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. (See Chapter 5 for a general discussion of set partitioning.) The idea is as follows: let the index set of all feasible routes be {1, 2, . . .,R} and let cr be the length of route r. Define
for each customer i = 1, 2, . . . , n and each route r = 1, 2, . . . ,R. Also, for every r= 1,2,..., R, let
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
(2005). Solving the VRP Using a Column Generation Approach. In: The Logic of Logistics. Springer Series in Operations Research. Springer, New York, NY. https://doi.org/10.1007/0-387-22619-2_16
Download citation
DOI: https://doi.org/10.1007/0-387-22619-2_16
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-22199-1
Online ISBN: 978-0-387-22619-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)