Advancing Transportation Routing Decisions Using Riemannian Manifold Surfaces

Algorithm 5

Optimization of objective functions .

	for u = 1 to do
	input the sets , , , , and the output from Algorithm 4 (this input determines the sets and )
	Input the costs and
	Input the weights and for all
	for to do (to calculate yield sign duration for a route)
	for to do
	end for
	end for
	for j = 1 to 4 do (to calculate stop sign duration for a route)
	end for
	for i = 1 to do (to calculate traffic light duration for a route)
	end for
	for h = 1 to 5 do (to calculateandafter receiving user preferences)
	input and
	calculate
	Sort and from min to max by using Quick sort algorithm
	display min values with the corresponding specific route choices
	end for
	end for