Solving the VRP using a Column Generation Approach

  • Julien Bramel
  • David Simchi-Levi
Part of the Springer Series in Operations Research book series (ORFE)


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. (See Chapter 4 for a general discussion of set partitioning.)


Integer Solution Linear Relaxation Customer Location Customer Type Feasible Route 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York, Inc. 1997

Authors and Affiliations

  • Julien Bramel
    • 1
  • David Simchi-Levi
    • 2
  1. 1.Management Science Division Graduate School of BusinessColumbia UniversityNew YorkUSA
  2. 2.Department of Industrial Engineering and Management SciencesNorthwestern UniversityEvanstonUSA

Personalised recommendations