Publication: Research - peer-review › Journal article – Annual report year: 2011
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.
|Citations||Web of Science® Times Cited: 0|
- Vehicle routing, Two-echelon systems, Branch-and-cut