|
|||||
|
|
A reduction result for location problems with polyhedral barriers |
|
| Authors: | K Klamroth |
| Institution: | 1. Utah State University, United States of America;2. University of Minnesota, United States of America;1. Steven G. Mihaylo College of Business and Economics, California State University-Fullerton, Fullerton, CA 92834, United States;2. Department of Mathematics and Computer Science, The Royal Military College of Canada, Kingston, ON, Canada;3. LAMIH Laboratory, University of Valenciennes and Hainaut-Cambrsis Universit de Valenciennes, Le Mont Houy 59313, France;4. Centre for Logistics & Heuristic Optimization, Kent Business School, University of Kent, Canterbury CT2 7PE, United Kingdom |
| Abstract: | In this paper we consider the problem of locating one new facility in the plane with respect to a given set of existing facilities where a set of polyhedral barriers restricts traveling. This non-convex optimization problem can be reduced to a finite set of convex subproblems if the objective function is a convex function of the travel distances between the new and the existing facilities (like e.g. the median and center objective functions). An exact algorithm and a heuristic solution procedure based on this reduction result are developed. |
| Keywords: | Location Non-convex optimization Barriers to travel |
| 本文献已被 ScienceDirect 等数据库收录！ | |