An Effective Heuristic Algorithm for the Double Vehicle Routing Problem with Multiple Stack and Heterogeneous Demand

Abstract

In this work, we address the Double Routing Vehicle Problem with Multiple Stacks and Heterogeneous Demand, a pickup and delivery problem. The objective of the problem is to determine a set routes for a fleet of vehicles in order to meet the demand of a set of customers so that the distance travelled by the vehicles is the minimum possible, while ensuring the feasibility of the loading plan. We propose a heuristic approach based on the Simulated Annealing for solving the problem. The computational results show that our heuristic is able to find high quality solution in short computational time when compared to the exact methods found in the literature.