Developing Conflict-Free Routes for Automated Guided Vehicles

DOI10.1287/opre.41.6.1077zbMath0800.90410OpenAlexW2017462525MaRDI QIDQ4285165

Rajan Batta, Nirup N. Krishnamurthy, Mark H. Karwan

Publication date: 13 March 1994

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.41.6.1077

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Transportation, logistics and supply chain management (90B06) Production models (90B30) Boolean programming (90C09)

Related Items (12)

Performance evaluation of dynamic scheduling approaches in vehicle-based internal transport systems ⋮ Scheduling and routing of automated guided vehicles: A hybrid approach ⋮ An adaptive routing approach for personal rapid transit ⋮ Towards the improvement of a combined transport chain performance. ⋮ Computational complexity of convoy movement planning problems ⋮ A shortest-path algorithm for solving the fleet management problem in underground mines ⋮ Single- and multi-objective facility layout with workflow interference considerations ⋮ Efficient generation of performance bounds for a class of traffic scheduling problems ⋮ Route planning for automated guided vehicles in a manufacturing facility ⋮ Survey of research in the design and control of automated guided vehicle systems ⋮ Scheduling of Automated Guided Vehicles in a Decision Making Hierarchy ⋮ An enumeration algorithm for solving the fleet management problem in underground mines

This page was built for publication: Developing Conflict-Free Routes for Automated Guided Vehicles