The Design of a Hierarchical Transportation Network with Transshipment Facilities

John R. Current
Additional contact information
John R. Current: The Ohio State University, Columbus, Ohio 43210

Transportation Science, 1988, vol. 22, issue 4, 270-277

Abstract: 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 K Shortest Path algorithm and a Minimum Spanning Tree algorithm. Heuristic results of two sample problems are presented and compared to the results obtained by solving the integer LP formulation.

Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.22.4.270 (application/pdf)

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:inm:ortrsc:v:22:y:1988:i:4:p:270-277

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().