IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v175y2010i1p367-40710.1007-s10479-009-0657-6.html
   My bibliography  Save this article

Variable neighbourhood search: methods and applications

Author

Listed:
  • Pierre Hansen
  • Nenad Mladenović
  • José Moreno Pérez

Abstract

Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building heuristics, based upon systematic changes of neighbourhoods both in descent phase, to find a local minimum, and in perturbation phase to emerge from the corresponding valley. It was first proposed in 1997 and has since then rapidly developed both in its methods and its applications. In the present paper, these two aspects are thoroughly reviewed and an extensive bibliography is provided. Moreover, one section is devoted to newcomers. It consists of steps for developing a heuristic for any particular problem. Those steps are common to the implementation of other metaheuristics. Copyright Springer Science+Business Media, LLC 2010

Suggested Citation

  • Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.
    • Handle: RePEc:spr:annopr:v:175:y:2010:i:1:p:367-407:10.1007/s10479-009-0657-6
    DOI: 10.1007/s10479-009-0657-6
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-009-0657-6
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-009-0657-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Loudni, Samir & Boizumault, Patrice, 2008. "Combining VNS with constraint programming for solving anytime optimization problems," European Journal of Operational Research, Elsevier, vol. 191(3), pages 705-735, December.
    2. Almada-Lobo, Bernardo & Oliveira, José F. & Carravilla, Maria Antónia, 2008. "Production planning and scheduling in the glass container industry: A VNS approach," International Journal of Production Economics, Elsevier, vol. 114(1), pages 363-375, July.
    3. I H Osman & S Ahmadi, 2007. "Guided construction search metaheuristics for the capacitated p-median problem with single source constraint," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(1), pages 100-114, January.
    4. A Higgins & G Beashel & A Harrison, 2006. "Scheduling of brand production and shipping within a sugar supply chain," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(5), pages 490-498, May.
    5. Aouchiche, M. & Bell, F.K. & Cvetkovic, D. & Hansen, P. & Rowlinson, P. & Simic, S.K. & Stevanovic, D., 2008. "Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph," European Journal of Operational Research, Elsevier, vol. 191(3), pages 661-676, December.
    6. Michael Brusco & Douglas Steinley, 2007. "A Comparison of Heuristic Procedures for Minimum Within-Cluster Sums of Squares Partitioning," Psychometrika, Springer;The Psychometric Society, vol. 72(4), pages 583-600, December.
    7. Drazic, Milan & Lavor, Carlile & Maculan, Nelson & Mladenovic, Nenad, 2008. "A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1265-1273, March.
    8. Moreno Perez, Jose A. & Marcos Moreno-Vega, J. & Rodriguez Martin, Inmaculada, 2003. "Variable neighborhood tabu search and its application to the median cycle problem," European Journal of Operational Research, Elsevier, vol. 151(2), pages 365-378, December.
    9. J Brimberg & N Mladenovic & S Salhi, 2004. "The multi-source Weber problem with constant opening cost," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(6), pages 640-646, June.
    10. Edoardo Amaldi & Leo Liberti & Francesco Maffioli & Nelson Maculan, 2009. "Edge-swapping algorithms for the minimum fundamental cycle basis problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 69(2), pages 205-233, May.
    11. Lejeune, M.A., 2006. "A variable neighborhood decomposition search method for supply chain management planning problems," European Journal of Operational Research, Elsevier, vol. 175(2), pages 959-976, December.
    12. Avanthay, Cedric & Hertz, Alain & Zufferey, Nicolas, 2003. "A variable neighborhood search for graph coloring," European Journal of Operational Research, Elsevier, vol. 151(2), pages 379-388, December.
    13. Michael Brusco & Hans-Friedrich Köhn & Stephanie Stahl, 2008. "Heuristic Implementation of Dynamic Programming for Matrix Permutation Problems in Combinatorial Data Analysis," Psychometrika, Springer;The Psychometric Society, vol. 73(3), pages 503-522, September.
    14. Hemmelmayr, Vera C. & Doerner, Karl F. & Hartl, Richard F., 2009. "A variable neighborhood search heuristic for periodic routing problems," European Journal of Operational Research, Elsevier, vol. 195(3), pages 791-802, June.
    15. Sophie D. Lapierre & Angel B. Ruiz & Patrick Soriano, 2004. "Designing Distribution Networks: Formulations and Solution Heuristic," Transportation Science, INFORMS, vol. 38(2), pages 174-187, May.
    16. Tasgetiren, M. Fatih & Liang, Yun-Chia & Sevkli, Mehmet & Gencyilmaz, Gunes, 2007. "A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1930-1947, March.
    17. Zhao, Qiu-Hong & Chen, Shuang & Zang, Cun-Xun, 2008. "Model and algorithm for inventory/routing decision in a three-echelon logistics system," European Journal of Operational Research, Elsevier, vol. 191(3), pages 623-635, December.
    18. Liang, Yun-Chia & Chen, Yi-Ching, 2007. "Redundancy allocation of series-parallel systems using a variable neighborhood search algorithm," Reliability Engineering and System Safety, Elsevier, vol. 92(3), pages 323-331.
    19. Tatjana Davidović & Pierre Hansen & Nenad Mladenović, 2005. "Permutation-Based Genetic, Tabu, And Variable Neighborhood Search Heuristics For Multiprocessor Scheduling With Communication Delays," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 22(03), pages 297-326.
    20. Zvi Drezner & Peter Hahn & Éeric Taillard, 2005. "Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods," Annals of Operations Research, Springer, vol. 139(1), pages 65-94, October.
    21. Estellon, Bertrand & Gardi, Frédéric & Nouioua, Karim, 2008. "Two local search approaches for solving real-life car sequencing problems," European Journal of Operational Research, Elsevier, vol. 191(3), pages 928-944, December.
    22. Prandtstetter, Matthias & Raidl, Günther R., 2008. "An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem," European Journal of Operational Research, Elsevier, vol. 191(3), pages 1004-1022, December.
    23. Jack Brimberg & Pierre Hansen & Nenad Mladenović & Eric D. Taillard, 2000. "Improvements and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem," Operations Research, INFORMS, vol. 48(3), pages 444-460, June.
    24. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
    25. Fathali, J. & Kakhki, H. Taghizadeh, 2006. "Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases," European Journal of Operational Research, Elsevier, vol. 170(2), pages 440-462, April.
    26. Jack Brimberg & Pierre Hansen & Keh-Wei Lin & Nenad Mladenović & MichÈle Breton, 2003. "An Oil Pipeline Design Problem," Operations Research, INFORMS, vol. 51(2), pages 228-239, April.
    27. de Souza, Mauricio C. & Martins, Pedro, 2008. "Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 191(3), pages 677-690, December.
    28. Hansen, Pierre & Oguz, Ceyda & Mladenovic, Nenad, 2008. "Variable neighborhood search for minimum cost berth allocation," European Journal of Operational Research, Elsevier, vol. 191(3), pages 636-649, December.
    29. Bischoff, Martin & Dächert, Kerstin, 2009. "Allocation search methods for a generalized class of location-allocation problems," European Journal of Operational Research, Elsevier, vol. 192(3), pages 793-807, February.
    30. Celso C. Ribeiro & Eduardo Uchoa & Renato F. Werneck, 2002. "A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs," INFORMS Journal on Computing, INFORMS, vol. 14(3), pages 228-246, August.
    31. L Vogt & C A Poojari & J E Beasley, 2007. "A tabu search algorithm for the single vehicle routing allocation problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(4), pages 467-480, April.
    32. Brimberg, J. & Urosevic, D. & Mladenovic, N., 2006. "Variable neighborhood search for the vertex weighted k-cardinality tree problem," European Journal of Operational Research, Elsevier, vol. 171(1), pages 74-84, May.
    33. Fleszar, K. & Hindi, K.S., 2008. "An effective VNS for the capacitated p-median problem," European Journal of Operational Research, Elsevier, vol. 191(3), pages 612-622, December.
    34. G I Zobolas & C D Tarantilis & G Ioannou, 2009. "A hybrid evolutionary algorithm for the job shop scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(2), pages 221-235, February.
    35. Emilio Carrizosa & Belén Martín-Barragán & Frank Plastria & Dolores Romero Morales, 2007. "On the Selection of the Globally Optimal Prototype Subset for Nearest-Neighbor Classification," INFORMS Journal on Computing, INFORMS, vol. 19(3), pages 470-479, August.
    36. Charles Audet & Jack Brimberg & Pierre Hansen & Sébastien Le Digabel & Nenad Mladenovi'{c}, 2004. "Pooling Problem: Alternate Formulations and Solution Methods," Management Science, INFORMS, vol. 50(6), pages 761-776, June.
    37. C Gagné & M Gravel & W L Price, 2005. "Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(6), pages 687-698, June.
    38. Mladenovic, Nenad & Brimberg, Jack & Hansen, Pierre & Moreno-Perez, Jose A., 2007. "The p-median problem: A survey of metaheuristic approaches," European Journal of Operational Research, Elsevier, vol. 179(3), pages 927-939, June.
    39. Hansen, Pierre & Mladenovic, Nenad & Moreno Pérez, Jos´e A., 2008. "Variable neighborhood search," European Journal of Operational Research, Elsevier, vol. 191(3), pages 593-595, December.
    40. Francesco Carrabs & Jean-François Cordeau & Gilbert Laporte, 2007. "Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 618-632, November.
    41. Alain Hertz & Michel Mittaz, 2001. "A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem," Transportation Science, INFORMS, vol. 35(4), pages 425-434, November.
    42. A Lusa & C N Potts, 2008. "A variable neighbourhood search algorithm for the constrained task allocation problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(6), pages 812-822, June.
    43. Sergio Consoli & Kenneth Darby-Dowman & Nenad Mladenović & José Moreno-Pérez, 2009. "Variable neighbourhood search for the minimum labelling Steiner tree problem," Annals of Operations Research, Springer, vol. 172(1), pages 71-96, November.
    44. Michael Brusco & Renu Singh & Douglas Steinley, 2009. "Variable Neighborhood Search Heuristics for Selecting a Subset of Variables in Principal Component Analysis," Psychometrika, Springer;The Psychometric Society, vol. 74(4), pages 705-726, December.
    45. Consoli, S. & Darby-Dowman, K. & Mladenovic, N. & Moreno Pérez, J.A., 2009. "Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem," European Journal of Operational Research, Elsevier, vol. 196(2), pages 440-449, July.
    46. J Brimberg & P Hansen & G Laporte & N Mladenović & D Urošević, 2008. "The maximum return-on-investment plant location problem with market share," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 399-406, March.
    47. Benati, Stefano & Hansen, Pierre, 2002. "The maximum capture problem with random utilities: Problem formulation and algorithms," European Journal of Operational Research, Elsevier, vol. 143(3), pages 518-530, December.
    48. Imran, Arif & Salhi, Said & Wassan, Niaz A., 2009. "A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 197(2), pages 509-518, September.
    49. Fleszar, Krzysztof & Hindi, Khalil S., 2004. "Solving the resource-constrained project scheduling problem by a variable neighbourhood search," European Journal of Operational Research, Elsevier, vol. 155(2), pages 402-413, June.
    50. J Desrosiers & N Mladenović & D Villeneuve, 2005. "Design of balanced MBA student teams," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(1), pages 60-66, January.
    51. Patricia Domínguez-Marín & Stefan Nickel & Pierre Hansen & Nenad Mladenović, 2005. "Heuristic Procedures for Solving the Discrete Ordered Median Problem," Annals of Operations Research, Springer, vol. 136(1), pages 145-173, April.
    52. K S Hindi & K Fleszar & C Charalambous, 2003. "An effective heuristic for the CLSP with set-up times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(5), pages 490-498, May.
    53. Ribeiro, Celso C. & Aloise, Daniel & Noronha, Thiago F. & Rocha, Caroline & Urrutia, Sebastián, 2008. "An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem," European Journal of Operational Research, Elsevier, vol. 191(3), pages 596-611, December.
    54. Goel, Asvin & Gruhn, Volker, 2008. "A General Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 191(3), pages 650-660, December.
    55. Polacek, Michael & Doerner, Karl F. & Hartl, Richard F. & Kiechle, Guenter & Reimann, Marc, 2007. "Scheduling periodic customer visits for a traveling salesperson," European Journal of Operational Research, Elsevier, vol. 179(3), pages 823-837, June.
    56. R. E. Griffith & R. A. Stewart, 1961. "A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems," Management Science, INFORMS, vol. 7(4), pages 379-392, July.
    57. Gupta, Skylab R. & Smith, Jeffrey S., 2006. "Algorithms for single machine total tardiness scheduling with sequence dependent setups," European Journal of Operational Research, Elsevier, vol. 175(2), pages 722-739, December.
    58. Ribeiro, Celso C. & Aloise, Daniel & Noronha, Thiago F. & Rocha, Caroline & Urrutia, Sebastián, 2008. "A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints," European Journal of Operational Research, Elsevier, vol. 191(3), pages 981-992, December.
    59. Kolisch, Rainer & Hartmann, Sonke, 2006. "Experimental investigation of heuristics for resource-constrained project scheduling: An update," European Journal of Operational Research, Elsevier, vol. 174(1), pages 23-37, October.
    60. Fleszar, Krzysztof & Osman, Ibrahim H. & Hindi, Khalil S., 2009. "A variable neighbourhood search algorithm for the open vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 195(3), pages 803-809, June.
    61. Pierre Hansen & Jack Brimberg & Dragan Urošević & Nenad Mladenović, 2007. "Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 552-564, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lamb, John D., 2012. "Variable neighbourhood structures for cycle location problems," European Journal of Operational Research, Elsevier, vol. 223(1), pages 15-26.
    2. G I Zobolas & C D Tarantilis & G Ioannou, 2009. "A hybrid evolutionary algorithm for the job shop scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(2), pages 221-235, February.
    3. Pierre Hansen & Nenad Mladenović & Raca Todosijević & Saïd Hanafi, 2017. "Variable neighborhood search: basics and variants," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 423-454, September.
    4. Tu, Wei & Fang, Zhixiang & Li, Qingquan & Shaw, Shih-Lung & Chen, BiYu, 2014. "A bi-level Voronoi diagram-based metaheuristic for a large-scale multi-depot vehicle routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 84-97.
    5. Janssens, Jochen & Van den Bergh, Joos & Sörensen, Kenneth & Cattrysse, Dirk, 2015. "Multi-objective microzone-based vehicle routing for courier companies: From tactical to operational planning," European Journal of Operational Research, Elsevier, vol. 242(1), pages 222-231.
    6. Zhaowei Miao & Feng Yang & Ke Fu & Dongsheng Xu, 2012. "Transshipment service through crossdocks with both soft and hard time windows," Annals of Operations Research, Springer, vol. 192(1), pages 21-47, January.
    7. Sophie N. Parragh & Jorge Pinho de Sousa & Bernardo Almada-Lobo, 2015. "The Dial-a-Ride Problem with Split Requests and Profits," Transportation Science, INFORMS, vol. 49(2), pages 311-334, May.
    8. HERREMANS, Dorien & SÖRENSEN, Kenneth, 2012. "Composing Fifth Species Counterpoint Music With Variable Neighborhood Search," Working Papers 2012020, University of Antwerp, Faculty of Business and Economics.
    9. Alcaraz, Javier & Landete, Mercedes & Monge, Juan F., 2012. "Design and analysis of hybrid metaheuristics for the Reliability p-Median Problem," European Journal of Operational Research, Elsevier, vol. 222(1), pages 54-64.
    10. VÁZQUEZ-ALCOCER, Alan & GOOS, Peter & SCHOEN, Eric D., 2016. "Two-level designs constructed by concatenating orthogonal arrays of strenght three," Working Papers 2016011, University of Antwerp, Faculty of Business and Economics.
    11. Brimberg, Jack & Drezner, Zvi & Mladenović, Nenad & Salhi, Said, 2014. "A new local search for continuous location problems," European Journal of Operational Research, Elsevier, vol. 232(2), pages 256-265.
    12. Chen, Qingfeng & Li, Kunpeng & Liu, Zhixue, 2014. "Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 69(C), pages 218-235.
    13. Hanen Akrout & Bassem Jarboui & Patrick Siarry & Abdelwaheb Rebaï, 2012. "A GRASP based on DE to solve single machine scheduling problem with SDST," Computational Optimization and Applications, Springer, vol. 51(1), pages 411-435, January.
    14. Michael Brusco & Hans-Friedrich Köhn, 2009. "Exemplar-Based Clustering via Simulated Annealing," Psychometrika, Springer;The Psychometric Society, vol. 74(3), pages 457-475, September.
    15. Amaldi, Edoardo & Coniglio, Stefano, 2013. "A distance-based point-reassignment heuristic for the k-hyperplane clustering problem," European Journal of Operational Research, Elsevier, vol. 227(1), pages 22-29.
    16. Chandra Ade Irawan & Martino Luis & Said Salhi & Arif Imran, 2019. "The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem," Annals of Operations Research, Springer, vol. 275(2), pages 367-392, April.
    17. Liang, Yun-Chia & Chen, Yi-Ching, 2007. "Redundancy allocation of series-parallel systems using a variable neighborhood search algorithm," Reliability Engineering and System Safety, Elsevier, vol. 92(3), pages 323-331.
    18. Gahm, Christian & Brabänder, Christian & Tuma, Axel, 2017. "Vehicle routing with private fleet, multiple common carriers offering volume discounts, and rental options," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 97(C), pages 192-216.
    19. HERREMANS, Dorien & SÖRENSEN, Kenneth, 2013. "FuX, an android app that generates counterpoint," Working Papers 2013003, University of Antwerp, Faculty of Business and Economics.
    20. Mladenovic, Nenad & Drazic, Milan & Kovacevic-Vujcic, Vera & Cangalovic, Mirjana, 2008. "General variable neighborhood search for the continuous optimization," European Journal of Operational Research, Elsevier, vol. 191(3), pages 753-770, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:175:y:2010:i:1:p:367-407:10.1007/s10479-009-0657-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.