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

DOI10.1016/J.COR.2004.11.016MaRDI QIDQ2581603zbMATH OpenOpenAlexFDO

Authors Mathieu Beaulieu, Michel Gamache

Publication date 10 January 2006

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2004.11.016

zbMATH Keywords

Bidirectional segmentsBidirectional vehiclesDynamic programmingEnumeration treeFleet management

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• A shortest-path algorithm for solving the fleet management problem in underground mines
• Fleet scheduling in underground mines using constraint programming
• Underground mine scheduling of mobile machines using constraint programming and large neighborhood search
• An efficient decision making process for vehicles operations in underground mining
• A hybrid heuristic algorithm for the open-pit-mining operational planning problem

Cites work

• A shortest-path algorithm for solving the fleet management problem in underground mines
• Conflict-free shortest-time bidirectional AGV routeing
• Design and operational issues in AGV-served manufacturing systems
• Developing Conflict-Free Routes for Automated Guided Vehicles
• New Benchmark Results for the Resource-Constrained Project Scheduling Problem

Cited in

(3)

• A shortest-path algorithm for solving the fleet management problem in underground mines
• Underground mine scheduling of mobile machines using constraint programming and large neighborhood search
• Machine scheduling in underground mining: an application in the potash industry

This page was built for publication: An enumeration algorithm for solving the fleet management problem in underground mines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581603)