Article ID: | iaor19881087 |
Country: | United States |
Volume: | 22 |
Issue: | 4 |
Start Page Number: | 270 |
End Page Number: | 277 |
Publication Date: | Nov 1988 |
Journal: | Transportation Science |
Authors: | Current John R. |
In this paper an integer linear program is formulated to identify the least cost two-level hierarchical network. This network must include a primary path from a predetermined starting node to a predetermined terminus node. In addition, each node not on the primary path must be connected to some node on that path via a secondary path. Transshipment facilities are required at the intersections of the primary and secondary paths. Consequently, the formulation directly considers the number and locations of transshipment facilities in determining the minimal cost network. A heuristic is presented which employs a