Short Review in Green Vehicle Routing Problem with Pick-up and Delivery and Time Windows Using Metaheuristics

Abstract

Integrating sustainability is a crucial process that every organization must incorporate into its supply chain. Transportation is one of the primary contributors to carbon emissions, accounting for approximately 24% of global CO₂ emissions. Notably, road transport is responsible for nearly 75% of these total emissions worldwide, according to recent studies conducted by the International Energy Agency (IEA) in 2021.

This paper explores the Green Vehicle Routing Problem (GVRP), which represents an extension of the classical Vehicle Routing Problem (VRP). GVRP integrates environmental considerations by focusing on reducing the carbon footprint. Within this framework, we focus on the Green Vehicle Routing Problem Pickup and Delivery with Time Windows (GVRPPDTW) variant, which introduces additional complexity by requiring vehicles to serve customers with specific pickup and delivery requests within predefined time windows. This variant reflects realistic constraints in the logistics field, such as schedule synchronization and the balance between efficiency and customer satisfaction. This study presents a short comprehensive review conducted over the period 2017-2024, identifying and analyzing research conducted in the context of this variant and analyzing the efficiency of using metaheuristic algorithms in solving this optimization problem. We will discuss existing research gaps and propose future directions for further advancements in the field. This analysis aims to provide a comprehensive understanding of GVRPPDTW, offering valuable insights for researchers and practitioners seeking to address its challenges.