| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142722 | Operations Research Letters | 2010 | 5 Pages |
Abstract
This paper presents an algorithm to obtain lower bounds for the Split Delivery Vehicle Routing Problem. An extended formulation over a large set of variables is provided and valid inequalities are identified. The algorithm combined column and cut generation and improved the best known lower bounds for all instances from the literature. Some reasonably sized instances are solved to optimality for the first time.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Lorenza Moreno, Marcus Poggi de Aragão, Eduardo Uchoa,