Using meta-heuristic algorithms and hybrid of them to solve multi compartment Vehicle Routing Problem

Abstract

The aim of Vehicle Routing Problem (VRP) is finding a reasonable routes for vehicle serving customers. Transportation has a significant effects on environment and these effects can be dangerous. So, an extension of vehicle routing problem called Pollution Routing Problem (PRP) is introduced to address environmentally issues. Load and speed are most important factors that can change the amount of pollution emitted by vehicle. Pollution routing problem calculates not only traveled distance, but also the amount of greenhouse emitted by fleet of vehicles. In this study, a new kind of green vehicle routing problem called multi-compartment green vehicle routing problem (MCGVRP) is presented. The aim of this problem is to minimize the cost of changes in load, speed and payment to drivers by considering pollution emitted by vehicle. Two meta-heuristic algorithms including genetic algorithm (GA) and simulated annealing (SA) are selected to solve the presented problem along with a hybrid metaheuristic algorithm. Finally, the results obtained by these methods are compared with each other.