{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:38:06Z","timestamp":1742913486514,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":76,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_262","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:01:35Z","timestamp":1219662095000},"page":"1498-1506","source":"Crossref","is-referenced-by-count":7,"title":["Heuristic and Metaheuristic Algorithms for the Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Yannis","family":"Marinakis","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"262_CR1_262","volume-title":"Simulated Annealing and Boltzmann Machines - A stochastic Approach to Combinatorial Optimization and Neural Computing","author":"E Aarts","year":"1989","unstructured":"Aarts E, Korst J (1989) Simulated Annealing and Boltzmann Machines - A\u00a0stochastic\nApproach to Combinatorial Optimization and Neural Computing. John Wiley and Sons, Chichester"},{"key":"262_CR2_262","first-page":"209","volume-title":"Handbook of Applied Optimization","author":"E Aarts","year":"2002","unstructured":"Aarts E, Ten Eikelder HMM (2002) Simulated Annealing. In: Pardalos PM, Resende MGC (eds)\nHandbook of Applied Optimization. Oxford University Press, Oxford, pp 209\u2013221"},{"key":"262_CR3_262","first-page":"91","volume-title":"Local Search in Combinatorial Optimization","author":"E Aarts","year":"1997","unstructured":"Aarts E, Korst J, Van Laarhoven P (1997) Simulated Annealing. In: Aarts E, Lenstra JK\n(eds) Local Search in Combinatorial Optimization. John Wiley and Sons, Chichester, pp 91\u2013120"},{"key":"262_CR4_262","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6331-0","volume-title":"Computational Intelligence for Optimization","author":"N Ansari","year":"1997","unstructured":"Ansari N, Hou E (1997) Computational Intelligence for Optimization, 1st edn. Kluwer, Boston","edition":"1"},{"key":"262_CR5_262","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1287\/ijoc.15.1.82.15157","volume":"15","author":"D Applegate","year":"2003","unstructured":"Applegate D, Cook W, Rohe A (2003) Chained Lin-Kernighan for Large\nTraveling Salesman Problems. Informs J Comput 15:82\u201392","journal-title":"Informs J Comput"},{"issue":"4","key":"262_CR6_262","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.1016\/j.chaos.2005.08.114","volume":"28","author":"Y Bai","year":"2006","unstructured":"Bai Y, Zhang W, Jin Z (2006) An New Self-Organizing Maps Strategy for Solving the\nTraveling Salesman Problem. Chaos Solitons Fractals 28(4):1082\u20131089","journal-title":"Chaos Solitons Fractals"},{"key":"262_CR7_262","first-page":"117","volume-title":"The Traveling Salesman Problem and its Variations","author":"E Balas","year":"2002","unstructured":"Balas E, Fischetti M (2002) Polyhedral Theory for the Assymetric Traveling Salesman\nProblem. In: Gutin G, Punnen A (eds) The Traveling Salesman Problem and its Variations.  Kluwer, Dordrecht, pp 117\u2013168"},{"key":"262_CR8_262","first-page":"361","volume-title":"The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"E Balas","year":"1985","unstructured":"Balas E, Toth P (1985) Branch and Bound Methods. In: Lawer EL, Lenstra JK, Rinnoy Kan\nAHG, Shmoys DB (eds) The Travelling Salesman Problem: A\u00a0Guided Tour of Combinatorial\nOptimization. John Wiley and Sons, Chichester, pp 361\u2013401"},{"issue":"6","key":"262_CR9_262","first-page":"1","volume":"5","author":"R Baralia","year":"2001","unstructured":"Baralia R, Hildago JI, Perego R (2001) A\u00a0Hybrid Heuristic for the Traveling\nSalesman Problem.  IEEE Trans Evol Comput 5(6):1\u201341","journal-title":"IEEE Trans Evol Comput"},{"key":"262_CR10_262","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1017\/S0305004100034095","volume":"55","author":"J Beardwood","year":"1959","unstructured":"Beardwood J, Halton JH, Hammersley JM (1959) The Shortest Path Through Many Points.\nProc Cambridge Philos Soc 55:299\u2013327","journal-title":"Proc Cambridge Philos Soc"},{"key":"262_CR11_262","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","volume":"4","author":"JL Bentley","year":"1992","unstructured":"Bentley JL (1992) Fast Algorithms for Geometric Traveling Salesman Problems.  ORSA\nJ Comput 4:387\u2013411","journal-title":"ORSA J Comput"},{"key":"262_CR12_262","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0305-0548(83)90030-8","volume":"10","author":"L Bodin","year":"1983","unstructured":"Bodin L, Golden B, Assad A, Ball M (1983) The State of the Art in the Routing and\nScheduling of Vehicles and Crews. Comput Oper Res 10:63\u2013212","journal-title":"Comput Oper Res"},{"key":"262_CR13_262","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0167-6377(93)90023-A","volume":"14","author":"I Charon","year":"1993","unstructured":"Charon I, Hudry O (1993) The Noising Method: A\u00a0New Combinatorial Optimization Method.\nOper Res Lett 14:133\u2013137","journal-title":"Oper Res Lett"},{"key":"262_CR14_262","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/S0377-2217(99)00457-9","volume":"125","author":"I Charon","year":"2000","unstructured":"Charon I, Hudry O (2000) Applications of the Noising Method to the Traveling Salesman\nProblem.  Eur J Oper Res 125:266\u2013277","journal-title":"Eur J Oper Res"},{"issue":"2","key":"262_CR15_262","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.physa.2006.04.052","volume":"371","author":"Y Chen","year":"2006","unstructured":"Chen Y, and Zhang P (2006) Optimized Annealing of Traveling Salesman Problem from the\nnth-Nearest-Neighbor Distribution.  Physica A: Stat Theor Phys\n371(2):627\u2013632","journal-title":"Physica A: Stat Theor Phys"},{"issue":"1\u20134","key":"262_CR16_262","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.ins.2003.10.013","volume":"167","author":"SC Chu","year":"2004","unstructured":"Chu SC, Roddick JF, Pan JS (2004) Ant Colony System with Communication Strategies.\nInf Sci 167(1\u20134):63\u201376","journal-title":"Inf Sci"},{"key":"262_CR17_262","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke G, and Wright J (1964) Scheduling of Vehicles from a\u00a0Central Depot to a\u00a0Number\nof Delivery Points. Oper Res 12:568\u2013581","journal-title":"Oper Res"},{"issue":"1","key":"262_CR18_262","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant Colony System: A\u00a0Cooperative Learning Approach to\nthe Traveling Salesman Problem.  IEEE Trans Evol Comput 1(1):53\u201366","journal-title":"IEEE Trans Evol Comput"},{"key":"262_CR19_262","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization, A Bradford Book","author":"M Dorigo","year":"2004","unstructured":"Dorigo M, Stutzle T (2004) Ant Colony Optimization, A\u00a0Bradford Book. The MIT Press\nCambridge, Massachusetts, London"},{"issue":"1","key":"262_CR20_262","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.ejor.2004.04.023","volume":"160","author":"D Gamboa","year":"2005","unstructured":"Gamboa D, Rego C, Glover F (2005) Data Structures and Ejection Chains for Solving\nLarge-Scale Traveling Salesman Problems. Eur J Oper Res\n160(1):154\u2013171","journal-title":"Eur J Oper Res"},{"issue":"4","key":"262_CR21_262","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1016\/j.cor.2005.06.014","volume":"33","author":"D Gamboa","year":"2006","unstructured":"Gamboa D, Rego C, Glover F (2006) Implementation Analysis of Efficient Heuristic\nAlgorithms for the Traveling Salesman Problem.  Comput Oper Res\n33(4):1154\u20131172","journal-title":"Comput Oper Res"},{"key":"262_CR22_262","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","volume":"40","author":"M Gendreau","year":"1992","unstructured":"Gendreau M, Hertz A, Laporte G (1992) New Insertion and Postoptimization Procedures for\nthe Traveling Salesman Problem.  Oper Res 40:1086\u20131094","journal-title":"Oper Res"},{"key":"262_CR23_262","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover F (1986) Future Paths for Integer Programming and Links to Artificial\nIntelligence. Comput Oper Res 13:533\u2013549","journal-title":"Comput Oper Res"},{"issue":"3","key":"262_CR24_262","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu Search I. ORSA J Comput 1(3):190\u2013206","journal-title":"ORSA J Comput"},{"issue":"1","key":"262_CR25_262","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu Search II. ORSA J Comput 2(1):4\u201332","journal-title":"ORSA J Comput"},{"key":"262_CR26_262","doi-asserted-by":"crossref","unstructured":"Glover F (1990) Tabu search: A\u00a0tutorial. Center for Applied Artificial Intelligence,\nUniversity of Colorado, pp 1\u201347","DOI":"10.1287\/inte.20.4.74"},{"key":"262_CR27_262","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","volume":"65","author":"F Glover","year":"1992","unstructured":"Glover F (1992) Ejection Chains, Reference Structures and Alternating Path Algorithms\nfor Traveling Salesman Problem.  Discrete Appl Math 65:223\u2013253","journal-title":"Discrete Appl Math"},{"key":"262_CR28_262","unstructured":"Glover F (1997) A\u00a0Template for Scatter Search and Path Relinking.  Lecture Notes in\nComputer Science, vol\u00a01363. pp\u00a013\u201354"},{"key":"262_CR29_262","first-page":"194","volume-title":"Handbook of Applied Optimization","author":"F Glover","year":"2002","unstructured":"Glover F, and Laguna M (2002) Tabu Search. In: Pardalos PM, Resende MGC (eds) Handbook\nof Applied Optimization. Oxford University Press, Oxford, pp 194\u2013209"},{"key":"262_CR30_262","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/0-306-48056-5_1","volume-title":"Handbook of Metaheuristics","author":"F Glover","year":"2003","unstructured":"Glover F, Laguna M, Marti R (2003) Scatter Search and Path Relinking: Advances and\nApplications. In: Glover F, Kochenberger GA (eds) Handbook of Metaheuristics. Kluwer, Boston, pp 1\u201336"},{"key":"262_CR31_262","unstructured":"Glover F, Laguna M, Taillard E, de Werra D (eds) (1993) Tabu Search. J.C. Baltzer AG,\nScience Publishers, Basel, Switzerland"},{"key":"#cr-split#-262_CR32_262.1","unstructured":"Goldbarg EFG, Souza GR, Goldbarg MC (2006) Particle Swarm Optimization for the"},{"key":"#cr-split#-262_CR32_262.2","unstructured":"Traveling Salesman Problem. EVOCOP 2006 LNCS 3906:99-110"},{"key":"262_CR33_262","first-page":"207","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"BL Golden","year":"1985","unstructured":"Golden BL, Stewart WR (1985) Empirical Analysis of Heuristics. In: Lawer EL, Lenstra\nJK, Rinnoy Kan AHG, Shmoys DB (eds) The Traveling Salesman Problem: A\u00a0Guided Tour of Combinatorial\nOptimization. John Wiley and Sons, Chichester, pp 207\u2013249"},{"volume-title":"The Traveling Salesman Problem and its Variations","year":"2002","key":"262_CR34_262","unstructured":"Gutin G, Punnen A (eds) (2002) The Traveling Salesman Problem and its\nVariations. Kluwer, Dordrecht"},{"key":"262_CR35_262","first-page":"47","volume-title":"Vehicle Routing: Methods and Studies","author":"M Haimovich","year":"1988","unstructured":"Haimovich M, Rinnoy Kan AHG, Stougie L (1988) Analysis of Heuristics for Vehicle\nRouting Problems. In: Golden BL, Assad AA (eds) Vehicle Routing: Methods and Studies. Elsevier\nScience Publishers, North Holland, pp 47\u201361"},{"key":"262_CR36_262","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen P, Mladenovic N (2001) Variable Neighborhood Search: Principles and\nApplications.  Eur J Oper Res 130:449\u2013467","journal-title":"Eur J Oper Res"},{"key":"262_CR37_262","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun K (2000) An Effective Implementation of the Lin-Kernighan Traveling Salesman\nHeuristic.  Eur J Oper Res 126:106\u2013130","journal-title":"Eur J Oper Res"},{"key":"262_CR38_262","volume-title":"Adaptation in Natural and Artificial Systems","author":"J Holland H.","year":"1975","unstructured":"Holland J H. (1975) Adaptation in Natural and Artificial Systems. University of\nMichigan Press, Ann Arbor"},{"key":"262_CR39_262","first-page":"215","volume-title":"Local Search in Combinatorial Optimization","author":"DS Johnson","year":"1997","unstructured":"Johnson DS, McGeoch LA (1997) The Traveling Salesman Problem: A\u00a0Case Study. In: Aarts\nE, Lenstra JK (eds) Local Search in Combinatorial Optimization. John\nWiley and Sons, Chichester, pp 215\u2013310"},{"key":"262_CR40_262","first-page":"369","volume-title":"The Traveling Salesman Problem and its Variations","author":"DS Johnson","year":"2002","unstructured":"Johnson DS, McGeoch LA (2002) Experimental Analysis of the STSP. In: Gutin G, Punnen A\n(eds) The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht, pp\n369\u2013444"},{"key":"262_CR41_262","first-page":"37","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"DS Johnson","year":"1985","unstructured":"Johnson DS, Papadimitriou CH (1985) Computational Complexity. In: Lawer EL, Lenstra JK,\nRinnoy Kan AHD, Shmoys DB (eds) The Traveling Salesman Problem: A\u00a0Guided Tour of Combinatorial\nOptimization. John Wiley and Sons, Chichester, pp 37\u201385"},{"key":"262_CR42_262","first-page":"145","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"DS Johnson","year":"1985","unstructured":"Johnson DS, Papadimitriou CH (1985) Performance Guarantees for Heuristics. In: Lawer\nEL, Lenstra JK, Rinnoy Kan AHD, Shmoys DB (eds) The Traveling Salesman Problem: A\u00a0Guided Tour of\nCombinatorial Optimization. John Wiley and Sons, Chichester, pp 145\u2013181"},{"key":"262_CR43_262","first-page":"181","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"RM Karp","year":"1985","unstructured":"Karp RM, Steele JM (1985) Probabilistic Analysis of Heuristics. In: Lawer EL, Lenstra\nJK, Rinnoy Kan AHD, Shmoys DB (eds) The Traveling Salesman Problem: A\u00a0Guided Tour of Combinatorial\nOptimization. John Wiley and Sons, Chichester, pp 181\u2013206"},{"key":"262_CR44_262","unstructured":"Kennedy J, Eberhart R (1995) Particle Swarm Optimization. Proc. 1995\nIEEE Int Conf Neural Netw 4:1942\u20131948"},{"key":"262_CR45_262","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1982","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1982) Optimization by Simulated\nAnnealing. Science 220:671\u2013680","journal-title":"Science"},{"key":"262_CR46_262","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"EL Lawer","year":"1985","unstructured":"Lawer EL, Lenstra JK, Rinnoy Kan AHG, Shmoys DB (1985) The Traveling Salesman Problem:\nA\u00a0Guided Tour of Combinatorial Optimization.  Wiley and Sons, New York"},{"key":"#cr-split#-262_CR47_262.1","unstructured":"Li X, Tian P, Hua J, Zhong N (2006) A\u00a0Hybrid Discrete Particle Swarm Optimization"},{"key":"#cr-split#-262_CR47_262.2","unstructured":"for the Traveling Salesman Problem. SEAL 2006, LNCS 4247:181-188"},{"key":"262_CR48_262","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin S (1965) Computer Solutions of the Traveling Salesman Problem. Bell Syst\nTech J 44:2245\u20132269","journal-title":"Bell Syst Tech J"},{"key":"262_CR49_262","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan BW (1973) An Effective Heuristic Algorithm for the Traveling Salesman\nProblem.  Oper Res 21:498\u2013516","journal-title":"Oper Res"},{"key":"262_CR50_262","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10589-005-4798-5","volume":"32","author":"Y Marinakis","year":"2005","unstructured":"Marinakis Y, Migdalas A, Pardalos PM (2005) Expanding Neighborhood GRASP for the\nTraveling Salesman Problem. Comput Optim Appl 32:231\u2013257","journal-title":"Comput Optim Appl"},{"key":"262_CR51_262","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10878-005-4921-7","volume":"10","author":"Y Marinakis","year":"2005","unstructured":"Marinakis Y, Migdalas A, Pardalos PM (2005) A\u00a0Hybrid Genetic-GRASP algortihm Using\nLangrangean Relaxation for the Traveling Salesman Problem.  J\u00a0Combinat\nOptim 10:311\u2013326","journal-title":"J Combinat Optim"},{"key":"262_CR52_262","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic N, Hansen P (1997) Variable Neighborhood Search. Comput Oper Res 24:1097\u20131100","journal-title":"Comput Oper Res"},{"issue":"6","key":"262_CR53_262","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1111\/j.1475-3995.1999.tb00175.x","volume":"6","author":"A Modares","year":"1999","unstructured":"Modares A, Somhom S, Enkawa T (1999) A\u00a0Self-Organizing Neural Network Approach for\nMultiple Traveling Salesman and Vehicle Routing Problems. Int Trans Oper Res 6(6):591\u2013606","journal-title":"Int Trans Oper Res"},{"key":"262_CR54_262","unstructured":"Neto DM (1999) Efficient Cluster Compensation for Lin - Kernighan Heuristics.\nPh.D. Thesis, Computer Science University of Toronto, Canada"},{"issue":"3\u20134","key":"262_CR55_262","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/j.physa.2004.10.022","volume":"349","author":"M Ninio","year":"2005","unstructured":"Ninio M, Schneider JJ (2005) Weight Annealing. Physica A: Stat Theor Phys 349(3\u20134):649\u2013666","journal-title":"Physica A: Stat Theor Phys"},{"key":"262_CR56_262","unstructured":"Or I (1976) Traveling Salesman-Type Combinatorial Problems and their Relation to the\nLogistics of Regional Blood Banking.  Ph.D. Thesis, Department of Industrial Engineering and\nManagement Sciences, Northwestern University, Evanston IL"},{"key":"262_CR57_262","first-page":"173","volume-title":"Local Search in Combinatorial Optimization","author":"B Sodererg","year":"1997","unstructured":"Sodererg B, Peterson C (1997) Artificial Neural Networks. In: Aarts E, Lenstra JK (eds)\nLocal Search in Combinatorial Optimization. John Wiley and Sons, Chichester, pp 173\u2013214"},{"key":"262_CR58_262","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1145\/76359.76361","volume":"36","author":"LK Platzmann","year":"1989","unstructured":"Platzmann LK, Bartholdi JJ (1989) Spacefilling Curves and the Planar Traveling Salesman\nProblem.  J\u00a0Assoc Comput Mach 36:719\u2013735","journal-title":"J Assoc Comput Mach"},{"key":"262_CR59_262","doi-asserted-by":"crossref","unstructured":"Potvin J Y. (1996) Genetic Algorithms for the Traveling Salesman Problem.\nMetaheuristics Combinatorial Optim  Ann Oper Res 63:339\u2013370","DOI":"10.1007\/BF02125403"},{"key":"262_CR60_262","first-page":"1","volume-title":"The Traveling Salesman Problem and its Variations","author":"AP Punnen","year":"2002","unstructured":"Punnen AP (2002) The Traveling Salesman Problem: Applications, Formulations and\nVariations. In: Gutin G, Punnen A (eds) The Traveling Salesman Problem and its Variations.  Kluwer, Dordrecht, pp 1\u201328"},{"key":"262_CR61_262","first-page":"151","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"CR Reeves","year":"1995","unstructured":"Reeves CR (1995) Genetic Algorithms. In: Reeves CR (ed) Modern Heuristic Techniques for\nCombinatorial Problems. McGraw - Hill, London, pp 151\u2013196"},{"key":"262_CR62_262","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/0-306-48056-5_3","volume-title":"Handbooks of Metaheuristics","author":"CR Reeves","year":"2003","unstructured":"Reeves CR (2003) Genetic Algorithms. In: Glover F, Kochenberger GA (eds) Handbooks of\nMetaheuristics. Kluwer, Dordrecht, pp 55\u201382"},{"key":"262_CR63_262","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1016\/S0377-2217(97)00288-9","volume":"106","author":"C Rego","year":"1998","unstructured":"Rego C (1998) Relaxed Tours and Path Ejections for the Traveling Salesman Problem.\nEur J Oper Res 106:522\u2013538","journal-title":"Eur J Oper Res"},{"key":"262_CR64_262","first-page":"309","volume-title":"The Traveling Salesman Problem and its Variations","author":"C Rego","year":"2002","unstructured":"Rego C, Glover F (2002) Local Search and Metaheuristics. In: Gutin G, Punnen A (eds)\nThe Traveling Salesman Problem and its Variations. Kluwer, Dordrecht, pp\n309\u2013367"},{"key":"262_CR65_262","volume-title":"The Traveling Salesman, Computational Solutions for TSP Applications","author":"G Reinelt","year":"1994","unstructured":"Reinelt G (1994) The Traveling Salesman, Computational Solutions for TSP Applications.\nSpringer, Berlin"},{"key":"262_CR66_262","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/0-306-48056-5_8","volume-title":"Handbook of Metaheuristics","author":"MGC Resende","year":"2003","unstructured":"Resende MGC, Ribeiro CC (2003) Greedy Randomized Adaptive Search Procedures. In: Glover\nF, Kochenberger GA (eds) Handbook of Metaheuristics. Kluwer, Boston, pp 219\u2013249"},{"key":"262_CR67_262","first-page":"367","volume-title":"Practical Handbook of Genetic Algorithms","author":"S Ronald","year":"1995","unstructured":"Ronald S (1995) Routing and Scheduling Problems. In: Chambers L (ed) Practical Handbook\nof Genetic Algorithms. CRC Press, New York, pp 367\u2013430"},{"key":"262_CR68_262","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"DJ Rosenkratz","year":"1977","unstructured":"Rosenkratz DJ, Stearns RE, Lewis PM (1977) An Analysis of Several Heuristics for the\nTravelling Salesman Problem.  SIAM J Comput 6:563\u2013581","journal-title":"SIAM J Comput"},{"issue":"4\u20136","key":"262_CR69_262","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1016\/j.neucom.2006.03.013","volume":"70","author":"PH Siqueira","year":"2007","unstructured":"Siqueira PH, Teresinha M, Steiner A, Scheer S (2007) A\u00a0New Approach to Solve the\nTraveling Salesman Problem. Neurocomputing 70(4\u20136):1013\u20131021","journal-title":"Neurocomputing"},{"key":"262_CR70_262","first-page":"130","volume-title":"Handbook of Applied Optimization","author":"ED Taillard","year":"2002","unstructured":"Taillard ED (2002) Ant Systems. In: Pardalos PM, Resende MGC (eds) Handbook of Applied\nOptimization. Oxford University Press, Oxford, pp 130\u2013138"},{"key":"262_CR71_262","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/S0377-2217(98)00099-X","volume":"113","author":"C Voudouris","year":"1999","unstructured":"Voudouris C, Tsang E (1999) Guided Local Search and its Application to the Travelling\nSalesman Problem.  Eur J Oper Res 113:469\u2013499","journal-title":"Eur J Oper Res"},{"key":"262_CR72_262","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/0-306-48056-5_7","volume-title":"Handbooks of Metaheuristics","author":"C Voudouris","year":"2003","unstructured":"Voudouris C, Tsang E (2003) Guided Local Search. In: Glover F, Kochenberger GA (eds)\nHandbooks of Metaheuristics. Kluwer, Dordrecht, pp 185\u2013218"},{"key":"262_CR73_262","doi-asserted-by":"crossref","unstructured":"Wang Y, Feng XY, Huang YX, Pu DB, Zhou WG, Liang YC, Zhou CG (2007) A\u00a0Novel Quantum\nSwarm Evolutionary Algorithm and its Applications. Neurocomputing\n70 (4\u20136):633\u2013640","DOI":"10.1016\/j.neucom.2006.10.001"},{"key":"262_CR74_262","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1007\/978-1-4613-1361-8_34","volume-title":"Meta-heuristics: Theory and Applications","author":"M Zachariasen","year":"1996","unstructured":"Zachariasen M, Dam M (1996) Tabu Search on the Geometric Traveling Salesman Problem.\nIn: Osman IH, Kelly JP (eds) Meta-heuristics: Theory and Applications. Kluwer,\nBoston, pp 571\u2013587"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_262","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T11:15:46Z","timestamp":1720696546000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":76,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_262","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}