Variable neighborhood search

Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques

Volumn , Issue , 2005, Pages 211-238

  Hansen, Pierre ^a   Mladenović, Nenad ^b  

^a HEC MONTRÉAL   (Canada)

^b MATHEMATICAL INSTITUTE   (Serbia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84891995513     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/0-387-28356-0_8     Document Type: Chapter

References (43)

1. Ahuja, R. K., Orlin, J. B. and Sharma, D., 2000, Very large-scale neighborhood search, Int. Trans. Open Res. 7:301-317.
2. Aloise, D. J., Aloise, D., Rocha, C. T. M., Ribeiro Filho, J. C, Moura, L. S. S. and Ribeiro, C. C, 2003, Scheduling workover rigs for onshore oil production, Research Report, Department of Computer Science, Catholic University of Rio de Janeiro, submitted.
3. Baum, E. B., 1986, Toward practical "neural" computation for combinatorial optimization problems, in: Neural Networks for Computing, J. Denker, ed., American Institute of Physics, New York.
4. Braysy, O., 2001, Local search and variable neighborhood search algorithms for vehicle routing with time windows, Acta Wasaensia, Vol. 87.
5. Burke, E. K., Cowling, P. and Keuthen, R., 1999, Effective local and guided variable neighborhood search methods for the asymmetric traveling salesman problem, in: Proc. of the Evo Workshops, Lecture Notes in Computer Science, Vol. 2037, Springer, Berlin, pp. 203-212.
6. Caporossi, G., Cvetkovic, D., Gutman, I. and Hansen, P., 1999, Variable neighborhood search for extremal graphs: 2. Finding graphs with extremal energy, J. Chem. Inf. Comput. Sci. 39:984-996.
7. Caporossi, G. and Hansen, P., 2000, Variable neighborhood search for extremal graphs: 1. The AutoGraphiX system, Discr. Math., 212:29-44.
8. Caporossi, G. and Hansen, P., 2004, Variable neighborhood search for extremal graphs: 5. Three ways to automate conjecture finding, Discr. Math. 276:81-94.
9. Cornuejols, G., Fisher, M. and Nemhauser, G., 1990, The uncapacitated facility location problem, in: Discrete Location Theory, P. Mirchandani and R. Francis, eds, Wiley, New York.
10. Desaulniers, G., Desrosiers, J. and Solomon, M. M., 2001, Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems, Essays and Surveys in Metaheuristics, Kluwer, Dordrecht, pp. 309-324.
11. Drezner, Z., 2003a, Heuristic algorithms for the solution of the quadratic assignment problem, J. Appl. Math. Decision Sci., to appear.
12. Drezner, Z., 2003b, A new genetic algorithm for the quadratic assignment problem, INFORMS J. Comput. 15, to appear.
13. Festa, P., Pardalos, P., Resende, M. and Ribeiro, C, 2001, GRASP and VNS for Max-cut, Proc. M1C2001, pp. 371-376.
14. Fischetti, M. and Lodi, A., 2003, Local branching, Math. Program. B, published online, 28 March.
15. Fischetti, M., Polo, C. and Scantamburlo, M., 2003, A local branching heuristic for mixed-integer programs with 2-level variables, Research Report, University of Padova.
16. Garey, M. R. and Johnson, D. S., 1979, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York.
17. Glover, F. and Kochenberger, G., eds, 2003, Handbook of Metaheuristics, Kluwer, Dordrecht.
18. Hansen, P., 1974, Programmes mathematiques en variables 0-1, These d'Agregation de l'Enseignment Superieur, Universite Libre de Bruxelles.
19. Hansen, P., 1975, Les procedures d'optimization et d'exploration par separation et evaluation, in: Combinatorial Programming, B. Roy, ed., Reidel, Dordrecht, pp. 19-65.
20. Hansen, P., Brimberg, J., Urosevic, D., and Mladenovic, N., 2003a, Primaldual variable neighborhood search for exact solution of the simple plant location problem (in preparation).
21. Hansen, P., and Mladenovic, N., 1997, Variable neighborhood search for the p-median, Location Sci. 5:207-226.
22. Hansen, P., and Mladenovic, N., 1999, An introduction to variable neighborhood search, in: Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization, S. Voss et al., eds, Kluwer, Dordrecht, pp. 433-458.
23. Hansen, P., and Mladenovic, N., 2001a, Variable neighborhood search: Principles and applications, Eur. J. Oper. Res. 130:449-4167.
24. Hansen, P., and Mladenovic, N., 2001b, J-Means: A new local search heuristic for minimum sum-of-squares clustering, Pattern Recognition 34:405-413.
25. Hansen, P. and Mladenović, N., 2001c, Developments of variable neighborhood search, in: Essays and Surveys in Metaheuristics, C. Ribeiro and P. Hansen, eds, Kluwer, Dordrecht, pp. 415-440.
26. Hansen, P. and Mladenović, N., 2002a, Variable neighborhood search, in: Handbook of Applied Optimization, P. Pardalos and M. Resende, Oxford University Press, New York, pp. 221-234.
27. Hansen, P. and Mladenovic, N., 2002b, Recherche a voisinage variable in: Optimisation Approche en Recherche Opérationnelle, J. Teghem and M. Pirlot, eds, Lavoisier/Hermès, Paris, pp. 81-100.
28. Hansen, P. and Mladenovic, N., 2003, Variable neighborhood search, in: Handbook of Metaheuristics, F. Glover and G. Kochenberger, eds, Kluwer, Dordrecht, pp. 145-184.
29. Hansen, P., Mladenović, N. and Moreno Pérez, J. A., 2003b, Búsqueda de entorno variable (in Spanish), Intell. Artif, to appear.
30. Hansen, P., Mladenovic, N. and Perez-Brito, D., 2001, Variable neighborhood decomposition search, J. Heuristics 7:335-350.
31. Hansen, P., Ngai, E., Cheung, B. and Mladenovic, N., 2003c, Survey and comparison of initialization methods for &-means clustering (in preparation).
32. Kochetov, Y., Mladenovic, N. and Hansen, P., 2003, Lokalnii poisk s chereduyshimisy okrestnostyami (in Russian), Diskretnoi analiza, to appear.
33. Labbe, M., Peeters, D. and Thisse, J. F., 1995, Location on networks, in: Network Routing, M. Ball et al., eds, North-Holland, Amsterdam, pp. 551-624.
34. Lopez, F. G., Batista, B. M., Moreno Pérez, J. A. and Moreno Vega J. M., 2002, The parallel variable neighborhood search for the p-median problem, J. Heuristics 8:375-388.
35. Mladenovic, N. and Hansen, P., 1997, Variable neighborhood search, Comput. Open Res. 24:1097-1100.
36. Papadimitriou, C, 1994, Computational Complexity, Addison-Wesley, Reading, MA.
37. Reeves, C. R., ed., 1993, Modern Heuristic Techniques for Combinatorial Problems, Blackwell, Oxford.
38. Resende, M. G. C, and Werneck, R., 2003, On the implementation of a swapbased local search procedure for the p-median problem, Proc. 5th Workshop on Algorithm Engineering and Experiments (ALENEX'03), R. E. Ladner, ed., SIAM, Philadelphia, PA, pp. 119-127.
39. Ribeiro, C., Uchoa, E. and Werneck, R., 2001, A hybrid GRASP with perturbations for the Steiner problem in graphs, Technical Report, Computer Science Department, Catholic University of Rio de Janeiro.
40. Rodriguez, I, Moreno-Vega, M. and Moreno-Perez, J., 1999, Heuristics for routing-median problems, SMG Report, Université Libre de Bruxelles, Belgium.
41. Teitz, M. B. and Bart, P., 1968, Heuristic methods for estimating the generalized vertex median of a weighted graph, Open Res. 16:955-961.
42. Whitaker, R., 1983, A fast algorithm for the greedy interchange for large-scale clustering and median location problems, INFOR 21:95-108.
43. Zufferey, N., Hertz A. and Avanthay, C, 2003, Variable neighborhood search for graph colouring, Eur. J. Oper. Res., to appear.