Article ID: | iaor20033084 |
Country: | Netherlands |
Volume: | 45 |
Issue: | 1 |
Start Page Number: | 1 |
End Page Number: | 15 |
Publication Date: | Jun 2003 |
Journal: | Computers & Industrial Engineering |
Authors: | Cavalier Tom M., McGarvey Ronald G. |
Keywords: | programming: branch and bound |
This paper addresses the planar 1-median problem with convex polygonal forbidden regions. A new facility is to be located to minimize the sum of weighted distances to a set of existing facilities such that the new facility is not located within any forbidden regions, and no travel occurs through forbidden regions. A solution procedure using the ‘Big Square Small Square’ branch-and-bound method is developed, and used to find a global optimum.