A guided reactive GRASP for the capacitated multi-source Weber problem

Computers and Operations Research

Volumn 38, Issue 7, 2011, Pages 1014-1024

  Luis, Martino ^a   Salhi, Said ^b   Nagy, Gbor ^b  

^a Universiti Utara Malaysia   (Malaysia)

^b UNIVERSITY OF KENT   (United Kingdom)

Author keywords

Capacitated location; Continuous location; Learning; Reactive GRASP; Restricted regions

Indexed keywords

CAPACITATED LOCATION; CONTINUOUS LOCATION; LEARNING; REACTIVE GRASP; RESTRICTED REGIONS;

TRANSFER CASES (VEHICLES);

LOCATION;

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

References (46)

1. K.E. Rosing The optimal location of steam generators in large heavy oil fields American Journal of Mathematical and Management Sciences 12 1992 19 42
2. M.S. Daskin What you should know about location modelling Naval Research Logistics 55 2008 283 294
3. M.S. Canbolat, and G.O. Wesolowsky The rectilinear distance Weber problem in the presence of a probabilistic line barrier European Journal of Operational Research 202 2010 114 121
4. N. Megiddo, and K.J. Supowit On the complexity of some common geometric location problems SIAM Journal on Computing 13 1984 182 196
5. P.B. Mirchandani, and R.L. Francis Discrete location theory 1990 Wiley New York
6. P. Hansen, N. Mladenović, and E.D. Taillard Heuristic of the multisource Weber problem as a p-median problem Operation Research Letters 22 1998 55 62
7. J. Brimberg, P. Hansen, N. Mladenović, and E.D. Taillard Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem Operations Research 48 2000 444 460
8. M.D.H. Gamal, and S. Salhi Constructive heuristics for the uncapacitated locationallocation problem Journal of the Operational Research Society 51 2001 1233 1240
9. M.D.H. Gamal, and S. Salhi A cellular heuristic for the multisource Weber problem Computers and Operations Research 30 2003 1609 1624
10. S. Salhi, and M.D.H. Gamal A GA based heuristic for the uncapacitated continuous locationallocation problem Annals of Operations Research 123 2003 203 222
11. E.D. Taillard Heuristics methods for large centroid clustering problems Journal of Heuristics 9 2003 51 73
12. N. Aras, K.C. Ozkisacik, and I.K. Altinel Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps Journal of the Operational Research Society 57 2006 82 93
13. I.N. Katz, and L. Cooper Facility location in the presence of forbidden regions, I: formulation and the case of Euclidean distance with one forbidden circle European Journal of Operational Research 6 1981 166 173
14. M. Bischoff, and K. Klamroth An efficient solution method for Weber problem with barriers based on genetic algorithms European Journal of Operational Research 177 2007 22 41
15. J. Brimberg, P. Hansen, N. Mladenović, and S. Salhi A survey of solution methods for the continuous locationallocation problem International Journal of Operations Research 5 2008 1 12
16. L. Cooper The transportation-location problem Operations Research 20 1972 94 108
17. L. Cooper Heuristic methods for locationallocation problems SIAM Review 6 1964 37 53
18. L. Cooper An efficient heuristic algorithm for the transportation- location problem Journal of Regional Science 16 1976 309 3015
19. L. Cooper The fixed charge problemI: a new heuristic method Computers and Mathematics with Applications 1 1975 89 95
20. H.D. Sherali, and C.M. Shetty The rectilinear distance locationallocation problem AIIE Transaction 9 1977 136 143
21. H.D. Sherali, and C.H. Tuncbilek A squared-Euclidean distance locationallocation problem Naval Research Logistics 39 1992 447 469
22. H.D. Sherali, S. Ramachandran, and S. Kim A localization and reformulation discrete programming approach for the rectilinear distance locationallocation problem Discrete Applied Mathematics 49 1994 357 378
23. D. Gong, M. Gen, G. Yamazaki, and W. Xu Hybrid evolutionary method for capacitated locationallocation problem Computers and Industrial Engineering 33 1997 577 580
24. p distance multifacility locationallocation problem Operations Research 50 2002 433 448
25. N. Aras, I.K. Altnel, and M. Orbay New heuristic methods for the capacitated multi-facility Weber problem Naval Research Logistics 54 2007 21 32
26. 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 2008 64 79
27. N. Aras, S. Yumusak, and I.K. Altnel Solving the capacitated multi-facility Weber problem by simulated annealing, threshold accepting and genetic algorithms K.F. Doerner, M. Gendreau, P. Greistorfer, W.J. Gutjahr, R.F. Hartl, M. Reimann, Metaheuristics: progress in complex systems optimization 2007 Springer 91 112
28. Z.M. Zainuddin, and S. Salhi A perturbation-based heuristic for the capacitated multisource Weber problem European Journal of Operational Research 179 2007 1194 1207
29. M. Luis, S. Salhi, and G. Nagy Region-rejection based heuristics for the capacitated multi-source Weber problem Computers and Operations Research 36 2009 2007 2017
30. H.M. Kuhn A note on Fermat's problem Mathematical Programming 3 1973 193 209
31. p distances Operations Research 41 1993 1153 1163
32. J.P. Hart, and A.W. Shogan Semi-greedy heuristics: an empirical study Operations Research Letters 6 1987 107 114
33. T.A. Feo, and M.G.C. Resende A probabilistic heuristic for a computationally difficult set covering problem Operations Research Letters 8 1989 67 71
34. T.A. Feo, and M.G.C. Resende Greedy randomized adaptive search procedures Journal of Global Optimization 6 1995 109 133
35. L.S. Pitsoulis, and M.G.C. Resende Greedy randomized adaptive search procedures P.M. Pardalos, M.G.C. Resende, Handbook of applied optimization 2002 Oxford University Press 168 181
36. M.G.C. Resende, and C.G. Ribeiro Greedy randomized adaptive search procedures F. Glover, G.A. Kochenberger, Handbook of metaheuristics 2003 Kluwer Academic Publishers 219 249
37. J. Delmaire, A. Diaz, E. Fernandez, and M. Ortega Reactive GRASP and tabu search based heuristics for the single source capacitated plant location problem INFOR 37 1999 194 225
38. Deng Y, Bard JF. GRASP with path relinking for capacitated clustering. Journal of Heuristics, in press, doi: 10.1007/s10732-010-9129-z.
39. R.Z. Rios-Mercado, and E. Fernandez A reactive GRASP for a commercial territory design problem with multiple balancing requirements Computers and Operations Research 36 2009 755 776
40. M.G.C. Resende, and C.G. Ribeiro GRASP with path-relinking: recent advances and applications T. Ibaraki, K. Nonobe, M. Yagiura, Metaheuristics: progress as real problem solvers 2005 Springer New York 29 63
41. A.A. Kuehn, and M.J. Hamburger A heuristic program for locating warehouse Management Science 9 1963 643 666
42. Luis M. Meta-heuristics for the capacitated multi-source Weber problem, PhD thesis, University of Kent, UK, 2008.
43. M. Bazaraa, J.J. Jarvis, and H.D. Sherali Linear programming and network flows 3rd ed 2005 Wiley Blackwell
44. Al-Loughani I. Algorithmic approaches for solving the Euclidian distance locationallocation problems. PhD dissertation, Industrial and System Engineering. Blacksburg, VA: Virginia Polytechnic Institute and State University; 1997.
45. Dongarra JJ. Performance of various computers using standard linear equations software, 2008. Technical Report available on line at 〈 http://www.netlib.org/benchmark/performance.ps 〉.
46. J. Brimberg, and S. Salhi A continuous locationallocation problem with zone-dependent fixed cost Annals of Operations Research 136 2005 99 115