Abstract
A classical method, first suggested by Balinski and Quandt (1964), for solving the VRP with capacity and time-window constraints, is based on formulating the problem as a set-partitioning problem.
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
References
Balinski, M. L., & Quandt, R. E. (1964). On an integer program for a delivery problem. Operation Research, 12, 300–304.
Bramel, J., & Simchi-Levi, D. (1997). On the effectiveness of set covering formulations for the vehicle routing problem. Operation Research, 45, 295–301.
Christofides, N., Mingozzi, A., & Toth, P. (1981). Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxations. Mathematical Programming, 20, 255–282.
Cullen, F., Jarvis, J., & Ratliff, D. (1981). Set partitioning based heuristics for interactive routing. Networks, 11, 125–144.
Desrochers, M., Desrosiers, J., & Solomon, M. (1992). A new optimization algorithm for the vehicle routing problem with time windows. Operation Research, 40, 342–354.
Hoffman, K. L., & Padberg, M. (1993). Solving airline crew scheduling problems by branch-and-cut. Management Science, 39, 657–682.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media New York
About this chapter
Cite this chapter
Simchi-Levi, D., Chen, X., Bramel, J. (2014). Solving the VRP Using a Column-Generation Approach. In: The Logic of Logistics. Springer Series in Operations Research and Financial Engineering. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-9149-1_19
Download citation
DOI: https://doi.org/10.1007/978-1-4614-9149-1_19
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-9148-4
Online ISBN: 978-1-4614-9149-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)