{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T09:39:56Z","timestamp":1773740396707,"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_4","type":"book-chapter","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T19:09:59Z","timestamp":1534187399000},"page":"791-808","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":80,"title":["A History of Metaheuristics"],"prefix":"10.1007","author":[{"given":"Kenneth","family":"S\u00f6rensen","sequence":"first","affiliation":[]},{"given":"Marc","family":"Sevaux","sequence":"additional","affiliation":[]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,14]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Ahuja RK, Ergun \u00d6, Orlin JB, Punnen AP (2002) A survey of very large-scale neighborhood search techniques. Discret Appl Math 123 (1): 75\u2013102","DOI":"10.1016\/S0166-218X(01)00338-9"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Baxter J (1981) Local optima avoidance in depot location. J Oper Res Soc 32:815\u2013819","DOI":"10.1057\/jors.1981.159"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Carbonell JG (1983) Learning by analogy: formulating and generalizing plans from past experience. In: Machine learning. Springer Science & Business Media, Berlin\/Heidelberg, pp 137\u2013161. https:\/\/doi.org\/10.1007\/978-3-662-12405-5_5","DOI":"10.1007\/978-3-662-12405-5_5"},{"key":"4_CR4","unstructured":"Chu T (2014) Human purpose and transhuman potential: a cosmic vision for our future evolution. Origin Press, San Rafael. ISBN:978-1-57983-0250"},{"key":"4_CR5","unstructured":"Colorni A, Dorigo M, Maniezzo V (1992) Distributed optimization by ant colonies. In: Varela FJ, Bourgine P (eds) Proceedings of the first European conference on artificial life. MIT Press, Cambridge, pp 134\u2013142"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Corber\u00e1n \u00c1, Peir\u00f3 J, Campos V, Glover F, Mart\u00ed R (2016) Strategic oscillation for the capacitated hub location problem with modular links. J Heuristics 22 (2): 221\u2013244","DOI":"10.1007\/s10732-016-9308-7"},{"key":"4_CR7","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms, 3rd edn. MIT Press, Cambridge. ISBN:978-0-262-03384-8"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Dueck G (1993) New optimization heuristics. J Comput Phys 104 (1): 86\u201392. https:\/\/doi.org\/10.1006\/jcph.1993.1010","DOI":"10.1006\/jcph.1993.1010"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Dueck G, Scheuer T (1990) Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J Comput Phys 90 (1): 161\u2013175. https:\/\/doi.org\/10.1016\/0021-9991(90)90201-b","DOI":"10.1016\/0021-9991(90)90201-b"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Glob Optim 6 (2): 109\u2013133. https:\/\/doi.org\/10.1007\/bf01096763","DOI":"10.1007\/bf01096763"},{"key":"4_CR11","unstructured":"Fogel LJ, Owens AJ, Walsh MJ (1966) Artificial intelligence through simulated evolution. Wiley, New York"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Mart\u00ednez C, Rodriguez FJ, Lozano M (2014) Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem. Eur J Oper Res 232 (3): 454\u2013463","DOI":"10.1016\/j.ejor.2013.07.035"},{"key":"4_CR13","doi-asserted-by":"publisher","unstructured":"Glover F (1977) Heuristics for integer programming using surrogate constraints. Decis Sci 8 (1): 156\u2013166. https:\/\/doi.org\/10.1111\/j.1540-5915.1977.tb01074.x","DOI":"10.1111\/j.1540-5915.1977.tb01074.x"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13 (5): 533\u2013549. https:\/\/doi.org\/10.1016\/0305-0548(86)90048-1","DOI":"10.1016\/0305-0548(86)90048-1"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Glover F (1998) A template for scatter search and path relinking. In: Artificial evolution. Lecture notes in computer Science. Springer Science & Business Media, pp 1\u201351. https:\/\/doi.org\/10.1007\/bfb0026589","DOI":"10.1007\/bfb0026589"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer Academic Publishers\/Springer, Boston","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"4_CR17","unstructured":"Glover F, Laguna M, Mart\u00ed R (2000) Fundamentals of scatter search and path relinking. Control and Cybern 29 (3): 653\u2013684"},{"key":"4_CR18","unstructured":"Goldberg D (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading"},{"key":"4_CR19","doi-asserted-by":"publisher","unstructured":"Granville V, Krivanek M, Rasson J-P (1994) Simulated annealing: a proof of convergence. IEEE Trans Pattern Anal Mach Intell 16 (6): 652\u2013656. https:\/\/doi.org\/10.1109\/34.295910","DOI":"10.1109\/34.295910"},{"key":"4_CR20","unstructured":"Holland J (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor"},{"key":"4_CR21","unstructured":"Hopfield J (1982) Neural networks and physical systems with emergent collective computational capabilities. Proc Natl Acad Sci 79 (8): 2254\u20132558"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Hvattum LM, L\u00f8kketangen A, Glover F (2004) Adaptive memory search for boolean optimization problems. Discret Appl Math 142 (1): 99\u2013109","DOI":"10.1016\/j.dam.2003.06.006"},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"Jarboui B, Derbel H, Hanafi S, Mladenovi\u0107 N (2013) Variable neighborhood search for location routing. Comput Oper Res 40 (1): 47\u201357. https:\/\/doi.org\/10.1016\/j.cor.2012.05.009","DOI":"10.1016\/j.cor.2012.05.009"},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220 (4598): 671\u2013680. https:\/\/doi.org\/10.1126\/science.220.4598.671","DOI":"10.1126\/science.220.4598.671"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o HR, Martin OC, St\u00fctzle T (2003) Iterated local search. Int Ser Oper Res Manag Sci 57:321\u2013354","DOI":"10.1007\/0-306-48056-5_11"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Lozano M, Glover F, Garc\u00eda-Mart\u00ednez C, Rodr\u00edguez FJ, Mart\u00ed R (2014) Tabu search with strategic oscillation for the quadratic minimum spanning tree. IIE Trans 46 (4): 414\u2013428","DOI":"10.1080\/0740817X.2013.768785"},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Maniezzo V, St\u00fctzle T, Vo\u00df S (eds) (2010) Matheuristics. Springer. https:\/\/doi.org\/10.1007\/978-1-4419-1306-7","DOI":"10.1007\/978-1-4419-1306-7"},{"key":"4_CR28","doi-asserted-by":"publisher","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24 (11): 1097\u20131100. https:\/\/doi.org\/10.1016\/s0305-0548(97)00031-2","DOI":"10.1016\/s0305-0548(97)00031-2"},{"key":"4_CR29","unstructured":"Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts \u2013 towards memetic algorithms. Technical Report 826, Caltech Concurrent Computation Program, Pasadena"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Polya G (2014) How to solve it: a new aspect of mathematical method. Princeton university press, Princeton","DOI":"10.2307\/j.ctvc773pk"},{"key":"4_CR31","doi-asserted-by":"publisher","unstructured":"Rechenberg I (1989) Evolution strategy: nature\u2019s way of optimization. In: Optimization: methods and applications, possibilities and limitations. Springer Science & Business Media, Berlin\/New York, pp 106\u2013126. https:\/\/doi.org\/10.1007\/978-3-642-83814-9_6","DOI":"10.1007\/978-3-642-83814-9_6"},{"key":"4_CR32","doi-asserted-by":"publisher","unstructured":"Ribeiro CC, Rosseti I, Souza RC (2011) Effective probabilistic stopping rules for randomized metaheuristics: GRASP implementations. In: Learning and intelligent optimization. Lecture notes in computer science, vol 6683. Springer Science & Business Media, pp 146\u2013160. https:\/\/doi.org\/10.1007\/978-3-642-25566-3_11","DOI":"10.1007\/978-3-642-25566-3_11"},{"issue":"4","key":"4_CR33","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40 (4): 455\u2013472","journal-title":"Transp Sci"},{"issue":"3","key":"4_CR34","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1016\/j.ejor.2006.07.029","volume":"187","author":"R Ruiz","year":"2008","unstructured":"Ruiz R, St\u00fctzle T (2008) An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. Eur J Oper Res 187 (3): 1143\u20131159","journal-title":"Eur J Oper Res"},{"key":"4_CR35","doi-asserted-by":"publisher","unstructured":"Shore HH (1970) The transportation problem and the VOGEL approximation method. Decis Sci 1 (3-4): 441\u2013457. https:\/\/doi.org\/10.1111\/j.1540-5915.1970.tb00792.x","DOI":"10.1111\/j.1540-5915.1970.tb00792.x"},{"key":"4_CR36","volume-title":"The sciences of the artificial","author":"HA Simon","year":"1996","unstructured":"Simon HA (1996) The sciences of the artificial, 3rd edn. MIT Press, Cambridge","edition":"3"},{"key":"4_CR37","doi-asserted-by":"publisher","unstructured":"Simon HA, Newell A (1958) Heuristic problem solving: the next advance in operations research. Oper Res 6 (1): 1\u201310. https:\/\/doi.org\/10.1287\/opre.6.1.1","DOI":"10.1287\/opre.6.1.1"},{"key":"4_CR38","doi-asserted-by":"publisher","unstructured":"S\u00f6rensen K (2015) Metaheuristics\u2013the metaphor exposed. Int Trans Oper Res 22 (1): 3\u201318. https:\/\/doi.org\/10.1111\/itor.12001","DOI":"10.1111\/itor.12001"},{"key":"4_CR39","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1007\/978-1-4419-1153-7_1167","volume-title":"Encyclopedia of operations research and management science, 663","author":"K S\u00f6rensen","year":"2013","unstructured":"S\u00f6rensen K, Glover FW (2013) Metaheuristics. In: Gass SI, Fu MC (eds) Encyclopedia of operations research and management science, 663 3rd edn, pp 960\u2013970, Springer, Boston, MA","edition":"3"},{"key":"4_CR40","doi-asserted-by":"publisher","unstructured":"Watson J-P, Barbulescu L, Whitley LD, Howe AE (2002) Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance. INFORMS J Comput 14 (2): 98\u2013123. https:\/\/doi.org\/10.1287\/ijoc.14.2.98.120","DOI":"10.1287\/ijoc.14.2.98.120"},{"key":"4_CR41","doi-asserted-by":"publisher","unstructured":"Watson J-P, Beck JC, Howe AE, Whitley LD (2003) Problem difficulty for tabu search in job-shop scheduling. Artif Intell 143 (2): 189\u2013217. https:\/\/doi.org\/10.1016\/s0004-3702(02)00363-6","DOI":"10.1016\/s0004-3702(02)00363-6"},{"key":"4_CR42","doi-asserted-by":"publisher","unstructured":"Weyland D (2010) A rigorous analysis of the harmony search algorithm. Int J Appl Metaheuristic Comput 1 (2): 50\u201360. https:\/\/doi.org\/10.4018\/jamc.2010040104","DOI":"10.4018\/jamc.2010040104"},{"issue":"1","key":"4_CR43","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.disopt.2004.03.005","volume":"1","author":"M Yagiura","year":"2004","unstructured":"Yagiura M, Iwasaki S, Ibaraki T, Glover F (2004) A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem. Discret Optim 1 (1): 87\u201398","journal-title":"Discret Optim"}],"container-title":["Handbook of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07124-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T07:21:50Z","timestamp":1571728910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07124-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319071237","9783319071244"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07124-4_4","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}