A method for the design of optimal transport strategies
AbstractThis paper presents a methodology for the design of optimal transport strategies and demonstrates its application to six UK cities. An objective function representing the total welfare of a transport strategy is used to measure the performance of the strategy; the levels of policy instruments in a strategy, such as changes in public transport fares and frequency, are chosen such that the objective function is optimised. Two types of analysis are reported: sensitivity tests around individual policies to examine their relative impacts, and optimisations of packages of transport policies. The effects of spatial variations of the PT policies in the optimisations are also investigated.
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 Transport Policy.
Volume (Year): 13 (2006)
Issue (Month): 4 (July)
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/30473/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.:
- Anthony May & Simon Shepherd & Paul Timms, 2000. "Optimal transport strategies for European cities," Transportation, Springer, Springer, vol. 27(3), pages 285-315, June.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.