Intersection graph method for AGV flow path design
暂无分享,去创建一个
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.
[1] Stephen J. Garland,et al. Algorithm 97: Shortest path , 1962, Commun. ACM.
[2] J. M. A. Tanchoco,et al. Flow path design for automated guided vehicle systems , 1987 .
[3] J. Tanchoco,et al. Optimal flow path design of unidirectional AGV systems , 1990 .