{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T21:41:36Z","timestamp":1781386896506,"version":"3.54.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030578015","type":"print"},{"value":"9783030578022","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,8,29]],"date-time":"2020-08-29T00:00:00Z","timestamp":1598659200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,29]],"date-time":"2020-08-29T00:00:00Z","timestamp":1598659200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-57802-2_51","type":"book-chapter","created":{"date-parts":[[2020,8,28]],"date-time":"2020-08-28T07:05:27Z","timestamp":1598598327000},"page":"530-539","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Hybrid Genetic Algorithms and Tour Construction and Improvement Algorithms Used for Optimizing the Traveling Salesman Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9865-8529","authenticated-orcid":false,"given":"Vladimir","family":"Ilin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7392-9767","authenticated-orcid":false,"given":"Dragan","family":"Simi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0692-2124","authenticated-orcid":false,"given":"Svetislav D.","family":"Simi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Svetlana","family":"Simi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,8,29]]},"reference":[{"issue":"4","key":"51_CR1","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1016\/j.neucom.2008.01.023","volume":"72","author":"JC Creput","year":"2009","unstructured":"Creput, J.C., Koukam, A.: A memetic neural network for the Euclidean traveling salesman problem. Neurocomputing 72(4), 1250\u20131264 (2009)","journal-title":"Neurocomputing"},{"key":"51_CR2","first-page":"162","volume":"85","author":"L Davis","year":"1985","unstructured":"Davis, L.: Applying adaptive algorithms to epistatic domains. IJCAI 85, 162\u2013164 (1985)","journal-title":"IJCAI"},{"issue":"6","key":"51_CR3","first-page":"745","volume":"6","author":"M Diaby","year":"2007","unstructured":"Diaby, M.: The traveling salesman problem: a linear programming formulation. WSEAS Trans. Math. 6(6), 745\u2013754 (2007)","journal-title":"WSEAS Trans. Math."},{"issue":"5","key":"51_CR4","doi-asserted-by":"publisher","first-page":"5006","DOI":"10.1016\/j.eswa.2011.10.012","volume":"39","author":"GF Dong","year":"2012","unstructured":"Dong, G.F., Guo, W.W., Tickle, K.: Solving the traveling salesman problem using cooperative genetic ant systems. Expert Syst. Appl. 39(5), 5006\u20135011 (2012)","journal-title":"Expert Syst. Appl."},{"key":"51_CR5","first-page":"167","volume":"41","author":"G Finke","year":"1984","unstructured":"Finke, G., Claus, A., Gunn, E.: A two-commodity network flow approach to the traveling salesman problem. Congressus Numerantium 41, 167\u2013178 (1984)","journal-title":"Congressus Numerantium"},{"key":"51_CR6","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/net.3230070303","volume":"7","author":"B Golden","year":"1977","unstructured":"Golden, B.: A statistical approach to the TSP. Networks 7, 209\u2013225 (1977)","journal-title":"Networks"},{"issue":"1","key":"51_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.3906\/elk-1210-147","volume":"23","author":"M Gunduz","year":"2015","unstructured":"Gunduz, M., Kiran, M.S., Ozceylan, E.: A hierarchic approach based on swarm intelligence to solve traveling salesman problem. Turk. J. Electr. Eng. Comput. Sci. 23(1), 103\u2013117 (2015)","journal-title":"Turk. J. Electr. Eng. Comput. Sci."},{"issue":"2","key":"51_CR8","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10732-019-09431-y","volume":"26","author":"QM Ha","year":"2019","unstructured":"Ha, Q.M., Deville, Y., Pham, Q.D., H\u00e0, M.H.: A hybrid genetic algorithm for the traveling salesman problem with drone. J. Heuristics 26(2), 219\u2013247 (2019). \nhttps:\/\/doi.org\/10.1007\/s10732-019-09431-y","journal-title":"J. Heuristics"},{"key":"51_CR9","volume-title":"Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence","author":"JH Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. University of Michigan Press, Oxford (1975)"},{"key":"51_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2017\/7430125","volume":"2017","author":"A Hussain","year":"2017","unstructured":"Hussain, A., Muhammad, Y.S., Sajid, M.N., Hussain, I., Shoukry, M.A., Gani, S.: Genetic algorithm for traveling salesman problem with modified cycle crossover operator. Comput. Intell. Neurosci. 2017, 1\u20137 (2017)","journal-title":"Comput. Intell. Neurosci."},{"key":"51_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1007\/978-3-319-19644-2_53","volume-title":"Hybrid Artificial Intelligent Systems","author":"V Ilin","year":"2015","unstructured":"Ilin, V., Simi\u0107, D., Tepi\u0107, J., Stoji\u0107, G., Sauli\u0107, N.: A survey of hybrid artificial intelligence algorithms for dynamic vehicle routing problem. In: Onieva, E., Santos, I., Osaba, E., Quinti\u00e1n, H., Corchado, E. (eds.) HAIS 2015. LNCS (LNAI), vol. 9121, pp. 644\u2013655. Springer, Cham (2015)"},{"issue":"2","key":"51_CR12","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling salesman problem. Opns. Res. 21(2), 498\u2013516 (1973)","journal-title":"Opns. Res."},{"key":"51_CR13","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, 2245\u20132269 (1965)","journal-title":"Bell Syst. Tech. J."},{"issue":"1","key":"51_CR14","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01609016","volume":"15","author":"P Miliotis","year":"1978","unstructured":"Miliotis, P.: Using cutting planes to solve the symmetric travelling salesman problem. Math. Program. 15(1), 177\u2013188 (1978)","journal-title":"Math. Program."},{"key":"51_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00500-020-04712-2","volume":"2","author":"P Victer Paul","year":"2020","unstructured":"Victer Paul, P., Ganeshkumar, C., Dhavachelvan, P., Baskaran, R.: A novel ODV crossover operator-based genetic algorithms for traveling salesman problem. Soft. Comput. 2, 1\u201331 (2020). \nhttps:\/\/doi.org\/10.1007\/s00500-020-04712-2","journal-title":"Soft. Comput."},{"issue":"3","key":"51_CR16","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF02125403","volume":"63","author":"J-Y Potvin","year":"1996","unstructured":"Potvin, J.-Y.: Genetic algorithms for the traveling salesman problem. Ann. Oper. Res. 63(3), 339\u2013370 (1996)","journal-title":"Ann. Oper. Res."},{"key":"51_CR17","unstructured":"Reinelt, G.: TSPLIB. \nhttp:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/\n\n. Accessed 13 Feb 2020"},{"key":"51_CR18","doi-asserted-by":"crossref","unstructured":"Rosenkrantz, D., Stearns, R., Lewis, P.: Approximate algorithms for the traveling salesperson problem. In: Proceedings of the 15th Annual IEEE Symposium of Switching and Automata Theory, pp. 33\u201342. IEEE (1974)","DOI":"10.1109\/SWAT.1974.4"},{"issue":"1","key":"51_CR19","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.ejor.2018.06.003","volume":"272","author":"Y Salii","year":"2019","unstructured":"Salii, Y.: Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization. Eur. J. Oper. Res. 272(1), 32\u201342 (2019)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"51_CR20","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1093\/jigpal\/jzv011","volume":"23","author":"D Simi\u0107","year":"2015","unstructured":"Simi\u0107, D., Kova\u010devi\u0107, I., Svir\u010devi\u0107, V., Simi\u0107, S.: Hybrid firefly model in routing heterogeneous fleet of vehicles in logistics distribution. Log. J. IGPL 23(3), 521\u2013532 (2015)","journal-title":"Log. J. IGPL"},{"key":"51_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-642-38682-4_42","volume-title":"Advances in Computational Intelligence","author":"D Simi\u0107","year":"2013","unstructured":"Simi\u0107, D., Simi\u0107, S.: Evolutionary approach in inventory routing problem. In: Rojas, I., Joya, G., Cabestany, J. (eds.) IWANN 2013. LNCS, vol. 7903, pp. 395\u2013403. Springer, Heidelberg (2013)"},{"key":"51_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-28942-2_19","volume-title":"Hybrid Artificial Intelligent Systems","author":"D Simi\u0107","year":"2012","unstructured":"Simi\u0107, D., Simi\u0107, S.: Hybrid artificial intelligence approaches on vehicle routing problem in logistics distribution. In: Corchado, E., Sn\u00e1\u0161el, V., Abraham, A., Wo\u017aniak, M., Gra\u00f1a, M., Cho, S.-B. (eds.) HAIS 2012. LNCS (LNAI), vol. 7208, pp. 208\u2013220. Springer, Heidelberg (2012)"},{"key":"51_CR23","first-page":"7197","volume":"24","author":"X Xu","year":"2020","unstructured":"Xu, X., Yuan, H., Matthew, P., Ray, J., Bagdasar, O., Trovati, M.: GORTS: genetic algorithm based on one-by-one revision of two sides for dynamic travelling salesman problems Soft. Comput. 24, 7197\u20137210 (2020)","journal-title":"Comput."},{"key":"51_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2016\/1712630","volume":"2016","author":"SH Zhan","year":"2016","unstructured":"Zhan, S.H., Lin, J., Zhang, Z.J., Zhong, Y.W.: List-based simulated annealing algorithm for traveling salesman problem. Comput. Intell. Neurosci. 2016, 1\u201312 (2016)","journal-title":"Comput. Intell. Neurosci."}],"container-title":["Advances in Intelligent Systems and Computing","15th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2020)"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57802-2_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,28]],"date-time":"2020-08-28T07:19:57Z","timestamp":1598599197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-57802-2_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,29]]},"ISBN":["9783030578015","9783030578022"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57802-2_51","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"value":"2194-5357","type":"print"},{"value":"2194-5365","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,29]]},"assertion":[{"value":"29 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Soft Computing Models in Industrial and Environmental Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Burgos","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"socomoin2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2020.sococonference.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}