Optimal strategies: A new assignment model for transit networks
AbstractWe describe a model for the transit assignment problem with a fixed set of transit lines. The traveler chooses the strategy that allows him or her to reach his or her destination at minimum expected cost. First we consider the case in which no congestion effects occur. For the special case in which the waiting time at a stop depends only on the combined frequency, the problem is formulated as a linear programming problem of a size that increases linearly with the network size. A label-setting algorithm is developed that solves the latter problem in polynomial time. Nonlinear cost extensions of the model are considered as well.
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.
Bibliographic InfoArticle provided by Elsevier in its journal Transportation Research Part B: Methodological.
Volume (Year): 23 (1989)
Issue (Month): 2 (April)
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page. reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Zhang, Lei).
If references are entirely missing, you can add them using this form.