Various Approaches to the Stochastic K-Server and Stacker-Crane Problems
| dc.contributor.author | Friedman, Alexander Daniel | en |
| dc.contributor.committeechair | Ball, Joseph A. | en |
| dc.contributor.committeemember | Rossi, John F. | en |
| dc.contributor.committeemember | Raghvendra, Sharath | en |
| dc.contributor.department | Mathematics | en |
| dc.date.accessioned | 2017-06-30T08:00:45Z | en |
| dc.date.available | 2017-06-30T08:00:45Z | en |
| dc.date.issued | 2017-06-29 | en |
| dc.description.abstract | 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. | en |
| dc.description.abstractgeneral | 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 algorithms with supporting theoretical and experimental analysis, providing certain guarantees about how close our algorithms compare to a theoretically optimal approach. | en |
| dc.description.degree | Master of Science | en |
| dc.format.medium | ETD | en |
| dc.identifier.other | vt_gsexam:11883 | en |
| dc.identifier.uri | http://hdl.handle.net/10919/78285 | en |
| dc.publisher | Virginia Tech | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject | K-Server Problem | en |
| dc.subject | Stacker-Crane Problem | en |
| dc.subject | K-Median | en |
| dc.subject | Zoning Algorithm | en |
| dc.subject | Probabilistic Hyperoctree | en |
| dc.subject | Voronoi Simplicial Decomposition | en |
| dc.title | Various Approaches to the Stochastic K-Server and Stacker-Crane Problems | en |
| dc.type | Thesis | en |
| thesis.degree.discipline | Mathematics | en |
| thesis.degree.grantor | Virginia Polytechnic Institute and State University | en |
| thesis.degree.level | masters | en |
| thesis.degree.name | Master of Science | en |