Heuristics for location models

International Series in Operations Research and Management Science

Volumn 155, Issue , 2011, Pages 335-355

  Brimberg, Jack ^a   Hodgson, John M ^b  

^a ROYAL MILITARY COLLEGE OF CANADA   (Canada)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84959186938     PISSN: 08848289     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-1-4419-7572-0_15     Document Type: Chapter

References (46)

1. Beasley JE (1993) Lagrangian heuristics for location problems. Eur J Oper Res 65:383-399
2. Bellman R (1958) On a routing problem. Q Appl Math 16:87-90
3. Bongartz I, Calamai PH, Conn AR (1994) A projection method for p norm location-allocation problems. Math Program 66:283-312
4. Brimberg J, Mladenovic N (1999) Degeneracy in the multi-source Weber problem. Math Program 85:213-220
5. Brimberg J, Hansen P, Mladenovic N, Taillard ED (2000) Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem. Oper Res 48:444-460
6. Brimberg J, Hansen P, Mladenovic N, Salhi S (2008a) A survey of solution methods for the continuous location-allocation problem. Int J Oper Res 5:1-12
7. Brimberg J, Hansen P, Laporte G, Mladenovic N, Urosevic D (2008b) The maximum return-oninvestment plant location problem with market share. J Oper Res Soc 59:399-406
8. Captivo EM (1991) Fast primal and dual heuristics for the p-median location problem. Eur J Oper Res 52:65-74
9. Chen R (1983) Solution of minisum and minimax location-allocation problems with Euclidean distances. Nav Res Logist Q 30:449-459
10. Chiyoshi F, Galvao RD (2000) A statistical analysis of simulated annealing applied to the p-median problem. Ann Oper Res 96:61-74
11. Cooper L (1963) Location-allocation problems. Oper Res 11:331-343
12. Cooper L (1964) Heuristic methods for location-allocation problems. SIAM Rev 6:37-53
13. Dorigo M, Di Caro G (1999) The ant colony optimization meta-heuristic. In: Corne G, Dorigo M, Glover F (eds) New ideas in optimization, McGraw-Hill, New York
14. Garcia-Lopez F, Melian Batista B, Moreno Perez JA, Moreno Vega JM (2003) Parallelization of the scatter search for the p-median problem. Parallel Comput 29:575-589
15. Hakimi SL (1964) Optimum locations of switching centers and the absolute centers and medians of a graph. Oper Res 12:450-459
16. Hanjoul P, Peeters D (1985) A comparison of two dual-based procedures for solving the p-median problem. Eur J Oper Res 20:387-396
17. Hansen P, Mladenovic N (1997) Variable neighborhood search for the p-median. Locat Sci 5:207- 226
18. Hansen P, Mladenovic N, Taillard E (1998) Heuristic solution of the multisource Weber problem as a p-median problem. Oper Res Lett 22:55-62
19. Hansen P, Mladenovic N, Perez-Brito D (2001) Variable neighborhood decomposition search. J Heuristics 7:335-350
20. Hansen P, Brimberg J, Urosevic D, Mladenovic N (2007) Primal-dual variable neighborhood search for the simple plant-location problem. INFORMS J Comput 19:552-564
21. Houck CR, Joines JA, Kay MG (1996) Comparison of genetic algorithms, random restart and twoopt switching for solving large location-allocation problems. Comput Oper Res 23:587-596
22. Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems: The p medians. SIAM J Appl Math 37:539-560
23. Katz IN (1974) Local convergence in Fermat's problem. Math Program 6:89-104
24. Kochetov Y (2001) Probabilistic local search algorithms for the discrete optimization problems. Discrete Mathematics and Applications. Moscow, MSU, 84-117 (in Russian)
25. Kochetov Y, Alekseeva E, Levanova T, Loresh N (2005) Large neighborhood search for the p-median problem. Yugosl J Oper Res 15:53-63
26. Kolesar P, Walker WE, Hausner J (1975) Determining the relation between fire engine travel times and travel distances in New York City. Oper Res 23:614-627
27. Kuhn HW (1973) A note on Fermat's problem. Math Program 4:98-107
28. Kuhn HW, Kuenne RE (1962) An efficient algorithm for the numerical solution of the generalized Weber problem in spatial economics. J Reg Sci 4:21-34
29. Love RF, Juel H (1982) Properties and solution methods for large location-allocation problems. J Oper Res Soc 33:443-452
30. Love RF, Morris JG, Wesolowsky GO (1988) Facilities location: models and methods. North Holland, New York
31. Maranzana FE (1964) On the location of supply points to minimize transport costs. Oper Res Q 15:261-270
32. Megiddo M, Supowit KJ (1984) On the complexity of some common geometric location problems. SIAM J Comput 13:182-196
33. Mladenovic N, Moreno-Perez JA, Moreno-Vega JM (1996) A chain-interchange heuristic method. Yugosl J Oper Res 6:41-54
34. Mladenovic N, Brimberg J, Hansen P, Moreno-Perez JA (2007) The p-median problem: A survey of metaheuristic approaches. Eur J Oper Res 179:927-939
35. Murtagh BA, Niwattisyawong SR (1982) An efficient method for the multi-depot location-allocation problem. J Oper Res Soc 33:629-634
36. Ng R, Han J (2002) CLARANS: a method for clustering objects for spatial data mining. IEEE Trans Knowl Data Eng 14:1003-1016
37. Reese J (2006) Solution methods for the p-median problem: an annotated bibliography. Networks 48:125-142
38. Rolland E, Schilling DA, Current JA (1996) An efficient tabu search procedure for the p-median problem. Eur J Oper Res 96:329-342
39. Rosing KE, Hodgson MJ (2002) Heuristic concentration for the p-median: An example demonstrating how and why it works. Comput Oper Res 29:1317-1330
40. Rosing KE, ReVelle CS (1997) Heuristic concentration: Two stage solution construction. Eur J Oper Res 96:329-342
41. Rosing KE, Hillsman EL, Rosing-Vogelaar H (1979) A note comparing optimal and heuristic solutions to the p-median problem. Geogr Anal 11:86-89
42. Scott AJ (1971) Combinatorial Programming, spatial analysis and planning. Methuen, London
43. Teitz MB, Bart P (1968) Heuristic methods for estimating the generalized vertex median of a weighted graph. Oper Res 16:955-961
44. Voss S (1996) A reverse elimination approach for the p-median problem. Stud Locat Anal 8:49-58
45. Weiszfeld E (1937) Sur le point pour lequel la somme des distances de n points donnés est minimum. Tohoku Math J 43:355-386
46. Whitaker R (1983) A fast algorithm for the greedy-interchange for large-scale clustering and median location problems. Inf Syst Oper Res 21:95-108