Premium
A branch‐and‐bound algorithm for flow‐path design of automated guided vehicle systems
Author(s) -
Venkataramanan M. A.,
Wilson Kathryn A.
Publication year - 1991
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199106)38:3<431::aid-nav3220380311>3.0.co;2-c
Subject(s) - constraint (computer aided design) , path (computing) , branch and bound , automated guided vehicle , flow network , integer programming , component (thermodynamics) , computer science , branch and cut , mathematical optimization , integer (computer science) , flow (mathematics) , algorithm , maximum flow problem , upper and lower bounds , mathematics , artificial intelligence , physics , geometry , thermodynamics , programming language , mathematical analysis
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.