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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
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)
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, pp. 921–934. Springer, Cham (2016)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)
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)
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.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Chagas, J.B.C., Santos, A.G. (2018). An Effective Heuristic Algorithm for the Double Vehicle Routing Problem with Multiple Stack and Heterogeneous Demand. In: Abraham, A., Muhuri, P., Muda, A., Gandhi, N. (eds) Intelligent Systems Design and Applications. ISDA 2017. Advances in Intelligent Systems and Computing, vol 736. Springer, Cham. https://doi.org/10.1007/978-3-319-76348-4_75
Download citation
DOI: https://doi.org/10.1007/978-3-319-76348-4_75
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-76347-7
Online ISBN: 978-3-319-76348-4
eBook Packages: EngineeringEngineering (R0)