Solving the p-Center Problem with Tabu Search and Variable Neighborhood Search

Networks

Volumn 42, Issue 1, 2003, Pages 48-64

  Mladenović, Nenad ^a,b   Labbé, Martine ^a   Hansen, Pierre ^b  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b HEC MONTRÉAL   (Canada)

Author keywords

Heuristics; Location; P center; Tabu search; Variable neighborhood search

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; HEURISTIC METHODS; INTEGER PROGRAMMING; OPERATIONS RESEARCH; PROBLEM SOLVING;

P-CENTER PROBLEM; P-MEDIAN PROBLEM; TABU SEARCH; VARIABLE NEIGHBORHOOD SEARCH;

GRAPH THEORY;

EID: 2142679347     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10081     Document Type: Article

References (26)

1. E.B. Baum, "Toward practical 'neural' computation for combinatorial optimization problems," Neural networks for computing, J. Denker (Editor), American Institute of Physics, College Park, MD, 1986.
2. J.E. Beasley, A note on solving large p-Median problems, Eur J Oper Res 21 (1985), 270-273.
3. K.D. Boese, A.B. Kahng, and S. Muddu, A new adaptive multi-start technique for combinatorial global optimizations, Oper Res Lett 16 (1994), 101-113.
4. J. Brimberg, P. Hansen, N. Mladenović, and É. Taillard, Improvements and comparison of heuristics for solving the multisource Weber problem, Oper Res 48 (2000), 444-460.
5. M. Daskin, Network and discrete location, Wiley, New York, 1995.
6. Z. Drezner, The p-Center problem - heuristics and optimal algorithms, J Oper Res Soc 35 (1984), 741-748.
7. M.E. Dyer and A.M. Frieze, A simple heuristic for the p-Center problem, Oper Res Lett 3 (1985), 285-288.
8. F. Glover, Tabu search - Part I, ORSA J Comput 1 (1989), 190-206.
9. F. Glover, Tabu search - Part II, ORSA J Comput 2 (1990), 4-32.
10. P. Hansen and B. Jaumard, Algorithms for the maximum satisfiability problem, Computing 44 (1990), 279-303.
11. P. Hansen, M. Labbé, and M. Minoux, The p-Center-sum location problem, Can CERO 36 (1994), 203-219.
12. P. Hansen and N. Mladenović, Variable neighborhood search for the p-Median, Locat Sci 5 (1997), 207-226.
13. P. Hansen and N. Mladenović, "An introduction to variable neighborhood search," Metaheuristics, advances and trends in local search paradigms for optimization, S. Voss, S. Martello, I.H. Osman and C. Roucairol. (Editors), Kluwer, Dordrecht, 1999, pp. 433-458.
14. P. Hansen and N. Mladenović, J-MEANS: A new local search heuristic for minimum sum-of-squares clustering, Pattern Recog 34 (2001), 405-413.
15. P. Hansen, N. Mladenović, and D. Perez-Brito, Variable neighborhood decomposition search, J Heuristics 7 (2001), 335-350.
16. D. Hochbaum and D. Shmoys, A best possible heuristic for the k-Center problem, Math Oper Res 10 (1985), 180-184.
17. O. Kariv and S.L. Hakimi, An algorithmic approach to network location problems. Part 1: The p-Centers, SIAM J Appl Math 37 (1979), 513-538.
18. J. Martinich, A vertex-closing approach to the p-Center problem, Naval Res Log 35 (1988), 185-201.
19. E. Minieka, The m-Center problem, SIAM Rev 12 (1970), 138-139.
20. N. Mladenović and P. Hansen, Variable neighborhood search, Comp Oper Res 24 (1997), 1097-1100.
21. N. Mladenović, J.P. Moreno, and J. Moreno-Vega, Tabu search in solving the p-facility location-allocation problems, Les Cahiers du GERAD, G-95-38, Montreal, 1995.
22. N. Mladenović, J.P. Moreno, and J. Moreno-Vega, A chain-interchange heuristic method, Yugoslav J Oper Res 6 (1996), 41-54.
23. J. Plesnik, A heuristic for the p-Center problem in graphs, Discrete Appl Math 17 (1987), 263-268.
24. G. Reinelt, TSP-Lib-A traveling salesman library, ORSA J Comput 3 (1991), 376-384.
25. S. Voss, A reverse elimination approach for the p-Median problem, Stud Local Anal 8 (1996), 49-58.
26. R. Whitaker, A fast algorithm for the greedy interchange for large-scale clustering and median location problems, INFOR 21 (1983), 95-108.