Bilevel Programming for Traffic Signal Coordinated Control considering Pedestrian Crossing

Algorithm 1

Pseudocode of the algorithm.

	d[s] = 0, d[j] = INF, (j = other nodes)//s is an origin, t is a destination
	i = s
	while i ≠ t:
	Initialize Olist as a list of no-tagged nodes which are the last ones of each link (i, j);
	t[j] = min{d[j], d[i] + dij}//j ∈ Olist
	list = []
	for all j in Olist
	add t[j] to list
	d[j] = min (list)//Tag the minimum element in the list
	i = j
	end while