{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T00:04:26Z","timestamp":1768262666201,"version":"3.49.0"},"reference-count":36,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T00:00:00Z","timestamp":1665532800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012456","name":"Special Project of National Emergency Management System Construction of Chinese National Funding of Social Science","doi-asserted-by":"publisher","award":["20VYJ024"],"award-info":[{"award-number":["20VYJ024"]}],"id":[{"id":"10.13039\/501100012456","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Aiming at the time-dependent green vehicle routing problem with fuzzy demand, this paper comprehensively considers the dispatch costs, time window penalty costs, fuel costs, and the effects of vehicle travel speed, road gradient, and vehicle load on fuel consumption, a mixed integer programming model is formulated based on pre-optimization and re-optimization strategies. The traditional vehicle routing problems are modeled based on a symmetric graph. In this paper, considering the influence of time-dependent networks on route optimization, modeling is based on an asymmetric graph, which increases the complexity of the problem. In the pre-optimization stage, a pre-optimization scheme is generated based on the credibility measure theory; in the re-optimization stage, a new re-optimization strategy was used to deal with the service failure node In order to solve this problem, we developed a chaotic genetic algorithm with variable neighborhood search, pseudo-randomness of chaos was introduced to ensure the diversity of initial solutions, and adaptive neighborhood search times strategy and inferior solution acceptance mechanism were proposed to improve the performance of the algorithm. The numerical results show that the model and algorithm we proposed are effective.<\/jats:p>","DOI":"10.3390\/sym14102115","type":"journal-article","created":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T05:31:18Z","timestamp":1665552678000},"page":"2115","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Chaotic Genetic Algorithm with Variable Neighborhood Search for Solving Time-Dependent Green VRPTW with Fuzzy Demand"],"prefix":"10.3390","volume":"14","author":[{"given":"Hao","family":"Fan","sequence":"first","affiliation":[{"name":"School of Transportation and Logistics, Dalian University of Technology, Dalian 116024, China"}]},{"given":"Xiaoxue","family":"Ren","sequence":"additional","affiliation":[{"name":"College of Transportation Engineering, Dalian Maritime University, Dalian 116026, China"}]},{"given":"Yueguang","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Transportation Engineering, Dalian Maritime University, Dalian 116026, China"}]},{"given":"Zimo","family":"Zhen","sequence":"additional","affiliation":[{"name":"School of Transportation and Logistics, Dalian University of Technology, Dalian 116024, China"}]},{"given":"Houming","family":"Fan","sequence":"additional","affiliation":[{"name":"College of Transportation Engineering, Dalian Maritime University, Dalian 116026, China"}]}],"member":"1968","published-online":{"date-parts":[[2022,10,12]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"2405","DOI":"10.1016\/j.eswa.2009.07.021","article-title":"The open vehicle routing problem with fuzzy demands","volume":"37","author":"Cao","year":"2010","journal-title":"Expert Syst. Appl."},{"key":"ref_2","first-page":"2574","article-title":"Hybrid particle swarm optimization with genetic algorithm for solving capacitated vehicle routing problem with fuzzy demand-A case study on garbage collection system","volume":"219","author":"Kuo","year":"2012","journal-title":"Appl. Math. Comput."},{"key":"ref_3","first-page":"238","article-title":"Dynamic management of vehicle routing problem with time windows and fuzzy demands based on the multi-objective optimization","volume":"10","author":"Wang","year":"2013","journal-title":"Chinese J. Manag."},{"key":"ref_4","first-page":"9071394","article-title":"Vehicle coordinated strategy for vehicle routing problem with fuzzy demands","volume":"9","author":"Liu","year":"2016","journal-title":"Math. Probl. Eng."},{"key":"ref_5","first-page":"123","article-title":"Optimization and real-time adjustment for vehicle routing problem with fuzzy demand","volume":"50","author":"Zhang","year":"2016","journal-title":"Shanghai Jiaotong Univer."},{"key":"ref_6","first-page":"522","article-title":"Two-stage variable neighborhood tabu search for the capacitated vehicle routing problem with fuzzy demand","volume":"38","author":"Li","year":"2018","journal-title":"Syst. Eng. Theory Pract."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"120774","DOI":"10.1016\/j.jclepro.2020.120774","article-title":"Fuzzy green vehicle routing problem for designing a three echelons supply chain","volume":"259","author":"Giallanza","year":"2020","journal-title":"J. Clean Prod."},{"key":"ref_8","first-page":"950","article-title":"Optimization for time dependent vehicle routing problem with fuzzy demand and time windows","volume":"37","author":"Fan","year":"2020","journal-title":"Con. Theory Appl."},{"key":"ref_9","first-page":"221","article-title":"Recent progress of local search in handling the time window constraints of the vehicle routing problem","volume":"8","author":"Hashimoto","year":"2010","journal-title":"Ann. Oper. Res."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/j.trb.2019.03.009","article-title":"A branch-and-price algorithm for the heterogeneous fleet green vehicle routing problem with time windows","volume":"122","author":"Yu","year":"2019","journal-title":"Transp. Res. Pt. B Methodol."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"100675","DOI":"10.1016\/j.swevo.2020.100675","article-title":"An improved ant colony optimization algorithm to the periodic vehicle routing problem with time window and service choice","volume":"55","author":"Wang","year":"2020","journal-title":"Swarm Evol. Comput."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/j.ins.2018.12.086","article-title":"A multi-adaptive particle swarm optimization for the vehicle routing problem with time windows","volume":"481","author":"Marinakis","year":"2019","journal-title":"Inf. Sci."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.cie.2019.02.017","article-title":"A hybrid estimation of distribution algorithm for the vehicle routing problem with time windows","volume":"130","year":"2019","journal-title":"Comput. Ind. Eng."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/j.trc.2004.07.007","article-title":"Intelligent transportation system based dynamic vehicle routing and scheduling with variable travel times","volume":"12","author":"Taniguchi","year":"2014","journal-title":"Transp. Res. Pt. C-Emerg. Technol."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/j.trpro.2014.10.024","article-title":"Time dependent travel speed vehicle routing and scheduling on a real road network: The case of Torino","volume":"3","author":"Mancini","year":"2014","journal-title":"Transp. Res. Procedia"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2959","DOI":"10.1016\/j.cor.2004.04.013","article-title":"A dynamic vehicle routing problem with time-dependent travel times","volume":"32","author":"Haghani","year":"2005","journal-title":"Comput. Oper. Res."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/j.disopt.2007.05.004","article-title":"An iterated local search algorithm for the time-dependent vehicle routing problem with time windows","volume":"5","author":"Hashimoto","year":"2008","journal-title":"Discret. Optim."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.cor.2018.02.006","article-title":"Robust vehicle routing problem with hard time windows under demand and travel time uncertainty","volume":"94","author":"Hu","year":"2018","journal-title":"Comput. Oper. Res."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1016\/j.tre.2011.11.006","article-title":"The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics","volume":"48","author":"Figliozzi","year":"2012","journal-title":"Transp. Res. Pt. E-Logist. Transp. Rev."},{"key":"ref_20","first-page":"1626","article-title":"Solving TDVRP based on parallel-simulated annealing algorithm","volume":"21","author":"Mu","year":"2015","journal-title":"Comput. Int. Manuf. Syst."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.cie.2010.03.012","article-title":"Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem","volume":"59","author":"Kuo","year":"2010","journal-title":"Comput. Ind. Eng."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"104813","DOI":"10.1016\/j.knosys.2019.06.021","article-title":"Time-dependent vehicle routing problem with time windows of city logistics with a congestion avoidance approach","volume":"188","author":"Liu","year":"2020","journal-title":"Knowl.-Based Syst."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.eswa.2018.01.052","article-title":"A fuel efficient green vehicle routing problem with varying speed constraint (F-GVRP)","volume":"100","author":"Poonthalir","year":"2018","journal-title":"Expert Syst. Appl."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"106011","DOI":"10.1016\/j.cie.2019.106011","article-title":"A model for capacitated green vehicle routing problem with the time varying vehicle speed and soft time windows","volume":"137","author":"Xu","year":"2019","journal-title":"Comput. Ind. Eng."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.tre.2016.01.011","article-title":"The heterogeneous green vehicle routing and scheduling problem with time-varying traffic congestion","volume":"88","author":"Xiao","year":"2016","journal-title":"Transp. Res. Pt. E-Logist. Transp. Rev."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.trd.2017.04.016","article-title":"Time-dependent green vehicle routing problem with stochastic vehicle speeds: An approximate dynamic programming algorithm","volume":"54","author":"Soysal","year":"2017","journal-title":"Transp. Res. Part D-Transp. Environ."},{"key":"ref_27","unstructured":"Yang, H. (2018). Research of Urban Recurrent Congestion Evolution based on Taxi GPS Date. [Doctoral Thesis, Harbin Institute of Technology]."},{"key":"ref_28","unstructured":"Hickman, J., Hassel, D., Joumard, R., Samaras, Z., and Sorenson, S. (1999). MEET Methodology for Calculating Transport Emissions and Energy Consumption, European Commission. Technical Report DG VII."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.cie.2016.07.029","article-title":"A novel comprehensive macroscopic model for time-dependent vehicle routing problem with multi-alternative graph to reduce fuel consumption: A case study","volume":"99","author":"Alinaghian","year":"2016","journal-title":"Comput. Ind. Eng."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/j.cam.2009.02.015","article-title":"A hybrid differential evolution algorithm to vehicle routing problem with fuzzy demands","volume":"231","author":"Cao","year":"2009","journal-title":"J. Comput. Appl. Math."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/trsc.34.1.99.12278","article-title":"Stochastic vehicle routing problem with restocking","volume":"34","author":"Yang","year":"2000","journal-title":"Transp. Sci."},{"key":"ref_32","first-page":"167","article-title":"Multi-tour optimization policy for stochastic vehicle routing problem","volume":"27","author":"Xie","year":"2007","journal-title":"Syst. Eng. Theory Prac."},{"key":"ref_33","first-page":"523","article-title":"Novel algorithm for multi-objective vehicle routing problem with stochastic demand","volume":"18","author":"Zhao","year":"2012","journal-title":"Comput. Integr. Manuf. Syst."},{"key":"ref_34","first-page":"1","article-title":"The multi-depot vehicle routing problem with simultaneous deterministic delivery and stochastic pickup based on joint distribution","volume":"47","author":"Fan","year":"2021","journal-title":"Acta Auto Sinica"},{"key":"ref_35","first-page":"67","article-title":"Wasp Colony Algorithm for Vehicle Routing Problem with Soft Time Windows","volume":"29","author":"Yang","year":"2010","journal-title":"Appl. Res. Comput."},{"key":"ref_36","unstructured":"Augerat, P., Belenguer, J.M., Benavent, E., Corberan, A., and Rinaldi, G. (1998). Computational Results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem, Universite Joseph Fourier. Rapport de Recherche-IMAG."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/10\/2115\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:50:21Z","timestamp":1760143821000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/10\/2115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,12]]},"references-count":36,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2022,10]]}},"alternative-id":["sym14102115"],"URL":"https:\/\/doi.org\/10.3390\/sym14102115","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,12]]}}}