Multi-Objective Stochastic Synchronous Timetable Optimization Model Based on a Chance-Constrained Programming Method Combined with Augmented Epsilon Constraint Algorithm

Table 1

Compliance description of notations used in this study.

Set
	Routes set,
	The earliest card-brush time set of all vehicles in line N,
	All card-brush time of the a(i)th bus in line N,
Parameters
	Total number of cars in route n
	Passenger transfer demand
	Total drop-off time of all transfer passengers in line M
	Total vehicle travel time for line M
	Total vehicle travel time for line N
	Mean of total vehicle travel time for line M
	Mean of total vehicle travel time for line N
	Boarding time of the transfer passenger who holds the ith IC card
	Drop-off time of the transfer passenger who holds the ith IC card in line M
	Boarding time of the transfer passenger who holds the ith IC card in line N
	Number of trips corresponding to the record of the ith IC card in line N
	The earliest card swiping time of the ith IC bus in line N
	Total boarding time of all transfer passengers in line N
	Departure time of the th bus online N in the existing timetable,
	Total waiting time of passengers transferring from line M to line N
	Total departure adjustment time of line M to line N
	Optimized bus travel time online N
	Maximum departure time interval
	Minimum departure time interval
	Adjustable range of departure timetable
	Floating range of a vehicle’s travel time
	The earliest departure times of a bus line
	The latest departure times of a bus line
	Maximum card swiping time of the th bus online N
	Optimal value of derived from deterministic programming
	Optimal value of derived from deterministic programming
	Random travel time of vehicles online N
	Confidence level of constraint satisfaction for stochastic programming
	Mean of random travel time in line N
	Variance of random travel time in line N
	Probability that the random planning transfer time after considering the random variable is less than the deterministic planning transfer time
Decision variables
	1 −
	Departure time of the -th bus online N in the optimized timetable