{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T13:11:35Z","timestamp":1779887495348,"version":"3.53.1"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,10,15]],"date-time":"2022-10-15T00:00:00Z","timestamp":1665792000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,15]],"date-time":"2022-10-15T00:00:00Z","timestamp":1665792000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s00521-022-07921-y","type":"journal-article","created":{"date-parts":[[2022,10,15]],"date-time":"2022-10-15T08:03:01Z","timestamp":1665820981000},"page":"3865-3882","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Multiobjective problem modeling of the capacitated vehicle routing problem with urgency in a pandemic period"],"prefix":"10.1007","volume":"35","author":[{"given":"Mehmet","family":"Altinoz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1236-7961","authenticated-orcid":false,"given":"O. Tolga","family":"Altinoz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,10,15]]},"reference":[{"issue":"3","key":"7921_CR1","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1016\/j.ejor.2019.07.049","volume":"289","author":"A Anderluh","year":"2021","unstructured":"Anderluh A, Nolz PC, Hemmelmayr VC, Crainic TG (2021) Multi-objective optimization of a two-echelon vehicle routing problem with vehicle synchronization and \u2018grey zone\u2019 customers arising in urban logistics. Eur J Oper Res 289(3):940\u2013958. https:\/\/doi.org\/10.1016\/j.ejor.2019.07.049","journal-title":"Eur J Oper Res"},{"key":"7921_CR2","doi-asserted-by":"publisher","first-page":"124343","DOI":"10.1016\/j.jclepro.2020.124343","volume":"282","author":"MET Araghi","year":"2021","unstructured":"Araghi MET, Tavakkoli-Moghaddam R, Jolai F, Molana SMH (2021) A green multi-facilities open location-routing problem with planar facility locations and uncertain customer. J Clean Prod 282:124343. https:\/\/doi.org\/10.1016\/j.jclepro.2020.124343","journal-title":"J Clean Prod"},{"issue":"1","key":"7921_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1162\/evco-a-00009","volume":"19","author":"J Bader","year":"2011","unstructured":"Bader J, Zitzler E (2011) Hype an algorithm for fast hypervolume-based many-objective optimization. Evol Comput 19(1):45\u201376. https:\/\/doi.org\/10.1162\/evco-a-00009","journal-title":"Evol Comput"},{"issue":"3","key":"7921_CR4","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1016\/j.ejor.2020.06.035","volume":"288","author":"M Behnke","year":"2021","unstructured":"Behnke M, Kirschstein T, Bierwirth C (2021) A column generation approach for an emission-oriented vehicle routing problem on a multigraph. Eur J Oper Res 288(3):794\u2013809. https:\/\/doi.org\/10.1016\/j.ejor.2020.06.035","journal-title":"Eur J Oper Res"},{"key":"7921_CR5","doi-asserted-by":"publisher","unstructured":"Beliaev M, Biyik E, Lazar DA, Wang WZ, Sadigh D, Pedarsani R (2021) Incentivizing routing choices for safe and efficient transportation in the face of the covid-19 pandemic. In: Proceedings of the ACM\/IEEE 12th International Conference on Cyber-Physical Systems, pp. 1\u201311. ACM. https:\/\/doi.org\/10.1145\/3450267.3450546","DOI":"10.1145\/3450267.3450546"},{"issue":"1","key":"7921_CR6","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10100-019-00625-0","volume":"29","author":"C Brandstatter","year":"2019","unstructured":"Brandstatter C (2019) A metaheuristic algorithm and structured analysis for the line-haul feeder vehicle routing problem with time windows. CEJOR 29(1):247\u2013289. https:\/\/doi.org\/10.1007\/s10100-019-00625-0","journal-title":"CEJOR"},{"key":"7921_CR7","doi-asserted-by":"publisher","first-page":"113910","DOI":"10.1016\/j.eswa.2020.113910","volume":"165","author":"L Cai","year":"2021","unstructured":"Cai L, Lv W, Xiao L, Xu Z (2021) Total carbon emissions minimization in connected and automated vehicle routing problem with speed variables. Expert Syst Appl 165:113910. https:\/\/doi.org\/10.1016\/j.eswa.2020.113910","journal-title":"Expert Syst Appl"},{"key":"7921_CR8","doi-asserted-by":"publisher","first-page":"100864","DOI":"10.1016\/j.swevo.2021.100864","volume":"63","author":"B Cao","year":"2021","unstructured":"Cao B, Zhang W, Wang X, Zhao J, Gu Y, Zhang Y (2021) A memetic algorithm based on twoarch2 for multi-depot heterogeneous-vehicle capacitated arc routing problem. Swarm Evol Comput 63:100864. https:\/\/doi.org\/10.1016\/j.swevo.2021.100864","journal-title":"Swarm Evol Comput"},{"key":"7921_CR9","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.biosystemseng.2020.12.007","volume":"202","author":"JX Cao","year":"2021","unstructured":"Cao JX, Wang X, Gao J (2021) A two-echelon location-routing problem for biomass logistics systems. Biosys Eng 202:106\u2013118. https:\/\/doi.org\/10.1016\/j.biosystemseng.2020.12.007","journal-title":"Biosys Eng"},{"key":"7921_CR10","doi-asserted-by":"publisher","first-page":"107017","DOI":"10.1016\/j.cie.2020.107017","volume":"152","author":"JX Cao","year":"2021","unstructured":"Cao JX, Zhang Z, Zhou Y (2021) A location-routing problem for biomass supply chains. Comput Ind Eng 152:107017. https:\/\/doi.org\/10.1016\/j.cie.2020.107017","journal-title":"Comput Ind Eng"},{"key":"7921_CR11","volume-title":"etc: Combinatorial optimization","author":"N Cristofides","year":"1979","unstructured":"Cristofides N (1979) etc: Combinatorial optimization. Wiley, New Jersey"},{"issue":"2","key":"7921_CR12","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Trans Evol Comput 6(2):182\u2013197. https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans Evol Comput"},{"key":"7921_CR13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/1-84628-137-7-6","volume-title":"Advanced information and knowledge processing","author":"K Deb","year":"2005","unstructured":"Deb K, Thiele L, Laumanns M, Zitzler E (2005) Scalable test problems for evolutionary multiobjective optimization. Advanced information and knowledge processing. Springer-Verlag, Berlin, pp 105\u2013145. https:\/\/doi.org\/10.1007\/1-84628-137-7-6"},{"issue":"1","key":"7921_CR14","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1080\/21642583.2020.1863276","volume":"9","author":"SK Dewi","year":"2020","unstructured":"Dewi SK, Utama DM (2020) A new hybrid whale optimization algorithm for green vehicle routing problem. Syst Sci Control Eng 9(1):61\u201372. https:\/\/doi.org\/10.1080\/21642583.2020.1863276","journal-title":"Syst Sci Control Eng"},{"key":"7921_CR15","doi-asserted-by":"publisher","first-page":"101236","DOI":"10.1016\/j.phycom.2020.101236","volume":"44","author":"J Euchi","year":"2021","unstructured":"Euchi J, Sadok A (2021) Hybrid genetic-sweep algorithm to solve the vehicle routing problem with drones. Phys Commun 44:101236. https:\/\/doi.org\/10.1016\/j.phycom.2020.101236","journal-title":"Phys Commun"},{"key":"7921_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejco.2020.100003","volume":"9","author":"F Theurich","year":"2021","unstructured":"Theurich F, Fischer A, Scheithauer G (2021) A branch-and-bound approach for a vehicle routing problem with customer costs. EURO J Comput Optim 9:1\u201311. https:\/\/doi.org\/10.1016\/j.ejco.2020.100003","journal-title":"EURO J Comput Optim"},{"key":"7921_CR17","doi-asserted-by":"publisher","first-page":"105211","DOI":"10.1016\/j.cor.2021.105211","volume":"129","author":"H Fan","year":"2021","unstructured":"Fan H, Zhang Y, Tian P, Lv Y, Fan H (2021) Time-dependent multi-depot green vehicle routing problem with time windows considering temporal-spatial distance. Comput Oper Res 129:105211. https:\/\/doi.org\/10.1016\/j.cor.2021.105211","journal-title":"Comput Oper Res"},{"issue":"1","key":"7921_CR18","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s00291-020-00609-6","volume":"43","author":"NS Gamchi","year":"2020","unstructured":"Gamchi NS, Torabi SA, Jolai F (2020) A novel vehicle routing problem for vaccine distribution using sir epidemic model. OR Spectrum 43(1):155\u2013188. https:\/\/doi.org\/10.1007\/s00291-020-00609-6","journal-title":"OR Spectrum"},{"key":"7921_CR19","doi-asserted-by":"publisher","first-page":"125628","DOI":"10.1016\/j.jclepro.2020.125628","volume":"288","author":"G Haixiang","year":"2021","unstructured":"Haixiang G, Fang W, Wenwen P, Mingyun G (2021) Period sewage recycling vehicle routing problem based on real-time data. J Clean Prod 288:125628. https:\/\/doi.org\/10.1016\/j.jclepro.2020.125628","journal-title":"J Clean Prod"},{"key":"7921_CR20","doi-asserted-by":"publisher","first-page":"113877","DOI":"10.1016\/j.eswa.2020.113877","volume":"165","author":"M Jalilvand","year":"2021","unstructured":"Jalilvand M, Bashiri M, Nikzad E (2021) An effective progressive hedging algorithm for the two-layers time window assignment vehicle routing problem in a stochastic environment. Expert Syst Appl 165:113877. https:\/\/doi.org\/10.1016\/j.eswa.2020.113877","journal-title":"Expert Syst Appl"},{"issue":"2","key":"7921_CR21","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1109\/tcyb.2020.2990319","volume":"52","author":"F Jiang","year":"2022","unstructured":"Jiang F, Dong L, Dai Q (2022) Designing a mixed multilayer wavelet neural network for solving eri inversion problem with massive amounts of data: A hybrid stgwo-gd learning approach. IEEE Trans Cybern 52(2):925\u2013936. https:\/\/doi.org\/10.1109\/tcyb.2020.2990319","journal-title":"IEEE Trans Cybern"},{"issue":"9","key":"7921_CR22","doi-asserted-by":"publisher","first-page":"6597","DOI":"10.1109\/jiot.2021.3113872","volume":"9","author":"F Jiang","year":"2022","unstructured":"Jiang F, Dong L, Wang K, Yang K, Pan C (2022) Distributed resource scheduling for large-scale mec systems: a multiagent ensemble deep reinforcement learning with imitation acceleration. IEEE Internet Things J 9(9):6597\u20136610. https:\/\/doi.org\/10.1109\/jiot.2021.3113872","journal-title":"IEEE Internet Things J"},{"issue":"7","key":"7921_CR23","doi-asserted-by":"publisher","first-page":"6252","DOI":"10.1109\/jiot.2019.2954503","volume":"7","author":"F Jiang","year":"2020","unstructured":"Jiang F, Wang K, Dong L, Pan C, Xu W, Yang K (2020) Deep-learning-based joint resource scheduling algorithms for hybrid mec networks. IEEE Internet Things J 7(7):6252\u20136265. https:\/\/doi.org\/10.1109\/jiot.2019.2954503","journal-title":"IEEE Internet Things J"},{"issue":"6","key":"7921_CR24","doi-asserted-by":"publisher","first-page":"3188","DOI":"10.3390\/su13063188","volume":"13","author":"B Ju","year":"2021","unstructured":"Ju B, Kim M, Moon I (2021) Vehicle routing problem considering reconnaissance and transportation. Sustainability 13(6):3188. https:\/\/doi.org\/10.3390\/su13063188","journal-title":"Sustainability"},{"key":"7921_CR25","doi-asserted-by":"publisher","first-page":"114408","DOI":"10.1016\/j.eswa.2020.114408","volume":"168","author":"TS Khoo","year":"2021","unstructured":"Khoo TS, Mohammad BB (2021) The parallelization of a two-phase distributed hybrid ruin-and-recreate genetic algorithm for solving multi-objective vehicle routing problem with time windows. Expert Syst Appl 168:114408. https:\/\/doi.org\/10.1016\/j.eswa.2020.114408","journal-title":"Expert Syst Appl"},{"issue":"1","key":"7921_CR26","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s11590-020-01594-z","volume":"15","author":"E Lalla-Ruiz","year":"2020","unstructured":"Lalla-Ruiz E, Mes M (2020) Mathematical formulations and improvements for the multi-depot open vehicle routing problem. Optim Lett 15(1):271\u2013286. https:\/\/doi.org\/10.1007\/s11590-020-01594-z","journal-title":"Optim Lett"},{"key":"7921_CR27","doi-asserted-by":"publisher","DOI":"10.1109\/tits.2021.3056120","author":"J Li","year":"2021","unstructured":"Li J, Xin L, Cao Z, Lim A, Song W, Zhang J (2021) Heterogeneous attentions for solving pickup and delivery problem via deep reinforcement learning. IEEE Trans Intell Transp Syst. https:\/\/doi.org\/10.1109\/tits.2021.3056120","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"3","key":"7921_CR28","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1109\/tevc.2013.2262178","volume":"18","author":"M Li","year":"2014","unstructured":"Li M, Yang S, Liu X (2014) Shift-based density estimation for pareto-based algorithms in many-objective optimization. IEEE Trans Evol Comput 18(3):348\u2013365. https:\/\/doi.org\/10.1109\/tevc.2013.2262178","journal-title":"IEEE Trans Evol Comput"},{"key":"7921_CR29","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.asoc.2016.11.009","volume":"50","author":"Y Liu","year":"2017","unstructured":"Liu Y, Gong D, Sun X, Zhang Y (2017) Many-objective evolutionary optimization based on reference points. Appl Soft Comput 50:344\u2013355. https:\/\/doi.org\/10.1016\/j.asoc.2016.11.009","journal-title":"Appl Soft Comput"},{"key":"7921_CR30","doi-asserted-by":"publisher","first-page":"105196","DOI":"10.1016\/j.cor.2020.105196","volume":"129","author":"I Malheiros","year":"2021","unstructured":"Malheiros I, Ramalho R, Passeti B, Bulhoes T, Subramanian A (2021) A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem. Comput Oper Res 129:105196. https:\/\/doi.org\/10.1016\/j.cor.2020.105196","journal-title":"Comput Oper Res"},{"issue":"5","key":"7921_CR31","doi-asserted-by":"publisher","first-page":"509","DOI":"10.3390\/math905050","volume":"9","author":"R Martin-Santamaria","year":"2021","unstructured":"Martin-Santamaria R, Lopez-Sanchez AD, Delgado-Jalon ML, Colmenar JM (2021) An efficient algorithm for crowd logistics optimization. Mathematics 9(5):509. https:\/\/doi.org\/10.3390\/math905050","journal-title":"Mathematics"},{"key":"7921_CR32","doi-asserted-by":"publisher","first-page":"100220","DOI":"10.1016\/j.jii.2021.100220","volume":"23","author":"M Mojtahedi","year":"2021","unstructured":"Mojtahedi M, Fathollahi-Fard AM, Tavakkoli-Moghaddam R, Newton S (2021) Sustainable vehicle routing problem for coordinated solid waste management. J Ind Inf Integr 23:100220. https:\/\/doi.org\/10.1016\/j.jii.2021.100220","journal-title":"J Ind Inf Integr"},{"key":"7921_CR33","doi-asserted-by":"publisher","first-page":"100767","DOI":"10.1016\/j.swevo.2020.100767","volume":"60","author":"Y Niu","year":"2021","unstructured":"Niu Y, Zhang Y, Cao Z, Gao K, Xiao J, Song W, Zhang F (2021) Mimoa: a membrane-inspired multi-objective algorithm for green vehicle routing problem with stochastic demands. Swarm Evol Comput 60:100767. https:\/\/doi.org\/10.1016\/j.swevo.2020.100767","journal-title":"Swarm Evol Comput"},{"key":"7921_CR34","doi-asserted-by":"publisher","first-page":"113846","DOI":"10.1016\/j.eswa.2020.113846","volume":"165","author":"S Nucamendi-Guillen","year":"2021","unstructured":"Nucamendi-Guillen S, Padilla AG, Olivares-Benitez E, Moreno-Vega JM (2021) The multi-depot open location routing problem with a heterogeneous fixed fleet. Expert Syst Appl 165:113846. https:\/\/doi.org\/10.1016\/j.eswa.2020.113846","journal-title":"Expert Syst Appl"},{"key":"7921_CR35","doi-asserted-by":"publisher","first-page":"27210","DOI":"10.1109\/access.2021.3058242","volume":"9","author":"A Osorio-Mora","year":"2021","unstructured":"Osorio-Mora A, Soto-Bustos M, Gatica G, Palominos P, Linfati R (2021) The multi-depot cumulative vehicle routing problem with mandatory visit times and minimum delayed latency. IEEE Access 9:27210\u201327225. https:\/\/doi.org\/10.1109\/access.2021.3058242","journal-title":"IEEE Access"},{"key":"7921_CR36","doi-asserted-by":"publisher","first-page":"105193","DOI":"10.1016\/j.cor.2020.105193","volume":"128","author":"B Pan","year":"2021","unstructured":"Pan B, Zhang Z, Lim A (2021) A hybrid algorithm for time-dependent vehicle routing problem with time windows. Comput Oper Res 128:105193. https:\/\/doi.org\/10.1016\/j.cor.2020.105193","journal-title":"Comput Oper Res"},{"key":"7921_CR37","doi-asserted-by":"publisher","first-page":"113959","DOI":"10.1016\/j.eswa.2020.113959","volume":"165","author":"H Park","year":"2021","unstructured":"Park H, Son D, Koo B, Jeong B (2021) Waiting strategy for the vehicle routing problem with simultaneous pickup and delivery using genetic algorithm. Expert Syst Appl 165:113959. https:\/\/doi.org\/10.1016\/j.eswa.2020.113959","journal-title":"Expert Syst Appl"},{"key":"7921_CR38","doi-asserted-by":"publisher","first-page":"102340","DOI":"10.1016\/j.omega.2020.102340","volume":"102","author":"O Quirion-Blais","year":"2021","unstructured":"Quirion-Blais O, Chen L (2021) A case-based reasoning approach to solve the vehicle routing problem with time windows and drivers\u2019 experience. Omega 102:102340. https:\/\/doi.org\/10.1016\/j.omega.2020.102340","journal-title":"Omega"},{"issue":"3","key":"7921_CR39","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1016\/j.ejor.2020.11.007","volume":"292","author":"M Saint-Guillain","year":"2021","unstructured":"Saint-Guillain M, Paquay C, Limbourg S (2021) Time-dependent stochastic vehicle routing problem with random requests: Application to online police patrol management in brussels. Eur J Oper Res 292(3):869\u2013885. https:\/\/doi.org\/10.1016\/j.ejor.2020.11.007","journal-title":"Eur J Oper Res"},{"key":"7921_CR40","unstructured":"Schott JR (1995) Fault tolerant design using single and multicriteria genetic algorithm optimizations. M.S. thesis"},{"key":"7921_CR41","doi-asserted-by":"publisher","first-page":"125434","DOI":"10.1016\/j.jclepro.2020.125434","volume":"287","author":"SU Sherif","year":"2021","unstructured":"Sherif SU, Asokan P, Sasikumar P, Mathiyazhagan K, Jerald J (2021) Integrated optimization of transportation, inventory and vehicle routing with simultaneous pickup and delivery in two-echelon green supply chain network. J Clean Prod 287:125434. https:\/\/doi.org\/10.1016\/j.jclepro.2020.125434","journal-title":"J Clean Prod"},{"key":"7921_CR42","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1016\/j.neucom.2020.02.126","volume":"423","author":"P Sitek","year":"2021","unstructured":"Sitek P, Wikarek J, Rutczynska-Wdowiak K, Bocewicz G, Banaszak Z (2021) Optimization of capacitated vehicle routing problem with alternative delivery, pick-up and time windows: A modified hybrid approach. Neurocomputing 423:670\u2013678. https:\/\/doi.org\/10.1016\/j.neucom.2020.02.126","journal-title":"Neurocomputing"},{"issue":"2","key":"7921_CR43","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1007\/s12652-020-02304-4","volume":"12","author":"N Tao","year":"2020","unstructured":"Tao N, Shishasha S, Peng Z, Tao G (2020) Disruption management decision model for vrpsdp under changes of customer distribution demand. J Ambient Intell Humaniz Comput 12(2):2053\u20132063. https:\/\/doi.org\/10.1007\/s12652-020-02304-4","journal-title":"J Ambient Intell Humaniz Comput"},{"issue":"4","key":"7921_CR44","doi-asserted-by":"publisher","first-page":"774","DOI":"10.7232\/iems.2020.19.4.774","volume":"19","author":"NA Theeb","year":"2020","unstructured":"Theeb NA, Hayajneh M, Qubelat NA (2020) Optimization of logistic plans with adopting the green technology considerations by utilizing electric vehicle routing problem. Ind Eng Manag Syst 19(4):774\u2013789. https:\/\/doi.org\/10.7232\/iems.2020.19.4.774","journal-title":"Ind Eng Manag Syst"},{"issue":"2","key":"7921_CR45","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1016\/j.ejor.2020.12.020","volume":"293","author":"H Tikani","year":"2021","unstructured":"Tikani H, Setak M, Demir E (2021) A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty. Eur J Oper Res 293(2):703\u2013730. https:\/\/doi.org\/10.1016\/j.ejor.2020.12.020","journal-title":"Eur J Oper Res"},{"key":"7921_CR46","doi-asserted-by":"publisher","first-page":"106912","DOI":"10.1016\/j.ijepes.2021.106912","volume":"131","author":"MB Tookanlou","year":"2021","unstructured":"Tookanlou MB, Kani SAP, Marzband M (2021) A comprehensive day-ahead scheduling strategy for electric vehicles operation. Int J Electr Power Energy Syst 131:106912. https:\/\/doi.org\/10.1016\/j.ijepes.2021.106912","journal-title":"Int J Electr Power Energy Syst"},{"key":"7921_CR47","doi-asserted-by":"publisher","first-page":"102193","DOI":"10.1016\/j.ijdrr.2021.102193","volume":"58","author":"YEM Vieira","year":"2021","unstructured":"Vieira YEM, de Mello Bandeira RA, da Silva Junior OS (2021) Multi-depot vehicle routing problem for large scale disaster relief in drought scenarios: the case of the brazilian northeast region. Int J Disaster Risk Reduct 58:102193. https:\/\/doi.org\/10.1016\/j.ijdrr.2021.102193","journal-title":"Int J Disaster Risk Reduct"},{"key":"7921_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2021\/6635749","volume":"2021","author":"N Wang","year":"2021","unstructured":"Wang N, Sun Y, Wang H (2021) An adaptive memetic algorithm for dynamic electric vehicle routing problem with time-varying demands. Math Probl Eng 2021:1\u201310. https:\/\/doi.org\/10.1155\/2021\/6635749","journal-title":"Math Probl Eng"},{"key":"7921_CR49","doi-asserted-by":"publisher","first-page":"114307","DOI":"10.1016\/j.eswa.2020.114307","volume":"168","author":"X Wang","year":"2021","unstructured":"Wang X, Lin N, Li Y, Shi Y, Ruan J (2021) An integrated modeling method for collaborative vehicle routing: facilitating the unmanned micro warehouse pattern in new retail. Expert Syst Appl 168:114307. https:\/\/doi.org\/10.1016\/j.eswa.2020.114307","journal-title":"Expert Syst Appl"},{"key":"7921_CR50","doi-asserted-by":"publisher","first-page":"114201","DOI":"10.1016\/j.eswa.2020.114201","volume":"167","author":"Y Wang","year":"2021","unstructured":"Wang Y, Li Q, Guan X, Xu M, Liu Y, Wang H (2021) Two-echelon collaborative multi-depot multi-period vehicle routing problem. Expert Syst Appl 167:114201. https:\/\/doi.org\/10.1016\/j.eswa.2020.114201","journal-title":"Expert Syst Appl"},{"key":"7921_CR51","doi-asserted-by":"publisher","first-page":"113838","DOI":"10.1016\/j.eswa.2020.113838","volume":"165","author":"Y Wang","year":"2021","unstructured":"Wang Y, Zhang J, Guan X, Xu M, Wang Z, Wang H (2021) Collaborative multiple centers fresh logistics distribution network optimization with resource sharing and temperature control constraints. Expert Syst Appl 165:113838. https:\/\/doi.org\/10.1016\/j.eswa.2020.113838","journal-title":"Expert Syst Appl"},{"issue":"3","key":"7921_CR52","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s00500-008-0394-9","volume":"14","author":"YN Wang","year":"2009","unstructured":"Wang YN, Wu LH, Yuan XF (2009) Multi-objective self-adaptive differential evolution with elitist archive and crowding entropy-based diversity measure. Soft Comput 14(3):193\u2013209. https:\/\/doi.org\/10.1007\/s00500-008-0394-9","journal-title":"Soft Comput"},{"issue":"1","key":"7921_CR53","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/tevc.2005.851275","volume":"10","author":"L While","year":"2006","unstructured":"While L, Hingston P, Barone L, Huband S (2006) A faster algorithm for calculating hypervolume. IEEE Trans Evol Comput 10(1):29\u201338. https:\/\/doi.org\/10.1109\/tevc.2005.851275","journal-title":"IEEE Trans Evol Comput"},{"key":"7921_CR54","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2021.3068828","author":"Y Wu","year":"2021","unstructured":"Wu Y, Song W, Cao Z, Zhang J, Lim A (2021) Learning improvement heuristics for solving routing problems. IEEE Trans Neural Netw Learn Syst. https:\/\/doi.org\/10.1109\/tnnls.2021.3068828","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"5","key":"7921_CR55","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/tevc.2012.2227145","volume":"17","author":"S Yang","year":"2013","unstructured":"Yang S, Li M, Liu X, Zheng J (2013) A grid-based evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 17(5):721\u2013736. https:\/\/doi.org\/10.1109\/tevc.2012.2227145","journal-title":"IEEE Trans Evol Comput"},{"key":"7921_CR56","doi-asserted-by":"publisher","first-page":"114804","DOI":"10.1016\/j.eswa.2021.114804","volume":"176","author":"S Yang","year":"2021","unstructured":"Yang S, Ning L, Tong LC, Shang P (2021) Optimizing electric vehicle routing problems with mixed backhauls and recharging strategies in multi-dimensional representation network. Expert Syst Appl 176:114804. https:\/\/doi.org\/10.1016\/j.eswa.2021.114804","journal-title":"Expert Syst Appl"},{"key":"7921_CR57","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.ins.2020.12.057","volume":"557","author":"F Yin","year":"2021","unstructured":"Yin F, Zhao Y (2021) Optimizing vehicle routing via stackelberg game framework and distributionally robust equilibrium optimization method. Inf Sci 557:84\u2013107. https:\/\/doi.org\/10.1016\/j.ins.2020.12.057","journal-title":"Inf Sci"},{"key":"7921_CR58","doi-asserted-by":"publisher","first-page":"107251","DOI":"10.1016\/j.asoc.2021.107251","volume":"105","author":"VF Yu","year":"2021","unstructured":"Yu VF, Jodiawan P, Gunawan A (2021) An adaptive large neighborhood search for the green mixed fleet vehicle routing problem with realistic energy consumption and partial recharges. Appl Soft Comput 105:107251. https:\/\/doi.org\/10.1016\/j.asoc.2021.107251","journal-title":"Appl Soft Comput"},{"key":"7921_CR59","doi-asserted-by":"publisher","first-page":"105166","DOI":"10.1016\/j.asoc.2021.107251","volume":"137","author":"M hua Zeng","year":"2021","unstructured":"hua Zeng M, Wang M, Chen Y, Yang Z (2021) Dynamic evacuation optimization model based on conflict-eliminating cell transmission and split delivery vehicle routing. Saf Sci 137:105166. https:\/\/doi.org\/10.1016\/j.asoc.2021.107251","journal-title":"Saf Sci"},{"issue":"5","key":"7921_CR60","doi-asserted-by":"publisher","first-page":"3795","DOI":"10.1007\/s00500-020-05408-3","volume":"25","author":"W Zhang","year":"2020","unstructured":"Zhang W, Chen Z, Zhang S, Cai Y (2020) Dynamic multi-stage failure-specific cooperative recourse strategy for logistics with simultaneous pickup and delivery. Soft Comput 25(5):3795\u20133812. https:\/\/doi.org\/10.1007\/s00500-020-05408-3","journal-title":"Soft Comput"},{"key":"7921_CR61","doi-asserted-by":"publisher","first-page":"16661","DOI":"10.1109\/access.2021.3053285","volume":"9","author":"Y Zhu","year":"2021","unstructured":"Zhu Y, Lee KY, Wang Y (2021) Adaptive elitist genetic algorithm with improved neighbor routing initialization for electric vehicle routing problems. IEEE Access 9:16661\u201316671. https:\/\/doi.org\/10.1109\/access.2021.3053285","journal-title":"IEEE Access"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07921-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-022-07921-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07921-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T05:14:48Z","timestamp":1674796488000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-022-07921-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,15]]},"references-count":61,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["7921"],"URL":"https:\/\/doi.org\/10.1007\/s00521-022-07921-y","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,15]]},"assertion":[{"value":"31 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2022","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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}