An Adaptive Large Neighborhood Search Heuristic for the Green Vehicle Routing Problem with Simultaneously Pickup and Delivery and Hard Time Windows

The classical models of vehicle routing generally focused on minimizing total distance and travel time, however in green vehicle routing problem the main objective is minimizing total emissions and fuel consumption besides the other objects. In this paper, extension of GVRP with minimizing fuel and emission costs presented that considered pickup and delivery constraints with hard time windows. Travel time in this model is not constant and speed of vehicles would be determined in regards to customers’ time widows. In this paper, a heuristic based adaptive large neighborhood search proposed for solving the model. Construction algorithm in this method is heuristic based algorithm with proposed criterion according to pick up and delivery constrains and time windows with assumption of variable speed. Computational results confirms efficiency of this algorithm.