On the collection depots location problem |
| |
| Authors: | Zvi Drezner George O Wesolowsky |
| |
| Institution: | 1. Department of Management Science/Information Systems, California State University – Fullerton, Fullerton, CA 92834-6848, USA;2. Faculty of Business, McMaster University, Hamilton, Ont., Canada L8S-4M4;1. Power Engineering Laboratory, Department of Electrical and Electronic Engineering, Kitami Institute of Technology, Koen-cho 165, Kitami, Hokkaido 090-8507, Japan;2. Power Engineering Laboratory, Department of Electrical and Electronic Engineering, Kitami Institute of Technology, Japan;3. Department of Mechanical Systems Engineering, National Institute of Technology, Asahikawa College, Shyunkodai 2-2-1-6, Asahikaw, Hokkaido 071-8142, Japan;1. Department of Management Science and Information Systems, Rutgers Business School, Newark, NJ 07102, United States of America;2. Operations Research Department, Naval Postgraduate School, Monterey, CA 93943, United States of America |
| |
| Abstract: | In this paper we investigate the problem of locating a new facility servicing a set of demand points. A given set of collection depots is also given. When service is required by a demand point, the server travels from the facility to the demand point, then from the demand point to one of the collection depots (which provides the shortest route back to the facility), and back to the facility. The problem is analyzed and properties of the solution point are formulated and proved. Computational results on randomly generated problems are reported. |
| |
| Keywords: | Location Weber problem Rectilinear Euclidean |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
