Title:
Routing in stochastic environments

Simple item page
dc.contributor.advisor Erera, Alan L.
dc.contributor.advisor Savelsbergh, Martin W. P.
dc.contributor.author Uyar, Emrah en_US
dc.contributor.committeeMember Ergun, Özlem
dc.contributor.committeeMember Ferguson, Mark
dc.contributor.committeeMember Kleywegt, Anton J.
dc.contributor.department Industrial and Systems Engineering en_US
dc.date.accessioned 2009-01-22T15:45:25Z
dc.date.available 2009-01-22T15:45:25Z
dc.date.issued 2008-11-17 en_US
dc.description.abstract In this thesis, we study two stochastic vehicle routing problems. In the first part, we investigate a routing problem where the distributor wants to construct a set of delivery routes each day to serve a set of geographically dispersed customers, but wants to send the same driver to the same set of customers as much as possible due to business requirements. The stochastic nature of customer demands and the existence of hard delivery time windows make this fixed routes problem much harder. We introduce a new recourse policy based on limited vehicle sharing and develop heuristic approaches for constructing fixed routes respecting the new policy for large real-life instances. Among the key contributions is the introduction of sampling-based techniques to handle the feasibility issues arising from hard delivery windows. An extensive computational study based on real-life data demonstrates the efficacy of the proposed fixed routing system and route construction techniques. In the second part, we investigate the new policy in an abstract setting to understand its properties. We characterize the optimal traditional fixed routes solution in terms of total expected cost for simple instances of the problem. Next we present a series of results for the new policy. For example, we show that operational feasibility of a set of fixed routes can be checked in polynomial time, but identifying the optimal use of fixed routes is NP-complete. In the final part, we focus on a dynamic and stochastic routing problem, which arises when there are service level agreements in place between a distributor and its customers. Specifically, the distributor has to serve customer orders within two days after the order is received, but has the flexibility to choose the actual delivery day. However, future customer orders are unknown and are revealed dynamically through time. We develop heuristic and optimal policies for simple instances of the problem that use the stochastic information about future orders. We empirically compare the performance of the various policies with the performance of policies that do not use future information and with an offline optimal policy which has perfect information about future orders. en_US
dc.description.degree Ph.D. en_US
dc.identifier.uri http://hdl.handle.net/1853/26554
dc.publisher Georgia Institute of Technology en_US
dc.subject Stochastic vehicle routing en_US
dc.subject Dynamic routing en_US
dc.subject Fixed routes problem en_US
dc.subject Sampling in vehicle routing en_US
dc.subject.lcsh Transportation Planning Mathematical models
dc.subject.lcsh Transportation Management Mathematical models
dc.subject.lcsh Stochastic processes
dc.subject.lcsh Delivery of goods
dc.title Routing in stochastic environments en_US
dc.type Text
dc.type.genre Dissertation
dspace.entity.type Publication
local.contributor.advisor Erera, Alan L.
local.contributor.advisor Savelsbergh, Martin W. P.
local.contributor.corporatename H. Milton Stewart School of Industrial and Systems Engineering
local.contributor.corporatename College of Engineering
relation.isAdvisorOfPublication 9c57adb1-12eb-40c7-bc1a-b77b6871cc03
relation.isAdvisorOfPublication a2cfc4e1-8f99-4246-b2c1-000ee5a8c96e
relation.isOrgUnitOfPublication 29ad75f0-242d-49a7-9b3d-0ac88893323c
relation.isOrgUnitOfPublication 7c022d60-21d5-497c-b552-95e489a06569
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
uyar_emrah_200812_phd.pdf
Size:
1.31 MB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Theses and Dissertations