Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
475916 | Computers & Operations Research | 2009 | 17 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Martin Bischoff, Tina Fleischmann, Kathrin Klamroth,