{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T06:04:23Z","timestamp":1779516263402,"version":"3.53.1"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819509812","type":"print"},{"value":"9789819509829","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-0982-9_25","type":"book-chapter","created":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T22:22:31Z","timestamp":1759270951000},"page":"306-320","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Hybrid Ant Colony Optimization for Vehicle Routing Problem with Time Windows"],"prefix":"10.1007","author":[{"given":"Ben","family":"Niu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinru","family":"He","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yiming","family":"Pan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mijat","family":"Kustudic","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xusheng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,10,1]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1016\/j.artint.2009.07.003","volume":"173","author":"R Marinescu","year":"2009","unstructured":"Marinescu, R., Dechter, R.: AND\/OR branch-and-bound search for combinatorial optimization in graphical models. Artif. Intell. 173, 1457\u20131491 (2009)","journal-title":"Artif. Intell."},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.tcs.2020.08.009","volume":"844","author":"M Mankowski","year":"2020","unstructured":"Mankowski, M., Moshkov, M.: Extensions of dynamic programming for multi-stage combinatorial optimization. Theoret. Comput. Sci. 844, 106\u2013132 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100675","volume":"55","author":"Y Wang","year":"2020","unstructured":"Wang, Y., et al.: An improved ant colony optimization algorithm to the periodic vehicle routing problem with time window and service choice. Swarm Evol. Comput. 55, 100675 (2020)","journal-title":"Swarm Evol. Comput."},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.ins.2019.03.070","volume":"490","author":"H Zhang","year":"2019","unstructured":"Zhang, H., et al.: A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows. Inf. Sci. 490, 166\u2013190 (2019)","journal-title":"Inf. Sci."},{"key":"25_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101425","volume":"84","author":"Q Wu","year":"2024","unstructured":"Wu, Q., et al.: A neighborhood comprehensive learning particle swarm optimization for the vehicle routing problem with time windows. Swarm Evol. Comput. 84, 101425 (2024)","journal-title":"Swarm Evol. Comput."},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.ins.2018.12.086","volume":"481","author":"Y Marinakis","year":"2019","unstructured":"Marinakis, Y., Marinaki, M., Migdalas, A.: A multi-adaptive particle swarm optimization for the vehicle routing problem with time windows. Inf. Sci. 481, 311\u2013329 (2019)","journal-title":"Inf. Sci."},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"114408","DOI":"10.1016\/j.eswa.2020.114408","volume":"168","author":"T Khoo","year":"2021","unstructured":"Khoo, T., Mohammad, B.: The parallelization of a two-phase distributed hybrid ruin-and-recreate genetic algorithm for solving multi-objective vehicle routing problem with time windows. Expert Syst. Appl. 168, 114408 (2021)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"25_CR8","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.eswa.2010.06.082","volume":"38","author":"B Yu","year":"2011","unstructured":"Yu, B., Yang, Z.Z., Yao, B.Z.: A hybrid algorithm for vehicle routing problem with time windows. Expert Syst. Appl. 38(1), 435\u2013441 (2011)","journal-title":"Expert Syst. Appl."},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.cor.2014.11.007","volume":"56","author":"ME McNabb","year":"2015","unstructured":"McNabb, M.E., et al.: Testing local search move operators on the vehicle routing problem with split deliveries and time windows. Comput. Oper. Res. 56, 93\u2013109 (2015)","journal-title":"Comput. Oper. Res."},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Ratanavilisagul, C.: A novel modified ant colony optimization algorithm by resetting and updating pheromone for vehicle routing problem with time windows. In: 2021 7th International Conference on Computer and Communications, ICCC, China, Chengdu, pp. 1194\u20131198 (2021)","DOI":"10.1109\/ICCC54389.2021.9674689"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Lijun, W., et al.: A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints. 243(3), 798\u2013814 (2015)","DOI":"10.1016\/j.ejor.2014.12.048"},{"key":"25_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2024.112593","volume":"169","author":"J Liu","year":"2025","unstructured":"Liu, J., Tong, L., Xia, X.: A genetic algorithm for vehicle routing problems with time windows based on cluster of geographic positions and time windows. Appl. Soft Comput. 169, 112593 (2025)","journal-title":"Appl. Soft Comput."},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Hai, S.: A study of welding robot path planning application based on genetic ant colony hybrid algorithm. In: IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference 2016, IMCEC, China, Xi\u2019an, pp. 1743\u20131746 (2016)","DOI":"10.1109\/IMCEC.2016.7867517"},{"issue":"1","key":"25_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.22.1.1","volume":"22","author":"M Solomon","year":"1988","unstructured":"Solomon, M., Jacques, D.: Time window constrained routing and scheduling problems. Transp. Sci. 22(1), 1\u201313 (1988)","journal-title":"Transp. Sci."},{"issue":"4","key":"25_CR15","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1109\/TEVC.2022.3197298","volume":"27","author":"W Yi","year":"2023","unstructured":"Yi, W., et al.: Automated design of metaheuristics using reinforcement learning within a novel general search framework. IEEE Trans. Evol. Comput. 27(4), 1072\u20131084 (2023)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"110203","DOI":"10.1016\/j.asoc.2023.110203","volume":"139","author":"W Hong","year":"2023","unstructured":"Hong, W., Gao, Y.: An ant colony optimization based on local search for the vehicle routing problem with simultaneous pickup\u2013delivery and time window. Appl. Soft Comput. 139, 110203 (2023)","journal-title":"Appl. Soft Comput."},{"key":"25_CR17","unstructured":"Colorni, A., Dorigo, M., Maniezzo, V.: Distributed optimization by ant colonies. Proceedings of ECAL91 - European Conference on Artificial Life, ECAL, France, Paris, pp.134\u2013142 (1991)"},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1018940026670","volume":"89","author":"B Bullnheimer","year":"1999","unstructured":"Bullnheimer, B., Hartl, R.F., Strauss, C.: An improved ant system algorithm for the vehicle routing problem. Ann. Oper. Res. 89, 319\u2013328 (1999)","journal-title":"Ann. Oper. Res."},{"key":"25_CR19","unstructured":"Solomon Benchmark Problems (2008). https:\/\/www.sintef.no\/projectweb\/top\/vrptw\/solomon-benchmark\/100-customers\/"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Oonsrikaw, Y., Thammano, A.: Enhanced ant colony optimization with local search. In: 2018 IEEE\/ACIS 17th International Conference on Computer and Information Science, ICIS, Singapore, pp. 291\u2013296 (2018)","DOI":"10.1109\/ICIS.2018.8466388"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-0982-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T05:05:21Z","timestamp":1779512721000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-0982-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,1]]},"ISBN":["9789819509812","9789819509829"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-0982-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,1]]},"assertion":[{"value":"1 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yokohama","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iasei.org\/icsi2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}