{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T01:43:32Z","timestamp":1772502212185,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T00:00:00Z","timestamp":1759190400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T00:00:00Z","timestamp":1759190400000},"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":["Evol. Intel."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s12065-025-01092-0","type":"journal-article","created":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T03:13:58Z","timestamp":1759202038000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Adaptive ant colony optimization for solving dynamic vehicle and drone routing with time window constraints"],"prefix":"10.1007","volume":"18","author":[{"given":"Phan Duc","family":"Hung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nguyen Thi","family":"Tam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huynh Thi","family":"Thanh Binh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,30]]},"reference":[{"issue":"1","key":"1092_CR1","first-page":"107","volume":"18","author":"D Markovi\u0107","year":"2020","unstructured":"Markovi\u0107 D, Petrov\u0107 G, \u0106ojba\u0161i\u0107 \u017d, Stankovi\u0107 A (2020) The vehicle routing problem with stochastic demands in an urban area-a case study. Facta Univ Ser Mech Eng 18(1):107\u2013120","journal-title":"Facta Univ Ser Mech Eng"},{"key":"1092_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107378","volume":"230","author":"Y Niu","year":"2021","unstructured":"Niu Y, Kong D, Wen R, Cao Z, Xiao J (2021) An improved learnable evolution model for solving multi-objective vehicle routing problem with stochastic demand. Knowl-Based Syst 230:107378","journal-title":"Knowl-Based Syst"},{"key":"1092_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100767","volume":"60","author":"Y Niu","year":"2021","unstructured":"Niu Y, Zhang Y, Cao Z, Gao K, Xiao J, Song W, Zhang F (2021) Mimoa: a membrane-inspired multi-objective algorithm for green vehicle routing problem with stochastic demands. Swarm Evol Comput 60:100767","journal-title":"Swarm Evol Comput"},{"issue":"2","key":"1092_CR4","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1016\/j.ejor.2022.07.015","volume":"306","author":"J Zhang","year":"2023","unstructured":"Zhang J, Luo K, Florio AM, Van Woensel T (2023) Solving large-scale dynamic vehicle routing problems with stochastic requests. Eur J Oper Res 306(2):596\u2013614","journal-title":"Eur J Oper Res"},{"key":"1092_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2023.104030","volume":"148","author":"W Ma","year":"2023","unstructured":"Ma W, Zeng L, An K (2023) Dynamic vehicle routing problem for flexible buses considering stochastic requests. Transp Res Part C Emerg Technol 148:104030","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"3","key":"1092_CR6","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1016\/j.ejor.2020.11.007","volume":"292","author":"M Saint-Guillain","year":"2021","unstructured":"Saint-Guillain M, Paquay C, Limbourg S (2021) Time-dependent stochastic vehicle routing problem with random requests: Application to online police patrol management in brussels. Eur J Oper Res 292(3):869\u2013885","journal-title":"Eur J Oper Res"},{"key":"1092_CR7","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s12351-019-00452-w","volume":"21","author":"M Rajabi-Bahaabadi","year":"2021","unstructured":"Rajabi-Bahaabadi M, Shariat-Mohaymany A, Babaei M, Vigo D (2021) Reliable vehicle routing problem in stochastic networks with correlated travel times. Oper Res Int J 21:299\u2013330","journal-title":"Oper Res Int J"},{"key":"1092_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2024.103100","volume":"127","author":"L Ricard","year":"2024","unstructured":"Ricard L, Desaulniers G, Lodi A, Rousseau L-M (2024) Increasing schedule reliability in the multiple depot vehicle scheduling problem with stochastic travel time. Omega 127:103100","journal-title":"Omega"},{"issue":"1","key":"1092_CR9","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s12065-021-00648-0","volume":"16","author":"E Messaoud","year":"2023","unstructured":"Messaoud E (2023) A chance constrained programming model and an improved large neighborhood search algorithm for the electric vehicle routing problem with stochastic travel times. Evol Intel 16(1):153\u2013168","journal-title":"Evol Intel"},{"issue":"1","key":"1092_CR10","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manage Sci 6(1):80\u201391","journal-title":"Manage Sci"},{"key":"1092_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107604","volume":"160","author":"BHO Rios","year":"2021","unstructured":"Rios BHO, Xavier EC, Miyazawa FK, Amorim P, Curcio E, Santos MJ (2021) Recent dynamic vehicle routing problems: a survey. Comput Ind Eng 160:107604","journal-title":"Comput Ind Eng"},{"issue":"3","key":"1092_CR12","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/j.ejor.2021.07.014","volume":"298","author":"N Soeffker","year":"2022","unstructured":"Soeffker N, Ulmer MW, Mattfeld DC (2022) Stochastic dynamic vehicle routing in the light of prescriptive analytics: A review. Eur J Oper Res 298(3):801\u2013820","journal-title":"Eur J Oper Res"},{"key":"1092_CR13","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.trc.2015.03.005","volume":"54","author":"CC Murray","year":"2015","unstructured":"Murray CC, Chu AG, Optimization of drone-assisted parcel delivery (2015) The flying sidekick traveling salesman problem. Transp Res Part C Emerg Technol 54:86\u2013109","journal-title":"Transp Res Part C Emerg Technol"},{"key":"1092_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2023.104407","volume":"157","author":"J Gao","year":"2023","unstructured":"Gao J, Zhen L, Wang S (2023) Multi-trucks-and-drones cooperative pickup and delivery problem. Transp Res Part C Emerg Technol 157:104407","journal-title":"Transp Res Part C Emerg Technol"},{"key":"1092_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2023.104139","volume":"151","author":"G Ruixue","year":"2023","unstructured":"Ruixue G, Liu Y, Poon M (2023) Dynamic truck-drone routing problem for scheduled deliveries and on-demand pickups with time-related constraints. Transp Res Part C Emerg Technol 151:104139","journal-title":"Transp Res Part C Emerg Technol"},{"key":"1092_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.122483","volume":"241","author":"P Stodola","year":"2024","unstructured":"Stodola P, Kut\u011bj L (2024) Multi-depot vehicle routing problem with drones: Mathematical formulation, solution algorithm and experiments. Expert Syst Appl 241:122483","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1092_CR17","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.ejor.2023.06.021","volume":"312","author":"J Jiang","year":"2024","unstructured":"Jiang J, Dai Y, Yang F, Ma Z (2024) A multi-visit flexible-docking vehicle routing problem with drones for simultaneous pickup and delivery services. Eur J Oper Res 312(1):125\u2013137","journal-title":"Eur J Oper Res"},{"key":"1092_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2022.102990","volume":"169","author":"S Meng","year":"2023","unstructured":"Meng S, Guo X, Li D, Liu G (2023) The multi-visit drone routing problem for pickup and delivery services. Transp Res Part E Logist Transp Rev 169:102990","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"1092_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2024.104698","volume":"165","author":"J Xing","year":"2024","unstructured":"Xing J, Guo T, Tong LC (2024) Reliable truck-drone routing with dynamic synchronization: a high-dimensional network programming approach. Transp Res Part C Emerg Technol 165:104698","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"3","key":"1092_CR20","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1016\/j.ejor.2023.06.037","volume":"312","author":"G Lera-Romero","year":"2024","unstructured":"Lera-Romero G, Bront JJM, Soulignac FJ (2024) A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows. Eur J Oper Res 312(3):978\u2013995","journal-title":"Eur J Oper Res"},{"key":"1092_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109093","volume":"177","author":"H Luo","year":"2023","unstructured":"Luo H, Dridi M, Grunder O (2023) A branch-price-and-cut algorithm for a time-dependent green vehicle routing problem with the consideration of traffic congestion. Comput Ind Eng 177:109093","journal-title":"Comput Ind Eng"},{"key":"1092_CR22","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.trb.2023.03.003","volume":"171","author":"Y Xia","year":"2023","unstructured":"Xia Y, Zeng W, Zhang C, Yang H (2023) A branch-and-price-and-cut algorithm for the vehicle routing problem with load-dependent drones. Transp Res Part B Methodol 171:80\u2013110","journal-title":"Transp Res Part B Methodol"},{"key":"1092_CR23","doi-asserted-by":"publisher","first-page":"3866","DOI":"10.1016\/j.procs.2023.10.382","volume":"225","author":"H Labidi","year":"2023","unstructured":"Labidi H, Azzouna NB, Hassine K, Gouider MS (2023) An improved genetic algorithm for solving the multi-objective vehicle routing problem with environmental considerations. Procedia Comput Sci 225:3866\u20133875","journal-title":"Procedia Comput Sci"},{"key":"1092_CR24","unstructured":"Jianxia L, Ruochen L, Ruinan W (2023) Elastic strategy-based adaptive genetic algorithm for solving dynamic vehicle routing problem with time windows. IEEE Trans Intell Transp Syst"},{"key":"1092_CR25","doi-asserted-by":"crossref","unstructured":"Wang DL, Ding A, Chen GL, Zhang L (2023) A combined genetic algorithm and a* search algorithm for the electric vehicle routing problem with time windows. Adv Prod Eng Manag 18(4)","DOI":"10.14743\/apem2023.4.481"},{"key":"1092_CR26","doi-asserted-by":"crossref","unstructured":"Anastasiadou MN, Mavrovouniotis M, Hadjimitsis D (2024) Ant colony optimization for the dynamic electric vehicle routing problem. In International conference on parallel problem solving from nature, pages 68\u201384. Springer","DOI":"10.1007\/978-3-031-70055-2_5"},{"issue":"1","key":"1092_CR27","doi-asserted-by":"publisher","first-page":"18351","DOI":"10.1038\/s41598-023-45543-z","volume":"13","author":"J Qiao","year":"2023","unstructured":"Qiao J, Li S, Liu M, Yang Z, Chen J, Liu P, Li H, Ma C (2023) A modified particle swarm optimization algorithm for a vehicle scheduling problem with soft time windows. Sci Rep 13(1):18351","journal-title":"Sci Rep"},{"key":"1092_CR28","doi-asserted-by":"crossref","unstructured":"Morteza Salehi Sarbijan and Javad Behnamian (2023) Feeder vehicle routing problem in a collaborative environment using hybrid particle swarm optimization and adaptive learning strategy. Environment, Development and Sustainability, pp 1\u201341","DOI":"10.1007\/s10668-023-04123-x"},{"issue":"9","key":"1092_CR29","doi-asserted-by":"publisher","first-page":"5772","DOI":"10.1109\/TITS.2020.2992549","volume":"22","author":"DN Das","year":"2020","unstructured":"Das DN, Sewani R, Wang J, Tiwari MK (2020) Synchronized truck and drone routing in package delivery logistics. IEEE Trans Intell Transp Syst 22(9):5772\u20135782","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"1092_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2022.101536","volume":"51","author":"S-H Huang","year":"2022","unstructured":"Huang S-H, Huang Y-H, Blazquez CA, Chen C-Y (2022) Solving the vehicle routing problem with drone for delivery services using an ant colony optimization algorithm. Adv Eng Inform 51:101536","journal-title":"Adv Eng Inform"},{"key":"1092_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101228","volume":"77","author":"T Ren","year":"2023","unstructured":"Ren T, Luo T, Jia B, Yang B, Wang L, Xing L (2023) Improved ant colony optimization for the vehicle routing problem with split pickup and split delivery. Swarm Evol Comput 77:101228","journal-title":"Swarm Evol Comput"},{"key":"1092_CR32","doi-asserted-by":"crossref","unstructured":"Balzotti C, Briani M (2022) Estimate of traffic emissions through multiscale second order models with heterogeneous data. arXiv preprint arXiv:2207.13964","DOI":"10.3934\/nhm.2022030"},{"key":"1092_CR33","doi-asserted-by":"crossref","unstructured":"Briani M, Manzo R, Piccoli B, Rarit\u00e0 L (2024) Estimation of no _ x and o _ 3reduction by dissipating traffic waves. Networks Heterogeneous Media 19(2)","DOI":"10.3934\/nhm.2024037"},{"issue":"1","key":"1092_CR34","doi-asserted-by":"publisher","first-page":"20240126","DOI":"10.1515\/math-2024-0126","volume":"23","author":"M Briani","year":"2025","unstructured":"Briani M, Denaro CA, Piccoli B, Rarit\u00e0 L (2025) Dynamics of particulate emissions in the presence of autonomous vehicles. Open Math 23(1):20240126","journal-title":"Open Math"},{"key":"1092_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.116264","volume":"191","author":"RJ Kuo","year":"2022","unstructured":"Kuo RJ, Shih-Hao L, Lai P-Y, Mara STW (2022) Vehicle routing problem with drones considering time windows. Expert Syst Appl 191:116264","journal-title":"Expert Syst Appl"},{"key":"1092_CR36","doi-asserted-by":"crossref","unstructured":"Wen X, Wu G, Liu J, Ong Y-S (2024) Transfer optimization for heterogeneous drone delivery and pickup problem. IEEE Trans Emerg Top Comput Intell","DOI":"10.1109\/TETCI.2024.3406689"},{"issue":"2","key":"1092_CR37","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254\u2013265","journal-title":"Oper Res"},{"key":"1092_CR38","unstructured":"Gehring H (Jan 1999) A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-025-01092-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-025-01092-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-025-01092-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T12:17:40Z","timestamp":1761394660000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-025-01092-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,30]]},"references-count":38,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["1092"],"URL":"https:\/\/doi.org\/10.1007\/s12065-025-01092-0","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,30]]},"assertion":[{"value":"20 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"110"}}