Article ID: | iaor19981540 |
Country: | Canada |
Volume: | 35 |
Issue: | 4 |
Start Page Number: | 297 |
End Page Number: | 308 |
Publication Date: | Nov 1997 |
Journal: | INFOR |
Authors: | Penn Michal, Nutov Zeev, Sinreich David |
Keywords: | engineering, graphs, networks: path, optimization |
In a mobile robot flow network different levels of flow intensity exist between the origin and destination nodes as a result of different part production requirements and mix. Henceforth, nodes handling heavy flows require additional alternative paths to the rest of the network in order to reduce blocking and traffic congestion, compared to nodes which handle moderate or light flows which require fewer alternative paths. In this study we make a distinction between light, moderate and heavy flows and assign one, two or three alternative node disjoint paths respectively, to handle these flows. Our aim is to find a cheapest network such that for a given node subset