Abstract
In this work we propose a computational study of a column generation based heuristic prototype for the vehicle routing problem with two-dimensional loading constraints. This prototype was recently proposed in literature (Pinto et al., 2013) and it relies in a column generation algorithm whose subproblem is relaxed. After solving the subproblem, the feasibility of the routes is verified using lower bounds and the classical bottom-left heuristic, enhanced with sequential constraints. For the infeasible routes, a simple route shortening process is applied, and the feasibility is tested again. The effectiveness of our approach is evaluated using benchmark instances from the literature.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Fuellerer, G., Doerner, K., Hartl, R., Iori, M.: Ant colony optimization for the two-dimensional loading vehicle routing problem. Computers & Operations Research 36(3), 655–673 (2009)
Gendreau, M., Iori, M., Laporte, G., Martello, S.: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51(1), 4–18 (2008)
Iori, M.: Metaheuristic algorithms for combinatorial optimization problems. PhD thesis, DEIS, University of Bologna (2004)
Iori, M., Salazar-Gonzalez, J.-J., Vigo, D.: An exact approach for the vehicle routing problem with twodimensional loading constraints. Transportation Science 41(2), 253–264 (2007)
Leung, S.C., Zhou, X., Zhang, D., Zheng, J.: Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem. Computers & Operations Research 38(1), 205–215 (2011)
Lodi, A., Martello, S., Vigo, D.: Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS Journal on Computing 11(4), 345–357 (1999)
Martello, S., Vigo, D.: Exact solution of the two-dimensional finite bin packing problem. Management science 44(3), 388–399 (1998)
Pinto, T., Alves, C., de Carvalho, J.V.: Column generation based heuristic for a vehicle routing problem with 2-dimensional loading constraints: a prototype. In: XI Congresso Galego de Estatística e Investigación de Operacións, Spain (2013)
Righini, G., Salani, M.: New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51(3), 155–170 (2008)
Salani, M., Vacca, I.: Branch and price for the vehicle routing problem with discrete split deliveries and time windows. European Journal of Operational Research 213(3), 470–477 (2011)
Vacca, I., Salani, M., Bierlaire, M.: An exact algorithm for the integrated planning of berth allocation and quay crane assignment. Transportation Science 47(2), 148–161 (2013)
Zachariadis, E.E., Tarantilis, C.D., Kiranoudis, C.T.: A guided tabu search for the vehicle routing problem with two-dimensional loading constraints. European Journal of Operational Research 195(3), 729–743 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Pinto, T., Alves, C., de Carvalho, J.V. (2015). Exploring a Column Generation Approach for a Routing Problem with Sequential Packing Constraints. In: Póvoa, A., de Miranda, J. (eds) Operations Research and Big Data. Studies in Big Data, vol 15. Springer, Cham. https://doi.org/10.1007/978-3-319-24154-8_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-24154-8_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24152-4
Online ISBN: 978-3-319-24154-8
eBook Packages: EngineeringEngineering (R0)