GRASP Algorithm for the Green Capacitated Vehicle Routing Problem (GCVRP)

The Vehicle Routing Problem (VRP) is a classic combinatorial optimization problem with a wide range of uses, studied for over more than fifty years since Dantzig and Ramser. In this paper, we define and present the bi-objective Green Capacitated Vehicle Routing Problem (GCVRP), the primary goal of the problem is to identify vehicle routes that will serve a group of customers while reducing the overall distance traveled and the amount of carbon dioxide emissions, we formulate a mathematical model and suggest using the GRASP (Greedy Randomized Adaptive Search Procedure) algorithm to solve the problem. The metaheuristic is tested on instances that we have proposed. The numerical experiment results demonstrate the algorithm's effectiveness within a reasonable amount of time in the case of small instances, permitting us to utilize it extensively in subsequent work.