Developing Conflict-Free Routes for Automated Guided Vehicles
From MaRDI portal
Cited in
(17)- Towards the improvement of a combined transport chain performance.
- A shortest-path algorithm for solving the fleet management problem in underground mines
- Efficient generation of performance bounds for a class of traffic scheduling problems
- An adaptive routing approach for personal rapid transit
- Single- and multi-objective facility layout with workflow interference considerations
- Survey of research in the design and control of automated guided vehicle systems
- An enumeration algorithm for solving the fleet management problem in underground mines
- Performance evaluation of dynamic scheduling approaches in vehicle-based internal transport systems
- Scheduling of Automated Guided Vehicles in a Decision Making Hierarchy
- Computational complexity of convoy movement planning problems
- Route planning for automated guided vehicles in a manufacturing facility
- Conflict-free electric vehicle routing problem: an improved compositional algorithm
- Real-time schedule adjustments for conflict-free vehicle routing
- Improving scheduling in multi-AGV systems by task prediction
- Conflict-free tow train routing in just-in-time assembly lines
- An exact decomposition-based approach to the conflict-free-transportation-constrained flexible job-shop scheduling problem
- Scheduling and routing of automated guided vehicles: A hybrid approach
This page was built for publication: Developing Conflict-Free Routes for Automated Guided Vehicles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285165)
