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

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & operations research Jg. 33; H. 6; S. 1606 - 1624
Hauptverfasser: Beaulieu, Mathieu, Gamache, Michel
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Oxford Elsevier Science 01.06.2006
Pergamon Press Inc
Schlagworte:
Algorithms
Applied sciences
Dynamic programming
Exact sciences and technology
Flows in networks. Combinatorial problems
Mathematical programming
Mines
Mining industry
Motor vehicle fleets
Operational research and scientific management
Operational research. Management science
Operations research
Routing
Studies
Bidirectional segments
Fleet management
Enumeration tree
Routing
Bidirectional vehicles
Scheduling
Dynamic programming
Automated guided vehicle
ISSN:0305-0548, 0305-0548
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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. [PUBLICATION ABSTRACT]
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0305-0548
0305-0548
DOI:10.1016/j.cor.2004.11.016