IDEAS home Printed from https://ideas.repec.org/a/spr/anresc/v40y2006i3p473-491.html
   My bibliography  Save this article

An equilibrium network design model with a social cost function for multimodal networks

Author

Listed:
  • Byung Kim
  • Wonkyu Kim

Abstract

No abstract is available for this item.

Suggested Citation

  • Byung Kim & Wonkyu Kim, 2006. "An equilibrium network design model with a social cost function for multimodal networks," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 40(3), pages 473-491, August.
    • Handle: RePEc:spr:anresc:v:40:y:2006:i:3:p:473-491
    DOI: 10.1007/s00168-005-0053-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00168-005-0053-3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00168-005-0053-3?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Solanki, Rajendra S. & Gorti, Jyothi K. & Southworth, Frank, 1998. "Using decomposition in large-scale highway network design with a quasi-optimization heuristic," Transportation Research Part B: Methodological, Elsevier, vol. 32(2), pages 127-140, February.
    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. Wang, David Z.W. & Liu, Haoxiang & Szeto, W.Y., 2015. "A novel discrete network design problem formulation and its global optimization solution algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 79(C), pages 213-230.
    2. Andrew Ensor & Felipe Lillo, 2016. "Colored-Edge Graph Approach for the Modeling of Multimodal Transportation Systems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(01), pages 1-21, February.
    3. Byung Kim & Wonkyu Kim & Byung Song, 2008. "Sequencing and scheduling highway network expansion using a discrete network design model," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 42(3), pages 621-642, September.
    4. Wei Huang & Guangming Xu & Hong K. Lo, 2020. "Pareto-Optimal Sustainable Transportation Network Design under Spatial Queuing," Networks and Spatial Economics, Springer, vol. 20(3), pages 637-673, September.
    5. Loukas Dimitriou & Theodore Tsekeris & Antony Stathopoulos, 2009. "Joint pricing and design of urban highways with spatial and user group heterogeneity," Netnomics, Springer, vol. 10(1), pages 141-160, April.
    6. Karimi Dehnavi, Hadi & Rezvan, Mohammad Taghi & Shirmohammadli, Abdolmatin & Vallée, Dirk, 2013. "A solution for urban road selection and construction problem using simulation and goal programming—Case study of the city of Isfahan," Transport Policy, Elsevier, vol. 29(C), pages 46-53.
    7. Arash Kaviani & Russell G. Thompson & Abbas Rajabifard & Majid Sarvi, 2020. "A model for multi-class road network recovery scheduling of regional road networks," Transportation, Springer, vol. 47(1), pages 109-143, February.
    8. Hamid Farvaresh & Mohammad Sepehri, 2013. "A Branch and Bound Algorithm for Bi-level Discrete Network Design Problem," Networks and Spatial Economics, Springer, vol. 13(1), pages 67-106, March.

    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. Poorzahedy, Hossain & Rouhani, Omid M., 2007. "Hybrid meta-heuristic algorithms for solving network design problem," European Journal of Operational Research, Elsevier, vol. 182(2), pages 578-596, October.
    2. Di, Xuan & Ma, Rui & Liu, Henry X. & Ban, Xuegang (Jeff), 2018. "A link-node reformulation of ridesharing user equilibrium with network design," Transportation Research Part B: Methodological, Elsevier, vol. 112(C), pages 230-255.
    3. Drezner, Zvi & Wesolowsky, George O., 2003. "Network design: selection and design of links and facility location," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(3), pages 241-256, March.
    4. Luathep, Paramet & Sumalee, Agachai & Lam, William H.K. & Li, Zhi-Chun & Lo, Hong K., 2011. "Global optimization method for mixed transportation network design problem: A mixed-integer linear programming approach," Transportation Research Part B: Methodological, Elsevier, vol. 45(5), pages 808-827, June.
    5. Byung Kim & Wonkyu Kim & Byung Song, 2008. "Sequencing and scheduling highway network expansion using a discrete network design model," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 42(3), pages 621-642, September.
    6. Arash Kaviani & Russell G. Thompson & Abbas Rajabifard & Majid Sarvi, 2020. "A model for multi-class road network recovery scheduling of regional road networks," Transportation, Springer, vol. 47(1), pages 109-143, February.
    7. Wang, David Z.W. & Liu, Haoxiang & Szeto, W.Y., 2015. "A novel discrete network design problem formulation and its global optimization solution algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 79(C), pages 213-230.
    8. 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.

    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:spr:anresc:v:40:y:2006:i:3:p:473-491. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.