An enumeration algorithm for solving the fleet management problem in underground mines |
| |
Authors: | Mathieu Beaulieu Michel Gamache |
| |
Affiliation: | Département des génies civil, géologique et des mines, École Polytechnique de Montréal, C.P. 6079 succ. Centre-ville, Montréal, Qué., Canada H3C 3A7 |
| |
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. |
| |
Keywords: | Fleet management Dynamic programming Enumeration tree Bidirectional vehicles Bidirectional segments |
本文献已被 ScienceDirect 等数据库收录! |
|