Intersection graph method for AGV flow path design
Authors:
- 1 September 1991
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 29 (9) , 1725-1732
Abstract
In this paper, we introduce the Intersection Graph Method for solving the AGV Flow Path Optimization Model developed by Kaspi and Tanchoco (1990). A branch-and-bound procedure is described wherein only a reduced subset of all nodes in the flow path network is considered. Only intersection nodes are used to obtain optimal solutions. Two examples are given to illustrate the proposed method.Keywords
This publication has 3 references indexed in Scilit:
- Optimal flow path design of unidirectional AGV systemsInternational Journal of Production Research, 1990
- Flow path design for automated guided vehicle systemsInternational Journal of Production Research, 1987
- Algorithm 97: Shortest pathCommunications of the ACM, 1962