Solution of the Capacity-Constrained Vehicle Routing Problem Considering Carbon Footprint Within the Scope of Sustainable Logistics with Genetic Algorithm


Creative Commons License

Palamutçuoğlu B. T., Çavuşoğlu S., Çamlı A. Y., Virlanuta F. O., Bacalum S., ZÜNGÜN D., ...More

Sustainability (Switzerland), vol.17, no.2, 2025 (SCI-Expanded) identifier

  • Publication Type: Article / Article
  • Volume: 17 Issue: 2
  • Publication Date: 2025
  • Doi Number: 10.3390/su17020727
  • Journal Name: Sustainability (Switzerland)
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Social Sciences Citation Index (SSCI), Scopus, Aerospace Database, Agricultural & Environmental Science Database, CAB Abstracts, Communication Abstracts, Food Science & Technology Abstracts, Geobase, INSPEC, Metadex, Veterinary Science Database, Directory of Open Access Journals, Civil Engineering Abstracts
  • Keywords: carbon footprint, genetic algorithm, green vehicle routing, sustainable vehicle routing
  • İstanbul Yeni Yüzyıl University Affiliated: Yes

Abstract

One of the important problems of sustainable logistics is routing vehicles in a sustainable manner, the green vehicle routing problem, or vehicle routing problems which aim to reduce CO2 emissions. In the literature research, it was seen that these problems were solved with heuristic, metaheuristic, or hyper-heuristic methods and hybrid approaches since they are in the NP-hard class. This work presents a parallel multi-process genetic algorithm that incorporates problem-specific genetic operators to minimize CO2 emissions in the capacity-constrained vehicle routing problem. Unlike previous research, the algorithm combines parallel computing with tailored genetic operators in order to enhance the diversity of solutions and speed up convergence. Genetic algorithm models were developed to minimize total distance, CO2 emissions, and both objectives simultaneously. Two genetic algorithm models were developed to minimize total distance and CO2 emissions. Experimental results using the reference CVRP examples such as A-n32-k5 and B-n44-k7 show that the proposed approach reduces CO2 emissions by 1.2% more than hybrid artificial bee colony optimization, 1.3% more than ant colony optimization, and 4% more than the traditional genetic algorithm. Experimental results using benchmark CVRP instances demonstrate that the proposed approach outperforms hybrid artificial bee colony optimization, ant colony optimization, and traditional genetic algorithms for most of the test cases. This is done by exploiting multi-core processors, and the parallel architecture has improved computational efficiency; the modules compare and update solutions against the global optimum. Results obtained show that prioritizing CO2 emissions as the only objective yields better results compared to multi-objective models. This study makes two significant contributions to the literature: (1) it introduces a novel parallel genetic algorithm framework optimized for CO2 emission reduction, and (2) it provides empirical evidence underscoring the advantages of emission-focused optimization in CVRP.