{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T17:35:25Z","timestamp":1781717725890,"version":"3.54.5"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T00:00:00Z","timestamp":1728604800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T00:00:00Z","timestamp":1728604800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62062002"],"award-info":[{"award-number":["62062002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62062002"],"award-info":[{"award-number":["62062002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci Rep"],"DOI":"10.1038\/s41598-024-74432-2","type":"journal-article","created":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T04:01:36Z","timestamp":1728619296000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Parallel adaptive large neighborhood search based on spark to solve VRPTW"],"prefix":"10.1038","volume":"14","author":[{"given":"Songzuo","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jian","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaohong","family":"Duan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guofang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,10,11]]},"reference":[{"key":"74432_CR1","doi-asserted-by":"publisher","first-page":"500","DOI":"10.21276\/ijre.2018.5.9.2","volume":"5","author":"W Othman","year":"2018","unstructured":"Othman, W., Wahab, A., Alhady, S. & Wong, H. N. Solving vehicle routing problem using ant colony optimization (ACO) algorithm. Int. J. Res. Eng.5, 500\u2013507 (2018).","journal-title":"Int. J. Res. Eng."},{"key":"74432_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.22219\/JTIUMM.Vol22.No1.1-17","volume":"22","author":"MF Ibrahim","year":"2021","unstructured":"Ibrahim, M. F., Putri, M., Farista, D. & Utama, D. M. An improved genetic algorithm for vehicle routing problem pick-up and delivery with time windows. Jurnal Teknik Industri. 22, 1\u201317 (2021).","journal-title":"Jurnal Teknik Industri"},{"key":"74432_CR3","doi-asserted-by":"publisher","first-page":"7974","DOI":"10.1109\/TITS.2023.3268324","volume":"24","author":"B Zhu","year":"2023","unstructured":"Zhu, B. et al. A critical scenario search method for intelligent vehicle testing based on the social cognitive optimization algorithm. IEEE Trans. Intell. Transp. Syst.24, 7974\u20137986 (2023).","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"74432_CR4","doi-asserted-by":"publisher","first-page":"11682","DOI":"10.1109\/TITS.2023.3285430","volume":"24","author":"J Zhao","year":"2023","unstructured":"Zhao, J. et al. A human-like trajectory planning method on a curve based on the driver preview mechanism. IEEE Trans. Intell. Transp. Syst.24, 11682\u201311698 (2023).","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"74432_CR5","doi-asserted-by":"publisher","first-page":"8720","DOI":"10.1109\/TVT.2021.3098429","volume":"70","author":"X Liu","year":"2021","unstructured":"Liu, X. et al. Trajectory prediction of preceding target vehicles based on lane crossing and final points generation model considering driving styles. IEEE Trans. Veh. Technol.70, 8720\u20138730 (2021).","journal-title":"IEEE Trans. Veh. Technol."},{"key":"74432_CR6","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M. M. Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res.35, 254\u2013265 (1987).","journal-title":"Oper. Res."},{"key":"74432_CR7","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1111\/itor.12631","volume":"27","author":"J Corstjens","year":"2020","unstructured":"Corstjens, J., Depaire, B., Caris, A. & S\u00f6rensen, K. A multilevel evaluation method for heuristics with an application to the VRPTW. Int. Trans. Oper. Res.27, 168\u2013196 (2020).","journal-title":"Int. Trans. Oper. Res."},{"key":"74432_CR8","first-page":"2355","volume":"13","author":"D Aggarwal","year":"2021","unstructured":"Aggarwal, D. & Kumar, V. Performance evaluation of distance metrics on firefly algorithm for VRP with time windows. Int. J. Inform. Technol.13, 2355\u20132362 (2021).","journal-title":"Int. J. Inform. Technol."},{"key":"74432_CR9","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1016\/j.apm.2017.02.042","volume":"49","author":"AAR Hosseinabadi","year":"2017","unstructured":"Hosseinabadi, A. A. R., Rostami, N. S. H., Kardgar, M., Mirkamali, S. & Abraham, A. A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm. Appl. Math. Model.49, 663\u2013679 (2017).","journal-title":"Appl. Math. Model."},{"key":"74432_CR10","unstructured":"Hosseinabadi, A. A. R., Alavipour, F., Shamshirbnd, S. & Balas, V. E. A novel meta-heuristic combinatory method for solving capacitated vehicle location-routing problem with hard time windows. In: Information Technology and Intelligent Transportation Systems: Volume 1, Proceedings of the 2015 International Conference on Information Technology and Intelligent Transportation Systems ITITS 2015, held December 12\u201313, 2015, Xi\u2019an China). Springer (2017)."},{"key":"74432_CR11","first-page":"315","volume":"11","author":"MN Nategh","year":"2018","unstructured":"Nategh, M. N., Hosseinabadi, A. A. R. & Balas, V. E. Ant_VRP: ant-colony-based meta-heuristic algorithm to solve the vehicle routing problem. Int. J. Adv. Intell. Paradigms. 11, 315\u2013334 (2018).","journal-title":"Int. J. Adv. Intell. Paradigms"},{"key":"74432_CR12","doi-asserted-by":"publisher","first-page":"1366","DOI":"10.3390\/su10051366","volume":"10","author":"EB Tirkolaee","year":"2018","unstructured":"Tirkolaee, E. B., Hosseinabadi, A. A. R., Soltani, M., Sangaiah, A. K. & Wang, J. A hybrid genetic algorithm for multi-trip green capacitated arc routing problem in the scope of urban services. Sustainability. 10, 1366 (2018).","journal-title":"Sustainability"},{"key":"74432_CR13","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.compeleceng.2018.01.040","volume":"77","author":"EB Tirkolaee","year":"2019","unstructured":"Tirkolaee, E. B., Alinaghian, M., Hosseinabadi, A. A. R., Sasi, M. B. & Sangaiah, A. K. An improved ant colony optimization for the multi-trip Capacitated Arc Routing Problem. Comput. Electr. Eng.77, 457\u2013470 (2019).","journal-title":"Comput. Electr. Eng."},{"key":"74432_CR14","doi-asserted-by":"crossref","unstructured":"Gocken, T. & Yaktubay, M. Comparison of different clustering algorithms via genetic algorithm for VRPTW. (2019).","DOI":"10.2507\/IJSIMM18(4)485"},{"key":"74432_CR15","first-page":"1","volume":"52","author":"OS Olaniyi","year":"2022","unstructured":"Olaniyi, O. S., James, A. K., Ibrahim, A. A. & Makanjuola, A. F. On the application of a modified genetic algorithm for solving vehicle routing problems with time windows and split delivery. IAENG Int. J. Appl. Math.52, 1\u20139 (2022).","journal-title":"IAENG Int. J. Appl. Math."},{"key":"74432_CR16","volume-title":"D-PFA: A Discrete Metaheuristic Method for Solving Traveling Salesman Problem Using Pathfinder Algorithm","author":"P Pirozmand","year":"2023","unstructured":"Pirozmand, P. et al. D-PFA: A Discrete Metaheuristic Method for Solving Traveling Salesman Problem Using Pathfinder Algorithm (IEEE Access, 2023)."},{"key":"74432_CR17","doi-asserted-by":"publisher","first-page":"110040","DOI":"10.1016\/j.cie.2024.110040","volume":"190","author":"M Tadaros","year":"2024","unstructured":"Tadaros, M. & Kyriakakis, N. A. A hybrid clustered ant colony optimization Approach for the hierarchical Multi-switch Multi-echelon Vehicle Routing Problem with Service Times. Comput. Ind. Eng.190, 110040 (2024).","journal-title":"Comput. Ind. Eng."},{"key":"74432_CR18","doi-asserted-by":"publisher","first-page":"110529","DOI":"10.1016\/j.knosys.2023.110529","volume":"270","author":"S Kumar","year":"2023","unstructured":"Kumar, S. et al. A two-archive multi-objective multi-verse optimizer for truss design. Knowl. Based Syst.270, 110529 (2023).","journal-title":"Knowl. Based Syst."},{"key":"74432_CR19","doi-asserted-by":"publisher","first-page":"e0308474","DOI":"10.1371\/journal.pone.0308474","volume":"19","author":"N Mashru","year":"2024","unstructured":"Mashru, N., Tejani, G. G., Patel, P. & Khishe, M. Optimal truss design with MOHO: a multi-objective optimization perspective. Plos One. 19, e0308474 (2024).","journal-title":"Plos One"},{"key":"74432_CR20","first-page":"1","volume-title":"Optimization of truss structures using multi-objective cheetah optimizer","author":"S Kumar","year":"2024","unstructured":"Kumar, S. et al. Optimization of Truss Structures Using multi-objective Cheetah Optimizer1\u201322 (Mechanics Based Design of Structures and Machines, 2024)."},{"key":"74432_CR21","volume-title":"Handbook of metaheuristics)","author":"F Focacci","year":"2003","unstructured":"Focacci, F., Laburthe, F. & Lodi, A. Local search and constraint programming. In: Handbook of Metaheuristics). Springer (2003)."},{"key":"74432_CR22","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. Transport. Sci.40, 455\u2013472 (2006).","journal-title":"Transport. Sci."},{"key":"74432_CR23","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1108\/IJICC-01-2022-0021","volume":"16","author":"Z Ayd\u0131nalp","year":"2023","unstructured":"Ayd\u0131nalp, Z. & \u00d6zgen, D. Solving vehicle routing problem with time windows using metaheuristic approaches. Int. J. Intell. Comput. Cybernetics. 16, 121\u2013138 (2023).","journal-title":"Int. J. Intell. Comput. Cybernetics"},{"key":"74432_CR24","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.trb.2020.11.012","volume":"144","author":"D Dumez","year":"2021","unstructured":"Dumez, D., Lehu\u00e9d\u00e9, F. & P\u00e9ton, O. A large neighborhood search approach to the vehicle routing problem with delivery options. Transp. Res. Part. B: Methodological. 144, 103\u2013132 (2021).","journal-title":"Transp. Res. Part. B: Methodological"},{"key":"74432_CR25","first-page":"1555","volume":"62","author":"SR Zeebaree","year":"2020","unstructured":"Zeebaree, S. R. et al. Characteristics and analysis of hadoop distributed systems. Technol. Rep. Kansai Univ.62, 1555\u20131564 (2020).","journal-title":"Technol. Rep. Kansai Univ."},{"key":"74432_CR26","doi-asserted-by":"crossref","unstructured":"Esmaeilzadeh, A. et al. Efficient large scale nlp feature engineering with apache spark. In: 2022 IEEE 12th Annual Computing and Communication and (CCWC)). IEEE (2022).","DOI":"10.1109\/CCWC54503.2022.9720765"},{"key":"74432_CR27","doi-asserted-by":"publisher","first-page":"669","DOI":"10.13053\/cys-24-2-3401","volume":"24","author":"S Ketu","year":"2020","unstructured":"Ketu, S., Mishra, P. K. & Agarwal, S. Performance analysis of distributed computing frameworks for big data analytics: hadoop vs spark. Computaci\u00f3n Y Sistemas. 24, 669\u2013686 (2020).","journal-title":"Computaci\u00f3n Y Sistemas"},{"key":"74432_CR28","unstructured":"Chambers, B. & Spark, M. Z. The Definitive Guide, Big Data Processing Made Simple.). Published by O\u2019Reilly Media (2018)."},{"key":"74432_CR29","doi-asserted-by":"publisher","first-page":"550","DOI":"10.26599\/TST.2018.9010022","volume":"23","author":"J Tang","year":"2018","unstructured":"Tang, J., Xu, M., Fu, S. & Huang, K. A scheduling optimization technique based on reuse in spark to defend against apt attack. Tsinghua Sci. Technol.23, 550\u2013560 (2018).","journal-title":"Tsinghua Sci. Technol."},{"key":"74432_CR30","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.procs.2018.08.244","volume":"136","author":"KK Hidri","year":"2018","unstructured":"Hidri, K. K., Bilas, A. & Kozanitis, C. HetSpark: a framework that provides heterogeneous executors to Apache Spark. Procedia Comput. Sci.136, 118\u2013127 (2018).","journal-title":"Procedia Comput. Sci."},{"key":"74432_CR31","unstructured":"Maqbool, F., Razzaq, S., Lehmann, J. & Jabeen, H. Scalable distributed genetic algorithm using apache spark (s-ga). In: Intelligent Computing Theories and Application: 15th International Conference, ICIC 2019, Nanchang, China, August 3\u20136, 2019, Proceedings, Part I 15). Springer (2019)."},{"key":"74432_CR32","doi-asserted-by":"publisher","first-page":"19522","DOI":"10.1007\/s11227-022-04627-9","volume":"78","author":"D Teijeiro","year":"2022","unstructured":"Teijeiro, D. et al. Land consolidation through parcel exchange among landowners using a distributed spark-based genetic algorithm. J. Supercomputing. 78, 19522\u201319544 (2022).","journal-title":"J. Supercomputing"},{"key":"74432_CR33","doi-asserted-by":"publisher","first-page":"6185","DOI":"10.1109\/ACCESS.2022.3233786","volume":"11","author":"RA Alhenawi Ea, Khurma","year":"2023","unstructured":"Alhenawi Ea, Khurma, R. A., Sharieh, A. A., Al-Adwan, O., Al Shorman, A. & Shannaq, F. Parallel ant colony optimization algorithm for finding the shortest path for mountain climbing. IEEE Access.11, 6185\u20136196 (2023).","journal-title":"IEEE Access."},{"key":"74432_CR34","doi-asserted-by":"publisher","first-page":"2021","DOI":"10.1007\/s10586-020-03162-7","volume":"23","author":"M AlJame","year":"2020","unstructured":"AlJame, M., Ahmad, I. & Alfailakawi, M. Apache spark implementation of whale optimization algorithm. Cluster Comput.23, 2021\u20132034 (2020).","journal-title":"Cluster Comput."},{"key":"74432_CR35","doi-asserted-by":"publisher","first-page":"e4429","DOI":"10.1002\/cpe.4429","volume":"30","author":"Z Wang","year":"2018","unstructured":"Wang, Z., Zhao, Y., Liu, Y. & Lv, C. A speculative parallel simulated annealing algorithm based on Apache Spark. Concurr Comput: Pract Exper30, e4429 (2018).","journal-title":"Concurr Comput: Pract Exper"},{"key":"74432_CR36","doi-asserted-by":"publisher","first-page":"10796","DOI":"10.1038\/s41598-024-61578-2","volume":"14","author":"H Guo","year":"2024","unstructured":"Guo, H., Wang, J., Sun, J. & Mao, X. Multi-objective green vehicle scheduling problem considering time window and emission factors in ship block transportation. Sci. Rep.14, 10796 (2024).","journal-title":"Sci. Rep."},{"key":"74432_CR37","doi-asserted-by":"publisher","first-page":"107054","DOI":"10.1016\/j.asoc.2020.107054","volume":"101","author":"R Durgut","year":"2021","unstructured":"Durgut, R. & Aydin, M. E. Adaptive binary artificial bee colony algorithm. Appl. Soft Comput.101, 107054 (2021).","journal-title":"Appl. Soft Comput."},{"key":"74432_CR38","doi-asserted-by":"publisher","first-page":"119956","DOI":"10.1016\/j.eswa.2023.119956","volume":"224","author":"E Sonu\u00e7","year":"2023","unstructured":"Sonu\u00e7, E. & \u00d6zcan, E. An adaptive parallel evolutionary algorithm for solving the uncapacitated facility location problem. Expert Syst. Appl.224, 119956 (2023).","journal-title":"Expert Syst. Appl."},{"key":"74432_CR39","doi-asserted-by":"publisher","first-page":"110022","DOI":"10.1016\/j.cie.2024.110022","volume":"190","author":"M Huang","year":"2024","unstructured":"Huang, M., Liu, M. & Kuang, H. Vehicle routing problem for fresh products distribution considering customer satisfaction through adaptive large neighborhood search. Comput. Ind. Eng.190, 110022 (2024).","journal-title":"Comput. Ind. Eng."},{"key":"74432_CR40","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke, G. & Wright, J. W. Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res.12, 568\u2013581 (1964).","journal-title":"Oper. Res."},{"key":"74432_CR41","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1214\/ss\/1177011077","volume":"8","author":"D Bertsimas","year":"1993","unstructured":"Bertsimas, D. & Tsitsiklis, J. Simulated annealing. Stat. Sci.8, 10\u201315 (1993).","journal-title":"Stat. Sci."},{"key":"74432_CR42","doi-asserted-by":"crossref","unstructured":"Vakil-Baghmisheh, M-T. & Navarbaf, A. A modified very fast simulated annealing algorithm. In: 2008 International Symposium on Telecommunications). IEEE (2008).","DOI":"10.1109\/ISTEL.2008.4651272"},{"key":"74432_CR43","doi-asserted-by":"crossref","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). IEEE Access. 12, 36974\u201336989 (2024).","DOI":"10.1109\/ACCESS.2024.3373699"},{"key":"74432_CR44","doi-asserted-by":"publisher","first-page":"93882","DOI":"10.1109\/ACCESS.2020.2984660","volume":"8","author":"Y Shen","year":"2020","unstructured":"Shen, Y., Liu, M., Yang, J., Shi, Y. & Middendorf, M. A hybrid swarm intelligence algorithm for vehicle routing problem with time windows. Ieee Access.8, 93882\u201393893 (2020).","journal-title":"Ieee Access."},{"key":"74432_CR45","doi-asserted-by":"crossref","unstructured":"Karouani, Y., Elhoussaine, Z. & Vision, C. Efficient spark-based framework for solving the traveling salesman problem using a distributed swarm intelligence method. In: International Conference on Intelligent Systems and (ISCV)). IEEE (2018). (2018).","DOI":"10.1109\/ISACV.2018.8354075"},{"key":"74432_CR46","doi-asserted-by":"crossref","unstructured":"El Fahim, H. A Cooperative Parallel Tabu Search Meta-heuristic for the Vehicle Routing Problem with Time Windows. (2022).","DOI":"10.20944\/preprints202206.0074.v1"},{"key":"74432_CR47","doi-asserted-by":"crossref","unstructured":"Blocho, M. & Czech, Z. J. A parallel EAX-based algorithm for minimizing the number of routes in the vehicle routing problem with time windows. In: 2012 IEEE 14th International Conference on High Performance Computing and Communication & 2012 IEEE 9th International Conference on Embedded Software and Systems). IEEE (2012).","DOI":"10.1109\/HPCC.2012.182"}],"container-title":["Scientific Reports"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41598-024-74432-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-024-74432-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-024-74432-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T08:07:27Z","timestamp":1728893247000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41598-024-74432-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,11]]},"references-count":47,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["74432"],"URL":"https:\/\/doi.org\/10.1038\/s41598-024-74432-2","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-4610138\/v1","asserted-by":"object"}]},"ISSN":["2045-2322"],"issn-type":[{"value":"2045-2322","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,11]]},"assertion":[{"value":"20 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2024","order":3,"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"}}],"article-number":"23809"}}