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

Full description

Saved in:

Bibliographic Details
Published in:	Computers & operations research Vol. 33; no. 6; pp. 1606 - 1624
Main Authors:	Beaulieu, Mathieu, Gamache, Michel
Format:	Journal Article
Language:	English
Published:	Oxford Elsevier Science 01.06.2006 Pergamon Press Inc
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!