Low Carbon Weber Problem

Date

2016-07-03

Author

Atashi Khoei, Arsham
Tural, Mustafa Kemal
Süral, Haldun

Metadata

Show full item record

Item Usage Stats

75
views

0
downloads

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 vehicles serving the customers within the one-sided time windows so as to minimize the total amount of carbon dioxide emissions. We also consider time-dependent congestion that limits the vehicle speeds in the LCWP, called as the time-dependent LCWP (TD-LCWP). We formulate the TD-LCWP as a second order cone programming problem which can be efficiently solved to optimality. Computational results are provided to compare the solutions of the Weber problem, the LCWP, and the TD-LCWP in terms of carbon dioxide emissions in different congestion patterns.

URI

http://www.euro2016.poznan.pl/schedule/
https://hdl.handle.net/11511/85828

Conference Name

28th European Conference on Operational Research, (3 - 06 Temmuz 2016)

Collections

Department of Industrial Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Multi-facility Green Weber Problem Atashıkhoeı, Arsham; Süral, Haldun; Tural, Mustafa Kemal (null; 2018-07-06) 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...
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...
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...
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 ...
Generalization of restricted planar location problems : unified meta-heuristics for single facility case Farham, Mohammad Saleh; Süral, Haldun; İyigün, Cem; Department of Industrial Engineering (2013) A planar single facility location problem, also known as the Fermat–Weber problem, is to ﬁnd a facility location such that the total weighted distance to a set of given demand points is minimized. A variation to this problem is obtained if there is a restriction coming from congested regions. In this study, congested regions are considered as arbitrary shaped polygonal areas on the plane where location of a facility is forbidden and traveling is charged with an additional ﬁxed cost. The traveling ﬁxed cost ...

Citation Formats

A. Atashi Khoei, M. K. Tural, and H. Süral, “Low Carbon Weber Problem,” presented at the 28th European Conference on Operational Research, (3 - 06 Temmuz 2016), Poznan, Polonya, 2016, Accessed: 00, 2021. [Online]. Available: http://www.euro2016.poznan.pl/schedule/.