| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 477061 | European Journal of Operational Research | 2011 | 5 Pages |
Abstract
In this paper we introduce a methodology for optimizing the expected cost of routing a single vehicle which has a probability of breaking down or failing to complete some of its tasks. More specifically, a calculus is devised for finding the optimal order in which each site should be visited.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Nikolaos Papadakos, George Tzallas-Regas, Berç Rustem, Joanne Thoms,