| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652745 | Electronic Notes in Discrete Mathematics | 2010 | 8 Pages |
Abstract
In this paper we study Capacitated Arc Routing Problem with Flexible Time Windows where violating a time windows implies some extra cost. We propose a branch-and-price algorithm due to the Dantzig-Wolfe decomposition. The subproblem is a non-elementary capacitated shortest path problem. Experimental results are presented on the instances up to 40 nodes and 69 required edges.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
