{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T08:43:07Z","timestamp":1774687387217,"version":"3.50.1"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319071237","type":"print"},{"value":"9783319071244","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-07124-4_19","type":"book-chapter","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T19:09:59Z","timestamp":1534187399000},"page":"759-787","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["Variable Neighborhood Search"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Hansen","sequence":"first","affiliation":[]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,14]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Aloise DJ, Aloise D, Rocha CTM, Ribeiro CC, Ribeiro JC, Moura LSS (2006) Scheduling workover rigs for onshore oil production. Discret Appl Math 154(5):695\u2013702","DOI":"10.1016\/j.dam.2004.09.021"},{"key":"19_CR2","unstructured":"Andrade DV, Resende MGC (2007) GRASP with path-relinking for network migration scheduling. In: Proceedings of international network optimization conference (INOC), Spa"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Audet C, B\u00e1chard V, Le Digabel S (2008) Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search J Glob Optim 41(2):299\u2013318","DOI":"10.1007\/s10898-007-9234-1"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Audet C, Brimberg J, Hansen P, Mladenovi\u0107 N (2004) Pooling problem: alternate formulation and solution methods, Manag Sci 50:761\u2013776","DOI":"10.1287\/mnsc.1030.0207"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Belacel N, Hansen P, Mladenovi\u0107 N (2002) Fuzzy J-means: a new heuristic for fuzzy clustering. Pattern Recognit 35(10):2193\u20132200","DOI":"10.1016\/S0031-3203(01)00193-5"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Bouaziz S, Dhahri H, Alimi AM, Abraham A (2013) A hybrid learning algorithm for evolving flexible beta basis function neural tree model. Neurocomputing 117: 107\u2013117. doi:10.1016\/j.neucom.2013.01.024","DOI":"10.1016\/j.neucom.2013.01.024"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Brimberg J, Hansen P, Mladenovi\u0107 N, Taillard \u00c9 (2000) Improvements and comparison of heuristics for solving the multisource Weber problem. Oper Res 48(3):444\u2013460","DOI":"10.1287\/opre.48.3.444.12431"},{"key":"19_CR8","unstructured":"Brimberg J, Mladenovi\u0107 N (1996) A variable neighborhood algorithm for solving the continuous location-allocation problem. Stud Locat Anal 10:1\u201312"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Canuto S, Resende M, Ribeiro C (2001) Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks 31(3):201\u2013206","DOI":"10.1002\/net.1023"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Caporossi G, Hansen P (2000) Variable neighborhood search for extremal graphs 1. The AutoGraphiX system. Discret Math 212:29\u201344","DOI":"10.1016\/S0012-365X(99)00206-X"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Carrizosa E, Hansen P, Moreno-Perez JA (2015). Variable neighborhood search. J Glob Optim (Spec Issue) 63(3):427\u2013629","DOI":"10.1007\/s10898-014-0175-1"},{"key":"19_CR12","unstructured":"Cohoon J, Sahni S (1987) heuristics for backplane ordering. J VLSI Comput Syst 2:37\u201361"},{"key":"19_CR13","unstructured":"Davidon WC (1959) Variable metric algorithm for minimization. Argonne National Laboratory report ANL-5990"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Dhahri H, Alimi AM, Abraham A (2012) Hierarchical multi-dimensional differential evolution for the design of beta basis function neural network. Neurocomputing 97:131\u2013140","DOI":"10.1016\/j.neucom.2012.04.008"},{"key":"19_CR15","unstructured":"Dra\u017ei\u0107 M, Kovacevic-Vujci\u0107 V, Cangalovi\u0107 M, Mladenovi\u0107 N (2006) GLOB \u2013 a new VNS-based software for global optimization In: Liberti L, Maculan N (eds) Global optimization: from theory to implementation. Springer, New York, pp 135\u2013144"},{"key":"19_CR16","unstructured":"Elleucha S, Jarbouia B, Mladenovic N (2015) Variable neighborhood programming a new automatic programming method in artificial intelligence, Gerad Technical report G-2016-21, HEC Montreal, Canada"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Fischetti M, Lodi A (2003) Local branching. Math Program 98(1\u20133):23\u201347","DOI":"10.1007\/s10107-003-0395-5"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Fletcher R, Powell MJD (1963) Rapidly convergent descent method for minimization. Comput J 6:163\u2013168","DOI":"10.1093\/comjnl\/6.2.163"},{"key":"19_CR19","unstructured":"Garey MR, Johnson DS (1978) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New-York"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Gill P, Murray W, Saunders MA (2002) SNOPT: an SQP algorithms for largescale constrained optimization. SIAM J Optim 12(4):979\u20131006","DOI":"10.1137\/S1052623499350013"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Griffith RE, Stewart RA (1961) A nonlinear programming technique for the optimization of continuous processing systems. Manag Sci 7:379\u2013392","DOI":"10.1287\/mnsc.7.4.379"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Hansen P, Brimberg J, Uro\u0161evi\u0107 D, Mladenovi\u0107 N (2007) Primal-dual variable neighborhood search for the simple plant location problem. INFORMS J Comput 19(4):552\u2013564","DOI":"10.1287\/ijoc.1060.0196"},{"key":"19_CR23","unstructured":"Hansen P, Jaumard B, Mladenovi\u0107 N, Parreira A (2000) Variable neighborhood search for weighted maximum satisfiability problem. Les Cahiers du GERAD G\u20132000\u201362, HEC Montr\u00e9al"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Hansen P, Mladenovi\u0107 N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130:449\u2013467","DOI":"10.1016\/S0377-2217(00)00100-4"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Hansen P, Mladenovi\u0107 N (2001) J-means: a new local search heuristic for minimum sum-of-squares clustering. Pattern Recognit 34:405\u2013413","DOI":"10.1016\/S0031-3203(99)00216-2"},{"key":"19_CR26","unstructured":"Hansen P, Mladenovi\u0107 N (2001) Developments of variable neighborhood search. In: Ribeiro C, Hansen P (eds) Essays and surveys in metaheuristics. Kluwer, Dordrecht\/London, pp 415\u2013440"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Hansen P, Mladenovi\u0107 N (2003) Variable neighborhood search. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer, Boston, pp 145\u2013184","DOI":"10.1007\/0-306-48056-5_6"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Hansen P, Mladenovi\u0107 N, Brimberg J, Moreno-Perrez JA (2010) Variable neighborhood search. In: Gendreau M, Potvin J-Y (eds) Handbook of metaheuristics, 2nd edn. Kluwer, New York, pp 61\u201386","DOI":"10.1007\/978-1-4419-1665-5_3"},{"key":"19_CR29","doi-asserted-by":"crossref","unstructured":"Hansen P, Mladenovi\u0107 N, Moreno P\u00e9rez JA (2008) Variable neighborhood search. Eur J Oper Res 191(3):593\u2013595","DOI":"10.1016\/j.ejor.2007.02.002"},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"Hansen P, Mladenovi\u0107 N, P\u00e9rez-Brito D (2001) Variable neighborhood decomposition search. J Heuristics 7(4):335\u2013350","DOI":"10.1023\/A:1011336210885"},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Hansen P, Mladenovi\u0107 N, Uro\u0161evi\u0107 D (2006) Variable neighborhood search and local branching. Comput Oper Res 33(10):3034\u20133045","DOI":"10.1016\/j.cor.2005.02.033"},{"key":"19_CR32","doi-asserted-by":"crossref","unstructured":"Hertz A, Plumettaz M, Zufferey N (2008) Variable space search for graph coloring. Discret Appl Math 156(13):2551\u20132560","DOI":"10.1016\/j.dam.2008.03.022"},{"key":"19_CR33","unstructured":"ILOG (2006) CPLEX 10.1. User\u2019s manual"},{"key":"19_CR34","unstructured":"Jornsten K, Lokketangen A (1997) Tabu search for weighted k-cardinality trees. Asia-Pac J Oper Res 14(2):9\u201326"},{"key":"19_CR35","unstructured":"Koza JR (1992) Genetic programming: on the programming of computers by means of natural selection. MIT Press, Cambridge"},{"key":"19_CR36","unstructured":"Liberti L, Dra\u017ei\u0107 M (2005) Variable neighbourhood search for the global optimization of constrained NLPs. In: Proceedings of GO workshop, Almeria"},{"key":"19_CR37","doi-asserted-by":"crossref","unstructured":"Meli\u00e1n B, Mladenovi\u0107 N (2007) Editorial IMA J Manag Math 18(2):99\u2013100","DOI":"10.1093\/imaman\/dpm017"},{"key":"19_CR38","unstructured":"Mladenovic N (1995) Variable neighborhood algorithm \u2013 a new metaheuristic for combinatorial optimization. In: Optimization days conference, Montreal, p 112"},{"key":"19_CR39","doi-asserted-by":"crossref","unstructured":"Mladenovi\u0107 N, Dra\u017ei\u0107 M, Kova\u010devic-Vuj\u010di\u0107 V, \u010cangalovi\u0107 M (2008) General variable neighborhood search for the continuous optimization Eur J Oper Res 191(3):753\u2013770","DOI":"10.1016\/j.ejor.2006.12.064"},{"key":"19_CR40","doi-asserted-by":"crossref","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24: 1097\u20131100","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"19_CR41","doi-asserted-by":"crossref","unstructured":"Mladenovic N, Kratica J, Kovacevic-Vujcic V, Cangalovic M (2012) Variable neighborhood search for metric dimension and minimal doubly resolving set problems. Eur J Oper Res 220(2):328\u2013337","DOI":"10.1016\/j.ejor.2012.02.019"},{"key":"19_CR42","doi-asserted-by":"crossref","unstructured":"Mladenovi\u0107 N, Petrovi\u0107 J, Kova\u010devi\u0107-Vuj\u010di\u0107 V, \u010cangalovi\u0107 M (2003) Solving spread spectrum radar polyphase code design problem by tabu search and variable neighborhood search. Eur J Oper Res 151:389\u2013399","DOI":"10.1016\/S0377-2217(02)00833-0"},{"key":"19_CR43","doi-asserted-by":"crossref","unstructured":"Mladenovi\u0107 N, Plastria F, Uro\u0161evi\u0107 D (2005) Reformulation descent applied to circle packing problems. Comput Oper Res 32:2419\u20132434","DOI":"10.1016\/j.cor.2004.03.010"},{"key":"19_CR44","doi-asserted-by":"crossref","unstructured":"Mladenovi\u0107 N, Plastria F, Uro\u0161evic D (2007) Formulation space search for circle packing problems. Engineering Stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. Lecture notes in computer science, vol 4638, pp 212\u2013216. https:\/\/link.springer.com\/book\/10.1007\/978-3-540-74446-7","DOI":"10.1007\/978-3-540-74446-7_20"},{"key":"19_CR45","doi-asserted-by":"crossref","unstructured":"Mladenovic N, Salhi S, Hnafi S, Brimberg J (eds) (2014) Recent advances in variable neighborhood search. Comput Oper Res 52(B):147\u2013148","DOI":"10.1016\/j.cor.2014.08.007"},{"key":"19_CR46","doi-asserted-by":"crossref","unstructured":"Mladenovic N, Urosevic D, P\u00e9rez-Brito D, Garc\u00eda-Gonz\u00e1lez CG (2010) Variable neighbourhood search for bandwidth reduction. Eur J Oper Res 200(1):14\u201327","DOI":"10.1016\/j.ejor.2008.12.015"},{"key":"19_CR47","doi-asserted-by":"crossref","unstructured":"Moreno-Vega JM, Meli\u00e1n B (2008) Introduction to the special issue on variable neighborhood search. J Heuristics 14(5):403\u2013404","DOI":"10.1007\/s10732-007-9044-0"},{"key":"19_CR48","doi-asserted-by":"crossref","unstructured":"Pantrigo JJ, Mart\u00ed R, Duarte A, Pardo EG (2012) Scatter search for the cutwidth minimization problem. Ann Oper Res 199:285\u2013304","DOI":"10.1007\/s10479-011-0907-2"},{"key":"19_CR49","doi-asserted-by":"crossref","unstructured":"Pardo EG, Mladenovic N, Pantrigo JJ, Duarte A (2013) Variable formulation search for the cutwidth minimization problem. Appl Soft Comput 13(5):2242\u20132252 (2013)","DOI":"10.1016\/j.asoc.2013.01.016"},{"key":"19_CR50","unstructured":"Plastria F, Mladenovi\u0107 N, Uro\u0161evi\u0107 D (2005) Variable neighborhood formulation space search for circle packing. In: 18th mini Euro conference VNS, Tenerife"},{"key":"19_CR51","doi-asserted-by":"crossref","unstructured":"Popper K (1959) The logic of scientific discovery Hutchinson, London","DOI":"10.1063\/1.3060577"},{"key":"19_CR52","unstructured":"Ribeiro CC, de Souza MC (2002) Variable neighborhood search for the degree-constrained minimum spanning tree problem. Discret Appl Math 118(1\u20132):43\u201354"},{"key":"19_CR53","doi-asserted-by":"crossref","unstructured":"Ribeiro CC, Uchoa E, Werneck R (2002) A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS J Comput 14(3):228\u2013246","DOI":"10.1287\/ijoc.14.3.228.116"},{"key":"19_CR54","doi-asserted-by":"crossref","unstructured":"Subudhi B, Jena D (2011) A differential evolution based neural network approach to nonlinear system identification, Appl Soft Comput 11:861\u2013871. doi:10.1016\/j.asoc.2010.01.006","DOI":"10.1016\/j.asoc.2010.01.006"},{"issue":"2","key":"19_CR55","doi-asserted-by":"publisher","first-page":"1178","DOI":"10.1016\/j.jmaa.2006.06.025","volume":"328","author":"AD Toksari","year":"2007","unstructured":"Toksari AD, G\u00fcner E (2007) Solving the unconstrained optimization problem by a variable neighborhood search. J Math Anal Appl 328(2):1178\u20131187","journal-title":"J Math Anal Appl"},{"key":"19_CR56","doi-asserted-by":"crossref","unstructured":"Whitaker R (1983) A fast algorithm for the greedy interchange of large-scale clustering and median location problems INFOR 21:95\u2013108","DOI":"10.1080\/03155986.1983.11731889"}],"container-title":["Handbook of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07124-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T07:22:03Z","timestamp":1571728923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07124-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319071237","9783319071244"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07124-4_19","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}