Özgür Kabadurmuş, Mehmet Serdar Erdoğan, Yiğitcan Özkan and Mertcan Köseoğlu
Distribution is one of the major sources of carbon emissions and this issue has been addressed by Green Vehicle Routing Problem (GVRP). This problem aims to fulfill the demand of a set of customers using a homogeneous fleet of Alternative Fuel Vehicles (AFV) originating from a single depot. The problem also includes a set of Alternative Fuel Stations (AFS) that can serve the AFVs. Since AFVs started to operate very recently, Alternative Fuel Stations servicing them are very few. Therefore, the driving span of the AFVs is very limited. This makes the routing decisions of AFVs more difficult. In this study, we formulated a multi-objective optimization model of Green Vehicle Routing Problem with two conflicting objective functions. While the first objective of our GVRP formulation aims to minimize total CO2 emission, which is proportional to the distance, the second aims to minimize the maximum traveling time of all routes. To solve this multi-objective problem, we used ɛ-constraint method, a multi-objective optimization technique, and found the Pareto optimal solutions. The problem is formulated as a Mixed-Integer Linear Programming (MILP) model in IBM OPL CPLEX. To test our proposed method, we generated two hypothetical but realistic distribution cases in Izmir, Turkey. The first case study focuses on an inner-city distribution in Izmir, and the second case study involves a regional distribution in the Aegean Region of Turkey. We presented the Pareto optimal solutions and showed that there is a tradeoff between the maximum distribution time and carbon emissions. The results showed that routes become shorter, the number of generated routes (and therefore, vehicles) increases and vehicles visit a lower number of fuel stations as the maximum traveling time decreases. We also showed that as maximum traveling time decreases, the solution time significantly decreases.