This paper presents a column generation algorithm for the Vehicle Routing Problem with Time Windows (VRPTW). Traditionally, column generation models of the VRPTW have consisted of a Set Partitioning master problem with each column representing a route, i.e., a resource feasible path starting and ending at the depot. Elementary routes (no customer visited more than once) have shown superior results on difficult instances (less restrictive capacity and time windows). However, the pricing problems do not scale well when the number of feasible routes increases, i.e., when a route may contain a large number of customers. We suggest to relax that ‘each column is a route’ into ‘each column is a part of the giant tour’; a so-called partial path, i.e., not necessarily starting and ending in the depot. This way, the length of the partial path can be bounded and a better control of the size of the solution space for the pricing problem can be obtained.
|Title of host publication||International Network Optimization Conference (INOC), 2009,|
|Place of Publication||Pisa, Italy|
|Publication status||Published - 2009|
|Event||International Network Optimization Conference (INOC), 2009, - Pisa,Italy|
Duration: 1 Jan 2009 → …
|Conference||International Network Optimization Conference (INOC), 2009,|
|Period||01/01/2009 → …|