New heuristic algorithms for solving the planar p-median problem

Computers and Operations Research

Volumn 62, Issue , 2015, Pages 296-304

  Drezner, Zvi ^a   Brimberg, Jack ^b   Mladenović, Nenad ^c   Salhi, Said ^d  

^a CALIFORNIA STATE UNIVERSITY   (United States)

^b ROYAL MILITARY COLLEGE OF CANADA   (Canada)

^c LAMIH   (France)

^d UNIVERSITY OF KENT   (United Kingdom)

Author keywords

Genetic algorithm; Location analysis; Multi source Weber problem; Planar p median; Variable neighborhood search

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; OPTIMIZATION;

HYBRID ALGORITHMS; HYBRID APPROACH; LOCATION ANALYSIS; NEW GENETIC ALGORITHMS; P-MEDIAN; P-MEDIAN PROBLEMS; VARIABLE NEIGHBORHOOD SEARCH; WEBER PROBLEM;

ALGORITHMS;

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

References (41)

1. O. Alp, Z. Drezner, and E. Erkut An efficient genetic algorithm for the p-median problem Ann Oper Res 122 2003 21 42
2. I. Bongartz, P.H. Calamai, and A.R. Conn A projection method for ℓp norm location-allocation problems Math Program 66 1994 238 312
3. J. Brimberg, and Z. Drezner A new heuristic for solving the p-median problem in the plane Comput Oper Res 40 2013 427 437
4. J. Brimberg, Z. Drezner, N. Mladenovic, and S. Salhi Generating good starting solutions for the p-median problem in the plane Electron Notes Discret Math 39 2012 225 232
5. J. Brimberg, Z. Drezner, N. Mladenović, and S. Salhi A new local search for continuous location problems Eur J Oper Res 232 2014 256 265
6. J. Brimberg, P. Hansen, and N. Mladenović Decomposition strategies for large-scale continuous location-allocation problems IMA J Manag Math 17 2006 307 316
7. J. Brimberg, P. Hansen, N. Mladenović, and S. Salhi A survey of solution methods for the continuous location-allocation problem Int J Oper Res 5 2008 1 12
8. J. Brimberg, P. Hansen, N. Mladenović, and E. Taillard Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem Oper Res 48 2000 444 460
9. J. Brimberg, and N. Mladenović Degeneracy in the multi-source Weber problem Math Program 85 1999 213 220
10. S. Carlsson Improving worst-case behavior of heaps BIT Numer Math 24 1984 14 18
11. E. Carrizosa, M. Dražić, Z. Dražić, and N. Mladenović Gaussian variable neighborhood search for continuous optimization Comput Oper Res 39 2012 2206 2213
12. P.C. Chen, P. Hansen, B. Jaumard, and H. Tuy A fast algorithm for the greedy interchange for large-scale clustering and median location problems by D.-C. programming Oper Res 46 1998 548 562
13. R. Chen Solution of minisum and minimax location-allocation problems with Euclidean distances Naval Res Logist Quart 30 1983 449 459
14. L. Cooper Location-allocation problems Oper Res 11 1963 331 343
15. L. Cooper Heuristic methods for location-allocation problems SIAM Rev 6 1964 37 53
16. S. Das, and P.N. Suganthan Differential evolution: a survey of the state-of-the-art IEEE Trans Evol Comput 15 2011 4 31
17. T. Drezner, and Z. Drezner Gender specific genetic algorithms INFOR Inf Syst Oper Res 44 2006 117 127
18. Z. Drezner The planar two-center and two-median problems Transp Sci 18 1984 351 361
19. Z. Drezner A new genetic algorithm for the quadratic assignment problem INFORMS J Comput 15 2003 320 330
20. Z. Drezner A distance based rule for removing population members in genetic algorithms 4OR-Quart J Oper Res 3 2005 109 116
21. Drezner Z. The fortified Weiszfeld algorithm for solving the Weber problem. IMA J Manage Math; 2013, in press.
22. Drezner Z, Brimberg J, Salhi S, Mladenović N. New local searches for solving the multi-source Weber problem; 2013, in review.
23. Z. Drezner, and G.A. Marcoulides A distance-based selection of parents in genetic algorithms M.G.C. Resende, J.P. de Sousa, Metaheuristics: computer decision-making 2003 Kluwer Academic Publishers Massachusetts, USA 257 278
24. Z. Drezner, A. Mehrez, and G.O. Wesolowsky The facility location problem with limited distances Transp Sci 25 1991 183 187
25. Z. Drezner, and S. Salhi Using hybrid metaheuristics for the one-way and two-way network design problem Naval Res Logist 49 2002 449 463
26. S. Eilon, C.D.T. Watson-Gandy, and N. Christofides Distribution management 1971 Hafner New York
27. M.A. Epelman, S. Pollock, B. Netter, and B.S. Low Anisogamy, expenditure of reproductive effort, and the optimality of having two sexes Oper Res 53 2005 560 567
28. H.N. Gabow, Z. Galil, T. Spencer, and R.E. Tarjan Efficient algorithms for finding minimum spanning trees in undirected and directed graphs Combinatorica 6 1986 109 122
29. P. Hansen, and N. Mladenović Variable neighborhood search for the p-median Locat Sci 5 1997 207 226
30. P. Hansen, D. Peeters, and J.-F. Thisse On the location of an obnoxious facility Sist Urbani 3 1981 299 317
31. Krau S. Extensions du problème de Weber [Ph.D. thesis]. École Polytechnique de Montréal; 1997.
32. N. Megiddo, and K.J. Supowit On the complexity of some common geometric location problems SIAM J Comput 13 1984 182 196
33. N. Mladenović, M. Dražić, V. Kovačevic-Vujčić, and M. Čangalović General variable neighborhood search for the continuous optimization Eur J Oper Res 191 3 2008 753 770
34. N. Mladenović, and P. Hansen Variable neighborhood search Comput Oper Res 24 1997 1097 1100
35. B.A. Murtagh, and S.R. Niwattisyawong An efficient method for the multi-depot location-allocation problem J Oper Res Soc 33 1982 629 634
36. F. Plastria GBSSS the generalized big square small square method for planar single facility location Eur J Oper Res 62 1992 163 174
37. G. Reinelt TSLIB a traveling salesman library ORSA J Comput 3 1991 376 384
38. S. Salhi, and M.D.H. Gamal A genetic algorithm based approach for the uncapacitated continuous location-allocation problem Ann Oper Res 123 2003 203 222
39. A. Schöbel, and D. Scholz The big cube small cube solution method for multidimensional facility location problems Comput Oper Res 37 2010 115 122
40. É. Taillard Heuristic methods for large centroid clustering problems J Heurist 9 2003 51 73
41. Xiao YY, Zhao QH, Mladenović N. Variable neighborhood simulated annealing algorithm for capacitated vehicle routing problems. Eng Optim; 2013, in press.