An enumeration algorithm for solving the fleet management problem in underground mines

Authors:
Mathieu Beaulieu;Michel Gamache
Affiliations:
Département des génies civil, géologique et des mines, École Polytechnique de Montréal, Montréal, Qué., Canada;Département des génies civil, géologique et des mines, École Polytechnique de Montréal, Montréal, Qué., Canada
Venue:
Computers and Operations Research
Year:
2006

Citing 2
Cited 0

Developing conflict-free routes for automated guided vehicles

Operations Research
New benchmark results for the resource-constrained project scheduling problem

Management Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.