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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computers & operations research Ročník 33; číslo 6; s. 1606 - 1624
Hlavní autori:	Beaulieu, Mathieu, Gamache, Michel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Oxford Elsevier Science 01.06.2006 Pergamon Press Inc
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!