{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T10:10:10Z","timestamp":1751796610052,"version":"3.41.0"},"publisher-location":"Cham","reference-count":89,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319071237"},{"type":"electronic","value":"9783319071244"}],"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_2","type":"book-chapter","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T19:09:59Z","timestamp":1534187399000},"page":"261-297","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Guided Local Search"],"prefix":"10.1007","author":[{"given":"Abdullah","family":"Alsheddy","sequence":"first","affiliation":[]},{"given":"Christos","family":"Voudouris","sequence":"additional","affiliation":[]},{"given":"Edward P. K.","family":"Tsang","sequence":"additional","affiliation":[]},{"given":"Ahmad","family":"Alhindi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,14]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Aardal K, Van Hoesel S, Koster A, Mannino C, Sassano A (2007) Models and solution techniques for frequency assignment problems. Ann Oper Res 153(1):79\u2013129","DOI":"10.1007\/s10479-007-0178-0"},{"key":"2_CR2","unstructured":"Alhindi A (2015) Multiobjective evolutionary algorithm based on decomposition with advanced local search methods. PhD thesis, Department of computer science, University of Essex, Colchester"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Alhindi A, Zhang Q (2013) MOEA\/D with guided local search: some preliminarily experimental results. In: 5th computer science and electronic engineering conference (CEEC), Colchester, pp 109\u2013114","DOI":"10.1109\/CEEC.2013.6659455"},{"key":"2_CR4","unstructured":"Alsheddy A (2011) Empowerment scheduling: a multi-objective optimization approach using guided local search. PhD thesis, Department of computer science, University of Essex, Colchester"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Alsheddy A, Tsang EPK (2009) Guided pareto local search and its application to the 0\/1 multi-objective knapsack problems. In: Metaheuristics international conference (MIC2009), Hamburg","DOI":"10.1109\/CEC.2010.5585983"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Alsheddy A, Tsang EPk (2010) Guided pareto local search based frameworks for biobjective optimization. In: IEEE congress on evolutionary computation (CEC), Barcelona, pp 1\u20138","DOI":"10.1109\/CEC.2010.5585983"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Alsheddy A, Tsang EPk (2011) Empowerment scheduling for a field workforce. J Sched 14(6):639\u2013654","DOI":"10.1007\/s10951-011-0232-2"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Anderson CA, Fraughnaugh K, Parker M, Ryan J (1993) Path assignment for call routing: an application of tabu search. Ann Oper Res 41:301\u2013312","DOI":"10.1007\/BF02022997"},{"key":"2_CR9","unstructured":"Azarmi N, Abdul-Hameed W (1995) Workforce scheduling with constraint logic programming. BT Technol J 13(1):81\u201394"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Backer BD, Furnon V, Shaw P, Kilby P and Prosser P (2000) Solving vehicle routing problems using constraint programming and metaheuristics. J Heuristics 6(4):501\u2013523","DOI":"10.1023\/A:1009621410177"},{"key":"2_CR11","unstructured":"Basharu M, Arana I, Ahriz H (2005) Distributed guided local search for solving binary DisCSPs. In: Proceedings of FLAIRS 2005. AAAI Press, Clearwater Beach, pp 660\u2013665"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Bentley JJ (1992) Fast algorithms for geometric traveling salesman problems. ORSA J Comput 4:387\u2013411","DOI":"10.1287\/ijoc.4.4.387"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Beullens P, Muyldermans L, Cattrysse D, Van Oudheusden D (2003) A guided local search heuristic for the capacitated arc routing problem. Eur J Oper Res 147(3):629\u2013643","DOI":"10.1016\/S0377-2217(02)00334-X"},{"key":"2_CR14","unstructured":"Bouju A, Boyce JF, Dimitropoulos CHD, vom Scheidt G, Taylor JG (1995) Intelligent search for the radio link frequency assignment problem. In: Proceedings of the international conference on digital signal processing, Limassol"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Castillo-Salazar A, Landa-Silva D, Qu R (2016) Workforce scheduling and routing problems: literature survey and computational study. Ann Oper Res 239(1):39\u201367","DOI":"10.1007\/s10479-014-1687-2"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Chiarandini M, Stutzle T (2007) Stochastic local search algorithms for graph set T-colouring and frequency assignment. Constraints 12(3):371\u2013403","DOI":"10.1007\/s10601-007-9023-y"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Chu P, Beasley JE (1997) A genetic algorithm for the generalized assignment problem. Comput Oper Res 24:17\u201323","DOI":"10.1016\/S0305-0548(96)00032-9"},{"key":"2_CR18","unstructured":"Congram RK, Potts CN (1999) Dynasearch algorithms for the traveling salesman problem. In: Presentation at the travelling salesman workshop, CORMSIS, University of Southampton, Southampton"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Cramer S, Kampouridis M (2015) Optimising the deployment of fibre optics using guided local search. In: Proceedings of the 2015 IEEE congress on evolutionary computation (CEC). IEEE Press, Sendai, pp 799\u2013806","DOI":"10.1109\/CEC.2015.7256973"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Croes A (1958) A method for solving traveling-salesman problems. Oper Res 5:791\u2013812","DOI":"10.1287\/opre.6.6.791"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Daoud S, Chehade H, Yalaoui F, Amodeo L (2014) Solving a robotic assembly line balancing problem using efficient hybrid methods. J Heuristics 20(3):235\u2013259","DOI":"10.1007\/s10732-014-9239-0"},{"key":"2_CR22","unstructured":"Daum M, Menzel W (2002) Parsing natural language using guided local search. In: Proceedings of 15th European conference on artificial intelligence (ECAI-2002), Lyon, pp 435\u2013439"},{"key":"2_CR23","unstructured":"Davenport A, Tsang EPK, Wang CJ, Zhu K (1994) GENET: a connectionist architecture for solving constraint satisfaction problems by iterative improvement. In: Proceedings of 12th national conference for artificial intelligence (AAAI), Seattle, 325\u2013330"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Dorne R, Voudouris C, Liret A, Ladde C, Lesaint D (2003) iSchedule \u2013 an optimisation tool-kit based on heuristic search to solve BT scheduling problems. BT Technol J 21(4):50\u201358","DOI":"10.1023\/A:1027375302779"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Dorne R, Mills P, Voudouris C (2007) Solving vehicle routing using iOpt. In: Doerner KF et al (eds) Metaheuristics: progress in complex systems optimization. Operations research\/computer science interfaces series, vol 39. Springer, New York, pp 389\u2013408","DOI":"10.1007\/978-0-387-71921-4_20"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Egeblad J, Nielsen B, Odgaard A (2007) Fast neighbourhood search for two- and three-dimensional nesting problems. Eur J Oper Res 183(3):1249\u20131266","DOI":"10.1016\/j.ejor.2005.11.063"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Faroe O, Pisinger D, Zachariasen M (2003) Guided local search for final placement in VLSI design. J Heuristics 9:269\u2013295","DOI":"10.1023\/A:1023721408655"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Flood MM (1956) The traveling-salesman problem. In: Operations research, vol 4. Columbia University, New York, pp 61\u201375","DOI":"10.1287\/opre.4.1.61"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Flores Lucio G, Reed M, Henning I (2007) Guided local search as a network planning algorithm that incorporates uncertain traffic demands. Comput Netw 51(11):3172\u20133196","DOI":"10.1016\/j.comnet.2007.01.017"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Freisleben B, Merz P (1996) A genetic local search algorithm for solving symmetric and asymmetric travelling salesman problems. In: Proceedings of the 1996 IEEE international conference on evolutionary computation. IEEE Press, Piscataway, pp 616\u2013621","DOI":"10.1109\/ICEC.1996.542671"},{"key":"2_CR31","unstructured":"Gent IP, van Maaren H, Walsh T (2000) SAT2000, highlights of satisfiability research in the year 2000. Frontiers in artificial intelligence and applications. IOS Press, Amsterdam\/Washington, DC"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer Academic, Boston","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"2_CR33","unstructured":"GLS Demos (2008). http:\/\/cswww.essex.ac.uk\/CSP\/glsdemo.html"},{"key":"2_CR34","unstructured":"Gomes N, Vale Z, Ramos C (2003) Hybrid constraint algorithm for the maintenance scheduling of electric power units. In: Proceeding Of international conference on intelligent systems application to power systems (ISAP 2003), Lemnos"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Hani Y, Amodeo L, Yalaoui F, Chen H (2007) Ant colony optimization for solving an industrial layout problem. Eur J Oper Res 183(2):633\u2013642","DOI":"10.1016\/j.ejor.2006.10.032"},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"Hansen P, Mladenovi\u0107 N, Todosijevi\u0107 R (2016) Variable neighborhood search: basics and variants. EURO J Comput Optim 1\u201332","DOI":"10.1007\/978-3-319-07153-4_19-1"},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Hifi M, Michrafy M, Sbihi A (2004) Heuristic algorithms for the multiple-choice multidimensional Knapsack problem. J Oper Res Soc 55:1323\u20131332","DOI":"10.1057\/palgrave.jors.2601796"},{"key":"2_CR38","unstructured":"Holstein D, Moscato P (1999) Memetic algorithms using guided local search: a case study. In: Corne D, Glover F, Dorigo M (eds) New ideas in optimisation. McGraw-Hill, London, pp 235\u2013244"},{"key":"2_CR39","doi-asserted-by":"crossref","unstructured":"Johnson D (1990) Local optimization and the traveling salesman problem. In: Proceedings of the 17th colloquium on automata languages and programming. Lecture notes in computer science, vol 443. Springer, London, pp 446\u2013461","DOI":"10.1007\/BFb0032050"},{"key":"2_CR40","doi-asserted-by":"crossref","unstructured":"Kilby P, Prosser P, Shaw P (1999) Guided local search for the vehicle routing problem with time windows. In: Voss S, Martello S, Osman IH, Roucairol C (eds) Meta-heuristics: advances and trends in local search paradigms for optimization. Kluwer Academic, Boston, pp 473\u2013486","DOI":"10.1007\/978-1-4615-5775-3_32"},{"key":"2_CR41","doi-asserted-by":"crossref","unstructured":"Knox J (1994) Tabu search performance on the symmetric traveling salesman problem. Comput Oper Res 21(8):867\u2013876","DOI":"10.1016\/0305-0548(94)90016-7"},{"key":"2_CR42","doi-asserted-by":"crossref","unstructured":"Koopman BO (1957) The theory of search, part III, the optimum distribution of search effort. Oper Res 5:613\u2013626","DOI":"10.1287\/opre.5.5.613"},{"key":"2_CR43","doi-asserted-by":"crossref","unstructured":"Kyt\u00f6joki J, Nuortio T, Br\u00e4ysy O, Gendreau M (2007) An efficient variable neighbourhood search heuristic for very large scale vehicle routing problems. Comput Oper Res 34(9): 2743\u20132757","DOI":"10.1016\/j.cor.2005.10.010"},{"key":"2_CR44","doi-asserted-by":"crossref","unstructured":"Langer Y, Bay M, Crama Y, Bair F, Caprace JD, Rigo P (2005) Optimization of surface utilization using heuristic approaches. In: Proceedings of the international conference COMPIT\u201905, Hamburg, pp 419\u2013425","DOI":"10.1179\/str.2005.52.3.007"},{"key":"2_CR45","unstructured":"Lau TL (1999) Guided genetic algorithm. PhD thesis, Department of computer science, University of Essex, Colchester"},{"key":"2_CR46","unstructured":"Lau TL, Tsang EPK (1998) Guided genetic algorithm and its application to the radio link frequency allocation problem. In: Proceedings of NATO symposium on frequency assignment, sharing and conservation in systems (AEROSPACE), Aalborg, AGARD, RTO-MP-13, paper No.14b"},{"key":"2_CR47","unstructured":"Lau TL, Tsang EPK (1998) The guided genetic algorithm and its application to the general assignment problem. In: IEEE 10th international conference on tools with artificial intelligence (ICTAI\u201998), Taiwan, pp 336\u2013343"},{"key":"2_CR48","doi-asserted-by":"crossref","unstructured":"Lin S (1965) Computer solutions of the traveling-salesman problem. Bell Syst Tech J 44: 2245\u20132269","DOI":"10.1002\/j.1538-7305.1965.tb04146.x"},{"key":"2_CR49","doi-asserted-by":"crossref","unstructured":"Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling salesman problem. Oper Res 21:498\u2013516","DOI":"10.1287\/opre.21.2.498"},{"key":"2_CR50","unstructured":"Martin O, Otto SW (1966) Combining simulated annealing with local search heuristics. Ann Operat Res 63(1):57\u201375"},{"key":"2_CR51","doi-asserted-by":"crossref","unstructured":"Mester D, Br\u00e4ysy O (2005) Active guided evolution strategies for large-scale vehicle routing problems with time windows. Comput Oper Res 32(6):1593\u20131614","DOI":"10.1016\/j.cor.2003.11.017"},{"key":"2_CR52","doi-asserted-by":"crossref","unstructured":"Mester DI, Ronin YI, Nevo E, Korol AB (2004) Fast and high precision algorithms for optimization in large-scale genomic problems. Comput Biol Chem 28(4):281\u2013290","DOI":"10.1016\/j.compbiolchem.2004.08.003"},{"key":"2_CR53","doi-asserted-by":"crossref","unstructured":"Mills P, Tsang EPK (2000) Guided local search for solving SAT and weighted MAX-SAT problems. J Autom Reason 24:205\u2013223","DOI":"10.1023\/A:1006343127545"},{"key":"2_CR54","doi-asserted-by":"crossref","unstructured":"Mills P, Tsang E, Ford J (2003) Applying an extended guided local search to the quadratic assignment problem. Ann Ope Res 118:1\u20134\/121\u2013135","DOI":"10.1023\/A:1021857607524"},{"key":"2_CR55","unstructured":"Moghrabi I (2006) Guided local search for query reformulation using weight propagation. Int J Appl Math Comput Sci (AMCS) 16(4):537\u2013549"},{"key":"2_CR56","doi-asserted-by":"crossref","unstructured":"Murphey RA, Pardalos PM, Resende MGC (1999) Frequency assignment problems. In: Du D-Z, Pardalos P (eds) Handbook of combinatorial optimization. vol 4, Kluwer Academic, Boston","DOI":"10.1007\/978-1-4757-3023-4_6"},{"key":"2_CR57","unstructured":"Padron V, Balaguer C (2000) New methodology to solve the RPP by means of isolated edge. In: Tuson A (ed) Cambridge conference tutorial papers. Young OR, vol 11. Operational Research Society, UK"},{"key":"2_CR58","doi-asserted-by":"crossref","unstructured":"Paquete L, Chiarandini M, St\u00fctzle T (2004) Pareto local optimum sets in the biobjective traveling salesman problem: an experimental study. In: Gandibleux X (ed) Metaheuristics for multiobjective optimisation, vol 535. Springer, Berlin\/New York, pp 177\u2013199","DOI":"10.1007\/978-3-642-17144-4_7"},{"key":"2_CR59","doi-asserted-by":"crossref","unstructured":"Peh S, Hong J (2016) GLSDock \u2013 drug design using guided local search. In: Proceedings of the 2016 international conference on computational science and its applications, Beijing, pp 11\u201321","DOI":"10.1007\/978-3-319-42111-7_2"},{"key":"2_CR60","doi-asserted-by":"crossref","unstructured":"Pesant G, Gendreau M (1999) A constraint programming framework for local search methods. J Heuristics 5(3)255\u2013279","DOI":"10.1023\/A:1009694016861"},{"key":"2_CR61","unstructured":"Rahman MK, Nayeem MA, Rahman MS (2015) Transit network design by hybrid guided genetic algorithm with elitism. In: Proceedings of the 2015 conference on advanced systems for public transport (CASPT), Rotterdam"},{"key":"2_CR62","doi-asserted-by":"crossref","unstructured":"Reinelt G (1991) A traveling salesman problem library. ORSA J Comput 3:376\u2013384","DOI":"10.1287\/ijoc.3.4.376"},{"key":"2_CR63","doi-asserted-by":"crossref","unstructured":"Resende MGC, Feo TA (1996) A GRASP for satisfiability. In: Johnson DS, Trick MA (eds) Cliques, coloring, and satisfiability: second DIMACS implementation challenge. DIMACS series on discrete mathematics and theoretical computer science, vol 26. American Mathematical Society, Providence, pp 499\u2013520","DOI":"10.1090\/dimacs\/026\/24"},{"key":"2_CR64","unstructured":"Selman B, Kautz H (1993) Domain-independent extensions to GSAT: solving large structured satisfiability problems. In: Proceeding of 13th international joint conference on AI, Chamb\u00e9ry, pp 290\u2013295"},{"key":"2_CR65","unstructured":"Selman B, Levesque HJ, Mitchell DG (1992) A new method for solving hard satisfiability problems. In: Proceedings of AAAI-92, San Jose, pp 40\u2013446"},{"key":"2_CR66","doi-asserted-by":"crossref","unstructured":"Shaghaghi A, Glover T, Kampouridis M, Tsang E (2013) Guided local search for optimal GPON\/FTTP network design. In: Chaki N et al (eds) Computer networks & communications (NetCom): proceedings of the fourth international conference on networks & communications. Springer, New York, pp 255\u2013263","DOI":"10.1007\/978-1-4614-6154-8_25"},{"key":"2_CR67","doi-asserted-by":"crossref","unstructured":"Shang Y, Wah BW (1998) A discrete Lagrangian-based global-search method for solving satisfiability problems. J Glob Optim 12(1):61\u201399","DOI":"10.1023\/A:1008287028851"},{"key":"2_CR68","doi-asserted-by":"crossref","unstructured":"Simon HU (1989) Approximation algorithms for channel assignment in cellular radio networks. In: Proceedings 7th international symposium on fundamentals of computation theory. Lecture notes in computer science, vol 380. Springer, Berlin\/New York, pp 405\u2013416","DOI":"10.1007\/3-540-51498-8_39"},{"key":"2_CR69","doi-asserted-by":"crossref","unstructured":"Stone LD (1983) The process of search planning: current approaches and continuing problems. Oper Res 31:207\u2013233","DOI":"10.1287\/opre.31.2.207"},{"key":"2_CR70","doi-asserted-by":"crossref","unstructured":"Tairan N, Algarni A, Varghese J, Jan M (2015) Population-based guided local search for multidimensional knapsack problem. In: Proceedings of the 2015 fourth international conference on future generation communication technology (FGCT), Luton, pp 1\u20135","DOI":"10.1109\/FGCT.2015.7300245"},{"key":"2_CR71","unstructured":"Tairan N, Zhang Q (2013) P-GLS-II: an enhanced version of the population-based guided local search. In: Proceedings of the 13th annual conference on genetic and evolutionary computation (GECCO), Dublin, pp 537\u2013544"},{"key":"2_CR72","doi-asserted-by":"crossref","unstructured":"Tamura H, Zhang Z, Tang Z, Ishii M (2006) Objective function adjustment algorithm for combinatorial optimization problems. IEICE Trans Fundam Electron Commun Comput Sci E89-A:9:2441\u20132444","DOI":"10.1093\/ietfec\/e89-a.9.2441"},{"key":"2_CR73","doi-asserted-by":"crossref","unstructured":"Tarantilis CD, Zachariadis EE, Kiranoudis CT (2008) A guided tabu search for the heterogeneous vehicle routeing problem. J Oper Res Soc 59(12):1659\u20131673","DOI":"10.1057\/palgrave.jors.2602504"},{"key":"2_CR74","doi-asserted-by":"crossref","unstructured":"Tarantilis CD, Zachariadis EE, Kiranoudis CT (2008) A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities. INFORMS J Comput 20(1)154\u2013168","DOI":"10.1287\/ijoc.1070.0230"},{"key":"2_CR75","unstructured":"Tikhonov AN, Arsenin VY (1977) Solutions of ill-posed problems. Wiley, New York"},{"key":"2_CR76","unstructured":"Tsang EPK, Voudouris C (1997) Fast local search and guided local search and their application to British Telecom\u2019s workforce scheduling problem. Oper Res Lett 20(3):119\u2013127"},{"key":"2_CR77","unstructured":"Tsang EPK, Wang CJ, Davenport A, Voudouris C, Lau TL (1999) A family of stochastic methods for constraint satisfaction and optimisation. In: Proceedings of the first international conference on the practical application of constraint technologies and logic programming (PACLP), London, pp 359\u2013383"},{"key":"2_CR78","doi-asserted-by":"crossref","unstructured":"Vansteenwegen P, Souffriau W, Berghe G, Oudheusden D (2009) A guided local search metaheuristic for the team orienteering problem. Eur J Oper Res 196(1):118\u2013127","DOI":"10.1016\/j.ejor.2008.02.037"},{"key":"2_CR79","unstructured":"Voudouris C (1997) Guided local search for combinatorial optimisation problems. PhD thesis, Department of computer science, University of Essex, Colchester"},{"key":"2_CR80","unstructured":"Voudouris C, Tsang EPK (1996) Partial constraint satisfaction problems and guided local search. In: Proceedings of PACT\u201996, London, pp 337\u2013356"},{"key":"2_CR81","unstructured":"Voudouris C, Tsang E (1998) Solving the radio link frequency assignment problems using guided local search. In: Proceedings of NATO symposium on frequency assignment, sharing and conservation in systems (AEROSPACE), Aalborg, AGARD, RTO-MP-13, paper No. 14a"},{"key":"2_CR82","doi-asserted-by":"crossref","unstructured":"Voudouris C, Tsang EPK (1999) Guided local search and its application to the travelling salesman problem. Eur J Oper Res 113(2):469\u2013499","DOI":"10.1016\/S0377-2217(98)00099-X"},{"key":"2_CR83","doi-asserted-by":"crossref","unstructured":"Voudouris C, Dorne R, Lesaint D, Liret A (2001) iOpt: a software toolkit for heuristic search methods. In: Walsh T (ed) Practice of constraint programming \u2013 CP 2001, Paphos. Lecture notes in computer science, vol 2239, pp 716\u2013729","DOI":"10.1007\/3-540-45578-7_58"},{"key":"2_CR84","unstructured":"Xiaohu T, Haubrich H-J (2005) A hybrid metaheuristic method for the planning of medium-voltage distribution networks. In: Proceedings of 15th power systems computation conference (PSCC 2005), Liege"},{"key":"2_CR85","doi-asserted-by":"crossref","unstructured":"Zachariadis E, Tarantilis C, Kiranoudis C (2009) A guided tabu search for the vehicle routing problem with two-dimensional loading constraints. Eur J Oper Res 195(3):729\u2013743","DOI":"10.1016\/j.ejor.2007.05.058"},{"key":"2_CR86","doi-asserted-by":"crossref","unstructured":"Zachariadis E, Tarantilis C, Kiranoudis C (2009) A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service. Expert Syst Appl 36(2):1070\u20131081","DOI":"10.1016\/j.eswa.2007.11.005"},{"key":"2_CR87","doi-asserted-by":"crossref","unstructured":"Zhang Q, Hui L (2007) MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11:712\u2013731","DOI":"10.1109\/TEVC.2007.892759"},{"key":"2_CR88","unstructured":"Zhang Q, Sun J, Tsang EPK, Ford J (2003) Combination of guided local search and estimation of distribution algorithm for solving quadratic assignment problem. In: Bird of a feather workshops, genetic and evolutionary computation conference, Chicago"},{"issue":"2","key":"2_CR89","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.tre.2003.12.003","volume":"41","author":"Y Zhong","year":"2005","unstructured":"Zhong Y, Cole MH (2005) A vehicle routing problem with backhauls and time windows: a guided local search solution. Transp Res E Logist Transp Rev 41(2):131\u2013144","journal-title":"Transp Res E Logist Transp Rev"}],"container-title":["Handbook of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07124-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T09:48:39Z","timestamp":1751795319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07124-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319071237","9783319071244"],"references-count":89,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07124-4_2","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}