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.
No takes yet. Share an insight, caveat, or question.
Sinriech et al. (1991) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: