a Imperial College London, Department of Computing, 180 Queen’s Gate, London SW7 2AZ, UK b BAE Systems Integrated System Technologies Limited, Lyon Way, Frimley, Camberley, Surrey GU16 7EX, UK
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.