{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T10:09:34Z","timestamp":1763978974947,"version":"3.45.0"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T00:00:00Z","timestamp":1758499200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T00:00:00Z","timestamp":1758499200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72271051","72021002","72071144"],"award-info":[{"award-number":["72271051","72021002","72071144"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["Grant No.2232018H-07"],"award-info":[{"award-number":["Grant No.2232018H-07"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s12351-025-00922-4","type":"journal-article","created":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T08:24:27Z","timestamp":1758529467000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A practical d-relaxed priority rule for balancing cost and quality in fresh food delivery: Bi-objective optimization with time-dependent travel speed"],"prefix":"10.1007","volume":"25","author":[{"given":"Feifeng","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenxiang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,22]]},"reference":[{"issue":"2","key":"922_CR1","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.ejor.2020.11.016","volume":"292","author":"C Audet","year":"2021","unstructured":"Audet C, Bigeon J, Cartier D, Le Digabel S, Salomon L (2021) Performance indicators in multiobjective optimization. Eur J Oper Res 292(2):397\u2013422","journal-title":"Eur J Oper Res"},{"key":"922_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105253","volume":"131","author":"S Allahyari","year":"2021","unstructured":"Allahyari S, Yaghoubi S, Van Woensel T (2021) The secure time-dependent vehicle routing problem with uncertain demands. Comput Oper Res 131:105253","journal-title":"Comput Oper Res"},{"key":"922_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100601","volume":"51","author":"LP Cota","year":"2019","unstructured":"Cota LP, Guimar\u00e3es FG, Ribeiro RG, Meneghini IR, De Oliveira FB, Souza MJF, Siarry P (2019) An adaptive multi-objective algorithm based on decomposition and large neighborhood search for a green machine scheduling problem. Swarm Evol Comput 51:100601","journal-title":"Swarm Evol Comput"},{"key":"922_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1007\/978-3-540-24694-7_71","volume-title":"MICAI 2004: Advances in Artificial Intelligence","author":"CAC Coello","year":"2004","unstructured":"Coello CAC, Sierra MR (2004) A study of the parallelization of a coevolutionary multi-objective evolutionary algorithm. In: Monroy R, Arroyo Figueroa G, Sucar LE, Sossa H (eds) MICAI 2004: Advances in Artificial Intelligence, vol 2972. Lecture Notes in Computer Science. Springer, Berlin, Heidelberg, pp 688\u2013697"},{"key":"922_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.106375","volume":"123","author":"SE Comert","year":"2023","unstructured":"Comert SE, Yazgan HR (2023) A new approach based on hybrid ant colony optimization-artificial bee colony algorithm for multi-objective electric vehicle routing problems. Eng Appl Artif Intell 123:106375","journal-title":"Eng Appl Artif Intell"},{"issue":"10","key":"922_CR6","doi-asserted-by":"publisher","first-page":"14830","DOI":"10.1109\/TITS.2024.3398781","volume":"25","author":"J Cai","year":"2024","unstructured":"Cai J, Zhu Q, Lin Q, Ming Z, Tan KC (2024) Decomposition-based multiobjective evolutionary optimization with tabu search for dynamic pickup and delivery problems. IEEE Trans Intell Transp Syst 25(10):14830\u201314843","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"1","key":"922_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garc\u00eda S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3\u201318","journal-title":"Swarm Evol Comput"},{"key":"922_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-023-05796-3","author":"G Du","year":"2024","unstructured":"Du G, Li W (2024) Multi-objective home healthcare routing and scheduling problem based on sustainability and \u201cphysician-patient\u2019\u2019 satisfaction. Ann Oper Res. https:\/\/doi.org\/10.1007\/s10479-023-05796-3","journal-title":"Ann Oper Res"},{"issue":"2","key":"922_CR9","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1287\/trsc.2022.1167","volume":"57","author":"F Deng","year":"2023","unstructured":"Deng F, Qin H, Li J, Cheng C (2023) The pickup and delivery problem with time windows and incompatibility constraints in cold chain transportation. Transp Sci 57(2):444\u2013462","journal-title":"Transp Sci"},{"key":"922_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107848","volume":"163","author":"C Fikar","year":"2022","unstructured":"Fikar C, Braekers K (2022) Bi-objective optimization of e-grocery deliveries considering food quality losses. Comput Ind Eng 163:107848","journal-title":"Comput Ind Eng"},{"key":"922_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105491","volume":"137","author":"C Friedrich","year":"2022","unstructured":"Friedrich C, Elbert R (2022) Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics. Comput Oper Res 137:105491","journal-title":"Comput Oper Res"},{"issue":"2","key":"922_CR12","doi-asserted-by":"publisher","first-page":"1706","DOI":"10.1109\/TITS.2023.3315785","volume":"25","author":"Y Fu","year":"2023","unstructured":"Fu Y, Ma X, Gao K, Li Z, Dong H (2023) Multi-objective home health care routing and scheduling with sharing service via a problem-specific knowledge-based artificial bee colony algorithm. IEEE Trans Intell Transp Syst 25(2):1706\u20131719","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"922_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105943","volume":"147","author":"G Ghiani","year":"2022","unstructured":"Ghiani G, Manni A, Manni E (2022) A scalable anticipatory policy for the dynamic pickup and delivery problem. Comput Oper Res 147:105943","journal-title":"Comput Oper Res"},{"key":"922_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.122121","volume":"238","author":"H Gitinavard","year":"2024","unstructured":"Gitinavard H, Mohagheghi V, Mousavi SM, Makui A (2024) A new bi-stage interactive possibilistic programming model for perishable logistics distribution systems under uncertainty. Expert Syst Appl 238:122121","journal-title":"Expert Syst Appl"},{"key":"922_CR15","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"},{"key":"922_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2023.103095","volume":"173","author":"F Guo","year":"2023","unstructured":"Guo F, Wei Q, Wang M, Guo Z, Wallace SW (2023) Deep attention models with dimension-reduction and gate mechanisms for solving practical time-dependent vehicle routing problems. Transp Res Part E: Logist Transp Rev 173:103095","journal-title":"Transp Res Part E: Logist Transp Rev"},{"key":"922_CR17","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1016\/j.swevo.2018.08.012","volume":"44","author":"SF Ghannadpour","year":"2019","unstructured":"Ghannadpour SF, Zarrabi A (2019) Multi-objective heterogeneous vehicle routing and scheduling problem with energy minimizing. Swarm Evol Comput 44:728\u2013747","journal-title":"Swarm Evol Comput"},{"key":"922_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106346","volume":"159","author":"M Huang","year":"2023","unstructured":"Huang M, Du B, Guo J (2023) A hybrid collaborative framework for integrated production scheduling and vehicle routing problem with batch manufacturing and soft time windows. Comput Oper Res 159:106346","journal-title":"Comput Oper Res"},{"issue":"11","key":"922_CR19","doi-asserted-by":"publisher","first-page":"2959","DOI":"10.1016\/j.cor.2004.04.013","volume":"32","author":"A Haghani","year":"2005","unstructured":"Haghani A, Jung S (2005) A dynamic vehicle routing problem with time-dependent travel times. Comput Oper Res 32(11):2959\u20132986","journal-title":"Comput Oper Res"},{"issue":"2","key":"922_CR20","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0377-2217(02)00147-9","volume":"144","author":"S Ichoua","year":"2003","unstructured":"Ichoua S, Gendreau M, Potvin J-Y (2003) Vehicle dispatching with time-dependent travel times. Eur J Oper Res 144(2):379\u2013396","journal-title":"Eur J Oper Res"},{"key":"922_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109128","volume":"125","author":"T-S Khoo","year":"2022","unstructured":"Khoo T-S, Bonab MB (2022) Solving multi-objective pickup and delivery with time windows using mediocre evolutionary distributed microservices re-optimization algorithm. Appl Soft Comput 125:109128","journal-title":"Appl Soft Comput"},{"issue":"1","key":"922_CR22","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10479-021-04191-0","volume":"309","author":"K Khalili-Damghani","year":"2022","unstructured":"Khalili-Damghani K, Tavana M, Ghasemi P (2022) A stochastic bi-objective simulation-optimization model for cascade disaster location-allocation-distribution problems. Ann Oper Res 309(1):103\u2013141","journal-title":"Ann Oper Res"},{"key":"922_CR23","first-page":"1","volume":"2021","author":"A Kohar","year":"2021","unstructured":"Kohar A, Jakhar SK (2021) A capacitated multi pickup online food delivery problem with time windows: a branch-and-cut algorithm. Ann Oper Res 2021:1\u201322","journal-title":"Ann Oper Res"},{"issue":"3","key":"922_CR24","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1109\/TITS.2018.2835145","volume":"20","author":"Y Li","year":"2019","unstructured":"Li Y, Chu F, Feng C, Chu C, Zhou M (2019) Integrated production inventory routing planning for intelligent food logistics systems. IEEE Trans Intell Transp Syst 20(3):867\u2013878","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"922_CR25","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2024.3421949","author":"X Liang","year":"2024","unstructured":"Liang X, Chen H, Wang N, Zhang M (2024) Bi-objective vehicle routing for perishable products delivery with consideration of customers\u2019 priorities and customized delivery time windows. IEEE Trans Intell Transp Syst. https:\/\/doi.org\/10.1109\/TITS.2024.3421949","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"922_CR26","doi-asserted-by":"crossref","unstructured":"Luo Z, Gu R, Poon M, Liu Z, Lim A (2022) A last-mile drone-assisted one-to-one pickup and delivery problem with multi-visit drone trips. Comput Oper Res 148","DOI":"10.1016\/j.cor.2022.106015"},{"key":"922_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105912","volume":"146","author":"H Liu","year":"2022","unstructured":"Liu H, Sun Y, Pan N, Li Y, An Y, Pan D (2022) Study on the optimization of urban emergency supplies distribution paths for epidemic outbreaks. Comput Oper Res 146:105912","journal-title":"Comput Oper Res"},{"key":"922_CR28","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s10479-022-04816-y","volume":"319","author":"Y Lu","year":"2022","unstructured":"Lu Y, Yang C, Yang J (2022) A multi-objective humanitarian pickup and delivery vehicle routing problem with drones. Ann Oper Res 319:291\u2013353","journal-title":"Ann Oper Res"},{"issue":"2","key":"922_CR29","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TEVC.2008.925798","volume":"13","author":"H Li","year":"2009","unstructured":"Li H, Zhang Q (2009) Multiobjective optimization problems with complicated pareto sets, moea\/d and nsga-ii. IEEE Trans Evol Comput 13(2):284\u2013302","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"922_CR30","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1287\/trsc.26.3.185","volume":"26","author":"C Malandraki","year":"1992","unstructured":"Malandraki C, Daskin MS (1992) Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms. Transp Sci 26(3):185\u2013200","journal-title":"Transp Sci"},{"key":"922_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2024.103454","volume":"183","author":"A Maleki","year":"2024","unstructured":"Maleki A, Hemmati V, Reza Abazari S, Aghsami A, Rabbani M (2024) Optimal distribution and waste management of covid-19 vaccines from vaccination centers\u2019 satisfaction perspective - a fuzzy time window-based vrp. Transp Res Part E: Logist Transp Rev 183:103454","journal-title":"Transp Res Part E: Logist Transp Rev"},{"key":"922_CR32","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.apm.2022.09.020","volume":"113","author":"B Ma","year":"2023","unstructured":"Ma B, Hu D, Wang Y, Sun Q, He L, Chen X (2023) Time-dependent vehicle routing problem with departure time and speed optimization for shared autonomous electric vehicle service. Appl Math Model 113:333\u2013357","journal-title":"Appl Math Model"},{"key":"922_CR33","unstructured":"Margiotta B, Short J, Richard E (2015) Freight Performance Measure Approaches for Bottlenecks, Arterials, and Linking Volumes to Congestion Report. Technical Report FHWA-HOP-15-033 . https:\/\/rosap.ntl.bts.gov\/view\/dot\/41268"},{"key":"922_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2023.103296","volume":"179","author":"L Meng","year":"2023","unstructured":"Meng L, Wang X, He J, Han C, Hu S (2023) A two-stage chance constrained stochastic programming model for emergency supply distribution considering dynamic uncertainty. Trans Res Part E: Logist Transp Rev 179:103296","journal-title":"Trans Res Part E: Logist Transp Rev"},{"key":"922_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108722","volume":"174","author":"D Nuraiman","year":"2022","unstructured":"Nuraiman D, Ozlen M (2022) A decomposition approach for the prioritised home health care problem with synchronised visits and multi-period planning. Comput Ind Eng 174:108722","journal-title":"Comput Ind Eng"},{"key":"922_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.105829","volume":"119","author":"N Oladzad-Abbasabady","year":"2023","unstructured":"Oladzad-Abbasabady N, Tavakkoli-Moghaddam R, Mohammadi M, Vahedi-Nouri B (2023) A bi-objective home care routing and scheduling problem considering patient preference and soft temporal dependency constraints. Eng Appl Artif Intell 119:105829","journal-title":"Eng Appl Artif Intell"},{"key":"922_CR37","unstructured":"Panchamgam KV (2011) Essays in retail operations and humanitarian logistics. PhD thesis, University of Maryland, College Park"},{"issue":"1","key":"922_CR38","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.ejor.2020.09.022","volume":"291","author":"B Pan","year":"2021","unstructured":"Pan B, Zhang Z, Lim A (2021) Multi-trip time-dependent vehicle routing problem with time windows. Eur J Oper Res 291(1):218\u2013231","journal-title":"Eur J Oper Res"},{"key":"922_CR39","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":"922_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2020.102085","volume":"142","author":"O Rifki","year":"2020","unstructured":"Rifki O, Chiabaut N, Solnon C (2020) On the impact of spatio-temporal granularity of traffic conditions on the quality of pickup and delivery optimal tours. Transp Res Part E: Logist Transp Rev 142:102085","journal-title":"Transp Res Part E: Logist Transp Rev"},{"key":"922_CR41","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1016\/j.apm.2019.01.047","volume":"70","author":"A Rahbari","year":"2019","unstructured":"Rahbari A, Nasiri MM, Werner F, Musavi MM, Jolai F (2019) The vehicle routing and scheduling problem with cross-docking for perishable products under uncertainty: Two robust bi-objective models. Appl Math Model 70:605\u2013625","journal-title":"Appl Math Model"},{"key":"922_CR42","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/978-3-319-72428-7","volume-title":"Recent Advances in Learning Automata","author":"A Rezvanian","year":"2018","unstructured":"Rezvanian A, Saghiri AM, Vahidipour SM, Esnaashari M, Meybodi MR (2018) Variable-structure learning automata. In: Monroy R, Arroyo Figueroa G, Sucar LE, Sossa H (eds) Recent Advances in Learning Automata, vol 754. Studies in Computational Intelligence. Springer, Berlin, pp 6\u20137"},{"key":"922_CR43","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":"922_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2022.108669","volume":"255","author":"A Soriano","year":"2023","unstructured":"Soriano A, Gansterer M, Hartl RF (2023) The multi-depot vehicle routing problem with profit fairness. Int J Prod Econ 255:108669","journal-title":"Int J Prod Econ"},{"key":"922_CR45","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2023.102864","volume":"118","author":"MJ Santos","year":"2023","unstructured":"Santos MJ, Jorge D, Ramos T, Barbosa-Povoa A (2023) Green reverse logistics: Exploring the vehicle routing problem with deliveries and pickups. Omega 118:102864","journal-title":"Omega"},{"key":"922_CR46","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.jfoodeng.2015.08.027","volume":"169","author":"B-D Song","year":"2016","unstructured":"Song B-D, Ko YD (2016) A vehicle routing problem of both refrigerated- and general-type vehicles for perishable food products delivery. J Food Eng 169:61\u201371","journal-title":"J Food Eng"},{"key":"922_CR47","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106531","volume":"164","author":"JF Sze","year":"2024","unstructured":"Sze JF, Salhi S, Wassan N (2024) An adaptive variable neighbourhood search approach for the dynamic vehicle routing problem. Comput Oper Res 164:106531","journal-title":"Comput Oper Res"},{"issue":"3","key":"922_CR48","doi-asserted-by":"publisher","first-page":"1058","DOI":"10.1016\/j.ejor.2017.07.004","volume":"264","author":"P Sun","year":"2018","unstructured":"Sun P, Veelenturf LP, Dabia S, Van Woensel T (2018) The time-dependent capacitated profitable tour problem with time windows and precedence constraints. Eur J Oper Res 264(3):1058\u20131073","journal-title":"Eur J Oper Res"},{"key":"922_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.trb.2018.07.002","volume":"116","author":"P Sun","year":"2018","unstructured":"Sun P, Veelenturf LP, Hewitt M, Van Woensel T (2018) The time-dependent pickup and delivery problem with time windows. Transp Res Part B: Methodol 116:1\u201324","journal-title":"Transp Res Part B: Methodol"},{"key":"922_CR50","unstructured":"TomTom: TomTom (2024). https:\/\/www.tomtom.com\/traffic-index\/ Accessed 2024-09-14"},{"issue":"1","key":"922_CR51","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1287\/trsc.2020.1000","volume":"55","author":"MW Ulmer","year":"2021","unstructured":"Ulmer MW, Thomas BW, Campbell AM, Woyak N (2021) The restaurant meal delivery problem: Dynamic pickup and delivery with deadlines and random ready times. Transp Sci 55(1):75\u2013100","journal-title":"Transp Sci"},{"key":"922_CR52","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1016\/j.asoc.2016.06.028","volume":"47","author":"R Vafashoar","year":"2016","unstructured":"Vafashoar R, Meybodi MR (2016) Multi swarm bare bones particle swarm optimization with distribution adaption. Appl Soft Comput 47:534\u2013552","journal-title":"Appl Soft Comput"},{"key":"922_CR53","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108837","volume":"175","author":"Q Wang","year":"2023","unstructured":"Wang Q, Li H, Wang D, Cheng TCE, Yin Y (2023) Bi-objective perishable product delivery routing problem with stochastic demand. Comput Ind Eng 175:108837","journal-title":"Comput Ind Eng"},{"key":"922_CR54","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2024.103798","volume":"192","author":"Y Wang","year":"2024","unstructured":"Wang Y, Wei Z, Luo S, Zhou J, Zhen L (2024) Collaboration and resource sharing in the multidepot time-dependent vehicle routing problem with time windows. Transp Res Part E: Logist Transp Rev 192:103798","journal-title":"Transp Res Part E: Logist Transp Rev"},{"key":"922_CR55","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106176","volume":"154","author":"Y Wu","year":"2023","unstructured":"Wu Y, Zeng B (2023) Dynamic parcel pick-up routing problem with prioritized customers and constrained capacity via lower-bound-based rollout approach. Comput Oper Res 154:106176","journal-title":"Comput Oper Res"},{"issue":"11","key":"922_CR56","doi-asserted-by":"publisher","first-page":"13161","DOI":"10.1109\/TITS.2022.3193679","volume":"24","author":"N Yin","year":"2023","unstructured":"Yin N (2023) Multiobjective Optimization for Vehicle Routing Optimization Problem in Low-Carbon Intelligent Transportation. IEEE Trans Intell Transp Syst 24(11):13161\u201313170","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"1\u20132","key":"922_CR57","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1080\/00207543.2023.2275639","volume":"62","author":"Y Zhang","year":"2024","unstructured":"Zhang Y, Chu F, Che A, Li Y (2024) Closed-loop inventory routing problem for perishable food with returnable transport items selection. Int J Prod Res 62(1\u20132):501\u2013521","journal-title":"Int J Prod Res"},{"key":"922_CR58","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2024.104484","volume":"160","author":"J Zhang","year":"2024","unstructured":"Zhang J, Li Y, Lu Z (2024) Multi-period vehicle routing problem with time windows for drug distribution in the epidemic situation. Transp Res Part C: Emerg Technol 160:104484","journal-title":"Transp Res Part C: Emerg Technol"},{"key":"922_CR59","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105938","volume":"147","author":"J Zhao","year":"2022","unstructured":"Zhao J, Poon M, Zhang Z, Gu R (2022) Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem. Comput Oper Res 147:105938","journal-title":"Comput Oper Res"},{"issue":"4","key":"922_CR60","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach. IEEE Trans Evol Comput 3(4):257\u2013271","journal-title":"IEEE Trans Evol Comput"},{"key":"922_CR61","doi-asserted-by":"publisher","DOI":"10.22094\/qjie.2024.1183458","author":"M Zhian Vamarzani","year":"2024","unstructured":"Zhian Vamarzani M, Rezaei Zeynali F, Tajally A, Parvin M (2024) Designing A Sustainable Waste Chain Network for Banana Farm Under Uncertainty: A Case Study. qjie. https:\/\/doi.org\/10.22094\/qjie.2024.1183458","journal-title":"qjie"},{"issue":"18","key":"922_CR62","doi-asserted-by":"publisher","first-page":"6177","DOI":"10.1080\/00207543.2022.2153940","volume":"61","author":"S Zhang","year":"2023","unstructured":"Zhang S, Zhou Z, Luo R, Zhao R, Xiao Y, Xu Y (2023) A low-carbon, fixed-tour scheduling problem with time windows in a time-dependent traffic environment. Int J Prod Res 61(18):6177\u20136196","journal-title":"Int J Prod Res"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-025-00922-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-025-00922-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-025-00922-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T10:04:21Z","timestamp":1763978661000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-025-00922-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,22]]},"references-count":62,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["922"],"URL":"https:\/\/doi.org\/10.1007\/s12351-025-00922-4","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"type":"print","value":"1109-2858"},{"type":"electronic","value":"1866-1505"}],"subject":[],"published":{"date-parts":[[2025,9,22]]},"assertion":[{"value":"25 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 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":"No potential conflict of interest was reported by the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"97"}}