Optimizing Vehicle Scheduling Based on Variable Timetable by Benders-and-Price Approach

Table 2

Notations for the path-based model.

Sets
	Set of vehicle types. Different types vehicles can execute different maximum allowed number of trips
	Set of vehicle types in terminal ,
	,
	Set of all possible paths
	Set of paths that can be covered by a vehicle from terminal of type
Parameters
	The cost of path covered by a vehicle of type . We suppose that two different vehicles with the same type have the same cost
	The number of vehicles of type in terminal ,
	A binary constant taking the value 1 if the path includes the trip , 0, otherwise
	A binary constant taking the value 1 if the path includes trips and in sequence, 0, otherwise
Decision variables
	A binary variable which takes value 1 if the path is selected and covered by a vehicle of type in an optimal solution, 0, otherwise
	A binary variable which takes value 1 if trips and are compatible, 0, otherwise