Show simple item record

dc.contributor.authorSteele, Patrick Robert
dc.date.accessioned2017-04-04T20:27:39Z
dc.date.available2017-08-01T06:00:54Z
dc.date.issued2017-01-30
dc.identifier.otherSteele_cornellgrad_0058F_10144
dc.identifier.otherhttp://dissertations.umi.com/cornellgrad:10144
dc.identifier.otherbibid: 9906044
dc.identifier.urihttps://hdl.handle.net/1813/47797
dc.description.abstractIn this dissertation we consider variants of the vehicle routing problem applied to two problem areas. First, we consider the problem of scheduling deliveries from a central depot to clients in a metric space using a single delivery vehicle. Although this problem involves only a single vehicle rather than a fleet, it is amenable to analysis from both a worst-case and average-case perspective, and has applications to real-world systems. Second, we consider two problems related to the scheduling of air ambulances, one in an offline setting and another in an online setting. Air ambulances are used to provide emergency medical services to residents of both British Columbia and Ontario, Canada. We consider techniques to improve the efficiency of service in these systems.
dc.language.isoen_US
dc.subjectVehicle routing problems
dc.subjectOperations research
dc.subjectCompetitive algorithms
dc.subjectSimulation
dc.titleVehicle Routing Problems
dc.typedissertation or thesis
thesis.degree.disciplineOperations Research
thesis.degree.grantorCornell University
thesis.degree.levelDoctor of Philosophy
thesis.degree.namePh. D., Operations Research
dc.contributor.chairShmoys, David B
dc.contributor.committeeMemberWilliamson, David P
dc.contributor.committeeMemberHenderson, Shane G.
dcterms.licensehttps://hdl.handle.net/1813/59810
dc.identifier.doihttps://doi.org/10.7298/X400003M


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics