EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Time-Dependent Vehicle Routing Problem with Simultaneous Pickup-and-Delivery and Time Windows Considering Carbon Emission Costs Using an Improved Ant Colony Optimization Algorithm

Meiling He, Jin Zhang, Xun Han, Mei Yang, Xi Yang, Xiaohui Wu, Xiaolai Ma

Sustainability · 31.01.2026 · 18 (3) · 1430

DOI: 10.3390/su18031430 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Sustainability, online erschienen am 31.01.2026. Verfasst von Meiling He und 6 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 60 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Postgraduate Research and Practice Innovation Program of Jiangsu Province, Intelligent Policing Key Laboratory of Sichuan Province, Humanity and Social Science Youth Foundation of the Ministry of Education of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In the context of sustainable logistics planning, carbon emission costs have become a critical factor influencing distribution decisions. Meanwhile, the time-dependent characteristics of urban road networks and simultaneous pickup–delivery operations present significant challenges to vehicle routing problems (VRPs). This study addresses a time-dependent vehicle routing problem with simultaneous pickup–delivery and time windows (TDVRPSPDTW). Fuel consumption and carbon emission costs are quantified using a comprehensive emission model, while time-dependent network conditions, simultaneous pickup–delivery demands, and time window constraints are integrated into a unified modeling framework. To solve this NP-hard problem, an improved ant colony optimization (IACO) algorithm is developed by incorporating adaptive large neighborhood search to enhance solution diversity and convergence efficiency. Computational experiments are conducted using internationally recognized VRPSPDTW benchmark datasets and newly constructed TDVRPSPDTW instances, together with sensitivity analyses under varying traffic conditions, time window flexibility, and delivery strategies. The results indicate that the proposed IACO effectively addresses the TDVRPSPDTW. Comparing ant colony optimization with local search (ACO-LS), the IACO achieves a maximum reduction of 11.78% in total distribution cost. Furthermore, relative to the conventional separate pickup–delivery strategy, the simultaneous pickup–delivery mode reduces total distribution cost and carbon emission cost by 49.96% and 53.48%, respectively.

Förderung

  • Postgraduate Research and Practice Innovation Program of Jiangsu Province
  • Intelligent Policing Key Laboratory of Sichuan Province
  • Humanity and Social Science Youth Foundation of the Ministry of Education of China

Zitieren

APA

He, M., Zhang, J., Han, X., Yang, M., Yang, X., Wu, X., & Ma, X. (2026). Time-Dependent Vehicle Routing Problem with Simultaneous Pickup-and-Delivery and Time Windows Considering Carbon Emission Costs Using an Improved Ant Colony Optimization Algorithm. Sustainability, 18(3), 1430. https://doi.org/10.3390/su18031430

Vancouver

He M, Zhang J, Han X, Yang M, Yang X, Wu X, et al. Time-Dependent Vehicle Routing Problem with Simultaneous Pickup-and-Delivery and Time Windows Considering Carbon Emission Costs Using an Improved Ant Colony Optimization Algorithm. Sustainability. 2026;18(3):1430. doi:10.3390/su18031430

BibTeX
@article{He2026,
  author = {He, Meiling and Zhang, Jin and Han, Xun and Yang, Mei and Yang, Xi and Wu, Xiaohui and Ma, Xiaolai},
  title = {Time-Dependent Vehicle Routing Problem with Simultaneous Pickup-and-Delivery and Time Windows Considering Carbon Emission Costs Using an Improved Ant Colony Optimization Algorithm},
  journal = {Sustainability},
  year = {2026},
  volume = {18},
  number = {3},
  pages = {1430},
  doi = {10.3390/su18031430}
}
Kostenlos starten →