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

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 736)

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.

Keywords

Vehicle routing Pickup and delivery Loading constraints Heterogeneous demand Simulated Annealing Meta-heuristic 

Notes

Acknowledgments

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.

References

  1. 1.
    Petersen, H.L., Madsen, O.B.: The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches. Eur. J. Oper. Res. 198, 139–147 (2009)CrossRefMATHGoogle Scholar
  2. 2.
    Iori, M., Riera-Ledesma, J.: Exact algorithms for the double vehicle routing problem with multiple stacks. Comput. Oper. Res. 63, 83–101 (2015)MathSciNetCrossRefMATHGoogle Scholar
  3. 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. 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. 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
  6. 6.
    Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    López-Ibáñez, M., Dubois-Lacoste, J., Cáceres, L.P., Birattari, M., Stützle, T.: The Irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43–58 (2016)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Departamento de ComputaçãoUniversidade Federal de Ouro PretoOuro PretoBrazil
  2. 2.Departamento de InformáticaUniversidade Federal de ViçosaViçosaBrazil

Personalised recommendations