A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem

Publication: Research - peer-reviewJournal article – Annual report year: 2013

View graph of relations

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 languageEnglish
JournalTransportation Science
Publication dateFeb 2013
Volume47
Pages23-37
ISSN0041-1655
DOIs
StatePublished
CitationsWeb of Science® Times Cited: 6

Keywords

  • Vehicle routing, Two-echelon systems, Branch-and-cut
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

ID: 5844969