Flexible Scheduling Model of Bus Services between Venues of the Beijing Winter Olympic Games

Table 3

Problem variables and explanations.

Variable	Domain	Explanation
	R+	Maximum number of stations that people can accept during a trip
	(0, 1)	Minimum load factor of the bus
	R+	The capacity of the bus
	R+	The average speed of the bus
	R+	Length of the link
	R+	Total requests at the m-th time interval at zone
	R+	Number of passengers wanting to get on the bus at the i-th node
	R+	Number of passengers wanting to get on/off at the i-th node for in-zonal passengers
	R+	Average time for one passenger to get on or off the bus
	R+	Actual serving time at the i-th node
	R+	The time window for picking up passengers at the i-th node
	R+	Actual arrival time at the i-th node for bus k
	R+	Actual leaving time at the i-th node for bus k
	R+	Variable cost per bus, fixed cost per bus, and penalty cost for late time per minute
	R+	Maximum waiting time for a passenger
	R+	Time duration of each time interval
	{0, 1}	1 if the k-th bus serves the i-th node at the m-th time interval; 0 otherwise
	{0, 1}	1 if the link is selected by bus k at the m-th time interval; 0 otherwise
	{0, 1}	1 if the k-th bus is sent at the m-th time interval; 0 otherwise
	{0, 1}	1 if ; 0 otherwise
	{0, 1}	1 if the bus arrives at the i-th node earlier than the time window ; 0 otherwise
	{0, 1}	1 if the bus arrives at the i-th node later than the time window ; 0 otherwise