Generalization of the restricted planar location problems: Unified metaheuristic algorithms

Date

2018-11-01

Author

Farham, Mohammad Saleh
Süral, Haldun
İyigün, Cem

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

187
views

0
downloads

In the restricted planar location problems, facilities cannot be located inside certain areas on the plane. We define congested regions as polygonal areas on the plane inside which locating a facility is infeasible but through which traveling is possible at an additional fixed cost. The location problem with congested regions on the Euclidean plane is shown to be a generalization of the two most studied problems in the literature, i.e. the restricted planar facility location problems with forbidden regions and with barriers. We propose three metaheuristic algorithms enhanced with a local search procedure to solve the restricted planar location problem. A user interface module is also developed to implement the algorithms on the test instances and analyze computational experiments. The test problem instances include those from the restricted planar facility location literature as well as modified large TSP and VRP instances from the routing literature. The presented computational results show the performance of the proposed algorithms and their effectiveness on solving problems with large size.

Subject Keywords

Management Science and Operations Research, Modelling and Simulation, General Computer Science

URI

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

Journal

COMPUTERS & OPERATIONS RESEARCH

DOI

https://doi.org/10.1016/j.cor.2018.04.022

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

An interactive solution approach for a bi-objective semi-desirable location problem Karasakal, Esra (Springer Science and Business Media LLC, 2008-10-01) In this study, we consider a semi-desirable facility location problem in a continuous planar region considering the interaction between the facility and the existing demand points. A facility can be defined as semi-desirable if it has both undesirable and desirable effects to the people living in the vicinity. Our aim is to maximize the weighted distance of the facility from the closest demand point as well as to minimize the service cost of the facility. The distance between the facility and the demand poi...
A flexible reference point-based multi-objective evolutionary algorithm: An application to the UAV route planning problem DAŞDEMİR, ERDİ; Köksalan, Mustafa Murat; TEZCANER ÖZTÜRK, DİCLEHAN (Elsevier BV, 2020-02-01) We study the multi-objective route planning problem of an unmanned air vehicle (UAV) moving in a continuous terrain. In this problem, the UAV starts from a base, visits all targets and returns to the base in a continuous terrain that is monitored by radars. We consider two objectives: minimizing total distance and minimizing radar detection threat. This problem has infinitely many Pareto-optimal points and generating all those points is not possible. We develop a general preference-based multi-objective evo...
Heuristics for a continuous multi-facility location problem with demand regions Dinler, Derya; Tural, Mustafa Kemal; İyigün, Cem; Department of Operational Research (2013) We consider a continuous multi-facility location problem where the demanding entities are regions in the plane instead of points. Each region may consist of a finite or an infinite number of points. The service point of a station can be anywhere in the region that is assigned to it. We do not allow fractional assignments, that is, each region is assigned to exactly one facility. The problem we consider can be stated as follows: given m demand regions in the plane, find the locations of q facilities and allo...
The planar hub location problem: a probabilistic clustering approach İyigün, Cem (Springer Science and Business Media LLC, 2013-12-01) Given the demand between each origin-destination pair on a network, the planar hub location problem is to locate the multiple hubs anywhere on the plane and to assign the traffic to them so as to minimize the total travelling cost. The trips between any two points can be nonstop (no hubs used) or started by visiting any of the hubs. The travel cost between hubs is discounted with a factor. It is assumed that each point can be served by multiple hubs.
Heuristic approaches for solid transportation-p-facility location problem Das, Soumen Kumar; Roy, Sankar Kumar; Weber, Gerhard Wilhelm (Springer Science and Business Media LLC, 2020-09-01) Determining optimum places for the facilities and optimum transportation from existing sites to the facilities belongs to the main problems in supply chain management. Thesolid transportation-p-facility location problem(ST-p-FLP) is an integration between thefacility location problemand thesolid transportation problem(STP). This paper delineates the ST-p-FLP, a generalization of the classical STP in which location ofp-potential facility sites are sought so that the total transportation cost by means of conv...

Citation Formats

M. S. Farham, H. Süral, and C. İyigün, “Generalization of the restricted planar location problems: Unified metaheuristic algorithms,” COMPUTERS & OPERATIONS RESEARCH, pp. 48–66, 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/39894.