An Effective Heuristic Algorithm for the Double Vehicle Routing Problem with Multiple Stack and Heterogeneous Demand
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.
KeywordsVehicle routing Pickup and delivery Loading constraints Heterogeneous demand Simulated Annealing Meta-heuristic
The authors thank Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) and Fundação de Amparo à Pesquisa do Estado de Minas Gerais (FAPEMIG) for the financial support of this project.
- 3.Silveira, U.E.F., Benedito, M.P.L., Santos, A.G.: Heuristic approaches to double vehicle routing problem with multiple stacks. In: 15th IEEE International Conference on Intelligent Systems Design and Applications, pp. 231–236. IEEE Press, Marrakesh (2015)Google Scholar
- 4.Chagas, J.B.C., Silveira, U.E.F., Benedito, M.P.L., Santos, A.G.: Simulated annealing metaheuristic for the double vehicle routing problem with multiple stacks. In: 19th IEEE International Conference on Intelligent Transportation Systems, pp. 1311–1316. IEEE Press, Rio de Janeiro (2016)Google Scholar
- 5.Chagas, J.B.C., Santos, A.G.: A branch-and-price algorithm for the double vehicle routing problem with multiple stacks and heterogeneous demand. In: International Conference on Intelligent Systems Design and Applications, pp. 921–934. Springer, Cham (2016)Google Scholar