A Multiobjective Optimization for Train Routing at the High-Speed Railway Station Based on Tabu Search Algorithm

Table 2

Decision variables.

Notations	Description
	Binary variables, if the arrival-departure line s is occupied by the train c, . Otherwise,
	Binary variables, if the route l in the left bottleneck is occupied by the outbound train c when pulls in, . Otherwise,
	Binary variables, if the route l in the left bottleneck is occupied by the inbound train c when departs from the station, . Otherwise,
	Binary variables, if the route r in the right bottleneck is occupied by the inbound train c when pulls in, . Otherwise,
	Binary variables, if the route r in the right bottleneck is occupied by the outbound train c when departs from the station, . Otherwise,
	Integer variables, indicates the starting time of train c to pull into the station
	Binary variables, indicates the trains and precedence relation at the same track. If the train precedes , . Otherwise,