Article ID: | iaor20062184 |
Country: | Netherlands |
Volume: | 166 |
Issue: | 2 |
Start Page Number: | 497 |
End Page Number: | 506 |
Publication Date: | Oct 2005 |
Journal: | European Journal of Operational Research |
Authors: | Gamache Michel, Grimard Renaud, Cohen Paul |
Keywords: | scheduling, vehicle routing & scheduling |
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.