Abstract
This paper introduces the Double Vehicle Routing Problem with Multiple Stacks and Heterogeneous Demand (DVRPMSHD). This problem is a more realistic generalization of the Double Vehicle Routing Problem with Multiple Stacks when customers have heterogeneous demands and the demand of each customer cannot be divided among two or more vehicles. The objective of this problem is to find optimal routes for a fleet of vehicles to visit all pickup and delivery locations while ensuring the feasibility of the loading plan. An integer linear programming and a branch-and-price algorithm are proposed. The computational results show that our branch-and-price algorithm is able to find the optimal solution for most of the instances reported and find better solutions than those found by the integer linear programming formulation for some instances.
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
Grabara, J., Kolcun, M., Kot, S.: The role of information systems in transport logistics. Int. J. Educ. Res. 2, 1–6 (2014)
Aggelakakis, A., Bernardino, J., Boile, M., Christidis, P., Condeco, A., Krail, M., Schippl, J.: The future of the transport industry. Technical report, Institute for Prospective and Technological Studies, Joint Research Centre (2015)
Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6, 80–91 (1959)
Desrochers, M., Lenstra, J.K., Savelsbergh, M.W.: A classification scheme for vehicle routing and scheduling problems. Eur. J. Oper. Res. 46, 322–332 (1990)
Iori, M., Martello, S.: Routing problems with loading constraints. TOP 18, 4–27 (2010)
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)
Felipe, Á., Ortuño, M.T., Tirado, G.: The double traveling salesman problem with multiple stacks: a variable neighborhood search approach. Comput. Oper. Res. 36, 2983–2993 (2009)
Carrabs, F., Cerulli, R., Speranza, M.G.: A branch-and-bound algorithm for the double TSP with two stacks. Networks 61, 58–75 (2013)
Alba Martínez, M.A., Cordeau, J.F., Dell’Amico, M.: A branch-and-cut algorithm for the double traveling salesman problem with multiple stacks. INFORMS J. Comput. 25, 41–55 (2013)
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)
Desaulniers, G., Desrosiers, J., Solomon, M.M.: Column Generation. Springer Science & Business Media, Berlin (2006)
Savelsbergh, M.: A branch-and-price algorithm for the generalized assignment problem. Oper. Res. 45, 831–841 (1997)
Acknowledgments
The authors thanks the Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) and GAPSO Company for financial support of this project.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Chagas, J.B.C., Santos, A.G. (2017). A Branch-and-Price Algorithm for the Double Vehicle Routing Problem with Multiple Stacks and Heterogeneous Demand. In: Madureira, A., Abraham, A., Gamboa, D., Novais, P. (eds) Intelligent Systems Design and Applications. ISDA 2016. Advances in Intelligent Systems and Computing, vol 557. Springer, Cham. https://doi.org/10.1007/978-3-319-53480-0_91
Download citation
DOI: https://doi.org/10.1007/978-3-319-53480-0_91
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-53479-4
Online ISBN: 978-3-319-53480-0
eBook Packages: EngineeringEngineering (R0)