{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T09:11:09Z","timestamp":1765357869917,"version":"3.44.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T00:00:00Z","timestamp":1755648000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T00:00:00Z","timestamp":1755648000000},"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":["U21A20512","62372001","62202006","62106002"],"award-info":[{"award-number":["U21A20512","62372001","62202006","62106002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s40747-025-02044-y","type":"journal-article","created":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T07:45:01Z","timestamp":1755675901000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A multiobjective evolutionary algorithm incorporating neighborhood detection for the vehicle routing problem with soft time windows"],"prefix":"10.1007","volume":"11","author":[{"given":"Hao","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Zhiwei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Chao","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xiaoshu","family":"Xiang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,20]]},"reference":[{"key":"2044_CR1","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.eswa.2019.113151","volume":"145","author":"W Zhang","year":"2020","unstructured":"Zhang W, Yang D, Zhang G, Gen M (2020) Hybrid multiobjective evolutionary algorithm with fast sampling strategy-based global search and route sequence difference-based local search for vrptw. Expert Syst Appl 145:113\u2013151","journal-title":"Expert Syst Appl"},{"issue":"1","key":"2044_CR2","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.cor.2010.05.004","volume":"38","author":"A Garcia-Najera","year":"2011","unstructured":"Garcia-Najera A, Bullinaria JA (2011) An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows. Comput Oper Res 38(1):287\u2013300","journal-title":"Comput Oper Res"},{"key":"2044_CR3","doi-asserted-by":"publisher","first-page":"1248","DOI":"10.1177\/0954405415586608","volume":"231","author":"V Sivaramkumar","year":"2017","unstructured":"Sivaramkumar V, Thansekhar M, Saravanan R, Miruna Joe Amali S (2017) Multi-objective vehicle routing problem with time windows: improving customer satisfaction by considering gap time. Proc Inst Mech Eng Part B J Eng Manuf 231:1248\u20131263","journal-title":"Proc Inst Mech Eng Part B J Eng Manuf"},{"issue":"1","key":"2044_CR4","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/TEVC.2020.3004012","volume":"25","author":"Y Tian","year":"2020","unstructured":"Tian Y, Zhang T, Xiao J, Zhang X, Jin Y (2020) A coevolutionary framework for constrained multiobjective optimization problems. IEEE Trans Evol Comput 25(1):102\u2013116","journal-title":"IEEE Trans Evol Comput"},{"key":"2044_CR5","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s11067-019-09492-3","volume":"20","author":"A Karoonsoontawong","year":"2020","unstructured":"Karoonsoontawong A, Punyim P, Nueangnitnaraporn W, Ratanavaraha V (2020) Multi-trip time-dependent vehicle routing problem with soft time windows and overtime constraints. Netw Spat Econ 20:549\u2013598","journal-title":"Netw Spat Econ"},{"key":"2044_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101201","volume":"75","author":"MS Sarbijan","year":"2022","unstructured":"Sarbijan MS, Behnamian J (2022) Real-time collaborative feeder vehicle routing problem with flexible time windows. Swarm Evol Comput 75:101201","journal-title":"Swarm Evol Comput"},{"key":"2044_CR7","doi-asserted-by":"crossref","unstructured":"Mao Y, Li J, Tang N (2023) A cluster-based multiobjective optimization algorithm for VRPSTW with salary balance. In: Proceedings of the companion conference on genetic and evolutionary computation, pp 391\u2013394","DOI":"10.1145\/3583133.3590589"},{"key":"2044_CR8","doi-asserted-by":"crossref","unstructured":"Urquhart N (2022) Solving problems that have multiple solution characteristics. In: Nature inspired optimisation for delivery problems: from theory to the real world. Springer, Berlin, pp 83\u2013112","DOI":"10.1007\/978-3-030-98108-2_5"},{"key":"2044_CR9","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2025.3581316","author":"H Jiang","year":"2025","unstructured":"Jiang H, Ai C, Wang C, Xiang X, Zhang X (2025) A surrogate-assisted bi-level evolutionary algorithm for multi-depot vehicle routing problems with uncertain demand. IEEE Trans Intell Transport Syst. https:\/\/doi.org\/10.1109\/TITS.2025.3581316","journal-title":"IEEE Trans Intell Transport Syst"},{"key":"2044_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.106016","volume":"149","author":"SN Bezerra","year":"2023","unstructured":"Bezerra SN, Souza MJF, de Souza SR (2023) A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction. Comput Oper Res 149:106016","journal-title":"Comput Oper Res"},{"issue":"1","key":"2044_CR11","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MCI.2020.3039066","volume":"16","author":"KC Tan","year":"2021","unstructured":"Tan KC, Feng L, Jiang M (2021) Evolutionary transfer optimization\u2014a new frontier in evolutionary computation research. IEEE Comput Intell Mag 16(1):22\u201333","journal-title":"IEEE Comput Intell Mag"},{"key":"2044_CR12","doi-asserted-by":"crossref","unstructured":"May AT, Jariyavajee C, Polvichai J (2021) An improved genetic algorithm for vehicle routing problem with hard time windows. In: 2021 International conference on electrical, computer and energy technologies (ICECET). IEEE, pp 1\u20136","DOI":"10.1109\/ICECET52533.2021.9698698"},{"key":"2044_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2023.128451","volume":"611","author":"K Zhang","year":"2023","unstructured":"Zhang K, Lin X, Li M (2023) Graph attention reinforcement learning with flexible matching policies for multi-depot vehicle routing problems. Phys A Stat Mech Appl 611:128451","journal-title":"Phys A Stat Mech Appl"},{"key":"2044_CR14","doi-asserted-by":"publisher","first-page":"1981","DOI":"10.1007\/s11590-021-01833-x","volume":"17","author":"LDP Pugliese","year":"2023","unstructured":"Pugliese LDP, Ferone D, Festa P, Guerriero F, Macrina G (2023) Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping. Optim Lett 17:1981\u20132003","journal-title":"Optim Lett"},{"issue":"1","key":"2044_CR15","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1287\/ijoc.2022.1195","volume":"35","author":"Y Liu","year":"2023","unstructured":"Liu Y, Yu Y, Zhang Y, Baldacci R, Tang J, Luo X, Sun W (2023) Branch-cut-and-price for the time-dependent green vehicle routing problem with time windows. INFORMS J Comput 35(1):14\u201330","journal-title":"INFORMS J Comput"},{"issue":"2","key":"2044_CR16","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1287\/ijoc.2021.1105","volume":"34","author":"M Yu","year":"2022","unstructured":"Yu M, Nagarajan V, Shen S (2022) Improving column generation for vehicle routing problems via random coloring and parallelization. INFORMS J Comput 34(2):953\u2013973","journal-title":"INFORMS J Comput"},{"issue":"5","key":"2044_CR17","first-page":"2241","volume":"34","author":"CT Merve","year":"2024","unstructured":"Merve CT (2024) A fuzzy multi-criteria approach based on Clarke and Wright savings algorithm for vehicle routing problem in humanitarian aid distribution. J Intell Manuf 34(5):2241\u20132261","journal-title":"J Intell Manuf"},{"key":"2044_CR18","doi-asserted-by":"crossref","unstructured":"Zhou Q, Zheng H, Wang S, Hao J, He R, Sun Z, Wang X, Wang L (2020) Two fast heuristics for online order dispatching. In: Proceedings of the 2020 IEEE congress on evolutionary computation (CEC). IEEE, pp 1\u20138","DOI":"10.1109\/CEC48606.2020.9185791"},{"issue":"7","key":"2044_CR19","doi-asserted-by":"publisher","first-page":"8148","DOI":"10.1109\/TITS.2024.3386457","volume":"25","author":"VG Pereira","year":"2024","unstructured":"Pereira VG, Alves-Junior OC, Baldo F (2024) An approach to solve the heterogeneous fixed fleet vehicle routing problem with time window based on adaptive large neighborhood search meta-heuristic. IEEE Trans Intell Transp Syst 25(7):8148\u20138157","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"2044_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2021.104606","volume":"109","author":"K-W Jie","year":"2022","unstructured":"Jie K-W, Liu S-Y, Sun X-J (2022) A hybrid algorithm for time-dependent vehicle routing problem with soft time windows and stochastic factors. Eng Appl Artif Intell 109:104606","journal-title":"Eng Appl Artif Intell"},{"issue":"2","key":"2044_CR21","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 (2024) Reinforcement learning for solving multiple vehicle routing problem with time window. ACM Trans Intell Syst Technol 15(2):1\u201319","journal-title":"ACM Trans Intell Syst Technol"},{"issue":"10","key":"2044_CR22","doi-asserted-by":"publisher","first-page":"18603","DOI":"10.1109\/TITS.2022.3163263","volume":"23","author":"J-F Chen","year":"2022","unstructured":"Chen J-F, Wang L, Ren H, Pan J, Wang S, Zheng J, Wang X (2022) An imitation learning-enhanced iterated matching algorithm for on-demand food delivery. IEEE Trans Intell Transport Syst 23(10):18603\u201318619","journal-title":"IEEE Trans Intell Transport Syst"},{"issue":"7","key":"2044_CR23","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1109\/JAS.2022.105677","volume":"9","author":"B Li","year":"2022","unstructured":"Li B, Wu G, He Y, Fan M, Pedrycz W (2022) An overview and experimental study of learning-based optimization algorithms for the vehicle routing problem. IEEE\/CAA J Autom Sin 9(7):1115\u20131138","journal-title":"IEEE\/CAA J Autom Sin"},{"issue":"12","key":"2044_CR24","doi-asserted-by":"publisher","first-page":"13930","DOI":"10.1109\/TITS.2023.3308593","volume":"24","author":"J Li","year":"2023","unstructured":"Li J, Liu R, Wang R (2023) Elastic strategy-based adaptive genetic algorithm for solving dynamic vehicle routing problem with time windows. IEEE Trans Intell Transport Syst 24(12):13930\u201313947","journal-title":"IEEE Trans Intell Transport Syst"},{"key":"2044_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109922","volume":"133","author":"Y Wang","year":"2023","unstructured":"Wang Y, Wei Y, Wang X, Wang Z, Wang H (2023) A clustering-based extended genetic algorithm for the multidepot vehicle routing problem with time windows and three-dimensional loading constraints. Appl Soft Comput 133:109922","journal-title":"Appl Soft Comput"},{"key":"2044_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2024.111789","volume":"161","author":"Y Su","year":"2024","unstructured":"Su Y, Zhang S, Zhang C (2024) A lightweight genetic algorithm with variable neighborhood search for multi-depot vehicle routing problem with time windows. Appl Soft Comput 161:111789","journal-title":"Appl Soft Comput"},{"issue":"3","key":"2044_CR27","doi-asserted-by":"publisher","first-page":"4344","DOI":"10.1109\/JSYST.2020.2966788","volume":"14","author":"P Jiang","year":"2020","unstructured":"Jiang P, Men J, Xu H, Zheng S, Kong Y, Zhang L (2020) A variable neighborhood search-based hybrid multiobjective evolutionary algorithm for hazmat heterogeneous vehicle routing problem with time windows. IEEE Syst J 14(3):4344\u20134355","journal-title":"IEEE Syst J"},{"issue":"7","key":"2044_CR28","doi-asserted-by":"publisher","first-page":"2467","DOI":"10.1109\/TCYB.2018.2821180","volume":"49","author":"J Wang","year":"2019","unstructured":"Wang J, Weng T, Zhang Q (2019) A two-stage multiobjective evolutionary algorithm for multiobjective multidepot vehicle routing problem with time windows. IEEE Trans Cybern 49(7):2467\u20132478","journal-title":"IEEE Trans Cybern"},{"key":"2044_CR29","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 (2024) A neighborhood comprehensive learning particle swarm optimization for the vehicle routing problem with time windows. Swarm Evol Comput 84:101425","journal-title":"Swarm Evol Comput"},{"key":"2044_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108431","volume":"117","author":"H Jiang","year":"2022","unstructured":"Jiang H, Lu M, Tian Y, Qiu J, Zhang X (2022) An evolutionary algorithm for solving capacitated vehicle routing problems by using local information. Appl Soft Comput 117:108431","journal-title":"Appl Soft Comput"},{"issue":"1\u20133","key":"2044_CR31","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.neucom.2006.07.008","volume":"70","author":"HG Santos","year":"2006","unstructured":"Santos HG, Ochi LS, Marinho EH, Drummond LM (2006) Combining an evolutionary algorithm with data mining to solve a single-vehicle routing problem. Neurocomputing 70(1\u20133):70\u201377","journal-title":"Neurocomputing"},{"issue":"6","key":"2044_CR32","doi-asserted-by":"publisher","first-page":"5275","DOI":"10.1109\/TITS.2021.3052834","volume":"23","author":"X Xiang","year":"2021","unstructured":"Xiang X, Tian Y, Zhang X, Xiao J, Jin Y (2021) A pairwise proximity learning-based ant colony algorithm for dynamic vehicle routing problems. IEEE Trans Intell Transp Syst 23(6):5275\u20135286","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"2044_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101730","volume":"91","author":"X Guo","year":"2024","unstructured":"Guo X, Miao Z-H, Pan Q-K, He X (2024) Hybrid loading situation vehicle routing problem in the context of agricultural harvesting: a reconstructed MOEA\/D with parallel populations. Swarm Evol Comput 91:101730","journal-title":"Swarm Evol Comput"},{"issue":"9","key":"2044_CR34","doi-asserted-by":"publisher","first-page":"9163","DOI":"10.1007\/s10668-022-02429-w","volume":"25","author":"A Heidari","year":"2023","unstructured":"Heidari A, Imani DM, Khalilzadeh M, Sarbazvatan M (2023) Green two-echelon closed and open location-routing problem: application of NSGA-II and MOGWO metaheuristic approaches. Environ Dev Sustain 25(9):9163\u20139199","journal-title":"Environ Dev Sustain"},{"key":"2044_CR35","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic N, Hansen P (1997) Algorithms for the vehicle routing and scheduling problems with time window constraints. Comput Oper Res 24:1097-1100","journal-title":"Comput Oper Res"},{"key":"2044_CR36","unstructured":"Gehring H, Homberger J (2001) A parallel two-phase metaheuristic for routing problems with time windows. Asia-Pac J Oper Res 18(1)"},{"issue":"7","key":"2044_CR37","doi-asserted-by":"publisher","first-page":"2467","DOI":"10.1109\/TCYB.2018.2821180","volume":"49","author":"J Wang","year":"2018","unstructured":"Wang J, Weng T, Zhang Q (2018) A two-stage multiobjective evolutionary algorithm for multiobjective multidepot vehicle routing problem with time windows. IEEE Trans Cybern 49(7):2467\u20132478","journal-title":"IEEE Trans Cybern"},{"key":"2044_CR38","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.ins.2022.06.056","volume":"608","author":"R Qi","year":"2022","unstructured":"Qi R, Li J-Q, Wang J, Jin H, Han Y-Y (2022) QMOEA: a Q-learning-based multiobjective evolutionary algorithm for solving time-dependent green vehicle routing problems with time windows. Inf Sci 608:178\u2013201","journal-title":"Inf Sci"},{"key":"2044_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.107957","volume":"116","author":"F Arnold","year":"2021","unstructured":"Arnold F, Santana \u00cd, S\u00f6rensen K, Vidal T (2021) PILS: exploring high-order neighborhoods by pattern mining and injection. Pattern Recogn 116:107957","journal-title":"Pattern Recogn"},{"key":"2044_CR40","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 (2025) A genetic algorithm for vehicle routing problems with time windows based on cluster of geographic positions and time windows. Appl Soft Comput 169:112593","journal-title":"Appl Soft Comput"}],"container-title":["Complex & Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-02044-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-025-02044-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-02044-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T13:33:40Z","timestamp":1758807220000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-025-02044-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,20]]},"references-count":40,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["2044"],"URL":"https:\/\/doi.org\/10.1007\/s40747-025-02044-y","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"type":"print","value":"2199-4536"},{"type":"electronic","value":"2198-6053"}],"subject":[],"published":{"date-parts":[[2025,8,20]]},"assertion":[{"value":"13 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"419"}}