{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T15:54:12Z","timestamp":1775318052515,"version":"3.50.1"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030059828","type":"print"},{"value":"9783030059835","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,12,18]],"date-time":"2018-12-18T00:00:00Z","timestamp":1545091200000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-05983-5_5","type":"book-chapter","created":{"date-parts":[[2018,12,17]],"date-time":"2018-12-17T07:27:46Z","timestamp":1545031666000},"page":"63-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Fixed Set Search Applied to the Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Raka","family":"Jovanovic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milan","family":"Tuba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,18]]},"reference":[{"issue":"4","key":"5_CR1","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s11047-007-9049-5","volume":"6","author":"A Banks","year":"2007","unstructured":"Banks, A., Vincent, J., Anyakoha, C.: A review of particle swarm optimization. Part I: background and development. Nat. Comput. 6(4), 467\u2013484 (2007)","journal-title":"Nat. Comput."},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s11047-007-9050-z","volume":"7","author":"A Banks","year":"2008","unstructured":"Banks, A., Vincent, J., Anyakoha, C.: A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications. Nat. Comput. 7(1), 109\u2013124 (2008)","journal-title":"Nat. Comput."},{"issue":"4","key":"5_CR3","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","volume":"4","author":"JJ Bentley","year":"1992","unstructured":"Bentley, J.J.: Fast algorithms for geometric traveling salesman problems. ORSA J. Comput. 4(4), 387\u2013411 (1992)","journal-title":"ORSA J. Comput."},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.cor.2015.10.014","volume":"68","author":"C Blum","year":"2016","unstructured":"Blum, C., Pinacho, P., L\u00f3pez-Ib\u00e1\u00f1ez, M., Lozano, J.A.: Construct, merge, solve & adapt a new general algorithm for combinatorial optimization. Comput. Oper. Res. 68, 75\u201388 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"5_CR5","doi-asserted-by":"publisher","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","volume":"11","author":"C Blum","year":"2011","unstructured":"Blum, C., Puchinger, J., Raidl, G.R., Roli, A.: Hybrid metaheuristics in combinatorial optimization: a survey. Appl. Soft Comput. 11(6), 4135\u20134151 (2011)","journal-title":"Appl. Soft Comput."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4419-1306-7_1","volume-title":"Matheuristics: Hybridizing Metaheuristics and Mathematical Programming","author":"M Caserta","year":"2010","unstructured":"Caserta, M., Vo\u00df, S.: Metaheuristics: intelligent problem solving. In: Maniezzo, V., St\u00fctzle, T., Vo\u00df, S. (eds.) Matheuristics: Hybridizing Metaheuristics and Mathematical Programming, vol. 10, pp. 1\u201338. Springer, Boston (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1306-7_1"},{"key":"5_CR7","unstructured":"Concorde: Concorde TSP solver (2015). http:\/\/www.math.uwaterloo.ca\/tsp\/concorde\/index.html"},{"issue":"6","key":"5_CR8","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791\u2013812 (1958)","journal-title":"Oper. Res."},{"issue":"1","key":"5_CR9","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10479-005-5724-z","volume":"134","author":"PT De Boer","year":"2005","unstructured":"De Boer, P.T., Kroese, D.P., Mannor, S., Rubinstein, R.Y.: A tutorial on the cross-entropy method. Ann. Oper. Res. 134(1), 19\u201367 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"2\u20133","key":"5_CR10","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M Dorigo","year":"2005","unstructured":"Dorigo, M., Blum, C.: Ant colony optimization theory: a survey. Theor. Comput. Sci. 344(2\u20133), 243\u2013278 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"5_CR11","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/s00453-013-9801-4","volume":"68","author":"M Englert","year":"2014","unstructured":"Englert, M., R\u00f6glin, H., V\u00f6cking, B.: Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP. Algorithmica 68(1), 190\u2013264 (2014)","journal-title":"Algorithmica"},{"issue":"2","key":"5_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.: Greedy randomized adaptive search procedures. J. Global Optim. 6(2), 109\u2013133 (1995)","journal-title":"J. Global Optim."},{"key":"5_CR13","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-30671-6_5","volume-title":"Hybrid Metaheuristics","author":"P Festa","year":"2013","unstructured":"Festa, P., Resende, M.G.C.: Hybridizations of GRASP with path-relinking. In: Talbi, E.G. (ed.) Hybrid Metaheuristics. Studies in Computational Intelligence, vol. 434, pp. 135\u2013155. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-30671-6_5"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-319-02141-6_3","volume-title":"Cuckoo Search and Firefly Algorithm: Theory and Applications","author":"I Fister","year":"2014","unstructured":"Fister, I., Yang, X.S., Fister, D., Fister, I.: Cuckoo search: a brief literature review. In: Yang, X.S. (ed.) Cuckoo Search and Firefly Algorithm: Theory and Applications, vol. 516, pp. 49\u201362. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-02141-6_3"},{"issue":"3","key":"5_CR15","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search-part I. ORSA J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"5_CR16","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover, F.: Tabu search-part II. ORSA J. Comput. 2(1), 4\u201332 (1990)","journal-title":"ORSA J. Comput."},{"issue":"3","key":"5_CR17","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., Mladenovi\u0107, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0167-6377(87)90021-6","volume":"6","author":"J Hart","year":"1987","unstructured":"Hart, J., Shogan, A.: Semi-greedy heuristics: an empirical study. Oper. Res. Lett. 6, 107\u2013114 (1987)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"5_CR19","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s10878-015-9945-z","volume":"35","author":"R Jovanovic","year":"2018","unstructured":"Jovanovic, R., Bousselham, A., Vo\u00df, S.: Partitioning of supply\/demand graphs with capacity limitations: an ant colony approach. J. Comb. Optim. 35(1), 224\u2013249 (2018)","journal-title":"J. Comb. Optim."},{"issue":"8","key":"5_CR20","doi-asserted-by":"publisher","first-page":"5360","DOI":"10.1016\/j.asoc.2011.05.023","volume":"11","author":"R Jovanovic","year":"2011","unstructured":"Jovanovic, R., Tuba, M.: An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem. Appl. Soft Comput. 11(8), 5360\u20135366 (2011)","journal-title":"Appl. Soft Comput."},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.asoc.2016.01.013","volume":"41","author":"R Jovanovic","year":"2016","unstructured":"Jovanovic, R., Tuba, M., Vo\u00df, S.: An ant colony optimization algorithm for partitioning graphs with supply and demand. Appl. Soft Comp. 41, 317\u2013330 (2016)","journal-title":"Appl. Soft Comp."},{"issue":"1","key":"5_CR22","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10462-012-9328-0","volume":"42","author":"D Karaboga","year":"2014","unstructured":"Karaboga, D., Gorkemli, B., Ozturk, C., Karaboga, N.: A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif. Intell. Rev. 42(1), 21\u201357 (2014)","journal-title":"Artif. Intell. Rev."},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-94-015-7744-1_2","volume-title":"Simulated Annealing: Theory and Applications","author":"PJM van Laarhoven","year":"1987","unstructured":"van Laarhoven, P.J.M., Aarts, E.H.L.: Simulated annealing. In: van Laarhoven, P.J.M., Aarts, E.H.L., et al. (eds.) Simulated Annealing: Theory and Applications, vol. 37, pp. 7\u201315. Springer, Dordrecht (1987). https:\/\/doi.org\/10.1007\/978-94-015-7744-1_2"},{"issue":"10","key":"5_CR24","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44(10), 2245\u20132269 (1965)","journal-title":"Bell Syst. Tech. J."},{"issue":"20","key":"5_CR25","doi-asserted-by":"publisher","first-page":"4684","DOI":"10.1016\/j.ins.2010.06.032","volume":"181","author":"Y Marinakis","year":"2011","unstructured":"Marinakis, Y., Marinaki, M., Dounias, G.: Honey bees mating optimization algorithm for the Euclidean traveling salesman problem. Inf. Sci. 181(20), 4684\u20134698 (2011)","journal-title":"Inf. Sci."},{"issue":"3","key":"5_CR26","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, P.M.: Expanding neighborhood GRASP for the traveling salesman problem. Comput. Optim. Appl. 32(3), 231\u2013257 (2005)","journal-title":"Comput. Optim. Appl."},{"key":"5_CR27","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An Introduction to Genetic Algorithms","author":"M Mitchell","year":"1998","unstructured":"Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, Cambridge (1998)"},{"issue":"1\u20132","key":"5_CR28","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10462-009-9137-2","volume":"33","author":"F Neri","year":"2010","unstructured":"Neri, F., Tirronen, V.: Recent advances in differential evolution: a survey and experimental analysis. Artif. Intell. Rev. 33(1\u20132), 61\u2013106 (2010)","journal-title":"Artif. Intell. Rev."},{"issue":"4","key":"5_CR29","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB\u2014a traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"5_CR30","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-1-4615-5775-3_21","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"L Sondergeld","year":"1999","unstructured":"Sondergeld, L., Vo\u00df, S.: Cooperative intelligent search using adaptive memory techniques. In: Vo\u00df, S., Martello, S., Osman, I., Roucairol, C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 297\u2013312. Springer, Boston (1999). https:\/\/doi.org\/10.1007\/978-1-4615-5775-3_21"},{"issue":"1","key":"5_CR31","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1111\/itor.12001","volume":"22","author":"K S\u00f6rensen","year":"2015","unstructured":"S\u00f6rensen, K.: Metaheuristics - the metaphor exposed. Int. Trans. Oper. Res. 22(1), 3\u201318 (2015). https:\/\/doi.org\/10.1111\/itor.12001","journal-title":"Int. Trans. Oper. Res."},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"St\u00fctzle, T., Hoos, H.: Max-min ant system and local search for the traveling salesman problem, pp. 309\u2013314. IEEE (1997)","DOI":"10.1109\/ICEC.1997.592327"},{"key":"5_CR33","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-1-4615-1507-4_27","volume-title":"Essays and Surveys in Metaheuristics","author":"E Taillard","year":"2002","unstructured":"Taillard, E., Vo\u00df, S.: POPMUSIC - a partial optimization metaheuristic under special intensification conditions. In: Ribeiro, C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics. Operations Research\/Computer Science Interfaces Series, vol. 15, pp. 613\u2013629. Kluwer, Boston (2002). https:\/\/doi.org\/10.1007\/978-1-4615-1507-4_27"},{"issue":"1","key":"5_CR34","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ins.2003.11.008","volume":"166","author":"CF Tsai","year":"2004","unstructured":"Tsai, C.F., Tsai, C.W., Tseng, C.C.: A new hybrid heuristic approach for solving large traveling salesman problem. Inf. Sci. 166(1), 67\u201381 (2004)","journal-title":"Inf. Sci."},{"key":"5_CR35","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1090\/dimacs\/040\/20","volume-title":"Network Design: Connectivity and Facilities Location","author":"S Vo\u00df","year":"1998","unstructured":"Vo\u00df, S., Gutenschwager, K.: A chunking based genetic algorithm for the Steiner tree problem in graphs. In: Pardalos, P., Du, D.Z. (eds.) Network Design: Connectivity and Facilities Location. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 40, pp. 335\u2013355. AMS, Princeton (1998)"},{"key":"5_CR36","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1016\/S0377-2217(97)00293-2","volume":"106","author":"D Woodruff","year":"1998","unstructured":"Woodruff, D.: Proposals for chunking and tabu search. Eur. J. Oper. Res. 106, 585\u2013598 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"Zhu, M., Chen, J.: Computational comparison of GRASP and DCTSP methods for the Traveling Salesman Problem, pp. 1044\u20131048 (2017)","DOI":"10.1109\/ICIVC.2017.7984713"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05983-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T14:57:19Z","timestamp":1775314639000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-05983-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,18]]},"ISBN":["9783030059828","9783030059835"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05983-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,18]]},"assertion":[{"value":"18 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Hybrid Metaheuristics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Concepci\u00f3n","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 January 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"hm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/hm2019.ing.udec.cl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}