Bibliographic Details
| Title: |
Complexity of the AGV shortest path and single-loop guide path layout problems. |
| Authors: |
De Guzman, M. C.1, Prabhu, N.1, Tanchoco, J. M. A.1 |
| Source: |
International Journal of Production Research. Aug1997, Vol. 35 Issue 8, p2083-2092. 10p. |
| Subjects: |
Automated guided vehicle systems, Materials handling, Industrial robots, Production engineering, Graph theory |
| Abstract: |
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. [ABSTRACT FROM AUTHOR] |
|
Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
