Optimal strategies: A new assignment model for transit networks
We 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.
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|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:23:y:1989:i:2:p:83-102. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.