Multi-facility Green Weber Problem

Date

2018-07-06

Author

Atashıkhoeı, Arsham
Süral, Haldun
Tural, Mustafa Kemal

Metadata

Show full item record

Item Usage Stats

129
views

0
downloads

Multi-facility Green Weber ProblemThe multi-facility Weber problem corresponds to locating a number of facilities on the plane so as to minimize the sum of the weighted Euclidean distances between the customers and the allocated facilities. Its applications can be exemplified by locating warehouses or facilities for a distribution system in which the demands will be delivered directly to the customers. Such distribution systems consume a large amount of fuel and increase the emissions of greenhouse gases.In this scope, the multi-facility green Weber problem (MF-GWP) is a planar location problem that aims to minimize the amount of CO2 emission in a distribution system. The MF-GWP, determines the locations of p facilities on the plane and the speeds of the vehicles while minimizing the total CO2 emission. We formulate the MF-GWP as a mixed integer second order cone programming (MISOCP) problem. Since the MISOCP formulation of the MF-GWP is weak, only small size instances can be solved to optimality in 4 hours. For solving large problem instances, well-known heuristics developed for the multi facility Weber problem such as alternate location-allocation heuristic, transfer follow-up heuristic, and decomposition heuristic are utilized as well as a newly developed local search approach.The computational results represent the difficulties of finding the exact solution of the MF-GWP with the MISOCP formulation even for the small size instances. For larger problem instances, quality of solutions obtained by different settings of computational experiments, depict the performance and benefits of the improvement heuristics proposed in our study.

URI

https://hdl.handle.net/11511/78061

Collections

Unverified, Conference / Seminar

Suggestions

OpenMETU
Core

Low Carbon Weber Problem Atashi Khoei, Arsham; Tural, Mustafa Kemal; Süral, Haldun (null; 2016-07-03) The Weber location problem locates a facility in a plane so that the sum of weighted Euclidean distances from the facility to the customers is minimized. Sending vehicles from the facility to the customers for delivering/picking goods results in a significant amount of CO2 emissions affecting citizens’ quality of life and the climate. We consider an extension of the Weber problem, named as the Low Carbon Weber Problem (LCWP). The LCWP decides on the location of the single facility and the speeds of the vehi...
The Weber problem in congested regions with entry and exit points Farham, Mohammad Saleh; Süral, Haldun; İyigün, Cem (2015-10-01) The Weber problem is about finding a facility location on a plane such that the total weighted distance to a set of given demand points is minimized. The facility location and access routes to the facility can be restricted if the Weber problem contains congested regions, some arbitrary shaped polygonal areas on the plane, where location of a facility is forbidden and traveling is allowed at an additional fixed cost. Traveling through congested regions may also be limited to certain entry and exit points (o...
A Multi-level continuous minimax location problem with regional demand Faridyahyaei, Amin; Tural, Mustafa Kemal; Department of Industrial Engineering (2017) The minimax facility location problem seeks for the optimal locations of the facilities in the plane so that the maximum Euclidean distance between the demanding entities (given points in the plane) and their corresponding nearest facilities is minimized. In the solutions, remote entities (irrespective of their weights) tend to pull the facilities toward themselves which may result in larger distances for the other entities. In this thesis, we consider a multi-level minimax location problem which allows som...
A minisum location problem with regional demand considering farthest Euclidean distances DİNLER, DERYA; Tural, Mustafa Kemal (2016-06-01) We consider a continuous multi-facility location-allocation problem that aims to minimize the sum of weighted farthest Euclidean distances between (closed convex) polygonal and/or circular demand regions, and facilities they are assigned to. We show that the single facility version of the problem has a straightforward second-order cone programming formulation and can therefore be efficiently solved to optimality. To solve large size instances, we adapt a multi-dimensional direct search descent algorithm to ...
Solution approaches for single-source capacitated multi facility weber problem Damgacıoğlu, Haluk; İyigün, Cem; Department of Industrial Engineering (2014) Single Source Capacitated Multi Facility Location Problem (SSCMFLP) is a continuous location-allocation problem such that determining the locations of p facilities in the plane and allocations of n demand points to only one facility by considering the capacity restriction of each facility so as to minimize total transportation cost to satisfy n demand points from p facilities. In addition to Mixed Integer Non-Linear Programming formulation of the problem in the literature, we give a new formulation for the ...

Citation Formats

A. Atashıkhoeı, H. Süral, and M. K. Tural, “Multi-facility Green Weber Problem,” 2018, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/78061.