- 157 views
- 137 downloads
Solving the LP Relaxation of Distance-Constrained Vehicle Routing Problem Using Column Generation
-
- Author / Creator
- Dezfuli, Seyyed Sina
-
The distance-constrained vehicle routing problem (DVRP) is one of the less studied variants of vehicle routing problems. Here, the objective is to deliver packages from a depot to clients with as few delivery vehicles as possible within a given time frame.
In this thesis, we tackle larger instances of DVRP with around 200 nodes using column generation. We utilize a recent 3-approximation algorithm for the rooted orienteering problem to provide a practical algorithm for generating columns to approximately solve an exponentially large LP-relaxation of the DVRP. We also provide a proof-of-concept implementation, analyze its performance, extract the practical bounds and compare them against the theoretical ones. Finally, we measure how much improvement our algorithm provides on top of more naive heuristics that can be used for generating columns. -
- Graduation date
- Fall 2020
-
- Type of Item
- Thesis
-
- Degree
- Master of Science
-
- License
- Permission is hereby granted to the University of Alberta Libraries to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. Where the thesis is converted to, or otherwise made available in digital form, the University of Alberta will advise potential users of the thesis of these terms. The author reserves all other publication and other rights in association with the copyright in the thesis and, except as herein before provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatsoever without the author's prior written permission.