نتایج جستجو برای: bi objective location routing problem

تعداد نتایج: 1645507  

Journal: :IJSDS 2016
Sanjeev Prashar Chandan Parsad T. Sai Vijay

16 A Bi-Objective Vehicle Routing Problem with Time Window by Considering Customer Satisfaction; Masoud Rabbani, School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran Mahyar Taheri, School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran Mohammad Ravanbakhsh, School of Industrial Engineering, College of Engineering, Uni...

Journal: :European Journal of Operational Research 2012
João Manuel Coutinho-Rodrigues Lino Tralhão Luís Alçada-Almeida

Journal: :European Journal of Operational Research 2007
Haluk Yapicioglu Alice E. Smith Gerry V. Dozier

In this paper, a new model for the semi-obnoxious facility location problem is introduced. The new model is composed of a weighted minisum function to represent the transportation costs and a distance-based piecewise function to represent the obnoxious effects of the facility. A single-objective particle swarm optimizer (PSO) and a bi-objective PSO are devised to solve the problem. Results are ...

Journal: :International Journal of Computer Theory and Engineering 2013

Journal: :Annals OR 2006
Juan G. Villegas Fernando Palacios Andrés L. Medaglia

The Colombian coffee supply network, managed by the Federación Nacional de Cafeteros de Colombia (Colombian National Coffee-Growers Federation), requires slimming down operational costs while continuing to provide a high level of service in terms of coverage to its affiliated coffee growers. We model this problem as a biobjective (cost-coverage) uncapacitated facility location problem (BOUFLP)....

2011
Mehdi Amiri-Aref Armand Baboli Nikbakhsh Javadian

This paper presents a single facility location problem in the presence of a probabilistic line barrier. The aim of this problem is to minimize bi-objectives, namely the total expected barrier distance and the maximum expected barrier distance from each demand point to the new facility point. Based on our best knowledge, there is no such a mathematical model to present this problem in the litera...

A capacitated location-routing problem (CLRP) is one of the new areas of research in distribution management. It consists of two problems; locating of facilities and routing of the vehicle with a specific capacity. The purpose of the CLRP is to open a set of stores, allocate customers to established deposits, and then design vehicle tours in order to minimize the total cost. In this paper, a ne...

Journal: :Computers & OR 2015
Jun Gang Yan Tu Benjamin Lev Jiuping Xu Wenjing Shen Liming Yao

This paper focuses on a stone industrial park location problemwith a hierarchical structure consisting of a local government and several stone enterprises under a random environment. In contrast to previous studies, conflicts between the local authority and the stone enterprises are considered. The local government, being the leader in the hierarchy, aims to minimize both total pollution emissi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید