COMPLEXITY OF THE AGV SHORTEST PATH AND SINGLE-LOOP GUIDE PATH LAYOUT PROBLEMS

@article{Guzman1997COMPLEXITYOT,
  title={COMPLEXITY OF THE AGV SHORTEST PATH AND SINGLE-LOOP GUIDE PATH LAYOUT PROBLEMS},
  author={M. Guzman and N. Prabhu and J. M. A. Tanchoco},
  journal={International Journal of Production Research},
  year={1997},
  volume={35},
  pages={2083-2092}
}
  • M. Guzman, N. Prabhu, J. M. A. Tanchoco
  • Published 1997
  • Mathematics
  • International Journal of Production Research
  • The guide path layout is one of the most important variables in the design of automated guided vehicle systems (AGVS). Many alternative guide path configurations have been proposed in previous research. Two of the simplest are the shortest path and shortest single-loop configurations. However, the optimal solutions to these two problems have not been easy to obtain. In this paper, we show why by proving the NP-completeness of these problems using graph theoretic methods. 
    44 Citations
    Ant colony algorithm for the shortest loop design problem
    • 16
    Tabu search algorithm for flexible flow path design of unidirectional automated-guided vehicle systems
    • 12
    Cell-Based Local Search Heuristics for Guide Path Design of Automated Guided Vehicle Systems With Dynamic Multicommodity Flow
    • 1