Vehicle Routing Problems that Minimize the Completion Time: Heuristics, Worst-Case Analyses, and Computational Results
| dc.contributor.advisor | Golden, Bruce | en_US |
| dc.contributor.author | Wang, Xingyin | en_US |
| dc.contributor.department | Mathematics | en_US |
| dc.contributor.publisher | Digital Repository at the University of Maryland | en_US |
| dc.contributor.publisher | University of Maryland (College Park, Md.) | en_US |
| dc.date.accessioned | 2016-09-08T05:34:44Z | |
| dc.date.available | 2016-09-08T05:34:44Z | |
| dc.date.issued | 2016 | en_US |
| dc.description.abstract | In the standard Vehicle Routing Problem (VRP), we route a fleet of vehicles to deliver the demands of all customers such that the total distance traveled by the fleet is minimized. In this dissertation, we study variants of the VRP that minimize the completion time, i.e., we minimize the distance of the longest route. We call it the min-max objective function. In applications such as disaster relief efforts and military operations, the objective is often to finish the delivery or the task as soon as possible, not to plan routes with the minimum total distance. Even in commercial package delivery nowadays, companies are investing in new technologies to speed up delivery instead of focusing merely on the min-sum objective. In this dissertation, we compare the min-max and the standard (min-sum) objective functions in a worst-case analysis to show that the optimal solution with respect to one objective function can be very poor with respect to the other. The results motivate the design of algorithms specifically for the min-max objective. We study variants of min-max VRPs including one problem from the literature (the min-max Multi-Depot VRP) and two new problems (the min-max Split Delivery Multi-Depot VRP with Minimum Service Requirement and the min-max Close-Enough VRP). We develop heuristics to solve these three problems. We compare the results produced by our heuristics to the best-known solutions in the literature and find that our algorithms are effective. In the case where benchmark instances are not available, we generate instances whose near-optimal solutions can be estimated based on geometry. We formulate the Vehicle Routing Problem with Drones and carry out a theoretical analysis to show the maximum benefit from using drones in addition to trucks to reduce delivery time. The speed-up ratio depends on the number of drones loaded onto one truck and the speed of the drone relative to the speed of the truck. | en_US |
| dc.identifier | https://doi.org/10.13016/M27F7Z | |
| dc.identifier.uri | http://hdl.handle.net/1903/18710 | |
| dc.language.iso | en | en_US |
| dc.subject.pqcontrolled | Operations research | en_US |
| dc.subject.pqcontrolled | Transportation | en_US |
| dc.subject.pquncontrolled | Completion time | en_US |
| dc.subject.pquncontrolled | Heuristics | en_US |
| dc.subject.pquncontrolled | Min-max | en_US |
| dc.subject.pquncontrolled | Vehicle routing | en_US |
| dc.subject.pquncontrolled | Worst-case | en_US |
| dc.title | Vehicle Routing Problems that Minimize the Completion Time: Heuristics, Worst-Case Analyses, and Computational Results | en_US |
| dc.type | Dissertation | en_US |
Files
Original bundle
1 - 4 of 4