IDEAS home Printed from https://ideas.repec.org/a/eee/jotrge/v19y2011i4p591-595.html
   My bibliography  Save this article

Hierarchical system of road networks with inward, outward, and through traffic

Author

Listed:
  • Miyagawa, Masashi

Abstract

This paper formulates a continuous model of a grid road network for determining the optimal hierarchical system of road networks. The hierarchical system is represented as the proportions of area taken up by roads at each level of the hierarchy. The objective is to derive the optimal ratio of road areas that minimizes the total travel time. The model explicitly incorporates inward, outward, and through traffic as well as inner traffic to examine how traffic composition affects the optimal ratio of road areas. The result reveals that the optimal ratio of major arterial roads increases with inward, outward and through traffic.

Suggested Citation

  • Miyagawa, Masashi, 2011. "Hierarchical system of road networks with inward, outward, and through traffic," Journal of Transport Geography, Elsevier, vol. 19(4), pages 591-595.
    • Handle: RePEc:eee:jotrge:v:19:y:2011:i:4:p:591-595
    DOI: 10.1016/j.jtrangeo.2010.06.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0966692310000943
    Download Restriction: no
    File URL: https://libkey.io/10.1016/j.jtrangeo.2010.06.013?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
    ---><---

    References listed on IDEAS

    as
    1. Anantaram Balakrishnan & Thomas L. Magnanti & Prakash Mirchandani, 1994. "A Dual-Based Algorithm for Multi-Level Network Design," Management Science, INFORMS, vol. 40(5), pages 567-581, May.
    2. Current, John R. & ReVelle, Charles S. & Cohon, Jared L., 1986. "The hierarchical network design problem," European Journal of Operational Research, Elsevier, vol. 27(1), pages 57-66, October.
    3. Hasan Pirkul & John Current & V. Nagarajan, 1991. "The Hierarchical Network Design Problem: A New Formulation and Solution Procedures," Transportation Science, INFORMS, vol. 25(3), pages 175-182, August.
    4. Masashi Miyagawa, 2009. "Optimal hierarchical system of a grid road network," Annals of Operations Research, Springer, vol. 172(1), pages 349-361, November.
    5. 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.
    6. C. E. M. Pearce, 1974. "Locating Concentric Ring Roads in a City," Transportation Science, INFORMS, vol. 8(2), pages 142-168, May.
    7. Aldaihani, Majid M. & Quadrifoglio, Luca & Dessouky, Maged M. & Hall, Randolph, 2004. "Network design for a grid hybrid transit service," Transportation Research Part A: Policy and Practice, Elsevier, vol. 38(7), pages 511-530, August.
    8. Tönu Puu, 1997. "Mathematical Location and Land Use Theory," Advances in Spatial Science, Springer, number 978-3-662-03439-2.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. 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.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. 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.
    2. 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.
    3. 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.
    4. Masashi Miyagawa, 2009. "Optimal hierarchical system of a grid road network," Annals of Operations Research, Springer, vol. 172(1), pages 349-361, November.
    5. Souza, Fernanda S.H. & Gendreau, Michel & Mateus, Geraldo R., 2014. "Branch-and-price algorithm for the Resilient Multi-level Hop-constrained Network Design," European Journal of Operational Research, Elsevier, vol. 233(1), pages 84-93.
    6. Bigotte, João F. & Krass, Dmitry & Antunes, António P. & Berman, Oded, 2010. "Integrated modeling of urban hierarchy and transportation network planning," Transportation Research Part A: Policy and Practice, Elsevier, vol. 44(7), pages 506-522, August.
    7. 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.
    8. Anantaram Balakrishnan & Thomas L. Magnanti & Prakash Mirchandani, 1998. "Designing Hierarchical Survivable Networks," Operations Research, INFORMS, vol. 46(1), pages 116-136, February.
    9. Crainic, Teodor Gabriel & Gendron, Bernard & Akhavan Kazemzadeh, Mohammad Rahim, 2022. "A taxonomy of multilayer network design and a survey of transportation and telecommunication applications," European Journal of Operational Research, Elsevier, vol. 303(1), pages 1-13.
    10. Balakrishnan, Anantaram. & Magnanti, Thomas L. & Mirchandani, Prakash., 1991. "A dual-based algorithm for multi-level network design," Working papers 3365-91., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    11. Sancho, N. G. F., 1997. "The hierarchical network design problem with multiple primary paths," European Journal of Operational Research, Elsevier, vol. 96(2), pages 323-328, January.
    12. Eusebio Angulo & Ricardo García-Ródenas & José Luis Espinosa-Aranda, 2016. "A Lagrangian relaxation approach for expansion of a highway network," Annals of Operations Research, Springer, vol. 246(1), pages 101-126, November.
    13. 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.
    14. Sancho, N. G. F., 1995. "A suboptimal solution to a hierarchial network design problem using dynamic programming," European Journal of Operational Research, Elsevier, vol. 83(1), pages 237-244, May.
    15. Cruz, F. R. B. & Smith, J. MacGregor & Mateus, G. R., 1999. "Algorithms for a multi-level network optimization problem," European Journal of Operational Research, Elsevier, vol. 118(1), pages 164-180, October.
    16. Chardy, M. & Costa, M.-C. & Faye, A. & Trampont, M., 2012. "Optimizing splitter and fiber location in a multilevel optical FTTH network," European Journal of Operational Research, Elsevier, vol. 222(3), pages 430-440.
    17. Luca Quadrifoglio & Randolph W. Hall & Maged M. Dessouky, 2006. "Performance and Design of Mobility Allowance Shuttle Transit Services: Bounds on the Maximum Longitudinal Velocity," Transportation Science, INFORMS, vol. 40(3), pages 351-363, August.
    18. Kim, Myungseob (Edward) & Schonfeld, Paul, 2015. "Maximizing net benefits for conventional and flexible bus services," Transportation Research Part A: Policy and Practice, Elsevier, vol. 80(C), pages 116-133.
    19. T. Boffey, 1998. "Efficient solution methods for covering tree problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 6(2), pages 205-221, December.
    20. Bogataj, Marija & Grubbström, Robert W. & Bogataj, Ludvik, 2011. "Efficient location of industrial activity cells in a global supply chain," International Journal of Production Economics, Elsevier, vol. 133(1), pages 243-250, September.

    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:eee:jotrge:v:19:y:2011:i:4:p:591-595. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/journal-of-transport-geography .

    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.