A dynamic programming heuristic for the P-median problem |
| |
| Affiliation: | 1. Department of Electrical and Computer Engineering, Northwestern University, Evanston, IL 60208, USA;2. Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL 60208, USA;1. Instituto Tecnológico de Celaya, Departamento de Ingeniería Química, Av. Tecnológico y A.G. Cubas s/n, Celaya 38010, Gto., Mexico;2. Mary Kay O’Connor Process Safety Center, Artie McFerrin Department of Chemical Engineering, Texas A&M University, College Station, TX 77843-3122, USA;1. Province-Ministry Joint Key Laboratory of Electromagnetic Field and Electrical Apparatus Reliability, Hebei University of Technology, 300130 Tianjin, China;2. Department of Biomedical Engineering, Johns Hopkins University, 21205 Baltimore, MD, USA;3. Electrical Engineering, Federal University of Uberlândia, 38400-000 Uberlândia, MG, Brazil;1. KERMIT, Department of Mathematical Modelling, Statistics and Bioinformatics, Ghent University, Belgium;2. Department of Statistics and O.R., University of Oviedo, Spain;3. Department of Mathematics, University of Oviedo, Spain;4. Department of Computer Science, University of Oviedo, Spain;1. School of Astronautics, Beihang University, Beijing 100191, China;2. School of Energy and Power Engineering, Beihang University, Beijing 100191, China |
| |
| Abstract: | A new heuristic algorithm is proposed for the P-median problem. The heuristic restricts the size of the state space of a dynamic programming algorithm. The approach may be viewed as an extension of the myopic or greedy adding algorithm for the P-median model. The approach allows planners to identify a large number of solutions all of which perform well with respect to the P-median objective of minimizing the demand weighted average distance between customer locations and the nearest of the P selected facilities. In addition, the results indicate regions in which it is desirable to locate facilities. Computational results from three test problems are discussed. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
