Abstract
The Vehicle Routing Problem with Time Windows is a generalization of the well known capacity constrained Vehicle Routing Problem. A homogeneous fleet of vehicles has to service a set of customers. The service of the customers can only start within a well-defined time interval denoted the time window. The objective is to determine routes for the vehicles that minimizes the accumulated cost (or distance). Currently the best approaches for determining optimal solutions are based on column generation and Branch-and-Bound, also known as Branch-and-Price. This paper presents two ideas for run-time improvements of the Branch-and-Price framework for the Vehicle Routing Problem with Time Windows. Both ideas reveal a significant potential for run-time refinements when speeding up an exact approach without compromising optimality.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barnhart, C., E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, and P. H. Vance, “Branch-and-price: Column generation for solving huge integer programs”, Operations Research, Vol. 46, No. 3, pp316–329, 1998.
Desrochers, M., J. Desrosiers, and M. Solomon, “A new optimization algorithm for the vehicle routing problem with time windows”, Operations Research, Vol. 40, No. 2, pp342–354, 1992.
Desrochers, M., “An algorithm for the shortest path problem with resource constraints”, Technical Report G-88-27, GERAD,’ Ecole des Hautes’ Etudes Commerciales, Universit’e de Montr’eal, September 1988.
G’elinas, S., M. Desrochers, J. Desrosiers, and M. M. Solomon, “A new branching strategy for time constrained routing problems with application to backhauling”, Annals of Operations Research, Vol. 61, pp91–109, 1995.
Halse, K., “Modeling and solving complex vehicle routing problems”, PhD thesis, Department for Mathematical Modeling, Technical University of Denmark, 1992.
Houck, D.J., J. Picard, M. Queyranne, and R. R. Vemuganti, “The travelling salesman problem as a constrained shortest path problem: Theory and computational experience”, Opsearch, Vol. 17, No. 2&3, pp93–109, 1980.
Kohl, N., J. Desrosiers, O.B.G. Madsen, M.M. Solomon, and F. Soumis, “k-path cuts for the vehicle routing problem with time windows”, Technical Report IMM-REP-1997-12, Department of Mathematical Modelling, Technical University of Denmark, 1997.
Kohl, N., “Exact methods for time constained routing and related scheduling problems”, PhD thesis, Department of Mathematical Modelling, Technical University of Denmark, 1995. IMM-PHD-1995-16.
Kolen, A.W.J., A.H.G.R. Kaan, and H.W.J.M. Trienekens, “Vehicle routing with time windows”, Operations Research, Vol. 35, No. 2, pp266–273, 1987.
Larsen, J., “Parallellization of the vehicle routing problem with time windows”, PhD thesis, Department of Mathematical Modelling, Technical University of Denmark, 1999. IMM-PHD-1999-62.
Wolsey, L.A., Integer Programming, Wiley-Interscience, 1998.
Author information
Authors and Affiliations
Additional information
Jesper Larsen received his BSc and MSc degrees in computer science from Copenhagen University, Denmark, in 1992 respectively 1995. He received his Ph.D. in Operations Research from the Technical University of Denmark in 1999. Since 1999 he has been with the department of Informatics and Mathematical Modelling at the Technical University of Denmark, until 2003 as assistant professor and since 2003 as associate professor. His research interests include disruption management, manpower planning, production planning and transport optimization.
Rights and permissions
About this article
Cite this article
Larsen, J. Refinements of the column generation process for the Vehicle Routing Problem with Time Windows. J. Syst. Sci. Syst. Eng. 13, 326–341 (2004). https://doi.org/10.1007/s11518-006-0168-9
Issue Date:
DOI: https://doi.org/10.1007/s11518-006-0168-9