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.
A. L. S. Souza and J. B. C. Chagas—Contributed equally to this work.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
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)
Casazza, M., Ceselli, A., Nunkesser, M.: Efficient algorithms for the double traveling salesman problem with multiple stacks. Comput. Oper. Res. 39, 1044–1053 (2012)
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)
Iori, M., Riera-Ledesma, J.: Exact algorithms for the double vehicle routing problem with multiple stacks. Comput. Oper. Res. 63, 83–101 (2015)
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)
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)
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)
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)
Burke, E.K., Bykov, Y.: The late acceptance hill-climbing heuristic. Eur. J. Oper. Res. 258, 70–78 (2017)
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.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Souza, A.L.S., Chagas, J.B.C., Penna, P.H.V., Souza, M.J.F. (2020). A Late Acceptance Hill-Climbing Heuristic Algorithm for the Double Vehicle Routing Problem with Multiple Stacks and Heterogeneous Demand. In: Abraham, A., Cherukuri, A.K., Melin, P., Gandhi, N. (eds) Intelligent Systems Design and Applications. ISDA 2018 2018. Advances in Intelligent Systems and Computing, vol 940. Springer, Cham. https://doi.org/10.1007/978-3-030-16657-1_71
Download citation
DOI: https://doi.org/10.1007/978-3-030-16657-1_71
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-16656-4
Online ISBN: 978-3-030-16657-1
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)