A shortest-path algorithm for solving the fleet management problem in underground mines

This paper describes the problem of managing a fleet of load-haul-dump (LHD) vehicles in an underground mine. The problem consists of dispatching, routing and scheduling vehicles whenever they need to be assigned to a new task. The solution approach is based on a shortest-path algorithm. Each decision takes into account the current status of the mine, the current traffic on all single-lane bi-directional road segments of the haulage network and operational constraints such as the fact that, while LHD vehicles move in forward or reverse modes, their bucket must be in dumping/loading position at destination. © 2004 Elsevier B.V. All rights reserved.