A Branch and Bound Algorithm for Flow Path Design of Automated Guided Vehicle Systems
1991, Naval Research Logistics
M. A. Venkataramanan, K. Wilson
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.
Venkataramanan, M. A. and K. Wilson (1991), "A Branch and Bound Algorithm for Flow Path Design of Automated Guided Vehicle Systems," Naval Research Logistics, Vol. 38, pp. 431-445.