Capacity constrained transit assignment with common lines

Capacity constrained transit assignment with common lines

0.00 Avg rating0 Votes
Article ID: iaor20043138
Country: Netherlands
Volume: 2
Issue: 4
Start Page Number: 309
End Page Number: 327
Publication Date: Oct 2003
Journal: Journal of Mathematical Modelling and Algorithms
Authors: , ,
Keywords: markov processes
Abstract:

This paper proposes the use of absorbing Markov chains to solve the capacity constrained transit network loading problem taking common lines into account. The approach handles congested transit networks, where some passengers will not be able to board because of the absence of sufficient space. The model also handles the common lines problem, where choice of route depends on frequency of arrivals. The mathematical formulation of the problem is presented together with a numerical example.

Reviews

Required fields are marked *. Your email address will not be published.