Journal article
Waiting Strategies for Anticipating Service Requests from Known Customer Locations
Transportation science, Vol.41(3), pp.319-331
08/01/2007
DOI: 10.1287/trsc.1060.0183
Abstract
This paper considers a dynamic and stochastic routing problem in which information about customer locations and probabilistic information about future service requests are used to maximize the expected number of customers served by a single uncapacitated vehicle. The problem is modeled as a Markov decision process, and analytical results on the structure of the optimal policy are derived. For the case of a single dynamic customer, we completely characterize the optimal policy. Using the analytical results, we propose a real-time heuristic and demonstrate its effectiveness compared with a series of other intuitively appealing heuristics. We also use computational tests to determine the heuristic value of knowing both customer locations and probabilistic information about future service requests.
Details
- Title: Subtitle
- Waiting Strategies for Anticipating Service Requests from Known Customer Locations
- Creators
- Barrett W. Thomas - University of Iowa
- Resource Type
- Journal article
- Publication Details
- Transportation science, Vol.41(3), pp.319-331
- DOI
- 10.1287/trsc.1060.0183
- ISSN
- 0041-1655
- eISSN
- 1526-5447
- Language
- English
- Date published
- 08/01/2007
- Academic Unit
- Bus Admin College; Business Analytics
- Record Identifier
- 9984380448502771
Metrics
1 Record Views