INTERSECTION GRAPH METHOD FOR AGV FLOW PATH DESIGN

被引:36
作者
SINRIECH, D
TANCHOCO, JMA
机构
[1] School of Industrial Engineering, Purdue University, West Lafayette, IN
关键词
D O I
10.1080/00207549108948044
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
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.
引用
收藏
页码:1725 / 1732
页数:8
相关论文
共 3 条
[1]  
Floyd R.W., Algorithm 97-shortest path, Communications of the ACM, 5, (1962)
[2]  
Gaskins R.J., Tanchoco I., Flow path design for automated guided vehicle systems, International Journal of Production Research, 25, 5, pp. 667-676, (1987)
[3]  
Kaspi M., Tanchoco J., Optimal flow path design of unidirectional AGV systems, International Journal of Production Research, 28, 6, pp. 1023-1030, (1990)