A BRANCH-AND-BOUND ALGORITHM FOR FLOW-PATH DESIGN OF AUTOMATED GUIDED VEHICLE SYSTEMS

被引:0
|
作者
VENKATARAMANAN, MA
WILSON, KA
机构
[1] Department of Decision and Information Systems, Indiana University, Bloomington, Indiana
关键词
D O I
10.1002/1520-6750(199106)38:3<431::AID-NAV3220380311>3.0.CO;2-C
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
An algorithm for determining the optimal, unidirectional flow path for an automated guided vehicle system with a given facility layout is presented. The problem is formulated as an integer program. The objective is to minimize the total distance traveled by vehicles subject to the constraint that the resulting network consists of a single strongly connected component. A specialized branch-and-bound solution procedure is discussed in detail.
引用
收藏
页码:431 / 445
页数:15
相关论文
共 50 条