Abstract
This paper presents an exact method for solving the symmetric two-echelon capacitated vehicle routing problem, a transportation problem concerned with the distribution of goods from a depot to a set of customers through a set of satellite locations. The presented method is based on an edge flow model that is a relaxation and provides a valid lower bound. A specialized branching scheme is employed to obtain feasible solutions. Out of a test set of 93 instances the algorithm is able to solve 47 to optimality surpassing previous exact algorithms.
Original language | English |
---|---|
Journal | Transportation Science |
Volume | 47 |
Pages (from-to) | 23-37 |
ISSN | 0041-1655 |
DOIs | |
Publication status | Published - Feb 2013 |
Keywords
- Vehicle routing
- Two-echelon systems
- Branch-and-cut