The multi-facility location–allocation problem with polyhedral barriers

详细信息    查看全文

• 作者：Martin Bischoff ; Tina Fleischmann ; Kathrin Klamroth
• 关键词：Multi-facility location ; Barriers ; Non-convex optimization ; Location allocation
• 刊名：Computers and Operations Research
• 出版年：2009
• 出版时间：May 2009
• 年：2009
• 卷：36
• 期：5
• 页码：1376-1392
• 全文大小：293 K

文摘

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.