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

Algorithm 2

Solving the ODSD with ACSd.

(1)	Input: ;
(2)	Initialize each of edge in ;
(3)	Set for each ;
(4)	Set iteration counter ;
(5)	From m initial routes, choose the optimal route as
(6)	for
(7)	for each ant k  do
(8)	Construct a feasible solution using Algorithm 1;
(9)	if
(10)
(11)	end for
(12)	get by comparing with ;
(13)	for each edge in do
(14)	if edge
(15)
(16)	else
(17)
(18)	end if
(19)	end for
(20)	Output: .