{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T07:57:49Z","timestamp":1774684669960,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"the National Natural Science Foundation of China under Grant","award":["11961001"],"award-info":[{"award-number":["11961001"]}]},{"name":"the Construction Project of First-Class Subjects in Ningxia Higher Education","award":["NXYLXK2017B09"],"award-info":[{"award-number":["NXYLXK2017B09"]}]},{"name":"the Major Proprietary Funded Project of North Minzu University","award":["ZDZX201901"],"award-info":[{"award-number":["ZDZX201901"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2023,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we propose a vehicle routing problem with time windows (TWVRP). In this problem, we consider a hard time constraint that the fleet can only serve customers within a specific time window. To solve this problem, a hybrid ant colony (HACO) algorithm is proposed based on ant colony algorithm and mutation operation. The HACO algorithm proposed has three innovations: the first is to update pheromones with a new method; the second is the introduction of adaptive parameters; and the third is to add the mutation operation. A famous Solomon instance is used to evaluate the performance of the proposed algorithm. Experimental results show that HACO algorithm is effective against solving the problem of vehicle routing with time windows. Besides, the proposed algorithm also has practical implications for vehicle routing problem and the results show that it is applicable and effective in practical problems.<\/jats:p>","DOI":"10.1007\/s40747-021-00401-1","type":"journal-article","created":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T20:16:53Z","timestamp":1622578613000},"page":"2491-2508","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["A hybrid ant colony algorithm based on multiple strategies for the vehicle routing problem with time windows"],"prefix":"10.1007","volume":"9","author":[{"given":"Hongguang","family":"Wu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2021-2097","authenticated-orcid":false,"given":"Yuelin","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Wanting","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Ziyu","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,1]]},"reference":[{"key":"401_CR1","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.ins.2019.03.070","volume":"490","author":"HZ Zhang","year":"2019","unstructured":"Zhang HZ, Zhang QW, Ma L, Zhang ZY, Liu Y (2019) A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows. Inf Sci 490:166\u2013190","journal-title":"Inf Sci"},{"issue":"2\u20133","key":"401_CR2","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10107-002-0323-0","volume":"94","author":"TK Ralphs","year":"2003","unstructured":"Ralphs TK, Kopman L, Pulleyblank WR, Trotter LE (2003) On the capacitated vehicle routing problem. Math Progr 94(2\u20133):343\u2013359","journal-title":"Math Progr"},{"issue":"2","key":"401_CR3","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/j.ejor.2015.08.040","volume":"249","author":"F Hernandez","year":"2016","unstructured":"Hernandez F, Feillet D, Giroudeau R, Naud O (2016) Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows. Eur J Oper Res 249(2):551\u2013559","journal-title":"Eur J Oper Res"},{"issue":"1","key":"401_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.ejor.2015.09.015","volume":"250","author":"M Schneider","year":"2016","unstructured":"Schneider M (2016) The vehicle-routing problem with time windows and driver-specific times. Eur J Oper Res 250(1):101\u2013119","journal-title":"Eur J Oper Res"},{"key":"401_CR5","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.cor.2015.05.004","volume":"64","author":"C Koc","year":"2015","unstructured":"Koc C, Bektas T, Jabali O, Laporte G (2015) A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows. Comput Oper Res 64:11\u201327","journal-title":"Comput Oper Res"},{"issue":"2","key":"401_CR6","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1287\/opre.44.2.286","volume":"44","author":"D Bertsimas","year":"1993","unstructured":"Bertsimas D, Simchi-Levi D (1993) A new generation of vehicle routing research: robust algorithms addressing uncertainty. Oper Res 44(2):286\u2013304","journal-title":"Oper Res"},{"issue":"1","key":"401_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10489-006-6926-z","volume":"24","author":"B Ombuki","year":"2006","unstructured":"Ombuki B, Ross BJ, Hanshar F (2006) Multi-objective genetic algorithms for vehicle routing problem with time windows. Appl Intell 24(1):17\u201330","journal-title":"Appl Intell"},{"issue":"4","key":"401_CR8","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1016\/j.asoc.2010.04.001","volume":"10","author":"K Ghoseiri","year":"2010","unstructured":"Ghoseiri K, Ghannadpour SF (2010) Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm. Appl Soft Comput 10(4):1096\u20131107","journal-title":"Appl Soft Comput"},{"issue":"12","key":"401_CR9","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.3390\/math7121237","volume":"7","author":"KG Wang","year":"2019","unstructured":"Wang KG, Gao YL (2019) Application of differential evolution algorithm based on mixed penalty function screening criterion in imbalanced data integration classification. Mathematics 7(12):1237","journal-title":"Mathematics"},{"issue":"4","key":"401_CR10","doi-asserted-by":"publisher","first-page":"330","DOI":"10.3390\/math7040330","volume":"7","author":"KG Wang","year":"2019","unstructured":"Wang KG, Gao YL (2019) Topology structure implied in $$\\beta $$-Hilbert space, heisenberg uncertainty quantum characteristics and numerical simulation of the DE algorithm. Mathematics 7(4):330","journal-title":"Mathematics"},{"issue":"12","key":"401_CR11","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1016\/S0305-0548(03)00155-2","volume":"31","author":"SC Ho","year":"2004","unstructured":"Ho SC, Haugland D (2004) A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Comput Oper Res 31(12):1947\u20131964","journal-title":"Comput Oper Res"},{"key":"401_CR12","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.cor.2013.08.010","volume":"52","author":"S Belhaiza","year":"2014","unstructured":"Belhaiza S, Hansen P, Laporte G (2014) A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows. Comput Oper Res 52:269\u2013281","journal-title":"Comput Oper Res"},{"key":"401_CR13","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.cie.2014.11.004","volume":"89","author":"Z Wang","year":"2014","unstructured":"Wang Z, Li Y, Hu XP (2014) A heuristic approach and a tabu search for the heterogeneous multi-type fleet vehicle routing problem with time windows and an incompatible loading constraint. Comput Ind Eng 89:162\u2013176. https:\/\/doi.org\/10.1016\/j.cie.2014.11.004","journal-title":"Comput Ind Eng"},{"issue":"1","key":"401_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02601637","volume":"63","author":"WC Chiang","year":"1996","unstructured":"Chiang WC, Russell RA (1996) Simulated annealing metaheuristics for the vehicle routing problem with time windows. Ann Oper Res 63(1):3\u201327","journal-title":"Ann Oper Res"},{"issue":"5","key":"401_CR15","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/S1874-8651(10)60049-X","volume":"29","author":"AM Deng","year":"2009","unstructured":"Deng AM, MAO C, Zhou YT (2009) Optimizing research of an improved simulated annealing algorithm to soft time windows vehicle routing problem with pick-up and delivery. Syst Eng Theory Pract 29(5):186\u2013192","journal-title":"Syst Eng Theory Pract"},{"key":"401_CR16","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.cie.2015.02.005","volume":"83","author":"C Wang","year":"2015","unstructured":"Wang C, Mu D, Zhao F, Sutherland JW (2015) A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup delivery and time windows. Comput Ind Eng 83:111\u2013122","journal-title":"Comput Ind Eng"},{"issue":"2","key":"401_CR17","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.tre.2010.09.010","volume":"47","author":"B Yu","year":"2011","unstructured":"Yu B, Yang ZZ (2011) An ant colony optimization model: the period vehicle routing problem with time windows. Transp Res Part E: Log Transp Rev 47(2):166\u2013181","journal-title":"Transp Res Part E: Log Transp Rev"},{"key":"401_CR18","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.neucom.2011.09.040","volume":"98","author":"QL Ding","year":"2012","unstructured":"Ding QL, Hu XP, Sun LJ, Wang YZ (2012) An improved ant colony optimization and its application to vehicle routing problem with time windows. Neurocomputing 98:101\u2013107","journal-title":"Neurocomputing"},{"key":"401_CR19","doi-asserted-by":"publisher","unstructured":"Wang Y, Wang L, Chen GC, Cai ZQ, Zhou YQ, Xing LN (2020) An improved ant colony optimization algorithm to the periodic vehicle routing problem with time window and service choice. Swarm Evolut Comput. https:\/\/doi.org\/10.1016\/j.swevo.2020.100675","DOI":"10.1016\/j.swevo.2020.100675"},{"key":"401_CR20","doi-asserted-by":"publisher","unstructured":"Geng N, Chen ZT, Nguyen QA, Gong DW (2021) Particle swarm optimization algorithm for the optimization of rescue task allocation with uncertain time constraints. Complex Intell Syst. https:\/\/doi.org\/10.1007\/s40747-020-00252-2","DOI":"10.1007\/s40747-020-00252-2"},{"issue":"3","key":"401_CR21","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/s40747-020-00159-y","volume":"6","author":"AN \u00dcnal","year":"2020","unstructured":"\u00dcnal AN, Kayakutlu G (2020) Multi-objective particle swarm optimization with random immigrants. Complex Intell Syst 6(3):635\u2013650","journal-title":"Complex Intell Syst"},{"issue":"2","key":"401_CR22","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s40747-020-00134-7","volume":"6","author":"SF Qin","year":"2020","unstructured":"Qin SF, Sun CL, Zhang GC, He XJ, Tan Y (2020) A modified particle swarm optimization based on decomposition with different ideal points for many-objective optimization problems. Complex Intell Syst 6(2):263\u2013274","journal-title":"Complex Intell Syst"},{"issue":"2","key":"401_CR23","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s40747-020-00144-5","volume":"6","author":"F Liu","year":"2020","unstructured":"Liu F, Zhang JW, Liu T (2020) A PSO-algorithm-based consensus model with the application to large-scale group decision-making. Complex Intell Syst 6(2):287\u2013298","journal-title":"Complex Intell Syst"},{"key":"401_CR24","doi-asserted-by":"publisher","unstructured":"Ebrahimnejad A, Enayattabr M, Motameni H, Garg H (2021) Modified artificial bee colony algorithm for solving mixed interval-valued fuzzy shortest path problem. Complex Intell Syst. https:\/\/doi.org\/10.1007\/s40747-021-00278-0","DOI":"10.1007\/s40747-021-00278-0"},{"issue":"2","key":"401_CR25","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s40747-020-00149-0","volume":"6","author":"Y Yang","year":"2020","unstructured":"Yang Y, Duan Z (2020) An effective co-evolutionary algorithm based on artificial bee colony and differential evolution for time series predicting optimization. Complex Intell Syst 6(2):299\u2013308","journal-title":"Complex Intell Syst"},{"key":"401_CR26","doi-asserted-by":"publisher","unstructured":"Wang H, Wang WJ, Zhou XY, Zhao J, Wang Y, Xiao SY, Xu MY (2020) Artificial bee colony algorithm based on knowledge fusion. Complex Intell Syst. https:\/\/doi.org\/10.1007\/s40747-020-00171-2","DOI":"10.1007\/s40747-020-00171-2"},{"key":"401_CR27","doi-asserted-by":"publisher","unstructured":"Pandey AC, Tikkiwal VA (2021) Stance detection using improved whale optimization algorithm. Complex Intell Syst. https:\/\/doi.org\/10.1007\/s40747-021-00294-0","DOI":"10.1007\/s40747-021-00294-0"},{"issue":"2","key":"401_CR28","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s40747-018-0083-y","volume":"5","author":"M Enayattabar","year":"2019","unstructured":"Enayattabar M, Ebrahimnejad A, Motameni H (2019) Dijkstra algorithm for shortest path problem under interval-valued Pythagorean fuzzy environment. Complex Intell Syst 5(2):93\u2013100","journal-title":"Complex Intell Syst"},{"key":"401_CR29","unstructured":"Colorni A, Dorigo M, Maniezzo V (1991) Distributed optimization by ant colonies. In: Proceedings of ECAL91-European conference on artificial life"},{"key":"401_CR30","unstructured":"Bullnheimer B, Hartl RF, Strauss C (1997) Applying the ant system to the vehicle routing problem. In: International Conference on Metaheuristics 1\u201312"},{"issue":"1","key":"401_CR31","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.ejor.2008.02.028","volume":"196","author":"B Yu","year":"2009","unstructured":"Yu B, Yang ZZ, Yao B (2009) An improved ant colony optimization for vehicle routing problem. Eur J Oper Res 196(1):171\u2013176","journal-title":"Eur J Oper Res"},{"issue":"7","key":"401_CR32","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1007\/s00500-010-0680-1","volume":"15","author":"M Mavrovouniotis","year":"2011","unstructured":"Mavrovouniotis M, Yang S (2011) A memetic ant colony optimization algorithm for the dynamic travelling salesman problem. Soft Comput 15(7):1405\u20131425","journal-title":"Soft Comput"},{"issue":"4","key":"401_CR33","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1109\/TSMC.2016.2606440","volume":"48","author":"XY Wang","year":"2016","unstructured":"Wang XY, Choi TM, Liu HK, Yue XH (2016) A novel hybrid ant colony optimization algorithm for emergency transportation problems during post-disaster scenarios. IEEE Trans Syst Man Cybern Syst 48(4):545\u2013556","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"401_CR34","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.trd.2017.09.003","volume":"57","author":"E Jabir","year":"2017","unstructured":"Jabir E, Panicker V, Sridharan R (2017) Design and development of a hybrid ant colony-variable neighbourhood search algorithm for a multi-depot green vehicle routing problem. Transp Res Part D Transp Environ 57:422\u2013457","journal-title":"Transp Res Part D Transp Environ"},{"key":"401_CR35","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1016\/j.jclepro.2019.03.185","volume":"227","author":"YB Li","year":"2019","unstructured":"Li YB, Soleimani H, Zohal M (2019) An improved ant colony optimization algorithm for the multi-depot green vehicle routing problem with multiple objectives. J Clean Prod 227:1161\u20131172","journal-title":"J Clean Prod"},{"key":"401_CR36","unstructured":"Dorigo M (1992) Optimization learning and natural algorithms. Politecnico di Milano, Italy"},{"issue":"3","key":"401_CR37","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.jksus.2010.03.002","volume":"22","author":"NA EI-Sherbeny","year":"2010","unstructured":"EI-Sherbeny NA (2010) Vehicle routing with time windows: an overview of exact, heuristic and metaheuristic methods. J King Saud Univ Sci 22(3):123\u2013131","journal-title":"J King Saud Univ Sci"},{"issue":"1","key":"401_CR38","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) The ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B 26(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybern Part B"},{"issue":"8","key":"401_CR39","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1016\/S0167-739X(00)00042-X","volume":"16","author":"M Dorigo","year":"2000","unstructured":"Dorigo M, Bonabeau E, Theraulaz G (2000) Ant algorithms and stigmergy. Fut Gen Comput Syst 16(8):851\u2013871","journal-title":"Fut Gen Comput Syst"},{"issue":"2\u20133","key":"401_CR40","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 (2005) Ant colony optimization theory: a survey. Theor Comput Sci 344(2\u20133):243\u2013278. https:\/\/doi.org\/10.1016\/j.tcs.2005.05.020","journal-title":"Theor Comput Sci"},{"key":"401_CR41","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1016\/j.asoc.2013.08.015","volume":"14","author":"SF Ghannadpour","year":"2014","unstructured":"Ghannadpour SF, Noori S, Tavakkoli-Moghaddam R, Ghoseiri K (2014) A multi-objective dynamic vehicle routing problem with fuzzy time windows: model, solution and application. Appl Soft Comput 14:504\u2013527","journal-title":"Appl Soft Comput"},{"key":"401_CR42","doi-asserted-by":"publisher","unstructured":"Huang SH, Huang YH, Blazquez CA, Paredes-Belmar G (2018) Application of the ant colony optimization in the resolution of the bridge inspection routing problem. Appl Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2018.01.034","DOI":"10.1016\/j.asoc.2018.01.034"},{"key":"401_CR43","doi-asserted-by":"publisher","unstructured":"Zhou YZ, Huang JC, Shi JM, Wang R, Huang KH (2021) The electric vehicle routing problem with partial recharge and vehicle recycling. Complex Intell Syst. https:\/\/doi.org\/10.1007\/s40747-021-00291-3","DOI":"10.1007\/s40747-021-00291-3"},{"key":"401_CR44","doi-asserted-by":"publisher","unstructured":"Feng GQ, Xu P, Cui DL, Dai XW, Liu H, Zhang Q (2021) Multi-stage timetable rescheduling for high-speed railways: a dynamic programming approach with adaptive state generation. Complex Intell Syst. https:\/\/doi.org\/10.1007\/s40747-021-00272-6","DOI":"10.1007\/s40747-021-00272-6"},{"key":"401_CR45","doi-asserted-by":"publisher","unstructured":"Jie J, Liu KR, Zheng H, Wang BB, Dai R (2021) High dimensional feature data reduction of multichannel sEMG for gesture recognition based on double phases PSO. Complex Intell Syst. https:\/\/doi.org\/10.1007\/s40747-020-00232-6","DOI":"10.1007\/s40747-020-00232-6"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00401-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-021-00401-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00401-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T17:35:21Z","timestamp":1686332121000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-021-00401-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,1]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["401"],"URL":"https:\/\/doi.org\/10.1007\/s40747-021-00401-1","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,1]]},"assertion":[{"value":"9 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}