{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T12:16:27Z","timestamp":1783685787186,"version":"3.55.0"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T00:00:00Z","timestamp":1774828800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T00:00:00Z","timestamp":1774828800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100006319","name":"Centre National pour la Recherche Scientifique et Technique","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006319","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s10586-026-06015-x","type":"journal-article","created":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T15:19:20Z","timestamp":1774883960000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An optimized clustering method for the vehicle routing problem with time windows to improve Moroccan waste management"],"prefix":"10.1007","volume":"29","author":[{"given":"Ilias","family":"Chakour","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Otman","family":"Abdoun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,3,30]]},"reference":[{"key":"6015_CR1","unstructured":"THE 17 GOALS | Sustainable Development. https:\/\/sdgs.un.org\/goals Accessed 2025-01-27"},{"issue":"23","key":"6015_CR2","doi-asserted-by":"publisher","DOI":"10.3390\/su142315582","volume":"14","author":"M Ammari","year":"2022","unstructured":"Ammari, M., Chentouf, M., Ammari, M., Ben Allal, L.: Assessing national progress in achieving the sustainable development goals: A case study of morocco. Sustainability 14(23), 15582 (2022). https:\/\/doi.org\/10.3390\/su142315582","journal-title":"Sustainability"},{"key":"6015_CR3","doi-asserted-by":"publisher","unstructured":"The Vehicle Routing Problem. https:\/\/doi.org\/10.1137\/1.9780898718515 . http:\/\/epubs.siam.org\/doi\/book\/10.1137\/1.9780898718515 Accessed 2024-12-25","DOI":"10.1137\/1.9780898718515"},{"key":"6015_CR4","doi-asserted-by":"publisher","first-page":"15459","DOI":"10.1007\/s10586-018-2637-6","volume":"22","author":"Y Sun","year":"2019","unstructured":"Sun, Y., Wang, D., Lang, M., Zhou, X.: Solving the time-dependent multi-trip vehicle routing problem with time windows and an improved travel speed model by a hybrid solution algorithm. Clust. Comput. 22, 15459\u201315470 (2019)","journal-title":"Clust. Comput."},{"key":"6015_CR5","doi-asserted-by":"publisher","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res.\u00a035(2), 254\u2013265 (1987). https:\/\/doi.org\/10.1287\/opre.35.2.254","DOI":"10.1287\/opre.35.2.254"},{"key":"6015_CR6","doi-asserted-by":"crossref","unstructured":"Balakrishnan, N.: Simple heuristics for the vehicle routeing problem with soft time windows.\u00a0J. Oper. Res. Soc.\u00a044(3), 279\u2013287 (1993)","DOI":"10.1057\/jors.1993.53"},{"key":"6015_CR7","doi-asserted-by":"publisher","first-page":"15447","DOI":"10.1007\/s10586-018-2635-8","volume":"22","author":"Y Xia","year":"2019","unstructured":"Xia, Y., Fu, Z.: A tabu search algorithm for distribution network optimization with discrete split deliveries and soft time windows. Clust. Comput. 22, 15447\u201315457 (2019)","journal-title":"Clust. Comput."},{"key":"6015_CR8","doi-asserted-by":"publisher","unstructured":"Pillac, V., Gendreau, M., Gu\u00e9ret, C., Medaglia, A.L.: A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225(1), 1\u201311 (2013). https:\/\/doi.org\/10.1016\/j.ejor.2012.08.015","DOI":"10.1016\/j.ejor.2012.08.015"},{"key":"6015_CR9","doi-asserted-by":"crossref","unstructured":"Savelsbergh, M.W.P., Sol, M.: The general pickup and delivery problem. Transp. Sci.\u00a029(1), 17\u201329 (1995)","DOI":"10.1287\/trsc.29.1.17"},{"key":"6015_CR10","unstructured":"Ilias, C., Abdoun, O.: Metaheuristic solution for vehicle transportations to improve moroccan logistics. Int. J. Artif. Intell.\u00a023(1), 42\u201354 (2025)"},{"issue":"15","key":"6015_CR11","doi-asserted-by":"publisher","DOI":"10.3390\/su151512004","volume":"15","author":"X Liu","year":"2023","unstructured":"Liu, X., Chen, Y.-L., Por, L.Y., Ku, C.S.: A systematic literature review of vehicle routing problems with time windows. Sustainability 15(15), 12004 (2023). https:\/\/doi.org\/10.3390\/su151512004","journal-title":"Sustainability"},{"key":"6015_CR12","unstructured":"Kerscher, C., Minner, S.: Spatial-temporal-demand clustering for solving large-scale vehicle routing problems with time windows. arXiv. https:\/\/doi.org\/10.48550\/arXiv.2402.00041 . http:\/\/arxiv.org\/abs\/2402.00041 Accessed 2024-12-25"},{"key":"6015_CR13","doi-asserted-by":"publisher","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows.\u00a0Comput. Oper. Res.\u00a040(1), 475\u2013489 (2013). https:\/\/doi.org\/10.1016\/j.cor.2012.07.018","DOI":"10.1016\/j.cor.2012.07.018"},{"key":"6015_CR14","doi-asserted-by":"publisher","unstructured":"Gocken, T., Yaktubay, M.: Comparison of different clustering algorithms via genetic algorithm for VRPTW.\u00a0Int. J. Simul. Model.\u00a018(4), 574\u2013585 (2019). https:\/\/doi.org\/10.2507\/IJSIMM18(4)485","DOI":"10.2507\/IJSIMM18(4)485"},{"issue":"3","key":"6015_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10586-024-04860-2","volume":"28","author":"Z Zhang","year":"2025","unstructured":"Zhang, Z., Tan, S., Qin, J., Zou, K., Zhou, S.: Multi-strategy ant colony optimization with k-means clustering algorithm for capacitated vehicle routing problem. Clust. Comput. 28(3), 1\u201324 (2025)","journal-title":"Clust. Comput."},{"key":"6015_CR16","unstructured":"Solomon Benchmarking Problems. http:\/\/web.cba.neu.edu\/~msolomon\/heuristi.htm\/"},{"key":"6015_CR17","doi-asserted-by":"publisher","unstructured":"Gmira, M., Gendreau, M., Lodi, A., Potvin, J.-Y.: Tabu search for the time-dependent vehicle routing problem with time windows on a road network. Eur. J. Oper. Res. 288(1), 129\u2013140 (2021). https:\/\/doi.org\/10.1016\/j.ejor.2020.05.041","DOI":"10.1016\/j.ejor.2020.05.041"},{"issue":"4","key":"6015_CR18","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1002\/net.21852","volume":"73","author":"H Ben Ticha","year":"2019","unstructured":"Ben Ticha, H., Absi, N., Feillet, D., Quilliot, A., Van Woensel, T.: A branch?and?price algorithm for the vehicle routing problem with time windows on a road network. Networks 73(4), 401\u2013417 (2019). https:\/\/doi.org\/10.1002\/net.21852","journal-title":"Networks"},{"key":"6015_CR19","unstructured":"MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 281\u2013297. Oakland, CA, USA. Issue: 14"},{"key":"6015_CR20","unstructured":"Shin, K., Han, S.: A centroid-based heuristic algorithm for the capacitated vehicle routing problem 30(4), 721\u2013732. ISBN: 2585-8807"},{"key":"6015_CR21","unstructured":"Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Kdd (ed.), vol. 96, pp. 226\u2013231. Issue: 34."},{"key":"6015_CR22","doi-asserted-by":"publisher","unstructured":"Ert\u00f6z, L., Steinbach, M., Kumar, V.: Finding clusters of different sizes, shapes, and densities in noisy, high dimensional data. In: Proceedings of the 2003 SIAM International Conference on Data Mining, pp. 47\u201358. Society for Industrial and Applied Mathematics. https:\/\/doi.org\/10.1137\/1.9781611972733.5 . https:\/\/epubs.siam.org\/doi\/10.1137\/1.9781611972733.5 Accessed 2024-12-26","DOI":"10.1137\/1.9781611972733.5"},{"key":"6015_CR23","doi-asserted-by":"publisher","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput.\u00a06(2), 182\u2013197 (2002). https:\/\/doi.org\/10.1109\/4235.996017","DOI":"10.1109\/4235.996017"},{"issue":"2","key":"6015_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3625232","volume":"15","author":"Z Zong","year":"2024","unstructured":"Zong, Z., Tong, X., Zheng, M., Li, Y.: Reinforcement learning for solving multiple vehicle routing problem with time window. ACM Trans. Intell. Syst. Technol. 15(2), 1\u201319 (2024). https:\/\/doi.org\/10.1145\/3625232","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"6015_CR25","unstructured":"Maroof, A., Ayvaz, B., Naeem, K.: Logistics optimization using hybrid genetic algorithm (hga): a solution to the vehicle routing problem with time windows (vrptw). ISBN: 2169-3536 Publisher: IEEE"},{"key":"6015_CR26","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.ins.2015.04.001","volume":"316","author":"J Luo","year":"2015","unstructured":"Luo, J., Li, X., Chen, M.-R., Liu, H.: A novel hybrid shuffled frog leaping algorithm for vehicle routing problem with time windows. Inf. Sci. 316, 266\u2013292 (2015). https:\/\/doi.org\/10.1016\/j.ins.2015.04.001","journal-title":"Inf. Sci."},{"key":"6015_CR27","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.neucom.2014.06.033","volume":"146","author":"D Barbucha","year":"2014","unstructured":"Barbucha, D.: A cooperative population learning algorithm for vehicle routing problem with time windows. Neurocomputing 146, 210\u2013229 (2014). https:\/\/doi.org\/10.1016\/j.neucom.2014.06.033","journal-title":"Neurocomputing"},{"key":"6015_CR28","doi-asserted-by":"crossref","unstructured":"Zhou, Z., Ma, X., Liang, Z., Zhu, Z.: Multi-objective multi-factorial memetic algorithm based on bone route and large neighborhood local search for VRPTW. In: 2020 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138. IEEE. https:\/\/doi.org\/10.1109\/CEC48606.2020.9185528 . https:\/\/ieeexplore.ieee.org\/document\/9185528\/ Accessed 2025-01-13","DOI":"10.1109\/CEC48606.2020.9185528"},{"issue":"7","key":"6015_CR29","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1109\/TCYB.2016.2554622","volume":"47","author":"A Gupta","year":"2017","unstructured":"Gupta, A., Ong, Y.-S., Feng, L., Tan, K.C.: Multiobjective multifactorial optimization in evolutionary multitasking. IEEE Trans. Cyber. 47(7), 1652\u20131665 (2017). https:\/\/doi.org\/10.1109\/TCYB.2016.2554622","journal-title":"IEEE Trans. Cyber."},{"key":"6015_CR30","doi-asserted-by":"publisher","unstructured":"Sel\u00e7uklu, S.B.: Multi-objective genetic algorithms. In: Kulkarni, A.J., Gandomi, A.H. (eds.) Handbook of Formal Optimization, pp. 1007\u20131044. Springer. https:\/\/doi.org\/10.1007\/978-981-97-3820-5_31 . https:\/\/link.springer.com\/10.1007\/978-981-97-3820-5_31 Accessed 2025-01-12","DOI":"10.1007\/978-981-97-3820-5_31"},{"key":"6015_CR31","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.procs.2024.05.021","volume":"236","author":"A Idrissi","year":"2024","unstructured":"Idrissi, A., Benabbou, R., Benhra, J., Haji, M.E.: Smart waste collection based on vehicle routing optimization: Case of casablanca city. Procedia Computer Science 236, 194\u2013201 (2024). https:\/\/doi.org\/10.1016\/j.procs.2024.05.021","journal-title":"Procedia Comput. Sci."},{"issue":"2","key":"6015_CR32","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/s10586-024-04812-w","volume":"28","author":"B Abdollahzadeh","year":"2025","unstructured":"Abdollahzadeh, B., Javadi, H., Tora\u011fay, O., Epicoco, N., Khodadadi, N.: The green marine waste collector routing optimization with puma selectison-based neighborhood search algorithm. Clust. Comput. 28(2), 80 (2025)","journal-title":"Clust. Comput."},{"issue":"7\u20138","key":"6015_CR33","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1016\/j.marpolbul.2003.12.004","volume":"48","author":"MS Islam","year":"2004","unstructured":"Islam, M.S., Tanaka, M.: Impacts of pollution on coastal and marine ecosystems including coastal and marine fisheries and approach for management: a review and synthesis. Mar. Pollut. Bull. 48(7\u20138), 624\u2013649 (2004)","journal-title":"Mar. Pollut. Bull."},{"issue":"4","key":"6015_CR34","doi-asserted-by":"publisher","first-page":"5235","DOI":"10.1007\/s10586-023-04221-5","volume":"27","author":"B Abdollahzadeh","year":"2024","unstructured":"Abdollahzadeh, B., Khodadadi, N., Barshandeh, S., Trojovsk\u1ef3, P., Gharehchopogh, F.S., El-kenawy, E.-S., Abualigah, L., Mirjalili, S.: Puma optimizer (po): a novel metaheuristic optimization algorithm and its application in machine learning. Clust. Comput. 27(4), 5235\u20135283 (2024)","journal-title":"Clust. Comput."},{"issue":"4","key":"6015_CR35","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455\u2013472 (2006)","journal-title":"Transp. Sci."},{"issue":"10","key":"6015_CR36","doi-asserted-by":"publisher","first-page":"13583","DOI":"10.1007\/s10586-024-04643-9","volume":"27","author":"Y\u00c7 Kuyu","year":"2024","unstructured":"Kuyu, Y.\u00c7., Vatansever, F.: A hybrid approach of alns with alternative initialization and acceptance mechanisms for capacitated vehicle routing problems. Clus. Comput. 27(10), 13583\u201313606 (2024)","journal-title":"Clus. Comput."},{"key":"6015_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115198","volume":"182","author":"G Duan","year":"2021","unstructured":"Duan, G., Fan, T., Chen, X., Chen, L., Ma, J.: A hybrid algorithm on the vessel routing optimization for marine debris collection. Expert Syst. Appl. 182, 115198 (2021)","journal-title":"Expert Syst. Appl."},{"key":"6015_CR38","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1109\/TSMC.1974.5408453","volume":"4","author":"KS Narendra","year":"1974","unstructured":"Narendra, K.S., Thathachar, M.A.: Learning automata-a survey. IEEE Trans. Syst. Man Cybern 4, 323\u2013334 (1974)","journal-title":"IEEE Trans. Syst. Man Cybern"},{"key":"6015_CR39","doi-asserted-by":"publisher","first-page":"3671","DOI":"10.1007\/s10586-021-03354-9","volume":"24","author":"P Yelmewad","year":"2021","unstructured":"Yelmewad, P., Talawar, B.: Parallel version of local search heuristic algorithm to solve capacitated vehicle routing problem. Clust. Comput. 24, 3671\u20133692 (2021)","journal-title":"Clust. Comput."},{"key":"6015_CR40","doi-asserted-by":"crossref","unstructured":"Yelmewad, P., Talawar, B.: Gpu-based parallel heuristics for capacited vehicle routing problem. In: 2020 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT), pp. 1\u20136 (2020). IEEE","DOI":"10.1109\/CONECCT50063.2020.9198667"},{"key":"6015_CR41","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.cor.2019.03.006","volume":"107","author":"F Arnold","year":"2019","unstructured":"Arnold, F., Gendreau, M., S\u00f6rensen, K.: Efficiently solving very large-scale routing problems. Computers & operations research 107, 32\u201342 (2019)","journal-title":"Computers & operations research"},{"issue":"3","key":"6015_CR42","doi-asserted-by":"publisher","first-page":"1981","DOI":"10.1007\/s10586-021-03304-5","volume":"25","author":"FS Gharehchopogh","year":"2022","unstructured":"Gharehchopogh, F.S., Abdollahzadeh, B.: An efficient harris hawk optimization algorithm for solving the travelling salesman problem. Clust. Comput 25(3), 1981\u20132005 (2022)","journal-title":"Clust. Comput"},{"issue":"2","key":"6015_CR43","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-024-04741-8","volume":"28","author":"ATE Selmi","year":"2025","unstructured":"Selmi, A.T.E., Zerarka, M.F., Cheriet, A.: Efficient technique utilizing an embedding hierarchical clustering-based representation into crossed cubes for tsp optimization. Clust. Comput. 28(2), 92 (2025)","journal-title":"Clust. Comput"},{"issue":"2","key":"6015_CR44","doi-asserted-by":"publisher","first-page":"1753","DOI":"10.1007\/s10586-023-04036-4","volume":"27","author":"J Zhang","year":"2024","unstructured":"Zhang, J., Li, L., Zhang, H., Wang, F., Tian, Y.: A novel sparrow search algorithm with integrates spawning strategy. Clust. Comput. 27(2), 1753\u20131773 (2024)","journal-title":"Clust. Comput."},{"key":"6015_CR45","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/j.future.2019.02.028","volume":"97","author":"AA Heidari","year":"2019","unstructured":"Heidari, A.A., Mirjalili, S., Faris, H., Aljarah, I., Mafarja, M., Chen, H.: Harris hawks optimization: Algorithm and applications. Future Generation Computer Systems 97, 849\u2013872 (2019)","journal-title":"Future Generation Computer Systems"},{"key":"6015_CR46","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1590\/0101-7438.2015.035.03.0465","volume":"35","author":"B Herrera","year":"2015","unstructured":"Herrera, B., Coelho, L., Steiner, M.T.A.: Quantum inspired particle swarm combined with lin-kernighan-helsgaun method to the traveling salesman problem. Pesquisa Oper. 35, 465\u2013488 (2015)","journal-title":"Pesquisa Oper."},{"issue":"Suppl 4","key":"6015_CR47","doi-asserted-by":"publisher","first-page":"8725","DOI":"10.1007\/s10586-018-1957-x","volume":"22","author":"Y Xia","year":"2019","unstructured":"Xia, Y., Fu, Z.: Improved tabu search algorithm for the open vehicle routing problem with soft time windows and satisfaction rate. Clust. Comput. 22(Suppl 4), 8725\u20138733 (2019)","journal-title":"Clust. Comput."},{"issue":"5","key":"6015_CR48","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1057\/palgrave.jors.2600924","volume":"51","author":"D Sariklis","year":"2000","unstructured":"Sariklis, D., Powell, S.: A heuristic method for the open vehicle routing problem. J. Oper. Res. Soc. 51(5), 564\u2013573 (2000)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"6015_CR49","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1057\/palgrave.jors.2601817","volume":"56","author":"Z Fu","year":"2005","unstructured":"Fu, Z., Eglese, R., Li, L.Y.: A new tabu search heuristic for the open vehicle routing problem. J. Oper. Res. Soc. 56(3), 267\u2013274 (2005)","journal-title":"J. Oper. Res. Soc."},{"key":"6015_CR50","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1007\/s10586-015-0478-0","volume":"18","author":"T Sooktip","year":"2015","unstructured":"Sooktip, T., Wattanapongsakorn, N.: Identifying preferred solutions for multi-objective optimization: application to capacitated vehicle routing problem. Clust. Comput. 18, 1435\u20131448 (2015)","journal-title":"Clust. Comput."},{"key":"6015_CR51","doi-asserted-by":"crossref","unstructured":"Sooktip, T., Wattanapongsakorn, N.: Pruning algorithm for multi-objective optimization with decision maker\u2019s preferences of system redundancy allocation problem. In: 2014 International Conference on IT Convergence and Security (ICITCS), pp. 1\u20134 (2014). IEEE","DOI":"10.1109\/ICITCS.2014.7021801"},{"key":"6015_CR52","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2025.112989","volume":"174","author":"C-M Lai","year":"2025","unstructured":"Lai, C.-M., Chiu, C.-C., Chen, T.-L.: A nondominated sorting simplified swarm optimization with local search mechanisms for multi-objective vehicle routing problems with time windows. App. Soft Comput. 174, 112989 (2025)","journal-title":"App. Soft Comput."},{"key":"6015_CR53","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105684","volume":"84","author":"C-M Lai","year":"2019","unstructured":"Lai, C.-M., Chiu, C.-C., Liu, W.-C., Yeh, W.-C.: A novel nondominated sorting simplified swarm optimization for multi-stage capacitated facility location problems with multiple quantitative and qualitative objectives. Appl. Soft Comput. 84, 105684 (2019)","journal-title":"Appl. Soft Comput."},{"key":"6015_CR54","unstructured":"Helsgaun, K.: An extension of the lin-kernighan-helsgaun tsp solver for constrained traveling salesman and vehicle routing problems. Roskilde: Roskilde University 12, 966\u2013980 (2017)"},{"key":"6015_CR55","doi-asserted-by":"crossref","unstructured":"Marrouche, W., Harmanani, H.M.: A strength pareto evolutionary algorithm for solving the capacitated vehicle routing problem with time windows. In: IJCCI, pp. 96\u2013106 (2021)","DOI":"10.5220\/0010640900003063"},{"key":"6015_CR56","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101425","volume":"84","author":"Q Wu","year":"2024","unstructured":"Wu, Q., Xia, X., Song, H., Zeng, H., Xu, X., Zhang, Y., Yu, F., Wu, H.: 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."},{"issue":"7","key":"6015_CR57","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0130224","volume":"10","author":"S Jawarneh","year":"2015","unstructured":"Jawarneh, S., Abdullah, S.: Sequential insertion heuristic with adaptive bee colony optimisation algorithm for vehicle routing problem with time windows. PLoS ONE 10(7), 0130224 (2015)","journal-title":"PLoS ONE"},{"key":"6015_CR58","doi-asserted-by":"publisher","DOI":"10.22266\/ijies2021.0630.22","author":"S Mortada","year":"2021","unstructured":"Mortada, S., Yusof, Y.: A neighbourhood search for artificial bee colony in vehicle routing problem with time windows. Int. J. Int. Eng. Sys. (2021). https:\/\/doi.org\/10.22266\/ijies2021.0630.22","journal-title":"Int. J. Int. Eng. Sys."},{"key":"6015_CR59","unstructured":"Karaboga, D., et al.: An idea based on honey bee swarm for numerical optimization (2005)"},{"issue":"4","key":"6015_CR60","doi-asserted-by":"publisher","DOI":"10.1016\/j.eij.2023.100403","volume":"24","author":"ZH Ahmed","year":"2023","unstructured":"Ahmed, Z.H., Maleki, F., Yousefikhoshbakht, M., Haron, H.: Solving the vehicle routing problem with time windows using modified football game algorithm. Egyptian Inf. J. 24(4), 100403 (2023)","journal-title":"Egyptian Inf. J."},{"key":"6015_CR61","doi-asserted-by":"crossref","unstructured":"Fadakar, E., Ebrahimi, M.: A new metaheuristic football game inspired algorithm. In: 2016 1st Conference on Swarm Intelligence and Evolutionary Computation (CSIEC), pp. 6\u201311 (2016). IEEE","DOI":"10.1109\/CSIEC.2016.7482120"},{"key":"6015_CR62","doi-asserted-by":"publisher","first-page":"42083","DOI":"10.1109\/ACCESS.2024.3378089","volume":"12","author":"Y Zhang","year":"2024","unstructured":"Zhang, Y., Li, J.: A hybrid heuristic harmony search algorithm for the vehicle routing problem with time windows. IEEE Acc. 12, 42083\u201342095 (2024)","journal-title":"IEEE Acc."},{"key":"6015_CR63","unstructured":"Ratanavilisagul, C.: Modified ant colony optimization for vehicle routing problem with time windows using limited search space and novel updating pheromone and re-initialization pheromone techniques. In: International Conference On Cyber Management And Engineering (CyMaEn) (2023)"},{"key":"6015_CR64","doi-asserted-by":"publisher","DOI":"10.3390\/electronics14040647","author":"G Chen","year":"2025","unstructured":"Chen, G., Gao, J., Chen, D.: Research on vehicle routing problem with time windows based on improved genetic algorithm and ant colony algorithm. Electronics (2025). https:\/\/doi.org\/10.3390\/electronics14040647","journal-title":"Electronics"},{"key":"6015_CR65","doi-asserted-by":"crossref","unstructured":"Alijo, M., Abdoun, O., Bergam, A.: Pity beetle algorithm to solve vrp variants. In: International Conference on Advanced Intelligent Systems for Sustainable Development, pp. 115\u2013134 (2019). Springer","DOI":"10.1007\/978-3-030-36677-3_14"},{"key":"6015_CR66","doi-asserted-by":"crossref","unstructured":"Zheng, S., Janecek, A., Tan, Y.: Enhanced fireworks algorithm. In: 2013 IEEE Congress on Evolutionary Computation, pp. 2069\u20132077,\u00a0IEEE (2013)\u00a0","DOI":"10.1109\/CEC.2013.6557813"},{"issue":"8","key":"6015_CR67","doi-asserted-by":"publisher","first-page":"5508","DOI":"10.1016\/j.asoc.2011.05.008","volume":"11","author":"R Rajabioun","year":"2011","unstructured":"Rajabioun, R.: Cuckoo optimization algorithm. Appl. Soft Comput. 11(8), 5508\u20135518 (2011)","journal-title":"Appl. Soft Comput."},{"key":"6015_CR68","unstructured":"ALIJO, M., ABDOUN, O., BERGAM, A.: Improved the performance of the combinatorial optimization: Hcsfw. Ele. J. Math. Ana. App. 7(3) (2019)"},{"key":"6015_CR69","doi-asserted-by":"crossref","unstructured":"EL\u00a0Majdoubi, O., Abdoun, F., Abdoun, O.: A new optimized approach to resolve a combinatorial problem: coronavirus optimization algorithm and self-organizing maps. In: International Conference on Digital Technologies and Applications, pp. 947\u2013957, Springer (2021)","DOI":"10.1007\/978-3-030-73882-2_86"},{"issue":"29","key":"6015_CR70","doi-asserted-by":"publisher","first-page":"41600","DOI":"10.1007\/s11356-024-31927-9","volume":"31","author":"P Lou","year":"2024","unstructured":"Lou, P., Zhou, Z., Zeng, Y., Fan, C.: Vehicle routing problem with time windows and carbon emissions: a case study in logistics distribution. Environ. Sci. Pollut. Res. 31(29), 41600\u201341620 (2024)","journal-title":"Environ. Sci. Pollut. Res."},{"issue":"7","key":"6015_CR71","first-page":"7359","volume":"23","author":"J James","year":"2021","unstructured":"James, J., Markos, C., Zhang, S.: Long-term urban traffic speed prediction with deep learning on graphs. IEEE Trans. Intell. Transp. Syst. 23(7), 7359\u20137370 (2021)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"5","key":"6015_CR72","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1016\/j.trc.2009.12.006","volume":"19","author":"C Archetti","year":"2011","unstructured":"Archetti, C., Feillet, D., Gendreau, M., Speranza, M.G.: Complexity of the vrp and sdvrp. Transportation Research Part C: Emerging Technologies 19(5), 741\u2013750 (2011)","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"2","key":"6015_CR73","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF02579017","volume":"10","author":"O Br\u00e4ysy","year":"2002","unstructured":"Br\u00e4ysy, O., Gendreau, M.: Tabu search heuristics for the vehicle routing problem with time windows. Top 10(2), 211\u2013237 (2002). https:\/\/doi.org\/10.1007\/BF02579017","journal-title":"Top"},{"key":"6015_CR74","doi-asserted-by":"publisher","first-page":"169851","DOI":"10.1109\/ACCESS.2020.3023741","volume":"8","author":"T-S Khoo","year":"2020","unstructured":"Khoo, T.-S., Mohammad, B.B., Wong, V.-H., Tay, Y.-H., Nair, M.: A two-phase distributed ruin-and-recreate genetic algorithm for solving the vehicle routing problem with time windows. IEEE Acc. 8, 169851\u2013169871 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.3023741","journal-title":"IEEE Acc."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-026-06015-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-026-06015-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-026-06015-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T11:40:59Z","timestamp":1783683659000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-026-06015-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,30]]},"references-count":74,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["6015"],"URL":"https:\/\/doi.org\/10.1007\/s10586-026-06015-x","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,30]]},"assertion":[{"value":"28 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2026","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 competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}}],"article-number":"206"}}