Advertisement

A Late Acceptance Hill-Climbing Heuristic Algorithm for the Double Vehicle Routing Problem with Multiple Stacks and Heterogeneous Demand

  • André L. S. SouzaEmail author
  • Jonatas B. C. ChagasEmail author
  • Puca H. V. Penna
  • Marcone J. F. Souza
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 940)

Abstract

We propose a heuristic algorithm based on the Late Acceptance Hill-Climbing metaheuristic for solving the Double Vehicle Routing Problem with Multiple Stacks and Heterogeneous Demand (DVRPMSHD). In this problem, customers must be served by a fleet of vehicles, which have their containers divided into horizontal stacks, where each load/unload operation has to obey the last-in-first-out policy. Each customer has a pickup location and a delivery location, where demand items must be collected and delivered, respectively. All demand of a specific customer cannot be split between the vehicles. The DVRPMSHD goal is to find optimal tours to visit all pickup and delivery locations while ensuring the feasibility of the loading plan of each vehicle. We have tested our algorithm on the benchmark instances and experimental results showed that our approach is highly competitive with other solution approaches already present in the literature.

Keywords

Pickup and delivery Loading constraints Late Acceptance Hill-Climbing 

Notes

Acknowledgments

The authors thank Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES), Fundação de Amparo à Pesquisa do Estado de Minas Gerais (FAPEMIG), Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq), Universidade Federal de Ouro Preto (UFOP) and Universidade Federal de Viçosa (UFV) for supporting this research.

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)CrossRefGoogle Scholar
  2. 2.
    Casazza, M., Ceselli, A., Nunkesser, M.: Efficient algorithms for the double traveling salesman problem with multiple stacks. Comput. Oper. Res. 39, 1044–1053 (2012)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Barbato, M., Grappe, R., Lacroix, M., Calvo, R.W.: Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks. Discrete Optim. 21, 25–41 (2016)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Iori, M., Riera-Ledesma, J.: Exact algorithms for the double vehicle routing problem with multiple stacks. Comput. Oper. Res. 63, 83–101 (2015)MathSciNetCrossRefGoogle Scholar
  5. 5.
    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
  6. 6.
    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
  7. 7.
    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, Porto, Portugal, pp. 921–934. Springer, Cham (2016)Google Scholar
  8. 8.
    Chagas, J.B.C., Santos, A.G.: An effective heuristic algorithm for the double vehicle routing problem with multiple stacks and heterogeneous demand. In: International Conference on Intelligent Systems Design and Applications, Delhi, India, pp. 785–796. Springer, Cham (2017)Google Scholar
  9. 9.
    Burke, E.K., Bykov, Y.: The late acceptance hill-climbing heuristic. Eur. J. Oper. Res. 258, 70–78 (2017)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

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