The multi-facility location-allocation problem with polyhedral barriers

Authors:
Martin Bischoff;Tina Fleischmann;Kathrin Klamroth
Affiliations:
Institute of Applied Mathematics, University of Erlangen-Nuremberg, Germany;Institute of Applied Mathematics, University of Erlangen-Nuremberg, Germany;Institute of Applied Mathematics, University of Erlangen-Nuremberg, Germany
Venue:
Computers and Operations Research
Year:
2009

Citing 4
Cited 2

Spatial tessellations: concepts and applications of Voronoi diagrams

Spatial tessellations: concepts and applications of Voronoi diagrams
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem

Operations Research
A global optimal approach to facility location in the presence of forbidden regions

Computers and Industrial Engineering

Ant colony optimization algorithm for the Euclidean location-allocation problem with unknown number of facilities

Journal of Intelligent Manufacturing
The center location-dependent relocation problem with a probabilistic line barrier

Applied Soft Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we consider the problem of locating N new facilities with respect to M existing facilities in the plane and in the presence of polyhedral barriers. We assume that a barrier is a region where neither facility location nor traveling is permitted. For the resulting multi-dimensional mixed-integer optimization problem two different alternate location and allocation procedures are developed. Numerical examples show the superiority of a joint treatment of all assignment variables, including those specifying the routes taken around the barrier polyhedra, over a separate iterative solution of the assignment problem and the single-facility location problems in the presence of barriers.