Complexity of the AGV shortest path and single-loop guide path layout problems
From MaRDI portal
Publication:4252095
DOI10.1080/002075497194741zbMath0945.90585OpenAlexW2112568714MaRDI QIDQ4252095
No author found.
Publication date: 1997
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/002075497194741
Related Items (13)
Tabu search algorithm for flexible flow path design of unidirectional automated-guided vehicle systems ⋮ Improved formulation, branch-and-cut and tabu search heuristic for single loop material flow system design ⋮ Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout ⋮ Loop based facility planning and material handling ⋮ Optimal solution for the flow path design problem of a balanced unidirectional AGV system ⋮ Scheduling and routing algorithms for AGVs: A survey ⋮ A practical exact algorithm for the shortest loop design problem in a block layout ⋮ An integrated approach to determine the block layout, AGV flow path and the location of pick-up/delivery points in single-loop systems ⋮ Designing an efficient method for simultaneously determining the loop and the location of the P/D stations using genetic algorithm ⋮ Developing exact and Tabu search algorithms for simultaneously determining AGV loop and P/D stations in single loop systems ⋮ The value of the shortest loop covering all work centers in a manufacturing facility layout ⋮ Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm ⋮ Survey of research in the design and control of automated guided vehicle systems
This page was built for publication: Complexity of the AGV shortest path and single-loop guide path layout problems