Shortest Paths and Vehicle Routing

Publication: ResearchPh.D. thesis – Annual report year: 2011

Documents

View graph of relations

This thesis presents how to parallelize a shortest path labeling algorithm. It is shown how to handle Chvátal-Gomory rank-1 cuts in a column generation context. A Branch-and-Cut algorithm is given for the Elementary Shortest Paths Problem with Capacity Constraint. A reformulation of the Vehicle Routing Problem based on partial paths is presented. Finally, a practical application of finding shortest paths in the telecommunication industry is shown.
Original languageEnglish
Publication dateJan 2011
Place of publicationKgs. Lyngby
PublisherDTU Management
Number of pages232
StatePublished
NamePhD thesis
Number9.2011

Keywords

  • Chvátal-Gomory rank-1 cuts, Vehicle Routing Problems, Branch-and-Cut, Elementary Shortest Path Problems with Resource Constrains, Branch-Price-and-Cut, Dantzig-Wolfe decomposition
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

Download statistics

No data available

ID: 5854756