An Enumeration Algorithm for Solving the Fleet Management Problem in Underground Mines


BibTeX reference

This paper presents an enumeration algorithm based on dynamic programming for optimally solving the fleet management problem in underground mines. This problem consists of routing and scheduling bidirectional vehicles on a haulage network composed of one-lane bidirectional road segments. The method takes into account the displacement modes of the vehicles, either forward or in reverse, and makes sure that these vehicles move forward when they arrive at their service point. The method has been developed for the underground mine context, but it can be extended to the industrial environment.

, 25 pages

Research Axis

Research application


An enumeration algorithm for solving the fleet management problem in uderground mines
Computers & Operations Research, 33(6), 1606–1624, 2006 BibTeX reference