Solving the VRP using a Column Generation Approach
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.)
KeywordsInteger Solution Linear Relaxation Customer Location Customer Type Feasible Route
Unable to display preview. Download preview PDF.