Modeling Demand for Passenger Transfers in the Bounds of Public Transport Network

The proposed model is based on the developed approach to perform the routing assignment stage in the classical four-stage urban planning procedure. Demand for trips is generated for each stop of a public transport system on the grounds of stochastic variable of the time interval between passengers arrival to the respective stop. After defining of the destination stop, the route for the passenger’s trip is determined with the use of Dijkstra’s algorithm within the frame of a public transport network which is presented as a graph model with stops for vertices and route segments for edges. Transfer nodes are defined in the model as such graph vertices which are common for at least two lines of the public transport system. The author presents a class library implemented with the use of the Python programming language. On the basis of this library, the model for simulations of demand for transfers within the given public transport system was developed. The proposed approach to the demand modeling and the developed software were used for simulations of demand for transfers within the bounds of the public transport system of Bochnia (Poland).