IDEAS home Printed from https://ideas.repec.org/a/eee/transa/v45y2011i6p499-511.html
   My bibliography  Save this article

Multi-objective optimization of a road diet network design

Author

Listed:
  • Sohn, Keemin

Abstract

The present study focuses on the development of a model for the optimal design of a road diet plan within a transportation network, and is based on rigorous mathematical models. In most metropolitan areas, there is insufficient road space to dedicate a portion exclusively for cyclists without negatively affecting existing motorists. Thus, it is crucial to find an efficient way to implement a road diet plan that both maximizes the utility for cyclists and minimizes the negative effect on motorists. A network design problem (NDP), which is usually used to find the best option for providing extra road capacity, is adapted here to derive the best solution for limiting road capacity. The resultant NDP for a road diet (NDPRD) takes a bi-level form. The upper-level problem of the NDPRD is established as one of multi-objective optimization. The lower-level problem accommodates user equilibrium (UE) trip assignment with fixed and variable mode-shares. For the fixed mode-share model, the upper-level problem minimizes the total travel time of both cyclists and motorists. For the variable mode-share model, the upper-level problem includes minimization of both the automobile travel share and the average travel time per unit distance for motorists who keep using automobiles after the implementation of a road diet. A multi-objective genetic algorithm (MOGA) is mobilized to solve the proposed problem. The results of a case study, based on a test network, guarantee a robust approximate Pareto optimal front. The possibility that the proposed methodology could be adopted in the design of a road diet plan in a real transportation network is confirmed.

Suggested Citation

  • Sohn, Keemin, 2011. "Multi-objective optimization of a road diet network design," Transportation Research Part A: Policy and Practice, Elsevier, vol. 45(6), pages 499-511, July.
  • Handle: RePEc:eee:transa:v:45:y:2011:i:6:p:499-511
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0965856411000516
    Download Restriction: Full text for ScienceDirect subscribers only

    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. repec:eee:reensy:v:91:y:2006:i:9:p:992-1007 is not listed on IDEAS
    2. Penchina, Claude M., 1997. "Braess paradox: Maximum penalty in a minimal critical network," Transportation Research Part A: Policy and Practice, Elsevier, vol. 31(5), pages 379-388, September.
    3. Pas, Eric I. & Principio, Shari L., 1997. "Braess' paradox: Some new insights," Transportation Research Part B: Methodological, Elsevier, vol. 31(3), pages 265-276, June.
    4. Chen, Anthony & Subprasom, Kitti, 2007. "Analysis of regulation and policy of private toll roads in a build-operate-transfer scheme under demand uncertainty," Transportation Research Part A: Policy and Practice, Elsevier, vol. 41(6), pages 537-558, July.
    5. Davis, Gary A., 1994. "Exact local solution of the continuous network design problem via stochastic user equilibrium assignment," Transportation Research Part B: Methodological, Elsevier, vol. 28(1), pages 61-75, 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. Chung, Jin-Hyuk & Bae, Yun Kyung & Kim, Jinhee, 2016. "Optimal sustainable road plans using multi-objective optimization approach," Transport Policy, Elsevier, vol. 49(C), pages 105-113.
    2. Shrestha, Jagat K. & Benta, Agostinho & Lopes, Rui B. & Lopes, Nuno, 2014. "A multi-objective analysis of a rural road network problem in the hilly regions of Nepal," Transportation Research Part A: Policy and Practice, Elsevier, vol. 64(C), pages 43-53.
    3. Salcedo-Sanz, S. & Cuadra, L. & Alexandre-Cortizo, E. & Jiménez-Fernández, S. & Portilla-Figueras, A., 2014. "Soft-Computing: An innovative technological solution for urban traffic-related problems in modern cities," Technological Forecasting and Social Change, Elsevier, vol. 89(C), pages 236-244.

    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:transa:v:45:y:2011:i:6:p:499-511. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/547/description#description .

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

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.