{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T17:34:00Z","timestamp":1768584840459,"version":"3.49.0"},"reference-count":32,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T00:00:00Z","timestamp":1679875200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Science Research Project of Anhui Higher Education Institutes","award":["No.2022AH040050"],"award-info":[{"award-number":["No.2022AH040050"]}]},{"name":"Science Research Project of Anhui Higher Education Institutes","award":["No.2022AH050269"],"award-info":[{"award-number":["No.2022AH050269"]}]},{"name":"Science Research Project of Anhui Higher Education Institutes","award":["2208085MG181"],"award-info":[{"award-number":["2208085MG181"]}]},{"name":"Science Research Project of Anhui Higher Education Institutes","award":["CS2021-ZD01"],"award-info":[{"award-number":["CS2021-ZD01"]}]},{"name":"General Program of Anhui Natural Science Foundation","award":["No.2022AH040050"],"award-info":[{"award-number":["No.2022AH040050"]}]},{"name":"General Program of Anhui Natural Science Foundation","award":["No.2022AH050269"],"award-info":[{"award-number":["No.2022AH050269"]}]},{"name":"General Program of Anhui Natural Science Foundation","award":["2208085MG181"],"award-info":[{"award-number":["2208085MG181"]}]},{"name":"General Program of Anhui Natural Science Foundation","award":["CS2021-ZD01"],"award-info":[{"award-number":["CS2021-ZD01"]}]},{"name":"Open Fund of Key Laboratory of Anhui Higher Education Institutes","award":["No.2022AH040050"],"award-info":[{"award-number":["No.2022AH040050"]}]},{"name":"Open Fund of Key Laboratory of Anhui Higher Education Institutes","award":["No.2022AH050269"],"award-info":[{"award-number":["No.2022AH050269"]}]},{"name":"Open Fund of Key Laboratory of Anhui Higher Education Institutes","award":["2208085MG181"],"award-info":[{"award-number":["2208085MG181"]}]},{"name":"Open Fund of Key Laboratory of Anhui Higher Education Institutes","award":["CS2021-ZD01"],"award-info":[{"award-number":["CS2021-ZD01"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems"],"abstract":"<jats:p>The dense population and the large amount of domestic waste generated make it difficult to determine the best route and departure time for waste removal trucks in a city. Aiming at the problems of municipal solid waste (MSW) removal and transportation not in time, high collection and transportation costs and high carbon emissions, this paper studies the vehicle routing problem of municipal solid waste removal under the influence of time-dependent travel time, traffic congestion and carbon emissions. In this paper, a dual objective model with the lowest total economic cost and the highest garbage removal efficiency is established, and a DCD-DE-NSGAII algorithm based on Dynamic Crowding Distance and Differential Evolution is designed to improve the search ability, improve the convergence speed and increase the diversity of the optimal solution set. The results show that: according to the actual situation of garbage collection and transportation, the method can scientifically plan the garbage collection and transportation route, give a reasonable garbage collection scheme and departure time, and effectively avoid traffic congestion time; Through algorithm comparison, the algorithm and model proposed in this paper can reduce collection and transportation costs, improve transportation efficiency and reduce environmental pollution.<\/jats:p>","DOI":"10.3390\/systems11040173","type":"journal-article","created":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T02:18:27Z","timestamp":1679883507000},"page":"173","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Based on Improved NSGA-II Algorithm for Solving Time-Dependent Green Vehicle Routing Problem of Urban Waste Removal with the Consideration of Traffic Congestion: A Case Study in China"],"prefix":"10.3390","volume":"11","author":[{"given":"Zhenhua","family":"Gao","sequence":"first","affiliation":[{"name":"School of Management Science and Engineering, Anhui University of Technology, Ma\u2019anshan 243002, China"}]},{"given":"Xinyu","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Management Science and Engineering, Anhui University of Technology, Ma\u2019anshan 243002, China"}]},{"given":"Yuhuan","family":"Hu","sequence":"additional","affiliation":[{"name":"School of Management Science and Engineering, Anhui University of Technology, Ma\u2019anshan 243002, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2115-8870","authenticated-orcid":false,"given":"Hongjun","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Management Science and Engineering, Anhui University of Technology, Ma\u2019anshan 243002, China"}]},{"given":"Chunliu","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Management Science and Engineering, Anhui University of Technology, Ma\u2019anshan 243002, China"}]},{"given":"Hongliang","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Management Science and Engineering, Anhui University of Technology, Ma\u2019anshan 243002, China"}]}],"member":"1968","published-online":{"date-parts":[[2023,3,27]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s11750-019-00505-5","article-title":"Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: A case study","volume":"27","author":"Molina","year":"2019","journal-title":"TOP"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.4186\/ej.2020.24.5.55","article-title":"Waste Collection Vehicle Routing Problem Model with Multiple Trips, Time Windows, Split Delivery, Heterogeneous Fleet and Intermediate Facility","volume":"24","author":"Nurprihatin","year":"2020","journal-title":"Eng. J."},{"key":"ref_3","first-page":"239","article-title":"Metaheuristics for a bi-objective location-routing-problem in waste collection management","volume":"34","author":"Asgarian","year":"2017","journal-title":"J. Ind. Prod. Eng."},{"key":"ref_4","first-page":"227","article-title":"A multi-objective model for the residential waste collection location-routing problem with time windows","volume":"12","author":"Rabani","year":"2020","journal-title":"J. Ind. Syst. Eng."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"100950","DOI":"10.1016\/j.retrec.2020.100950","article-title":"Effective municipal solid waste collection using geospatial information systems for transportation: A case study of two metropolitan cities in Pakistan","volume":"84","author":"Hina","year":"2020","journal-title":"Res. Transp. Econ."},{"key":"ref_6","first-page":"256","article-title":"Multi-objective Optimization of Heterogeneous Vehicles Routing in the Case of Medical Waste Using Genetic Algorithm","volume":"1207","author":"Ahlaqqach","year":"2020","journal-title":"Smart Appl. Data Anal."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"100113","DOI":"10.1016\/j.dajour.2022.100113","article-title":"The applications of multiple route optimization heuristics and meta-heuristic algorithms to solid waste transportation: A case study in Turkey","volume":"4","author":"Dereci","year":"2022","journal-title":"Decis. Anal. J."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1016\/j.jclepro.2017.10.001","article-title":"Optimizing the green open vehicle routing problem with time windows by minimizing comprehensive routing cost","volume":"171","author":"Niu","year":"2018","journal-title":"J. Clean. Prod."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1016\/j.cie.2019.02.031","article-title":"Multi-factorial evolutionary algorithm based novel solution approach for multi-objective pollution-routing problem","volume":"130","author":"Rauniyar","year":"2019","journal-title":"Comput. Ind. Eng."},{"key":"ref_10","first-page":"365","article-title":"A multi-objective green vehicle routing optimization algorithm based on delivery benefit blance","volume":"38","author":"Qiu","year":"2023","journal-title":"Control Decis."},{"key":"ref_11","first-page":"2202","article-title":"Research on green vehicle routing problem and algorithm of multi-to-many cross-docking","volume":"19","author":"Zhou","year":"2022","journal-title":"J. Railw. Sci. Eng."},{"key":"ref_12","unstructured":"Zhou, X., Jiang, T., He, C., Wang, L., and Yang, L. (2016). Green Vehicle Routing Model and Its Solution Algorithm in Cold-chain Logistics Distribution. Chin. J. Manag. Sci., 1\u201311."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1111\/itor.13044","article-title":"Bi-objective green vehicle routing problem","volume":"29","author":"Karabulut","year":"2022","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_14","first-page":"11","article-title":"Performance Comparison of Two Recent Heuristics for Green Time Dependent Vehicle Routing Problem","volume":"6","author":"Soysal","year":"2019","journal-title":"Int. J. Bus. Anal."},{"key":"ref_15","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_16","first-page":"57","article-title":"Improved ant colony algorithm and modeling of time-dependent green vehicle routing problem","volume":"22","author":"Zhou","year":"2019","journal-title":"J. Manag. Sci. China"},{"key":"ref_17","first-page":"473","article-title":"Multi-depot green vehicle routing model and its optimization algorithm with time-dependent speed","volume":"37","author":"Zhou","year":"2022","journal-title":"Control Decis."},{"key":"ref_18","first-page":"75","article-title":"Study on the Optimization of Pollution Routing Problem with Time-dependent Traffic Congestion","volume":"25","author":"Ge","year":"2020","journal-title":"Ind. Eng. Manag."},{"key":"ref_19","first-page":"56","article-title":"On Time and Space Dependent Vehicle Routing Problem in Urban Delivery","volume":"26","author":"Chen","year":"2021","journal-title":"Ind. Eng. Manag."},{"key":"ref_20","first-page":"187","article-title":"Time-dependent Green Vehicle Routing Problem","volume":"21","author":"Zhu","year":"2021","journal-title":"J. Transp. Syst. Eng. Inf. Technol."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"109093","DOI":"10.1016\/j.cie.2023.109093","article-title":"A branch-price-and-cut algorithm for a time-dependent green vehicle routing problem with the consideration of traffic congestion","volume":"177","author":"Luo","year":"2023","journal-title":"Comput. Ind. Eng."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Liu, Y., Roberto, B., Zhou, J., Yu, Y., Zhang, Y., and Sun, W. (2023). Efficient Feasibility Checks and an Adaptive Large Neighborhood Search Algorithm for the Time-Dependent Green Vehicle Routing Problem with Time Windows. Eur. J. Oper. Res., in press.","DOI":"10.1016\/j.ejor.2023.02.028"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Deb, K., Agrawal, S., Pratap, A., and Meyarivan, T. (2000, January 18\u201320). A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization: NSGA-II. Proceedings of the 6th International Conference, Paris, France.","DOI":"10.1007\/3-540-45356-3_83"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multiobjective genetic algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"57757","DOI":"10.1109\/ACCESS.2021.3070634","article-title":"A comprehensive review on NSGA-II for multi-objective combinatorial optimization problems","volume":"9","author":"Verma","year":"2021","journal-title":"IEEE Access"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Xu, H., Fan, W., Wei, T., and Yu, L. (2008, January 23\u201326). An Or-opt NSGA-II algorithm for multi-objective Vehicle Routing Problem with Time Windows. Proceedings of the 2008 IEEE International Conference on Automation Science and Engineering, Arlington, VA, USA.","DOI":"10.1109\/COASE.2008.4626505"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Liu, Y.Y., Enayatollahi, F., and Thulasiraman, P. (2019, January 6\u20139). Traffic aware many-objective dynamic route planning. Proceedings of the 2019 IEEE Symposium Series on Computational Intelligence (SSCI), Xiamen, China.","DOI":"10.1109\/SSCI44817.2019.9002725"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/j.knosys.2018.07.024","article-title":"Collaboration and transportation resource sharing in multiple centers vehicle routing optimization with delivery and pickup","volume":"160","author":"Wang","year":"2018","journal-title":"Knowl. Based Syst."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"114779","DOI":"10.1016\/j.eswa.2021.114779","article-title":"NSGA-II with objective-specific variation operators for multiobjective vehicle routing problem with time windows","volume":"176","author":"Srivastava","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"ref_30","unstructured":"Barth, M., Younglove, T., and Scora, G. (2005). Development of a Heavy-Duty Diesel Modal Emissions and Fuel Consumption Model, UC Berkeley; California Partners for Advanced Transportation Technology."},{"key":"ref_31","first-page":"257","article-title":"An Improved NSGA-Il Algorithm Based on Dynamic Crowding Distance and Adaptive t-Distribution Crossover","volume":"36","author":"Shi","year":"2019","journal-title":"Comput. Simul."},{"key":"ref_32","first-page":"47","article-title":"An improved NSGA-II algorithm for multi-objective nonlinear optimization","volume":"37","author":"Zheng","year":"2020","journal-title":"Microelectron. Comput."}],"container-title":["Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-8954\/11\/4\/173\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:03:42Z","timestamp":1760123022000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-8954\/11\/4\/173"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,27]]},"references-count":32,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2023,4]]}},"alternative-id":["systems11040173"],"URL":"https:\/\/doi.org\/10.3390\/systems11040173","relation":{},"ISSN":["2079-8954"],"issn-type":[{"value":"2079-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,27]]}}}