{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T11:16:49Z","timestamp":1775215009008,"version":"3.50.1"},"publisher-location":"Cham","reference-count":43,"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_1","type":"book-chapter","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T19:09:59Z","timestamp":1534187399000},"page":"155-175","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Multi-start Methods"],"prefix":"10.1007","author":[{"given":"Rafael","family":"Mart\u00ed","sequence":"first","affiliation":[]},{"given":"Jose A.","family":"Lozano","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Mendiburu","sequence":"additional","affiliation":[]},{"given":"Leticia","family":"Hernando","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,14]]},"reference":[{"key":"1_CR1","first-page":"2498","volume-title":"IEEE congress on evolutionary computation, CEC 2008","author":"A Albrecht","year":"2008","unstructured":"Albrecht A, Lane P, Steinhofel K (2008) Combinatorial landscape analysis for k-SAT instances. In: IEEE congress on evolutionary computation, CEC 2008, Hong Kong. IEEE World congress on computational intelligence, pp 2498\u20132504"},{"issue":"4","key":"1_CR2","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s11786-010-0040-7","volume":"3","author":"A Albrecht","year":"2010","unstructured":"Albrecht A, Lane P, Steinhofel K (2010) Analysis of local search landscapes for k-SAT instances. Math Comput Sci 3(4):465\u2013488","journal-title":"Math Comput Sci"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10479-007-0199-8","volume":"157","author":"R Beausoleil","year":"2008","unstructured":"Beausoleil R, Baldoquin G, Montejo R (2008) A multi-start and path relinking methods to deal with multiobjective knapsack problems. Ann Oper Res 157:105\u2013133","journal-title":"Ann Oper Res"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0167-6377(94)90065-5","volume":"16","author":"K Boese","year":"1994","unstructured":"Boese K, Kahng A, Muddu S (1994) A new adaptive multi-start technique for combinatorial global optimisation. Oper Res Lett 16:103\u2013113","journal-title":"Oper Res Lett"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1016\/S0377-2217(03)00435-1","volume":"159","author":"O Braysy","year":"2004","unstructured":"Braysy O, Hasle G, Dullaert W (2004) A multi-start local search algorithm for the vehicle routing problem with time windows. Eur J Oper Res 159:586\u2013605","journal-title":"Eur J Oper Res"},{"issue":"4","key":"1_CR6","first-page":"265","volume":"11","author":"A Chao","year":"1984","unstructured":"Chao A (1984) Nonparametric estimation of the number of classes in a population. Scand J Stat 11(4):265\u2013270","journal-title":"Scand J Stat"},{"issue":"3","key":"1_CR7","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1111\/j.0006-341X.2002.00531.x","volume":"58","author":"A Chao","year":"2002","unstructured":"Chao A, Bunge J (2002) Estimating the number of species in a stochastic abundance model. Biometrics 58(3):531\u2013539","journal-title":"Biometrics"},{"issue":"417","key":"1_CR8","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1080\/01621459.1992.10475194","volume":"87","author":"A Chao","year":"1992","unstructured":"Chao A, Lee SM (1992) Estimating the number of classes via sample coverage. J Am Stat Assoc 87(417):210\u2013217","journal-title":"J Am Stat Assoc"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Crowston WB, Glover F, Thompson GL, Trawick JD (1963) Probabilistic and parametric learning combinations of local job shop scheduling rules. Technical report 117, Carnegie-Mellon University, Pittsburgh","DOI":"10.21236\/AD0600965"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"1498","DOI":"10.1002\/nme.2873","volume":"83","author":"S Dhouib","year":"2010","unstructured":"Dhouib S, Kharrat A, Chabchoub H (2010) A multi-start threshold accepting algorithm for multiple objective continuous optimization problems. Int J Numer Methods Eng 83:1498\u20131517","journal-title":"Int J Numer Methods Eng"},{"key":"1_CR11","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-46004-7_4","volume-title":"Applications of evolutionary computing","author":"AV Eremeev","year":"2002","unstructured":"Eremeev AV, Reeves CR (2002) Non-parametric estimation of properties of combinatorial landscapes. In: Cagnoni S, Gottlieb J, Hart E, Middendorf M, Raidl G (eds) Applications of evolutionary computing. Lecture notes in computer science, vol 2279. Springer, Berlin\/Heidelberg, pp 31\u201340"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Eremeev AV, Reeves CR (2003) On confidence intervals for the number of local optima. In: Proceedings of EvoWorkshops 2003, Essex, pp 224\u2013235","DOI":"10.1007\/3-540-36605-9_21"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.cirpj.2010.05.002","volume":"2","author":"M Essafi","year":"2010","unstructured":"Essafi M, Delorme X, Dolgui A (2010) Balancing lines with CNC machines: a multi-start and based heuristic. CIRP J Manuf Sci Technol 2:176\u2013182","journal-title":"CIRP J Manuf Sci Technol"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T Feo","year":"1989","unstructured":"Feo T, Resende M (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8:67\u201371","journal-title":"Oper Res Lett"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T Feo","year":"1995","unstructured":"Feo T, Resende M (1995) Greedy randomized adaptive search procedures. J Glob Optim 6:109\u2013133","journal-title":"J Glob Optim"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1287\/ijoc.11.2.198","volume":"11","author":"C Fleurent","year":"1999","unstructured":"Fleurent C, Glover F (1999) Improved constructive multi-start strategies for the quadratic assignment problem using adaptive memory. INFORMS J Comput 11:198\u2013204","journal-title":"INFORMS J Comput"},{"key":"1_CR17","first-page":"1","volume-title":"Computing tools for modeling optimization and simulation","author":"F Glover","year":"2000","unstructured":"Glover F (2000) Multi-start and strategic oscillation methods \u2013 principles to exploit adaptive memory. In: Laguna M, Gonzalez-Velarde J (eds) Computing tools for modeling optimization and simulation. Kluwer Academic, Boston, pp 1\u201325"},{"key":"1_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer Academic, Boston"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10878-006-9009-5","volume":"13","author":"D Grundel","year":"2007","unstructured":"Grundel D, Krokhmal P, Oliveira C, Pardalos P (2007) On the number of local minima for the multidimensional assignment problem. J Combin Optim 13:1\u201318","journal-title":"J Combin Optim"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1109\/43.644032","volume":"16","author":"L Hagen","year":"1997","unstructured":"Hagen L, Kahng A (1997) Combining problem reduction and adaptive multi-start: a new technique for superior iterative partitioning. IEEE Trans CAD 16:709\u2013717","journal-title":"IEEE Trans CAD"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M Held","year":"1970","unstructured":"Held M, Karp R (1970) The traveling-salesman problem and minimum spanning trees. Oper Res 18:1138\u20131162","journal-title":"Oper Res"},{"issue":"4","key":"1_CR22","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1162\/EVCO_a_00100","volume":"21","author":"L Hernando","year":"2013","unstructured":"Hernando L, Mendiburu A, Lozano JA (2013) An evaluation of methods for estimating the number of local optima in combinatorial optimization problems. Evol Comput 21(4):625\u2013658","journal-title":"Evol Comput"},{"key":"1_CR23","first-page":"1","volume":"1","author":"F Hickernell","year":"1997","unstructured":"Hickernell F, Yuan Y (1997) A simple multistart algorithm for global optimization. OR Trans 1:1\u201311","journal-title":"OR Trans"},{"key":"1_CR24","first-page":"1","volume":"1","author":"X Hu","year":"1994","unstructured":"Hu X, Shonkwiler R, Spruill M (1994) Random restarts in global optimization. Ga Inst Technol 1:1\u201310","journal-title":"Ga Inst Technol"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF02592071","volume":"39","author":"AR Kan","year":"1987","unstructured":"Kan AR, Timmer G (1987) Stochastic global optimization methods (Part II): multi level methods. Math Program 39:57\u201378","journal-title":"Math Program"},{"key":"1_CR26","first-page":"631","volume-title":"Kan R, Todds (eds) Handbooks in operations research and management science","author":"AR Kan","year":"1998","unstructured":"Kan AR, Timmer G (1998) Global optimization. In: Kan R, Todds (eds) Handbooks in operations research and management science. North Holland, Amsterdam, pp 631\u2013662"},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10898-012-9913-4","volume":"55","author":"M Kaucic","year":"2013","unstructured":"Kaucic M (2013) A multi-start opposition-based particle swarm optimization algorithm with adaptive velocity for bound constrained global optimization. J Glob Optim 55:165\u2013188","journal-title":"J Glob Optim"},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/j.cie.2006.08.002","volume":"51","author":"G Lan","year":"2006","unstructured":"Lan G, DePuy G (2006) On the effectiveness of incorporating randomness and memory into a multi-start metaheuristic with application to the set covering problem. Comput Ind Eng 51:362\u2013374","journal-title":"Comput Ind Eng"},{"issue":"3","key":"1_CR29","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1007\/s10589-010-9384-9","volume":"51","author":"R Mart\u00ed","year":"2012","unstructured":"Mart\u00ed R, Reinelt G, Duarte A (2012) A benchmark library and a comparison of heuristic methods for the linear ordering problem. Comput Optim Appl 51(3):1297\u20131317","journal-title":"Comput Optim Appl"},{"issue":"1","key":"1_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2012.10.012","volume":"226","author":"R Mart\u00ed","year":"2013","unstructured":"Mart\u00ed R, Resende M, Ribeiro C (2013) Multi-start methods for combinatorial optimization. Eur J Oper Res 226(1):1\u20138","journal-title":"Eur J Oper Res"},{"key":"1_CR31","first-page":"111","volume-title":"Analysis and optimization of systems","author":"DQ Mayne","year":"1988","unstructured":"Mayne DQ, Meewella C (1988) A non-clustering multistart algorithm for global optimization. In: Bensoussan A, Lions J-L (eds) Analysis and optimization of systems. Lecture notes in control and information sciences. Springer, Berlin\/New York, pp 111\u2013117"},{"key":"1_CR32","doi-asserted-by":"publisher","DOI":"10.1109\/E-SCIENCE.2006.261196","volume-title":"Using the multi-start and island models for parallel multi-objective optimization on the computational grid","author":"M Mezmaz","year":"2006","unstructured":"Mezmaz M, Melab N, Talbi E (2006) Using the multi-start and island models for parallel multi-objective optimization on the computational grid. In: Second IEEE international conference on e-science and grid computing, Amsterdam"},{"key":"1_CR33","volume-title":"An statistical analysis of strategies for multistart heuristic searches for p-facility location-allocation problems","author":"J Moreno","year":"1995","unstructured":"Moreno J, Mladenovic N, Moreno-Vega J (1995) An statistical analysis of strategies for multistart heuristic searches for p-facility location-allocation problems. In: Eighth meeting of the EWG on locational analysis Lambrecht"},{"key":"1_CR34","volume-title":"Industrial scheduling","author":"JF Muth","year":"1963","unstructured":"Muth JF, Thompson GL (1963) Industrial scheduling. Prentice-Hall, Englewood Cliffs"},{"key":"1_CR35","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/A:1009629727566","volume":"5","author":"R Patterson","year":"1999","unstructured":"Patterson R, Pirkul H, Rolland E (1999) Adaptive reasoning technique for the capacitated minimum spanning tree problem. J Heuristics 5:159\u2013180","journal-title":"J Heuristics"},{"key":"1_CR36","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/978-3-540-30217-9_11","volume-title":"Parallel problem solving from nature \u2013 PPSN VIII","author":"C Reeves","year":"2004","unstructured":"Reeves C, Aupetit-B\u00e9laidouni M (2004) Estimating the number of solutions for SAT problems. In: Yao X, Burke E, Lozano J, Smith J, Merelo-Guerv\u00f3s J, Bullinaria J, Rowe J, Tino P, Kab\u00e1n A, Schwefel HP (eds) Parallel problem solving from nature \u2013 PPSN VIII. Lecture notes in computer science, vol 3242. Springer, Berlin\/Heidelberg, pp 101\u2013110"},{"key":"1_CR37","first-page":"293","volume-title":"Handbook of metaheuristics","author":"M Resende","year":"2010","unstructured":"Resende M, Ribeiro C (2010) Greedy randomized adaptive search procedures: advances and applications. In: Gendreau M, Potvin JY (eds) Handbook of metaheuristics, 2nd edn. Springer, New York, pp 293\u2013319","edition":"2"},{"key":"1_CR38","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/moor.6.1.19","volume":"6","author":"F Solis","year":"1981","unstructured":"Solis F, Wets R (1981) Minimization by random search techniques. Math Oper Res 6:19\u201330","journal-title":"Math Oper Res"},{"key":"1_CR39","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"E Taillard","year":"1997","unstructured":"Taillard E, Badeau P, Gendreau M, Guertin F, Potvin J (1997) A tabu search heuristic of the vehicle routing problem with time windows. Transp Sci 31:170\u2013186","journal-title":"Transp Sci"},{"key":"1_CR40","doi-asserted-by":"publisher","first-page":"2253","DOI":"10.1002\/nme.401","volume":"53","author":"W Tu","year":"2002","unstructured":"Tu W, Mayne R (2002) An approach to multi-start clustering for global optimization with non-linear constraints. Int J Numer Methods Eng 53:2253\u20132269","journal-title":"Int J Numer Methods Eng"},{"issue":"3","key":"1_CR41","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1287\/ijoc.1060.0175","volume":"19","author":"Z Ugray","year":"2007","unstructured":"Ugray Z, Lasdon L, Plummer J, Glover F, Kelly J, Mart\u00ed R (2007) Scatter search and local NLP solvers: a multistart framework for global optimization. INFORMS J Comput 19(3):328\u2013340","journal-title":"INFORMS J Comput"},{"key":"1_CR42","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1080\/10556780902912389","volume":"24","author":"Z Ugray","year":"2009","unstructured":"Ugray Z, Lasdon L, Plummer J, Bussieck M (2009) Dynamic filters and randomized drivers for the multi-start global optimization algorithm MSNLP. Optim Methods Softw 24:4\u20135","journal-title":"Optim Methods Softw"},{"key":"1_CR43","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1016\/j.engappai.2010.01.013","volume":"23","author":"J Villegas","year":"2010","unstructured":"Villegas J, Prins C, Prodhon C, Medaglia A, Velasco N (2010) GRASP\/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots. Eng Appl Artif Intell 23:780\u2013794","journal-title":"Eng Appl Artif Intell"}],"container-title":["Handbook of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07124-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T07:18:34Z","timestamp":1571728714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07124-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319071237","9783319071244"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07124-4_1","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}