A new local search for continuous location problems

European Journal of Operational Research

Volumn 232, Issue 2, 2014, Pages 256-265

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

^a ROYAL MILITARY COLLEGE OF CANADA   (Canada)

^b CALIFORNIA STATE UNIVERSITY   (United States)

^c BRUNEL UNIVERSITY   (United Kingdom)

^d UNIVERSITY OF KENT   (United Kingdom)

Author keywords

Continuous location; Space search formulation; Variable neighbourhood; Weber problem

Indexed keywords

CONTINUOUS LOCATIONS; CONTINUOUS MODELING; CONTINUOUS SPACES; NEIGHBOURHOOD; PROBLEM FORMULATION; SPACE SEARCH; VARIABLE NEIGHBOURHOOD SEARCH; WEBER PROBLEM;

MATHEMATICAL MODELS; OPERATIONS RESEARCH;

TRANSFER CASES (VEHICLES);

EID: 84883756979     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2013.06.022     Document Type: Article

References (48)

1. M.H. Akyüz, I.K. Altinel, and T. Öncan Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem Annals of Operations Research 2013 10.1007/s10479-012-1221-3
2. N. Aras, I.K. Altinel, and M. Orbay New heuristic methods for the capacitated multi-facility Weber problem Naval Research Logistics 54 1 2007 21 32
3. N. Aras, M. Orbay, and I.K. Altinel Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem Journal of the Operational Research Society 59 1 2008 64 79
4. I. Bongartz, P.H. Calamai, and A.R. Conn A projection method for lp norm location-allocation problems Mathematical Programming 66 1994 283 312
5. B. Boyaci, I.K. Altinel, and N. Aras Approximate solutions methods for the capacitated multi-facility Weber problem IIE Transactions 43 1 2013 97 120
6. J. Brimberg, and Z. Drezner A new heuristic for solving the p-median problem in the plane Computers and Operations Research 40 2013 427 437
7. J. Brimberg, Z. Drezner, N. Mladenović, and S. Salhi Generating good starting solutions for the p-median problem in the plane Electronic Notes in Discrete Mathematics 39 2013 225 232
8. J. Brimberg, P. Hansen, and N. Mladenović Attraction probabilities in variable neighbourhood search 4OR-Quarterly Journal of Operations Research 8 2010 181 194
9. J. Brimberg, P. Hansen, N. Mladenovic, and S. Salhi A survey of solution methods for the continuous location-allocation problem International Journal of Operations Research 5 2008 1 12
10. J. Brimberg, P. Hansen, N. Mladenović, and E.D. Taillard Improvement and comparison of heuristics for solving the uncapacitated multisource Weber problem Operations Research 48 3 2000 444 460
11. J. Brimberg, N. Mladenovic, and S. Salhi The multi-source Weber problem with constant opening cost Journal of the Operational Research Society 55 2004 640 646
12. J. Brimberg, and S. Salhi A continuous location-allocation problem with zone-dependent fixed cost Annals of Operations Research 136 2005 99 115
13. J. Brimberg, and J.H. Walker Estimation of travel distance N. Balakrishnan, Methods and applications of statistics in business Finance and management science 2010 John Wiley and Sons 139 157
14. L. Cooper Location-allocation problems Operations Research 11 1963 331 343
15. L. Cooper Heuristic methods for location-allocation problems SIAM Review 6 1964 37 53
16. Drezner, Z., Brimberg, J., Mladenović, N., & Salhi, S. (submitted for publication). Effective solutions to the p-median problem in the plane.
17. du Merle, O., Villeneuve, D., Desrosiers, J., & Hansen, P. (1997). Stabilization dans le cadre de la génération de colonnes. Les cahiers du GERAD G-97-08, University of Montreal.
18. E. Durmaz, N. Aras, and I.K. Altinel Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations Computers and Operations Research 36 7 2009 2139 2148
19. S. Eilon, C.D.T. Watson-Gandy, and N. Christofides Distribution management 1971 Hafner New York
20. E. Erkut, and S. Newman Analytical models for locating undesirable facilities European Journal of Operational Research 40 1989 275 291
21. D. Erlenkotter A dual-based procedure for uncapacitated facility location Operations Research 26 1978 992 1009
22. R.L. Francis, L.F. McGinnis, and J.A. White Facility layout and location: An analytical approach 1992 Prentice Hall Englewood Cliffs
23. M.D.H. Gamal, and S. Salhi Constructive heuristics for the uncapacitated continuous location-allocation problem Journal of the Operational Research Society 52 2001 821 829
24. M.D.H. Gamal, and S. Salhi A cellular heuristic for the multisource Weber problem Computers and Operations Research 30 2003 1603 1624
25. Hansen, P., Krau, S., & du Merle, O. (2000). Stabilized column generation algorithm for the multisource Weber problem. Les cahiers du GERAD G-2000-62, University of Montreal.
26. P. Hansen, N. Mladenović, and J.A. Moreno Perez Variable neighborhood search: Methods and applications Annals of OR 175 2010 367 407
27. 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
28. P. Hansen, J. Perreur, and J.-F. Thisse Location theory, dominance, and convexity: Some further results Operations Research 28 1980 1241 1250
29. Krau, S. (1997). Extensions du problème de Weber. PhD Thesis, Ecole Polytechnique de Montreal, Montreal.
30. R.E. Kuenne, and R.M. Soland Exact and approximate solutions to the multisource Weber problem Mathematical Programming 3 1972 193 209
31. R.F. Love, J.G. Morris, and G.O. Wesolowsky Facilities location: Models and methods 1988 North-Holland New York
32. M. Megiddo, and K.J. Supowit On the complexity of some common geometric location problems SIAM Journal on Computing 13 1984 182 196
33. N. Mladenović, J. Brimberg, P. Hansen, and J.A. Moreno-Perez The p-median problem: A survey of metaheuristic approaches European Journal of Operational Research 179 2007 927 939
34. N. Mladenović, and P. Hansen Variable neighbourhood search Computers and Operations Research 24 1997 1097 1100
35. N. Mladenović, F. Plastria, and D. Urosevic Reformulation descent applied to a circle packing problem Computers and Operations Research 32 2005 2419 2434
36. N. Mladenović, R. Todosijevic, and D. Urosevic An efficient general variable neighborhood search for large TSP problems with time windows Yugoslav Journal of Operations Research 23 2013 19 31
37. S. Nickel, and J. Puerto Location theory: A unified approach 2005 Springer Heidelberg
38. Ostresh Jr. L.M. (1973). Multi-exact solutions to the M-center location-allocation problem. In G. Rushton, M. F. Goodchild & L. M. Ostresh Jr. (Eds.), Computer Programs for Location-Allocation Problems. Monograph No. 6, University of Iowa, IA.
39. G. Reinelt TSLIB-a travelling salesman library ORSA Journal on Computing 3 1991 376 384
40. K.E. Rosing An optimal method for solving the (generalized) multi-Weber problem European Journal of Operational Research 58 1992 414 426
41. S. Salhi, and M. Sari A multi-level composite heuristic for the multi-depot vehicle fleet mix problem European Journal of Operational Research 103 1997 95 112
42. A.J. Scott Combinatorial programming, spatial analysis and planning 1971 Methuen London
43. E. Taillard Heuristic methods for large centroid clustering problems Journal of Heuristics 9 2003 51 73
44. M.B. Teitz, and P. Bart Heuristic methods for estimating the generalized vertex median of a weighted graph Operations Research 16 1968 955 961
45. J.E. Ward, and R.E. Wendell A new norm for measuring distance which yields linear location problems Operations Research 28 1980 836 844
46. J.E. Ward, R.E. Wendell, and E. Richard Using block norms for location modeling Operations Research 33 1985 1074 1090
47. E. Weiszfeld Sur le point pour lequel la somme des distances de n points donnés est minimum Tohoku Mathematical Journal 43 1937 355 386
48. R. Whitaker A fast algorithm for the greedy-interchange for large-scale clustering and median location problems INFOR 21 1983 95 108