A new heuristic for solving the p-median problem in the plane

Computers and Operations Research

Volumn 40, Issue 1, 2013, Pages 427-437

  Brimberg, Jack ^a   Drezner, Zvi ^b  

^a ROYAL MILITARY COLLEGE OF CANADA   (Canada)

^b CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

Continuous p median; Heuristics; Location allocation

Indexed keywords

HEURISTICS; INITIAL POINT; LOCAL SEARCH; LOCATION PROBLEMS; LOCATION-ALLOCATION; P-MEDIAN; P-MEDIAN PROBLEMS; STARTING SOLUTIONS;

COMPUTER SCIENCE; OPERATIONS RESEARCH;

LOCATION;

EID: 84866180316     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2012.07.012     Document Type: Article

References (49)

1. O. Alp, Z. Drezner, and E. Erkut An efficient genetic algorithm for the p-median problem Annals of Operations Research 122 2003 21 42
2. T.S. Arthanari, and Y. Dodge Mathematical programming in statistics 1993 John Wiley & Sons, Inc. New York
3. G. Babich An efficient algorithm for solving the rectilinear location-allocation problem Environment and Planning A 10 1978 1387 1395
4. p norm location-allocation problems Mathematical Programming 66 1994 238 312
5. J. Brimberg, P. Hansen, and N. Mladenović Attraction probabilities in variable neighborhood search 4OR - Quarterly Journal of Operations Research 8 2010 181 194
6. J. Brimberg, P. Hansen, N. Mladenović, and S. Salhi A survey of solution methods for the continuous location-allocation problem International Journal of Operations Research 5 2008 1 12
7. J. Brimberg, P. Hansen, N. Mladenović, and E. Taillard Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem Operations Research 48 2000 444 460
8. J. Brimberg, and M.J. Hodgson Heuristics for location models H.A. Eiselt, V. Marianov, Foundations of location analysis: industrial series in operations research & management science vol. 155 2011 Springer New York, NY 335 355 (Chapter 15)
9. J. Brimberg, and N. Mladenović Degeneracy in the multi-source Weber problem Mathematical Programming 85 1999 213 220
10. R. Chen Solution of minisum and minimax location-allocation problems with Euclidean distances Naval Research Logistics Quarterly 30 1983 449 459
11. L. Cooper Location-allocation problems Operations Research 11 1963 331 343
12. L. Cooper Heuristic methods for location-allocation problems SIAM Review 6 1964 37 53
13. J. Current, M. Daskin, and D. Schilling Discrete network location models Z. Drezner, H.W. Hamacher, Facility location: applications and theory 2002 Springer-Verlag Berlin 81 118
14. P.J. Densham, and G. Rushton A more efficient heuristic for solving large p-median problems Papers in Regional Science 71 1992 307 329
15. T. Drezner, Z. Drezner, and S. Salhi Solving the multiple competitive facilities location problem European Journal of Operational Research 142 2002 138 151
16. Z. Drezner The planar two-center and two-median problems Transportation Science 18 1984 351 361
17. Z. Drezner A note on accelerating the Weiszfeld procedure Location Science 3 1996 275 279
18. Z. Drezner, K. Klamroth, A. Schöbel, and G.O. Wesolowsky The Weber problem Z. Drezner, H.W. Hamacher, Facility location: applications and theory 2002 Springer Berlin 1 36
19. Z. Drezner, and D. Simchi-Levi Asymptotic behavior of the Weber location problem on the plane Annals of Operations Research 40 1992 163 172
20. S. Eilon, C.D.T. Watson-Gandy, and N. Christofides Distribution management 1971 Hafner New York
21. H.A. Eiselt, and V. Marianov Foundations of location analysis: industrial series in operations research & management science vol. 155 2011 Springer New York
22. E. Feldman, F.A. Lehrer, and T.L. Ray Warehouse location under continuous economies of scale Management Science 12 1966 670 684
23. F. Glover Heuristics for integer programming using surrogate constraints Decision Sciences 8 1977 156 166
24. F. Glover Future paths for integer programming and links to artificial intelligence Computers & Operations Research 13 1986 533 549
25. F. Glover, and M. Laguna Tabu search 1997 Kluwer Academic Publishers Boston, MA
26. S.L. Hakimi Optimum locations of switching centres and the absolute centres and medians of a graph Operations Research 12 1964 450 459
27. S.L. Hakimi Optimum distribution of switching centers in a communication network and some related graph theoretic problems Operations Research 13 1965 462 475
28. P. Hansen, N. Mladenović, and E. Taillard Heuristic solution of the multisource Weber problem as a p-median problem Operations Research Letters 22 1998 55 62
29. J. Hartigan, and M. Wong Algorithm AS 136: A k-means clustering algorithm Journal of the Royal Statistical Society. Series C (Applied Statistics) 28 1979 100 108
30. K. Krishna, and M. Narasimha Murty Genetic k-means algorithm IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 29 1999 433 439
31. A.A. Kuehn, and M.J. Hamburger A heuristic program for locating warehouses Management Science 9 1963 643 666
32. R.F. Love One dimensional facility location-allocation using dynamic programming Management Science 22 1976 614 617
33. R.F. Love, and J.G. Morris A computation procedure for the exact solution of location-allocation problems with rectangular distances Naval Research Logistics Quarterly 22 1975 441 453
34. R.F. Love, J.G. Morris, and G.O. Wesolowsky Facilities location: models & methods 1988 North Holland New York, NY
35. E.E. Maranzana On the location of supply points to minimize transport costs Operational Research Quarterly 15 1964 261 270
36. N. Megiddo, and K.J. Supowit On the complexity of some common geometric location problems SIAM Journal on Computing 13 1984 182 196
37. N. Mladenović, J. Brimberg, P. Hansen, and J.A. Moreno-Perez The p-median problem: a survey of metaheuristic approaches European Journal of Operations Research 179 2007 927 939
38. B.A. Murtagh, and S.R. Niwattisyawong An efficient method for the multi-depot location-allocation problem Journal of the Operational Research Society 33 1982 629 634
39. Okabe A, Boots B, Sugihara K, Chiu SN. Spatial tessellations: concepts and applications of Voronoi diagrams. Wiley series in probability and statistics. John Wiley; 2000.
40. G. Reinelt TSLIB a traveling salesman library ORSA Journal on Computing 3 1991 376 384
41. S. Salhi, and R.A. Atkinson Subdrop: a modified drop heuristic for location problems Location Science 3 1995 267 273
42. A.J. Scott Location-allocation systems: a review Geographical Analysis 2 1970 95 119
43. H.D. Sherali, and C.M. Shetty The rectilinear distance location-allocation problem AIIE Transactions 9 1977 136 143
44. H.D. Sherali, and C.H. Tuncbilek A squared Euclidean distance location-allocation problem Naval Research Logistics 39 1992 447 469
45. A. Suzuki, and A. Okabe Using Voronoi diagrams Z. Drezner, Facility location: a survey of applications and methods 1995 Springer New York 103 118
46. Tornqvist G, Nordbeck S, Rystedt B, Gould P. Multiple location analysis. In: Lund studies in geography, Series C, general, mathematical and regional geography, No. 12. University of Lund, Sweden; 1971.
47. E. Weiszfeld Sur le point pour lequel la somme des distances de n points donnes est minimum Tohoku Mathematical Journal 43 1936 355 386
48. E. Weiszfeld, and F. Plastria On the point for which the sum of the distances to n given points is minimum Annals of Operations Research 167 2009 7 41
49. R. Whitaker A fast algorithm for the greedy interchange for large-scale clustering and median location problems INFOR 21 1983 95 108