Driving Strategy Using an Improved Ant Colony System for Energy-Efficient Train

Algorithm 1

The process of constructing a feasible solution.

	Given in ;
(1)	for
(2)	Generate a random number ;
(3)	Calculate and in ;
(4)	Calculate energy-efficient heuristic factor ;
(5)	if then ; //come into next slope
(6)	Update the of the current slope q by using equation (11);
(7)	Calculate speed heuristic factor with ;
(8)	Calculate heuristic information ;
(9)	Choose a regime in by using transition rule equation (21);
(10)	if then
	repairing speed violation
	by regimes replacement backwards until ;
	end if
(11)	end for
(12)	If , then repair distance constraint violation;
(13)	return .