Parallel Variable Neighborhood Search

Parallel Metaheuristics: A New Class of Algorithms

Volumn , Issue , 2005, Pages 247-266

  Pérez, José A Moreno ^a   Hansen, Pierre ^b   Mladenović, Nenad ^c  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

^b HEC MONTRÉAL   (Canada)

^c MATHEMATICAL INSTITUTE   (Serbia)

Author keywords

Combinatorial optimization problem; Parallelization; Sequential variable neighborhood search; Variable neighborhood descent method; Variable neighborhood search metaheuristic

Indexed keywords

EID: 84889291470     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/0471739383.ch11     Document Type: Chapter

References (35)

1. J.E. Beasley. A note on solving large p-median problems, European Journal of Operational Research, 21 (1985) 270-273.
2. M.L. Brandeau and S.S. Chiu. An overview of representative problems in location research. Management Science 35 (1989) 645-674.
3. G. Comuejols, M.L. Fisher and G.L. Nemhauser. Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms, Management Science 23 (1977) 789-810.
4. T.G. Crainic, M. Gendreau, P. Hansen and N. Mladenovik, Cooperative parallel variable neighbourhood search for the p-median. Journal of Heuristics 10 (2004) 293-314.
5. T.G. Crainic, M. Gendreau, Cooperative parallel tabu search for the capacitated network design. Journal of Heuristics 8 (2002) 601-627.
6. J.A. Díaz, E. Femández, Scatter search and Path relinking for the capacitated p-median problem, European Journal of Operational Research (2005, to appear).
7. Drezner, Z. (ed.) Facility location: A survey of applications and methods, Springer, 1995.
8. F. Garcia López, B. Melian Batista, J.A. Moreno Perez and J.M. Moreno Vega, The parallel variable neighbourhood search for the p-median problem. Journal of Heuristics, 8 (2002) 375-388.
9. F. Glover and G. Kochenberger (eds.), Handbook of Metaheuristics, Kluwer, 2003.
10. P. Hanjoul, D. Peeters. A comparison of two dual-based procedures for solving the pmedian problem. European Journal of Operational Research, 20 (1985) 387-396. REFERENCES 265
11. P. Hansen and N. Mladenović. Variable neighborhood search for the pmedian. Location Science, 5 (1997) 207-226.
12. P. Hansen and N. Mladenović, An introduction to Variable neighborhood search, in: S. Voss et al. eds., Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization, Kluwer, (1999) 433-458.
13. P. Hansen and N. Mladenović. Developments of variable neighborhood search, C. Ribeiro, P. Hansen (eds.), Essays and surveys in metaheuristics, Kluwer Academic Publishers, BostodDordrecht/London, (2001) 415-440.
14. P. Hansen and N. Mladenović, Variable neighborhood search: principles and applications, European Journal of Operational Research 130 (2001) 449-467.
15. P. Hansen, N. Mladenović. Variable Neighborhood Search. In F. Glover and G. Kochenberger (eds.), Handbook ofMetaheuristics Kluwer (2003) 145-184.
16. P. Hansen, N. Mladenović and D. Perez-Brito. Variable neighborhood decomposition search. Journal of Heuristics 7 (2001) 335-350.
17. Kariv, S.L. Hakimi. An algorithmic approach to network location problems; part 2. The p-medians. SZAM Journal on Applied Mathematics, 31 (1969) 539-560.
18. A.A. Kuehn, M.J. Hamburger. A heuristic program for locating warehouses. Management Science, 9 (1963) 643-666.
19. L.A.N. Lorena, E.L.F. Senne, A column generation approach to capacitated p-median problems Computers and Operations Research 31 2004) 863-876.
20. H.R. Lourenco, O. Martin, and T. Stuetzle. Iterated Local Search. In F. Glover and G. Kochenberger (eds.), Handbook of Metaheuristics, Kluwer, (2003) 321-353.
21. F.E. Maranzana. On the location of supply points to minimize transportation costs. Operations Research Quarterly, 12 (1964) 138-139.
22. P. Mirchandani and R. Francis, (eds.) Discrete location theory, Wiley-Interscience, (1990).
23. N. Mladenović. A variable neighborhood algorithm-A new metaheuristic for combinatorial optimization. Presented at Optimization Days, Montreal (1995) pp. 112.
24. N. Mladenović and P. Hansen. Variable neighborhood search. Computers Oper:Res. 24 (1997) 1097-1100.
25. N. Mladenović, J.A. Moreno-Pérez, and J. Marcos Moreno-Vega. A chaininterchange heuristic method, Yugoslav J. Oper Res. 6 (1996) 41-54.
26. C.R. Reeves, Modern heuristic techniques for combinatorial problems. Blackwell Scientific Press, (1993).
27. M.G.C. Resende and R.F. Werneck, A hybrid heuristic for the p-median problem, Journal of Heuristics 10 (2004) 59-88.
28. E. Rolland, D.A. Schilling and J.R. Current, An efficient tabu search procedure for the p-median problem, European Journal of Operational Research, 96 (1996) 329-342.
29. K.E. Rosing, C.S. ReVelle and H. Rosing-Vogelaar, The p-median and its linear programming relaxation: An approach to large problems, Journal of the Operational Research Society, 30 (1979) 815-823.
30. K.E. Rosing and C.S. ReVelle, Heuristic concentration: Two stage solution construction, European Journal of Operational Research 97 (1997) 75-86.
31. E.L.F. Senne and L.A.N. Lorena, Lagrangeadsurrogate heuristics for p-median problems, in: M. Laguna and J. L. González-Velarde, eds. Computing Tools for Modeling Optimization and Simulation: Interfaces in Computer Science and Operations Research, Kluwer (2000) 115-130.
32. E.L.F. Senne and L.A.N. Lorena, Stabilizing column generation using Lagrangeadsurrogate relaxation: an application to p-median location problems, EURO 2001-The European Operational Research Conference, (2001).
33. M.B. Teitz, P. Bart. Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research, 16 (1968) 955-961.
34. S. Voss. A reverse elimination approach for the p-median problem. Studies in Locational Analysis, 8 (1996) 49-58.
35. The OpenMP architecture review Board. OpenMP: A proposed industv standard API for shared memory programming. White Paper, October 1997 (http://www.opeMlp.org/openmp/mp-documents/paper/paper.html)