A branch‐and‐bound algorithm for flow‐path design of automated guided vehicle systems

M. A. Venkataramanan and Kathryn A. Wilson

Naval Research Logistics (NRL), 1991, vol. 38, issue 3, 431-445

Abstract: 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.

Date: 1991
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199106)38:33.0.CO;2-C

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:38:y:1991:i:3:p:431-445

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().