A shortest-path algorithm for solving the fleet management problem in underground mines

DOI10.1016/J.EJOR.2004.03.008zbMath1064.90017OpenAlexW2054796629MaRDI QIDQ1780759

Paul Cohen, Michel Gamache, Renaud Grimard

Publication date: 13 June 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.03.008

zbMATH Keywords

RoutingSchedulingFleet managementDispatchingUnderground mining

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Related Items (5)

Machine scheduling in underground mining: an application in the potash industry ⋮ Underground mine scheduling of mobile machines using constraint programming and large neighborhood search ⋮ Staff and machine shift scheduling in a German potash mine ⋮ A shortest-path algorithm for solving the fleet management problem in underground mines ⋮ An enumeration algorithm for solving the fleet management problem in underground mines

Cites Work

• A shortest-path algorithm for solving the fleet management problem in underground mines
• Conflict-free shortest-time bidirectional AGV routeing
• Developing Conflict-Free Routes for Automated Guided Vehicles

This page was built for publication: A shortest-path algorithm for solving the fleet management problem in underground mines