Multi-objective optimization of a road diet network design
AbstractThe 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Transportation Research Part A: Policy and Practice.
Volume (Year): 45 (2011)
Issue (Month): 6 (July)
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/547/description#description
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- 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.
- 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.
- 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.
- 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.
- 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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 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.