IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v22y1988i4p270-277.html
   My bibliography  Save this article

The Design of a Hierarchical Transportation Network with Transshipment Facilities

Author

Listed:
  • John R. Current

    (The Ohio State University, Columbus, Ohio 43210)

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.

Suggested Citation

  • John R. Current, 1988. "The Design of a Hierarchical Transportation Network with Transshipment Facilities," Transportation Science, INFORMS, vol. 22(4), pages 270-277, November.
    • Handle: RePEc:inm:ortrsc:v:22:y:1988:i:4:p:270-277
    DOI: 10.1287/trsc.22.4.270
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.22.4.270
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.22.4.270?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. J. Beasley & E. Nascimento, 1996. "The Vehicle Routing-Allocation Problem: A unifying framework," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 4(1), pages 65-86, June.
    2. Cocking, Cara & Flessa, Steffen & Reinelt, Gerhard, 2012. "Improving access to health facilities in Nouna district, Burkina Faso," Socio-Economic Planning Sciences, Elsevier, vol. 46(2), pages 164-172.
    3. Obreque, Carlos & Donoso, Macarena & Gutiérrez, Gabriel & Marianov, Vladimir, 2010. "A branch and cut algorithm for the hierarchical network design problem," European Journal of Operational Research, Elsevier, vol. 200(1), pages 28-35, January.
    4. M-G Yoon & J Current, 2008. "The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(1), pages 80-89, January.
    5. Eduardo Álvarez-Miranda & Ivana Ljubić & S. Raghavan & Paolo Toth, 2015. "The Recoverable Robust Two-Level Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 1-19, February.
    6. Lin, Cheng-Chang & Chen, Sheu-Hua, 2004. "The hierarchical network design problem for time-definite express common carriers," Transportation Research Part B: Methodological, Elsevier, vol. 38(3), pages 271-283, March.
    7. Lin, Cheng-Chang, 2010. "The integrated secondary route network design model in the hierarchical hub-and-spoke network for dual express services," International Journal of Production Economics, Elsevier, vol. 123(1), pages 20-30, January.
    8. Martina Jakara & Nikolina Brnjac, 2023. "Foliated Transport Networks in Intermodal Freight Transport," Sustainability, MDPI, vol. 15(9), pages 1-13, April.
    9. Mesa, Juan A. & Brian Boffey, T., 1996. "A review of extensive facility location in networks," European Journal of Operational Research, Elsevier, vol. 95(3), pages 592-603, December.
    10. Masashi Miyagawa, 2014. "Optimal allocation of area in hierarchical road networks," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 53(2), pages 617-630, September.
    11. Gollowitzer, Stefan & Gouveia, Luis & Ljubić, Ivana, 2013. "Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities," European Journal of Operational Research, Elsevier, vol. 225(2), pages 211-222.
    12. Masashi Miyagawa, 2009. "Optimal hierarchical system of a grid road network," Annals of Operations Research, Springer, vol. 172(1), pages 349-361, November.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:22:y:1988:i:4:p:270-277. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.