The multi-criteria road network design problem in an urban area
In this paper, urban network design is analysed through a heuristic multi-criteria technique based on genetic algorithms. Both network layout and link capacity (link layout and traffic lights) are optimised. Different optimisation criteria are included for users, non-users and public system managers. Demand is considered elastic with respect to mode choice; both morning and afternoon peak periods are taken into account. In addition, choice of parking location is simulated. The procedure is applied to a test and to a real transportation system. Copyright Springer Science+Business Media B.V. 2006
If 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.
References listed on IDEAS
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.:
- Foulds, L. R., 1981. "A multi-commodity flow network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 15(4), pages 273-283, August.
- Meng, Q. & Yang, H. & Bell, M. G. H., 2001. "An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 35(1), pages 83-105, January.
- Friesz, Terry L. & Shah, Samir, 2001. "An overview of nontraditional formulations of static and dynamic equilibrium network design," Transportation Research Part B: Methodological, Elsevier, vol. 35(1), pages 5-21, January.
- Ben-Ayed, Omar & Boyce, David E. & Blair, Charles E., 1988. "A general bilevel linear programming formulation of the network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 22(4), pages 311-318, August.
- Poorzahedy, Hossain & Turnquist, Mark A., 1982. "Approximate algorithms for the discrete network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 16(1), pages 45-55, February.
- Meneguzzer, Claudio, 1995. "An equilibrium route choice model with explicit treatment of the effect of intersections," Transportation Research Part B: Methodological, Elsevier, vol. 29(5), pages 329-356, October.
When requesting a correction, please mention this item's handle: RePEc:kap:transp:v:33:y:2006:i:6:p:567-588. 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: (Guenther Eichhorn)or (Christopher F. Baum)
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.