Various Approaches to the Stochastic K-Server and Stacker-Crane Problems

In recent years there has been a trend towards large-scale logistics for individual members of the public, such as ride-sharing services and drone package delivery. Efficient coordination of pickups and deliveries is essential in order to keep costs and wait times down. In this thesis we present these types of problems in a more general framework, expanding applicability of our discussion to an even wider domain of problems. We present fast new al- gorithms with supporting theoretical and experimental analysis, providing certain guarantees about how close our algorithms compare to a theoretically optimal approach.

Name thesis:degree_name

Master of Science

Level thesis:degree_level

masters

Discipline thesis:degree_discipline

Mathematics

Department dc:contributor.department

Mathematics

Grantor dc:publisher

Virginia Tech

Year dc:date.issued

2017

Author dc:creator

• Friedman, Alexander Daniel

Chair dc:contributor.committeechair

• Ball, Joseph A.

Committee members dc:contributor.committeemember

• Rossi, John F.
• Raghvendra, Sharath

• K-Server Problem
• Stacker-Crane Problem
• K-Median
• Zoning Algorithm
• Probabilistic Hyperoctree
• Voronoi Simplicial Decomposition

Statement dc:rights

• In Copyright

Licence dc:rights.uri

• http://rightsstatements.org/vocab/InC/1.0/

Dc Identifier Other

vt_gsexam:11883

OAI identifier oai:identifier

oai:vtechworks.lib.vt.edu:10919/78285