Professional Documents
Culture Documents
This gaussian distribution represents the results of a random sampling of delays in bus schedule
on a random route or part of the route. Toward the finish of every month, this time point
information is brought into the database. The information is then partitioned into 7 gatherings as
per the day in the week. We at that point create the bunches and ordinary dispersions for all the
course portions in each gathering. The gaussian is retained in the database so that the clustering
analysis does not have to be run for every query.
Optimization Algorithm for Dynamic Bus scheduling-
Here, a rolling time window method is employed. During a specific time point at a particular
depot, some buses have departed and some buses are yet to depart. Real time information is
obtained from the various iot devices like GPS trackers, sensors, cameras etc. and based on this
real time data, the speeds of the departed buses will be altered for optimal scheduling and the
departure times of the buses in queue will be established for optimized timetable. The particular
window of analysis is called planning horizon and this planning horizon moves forward in time
in discrete intervals.
Some of the metrics used to determine the efficiency of a public transit system are waiting time,
running time, accessibility, frequency etc. This method employs waiting time as the evaluation
criterion.
Sum of the following two components will give the waiting time-
a) Waiting time of passengers for the first arrival of bus i at stop m in the current planning horizon:
b) Waiting time of passengers waiting at stop m for bus i as they could not get on the bus i-1 as it
was running at full capacity:
Where,