Optimal solution for the flow path design problem of a balanced unidirectional AGV system
From MaRDI portal
Publication:4674434
DOI10.1080/00207540110079761zbMath1060.90518OpenAlexW2089515406MaRDI QIDQ4674434
No author found.
Publication date: 11 May 2005
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540110079761
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Traffic problems in operations research (90B20)
Related Items (7)
Tabu search algorithm for flexible flow path design of unidirectional automated-guided vehicle systems ⋮ Designing an efficient method for tandem AGV network design problem using tabu search ⋮ A six sigma based multi-objective optimization for machine grouping control in flexible cellular manufacturing systems with guide-path flexibility ⋮ 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 ⋮ Survey of research in the design and control of automated guided vehicle systems ⋮ A review of design and control of automated guided vehicle systems
Cites Work
- Intersection graph method for AGV flow path design
- A Petri net model for the operational design and analysis of segmented flow topology (SFT) AGV systems
- Complexity of the AGV shortest path and single-loop guide path layout problems
- An introduction to the segmented flow approach for discrete material flow systems
- A branch-and-bound algorithm for flow-path design of automated guided vehicle systems
This page was built for publication: Optimal solution for the flow path design problem of a balanced unidirectional AGV system
