A Three-Step Heuristic Approach to the Electric Vehicle Path Planning Problem considering Charging

Table 5

Charging path planning.

Charging path planning algorithm
Input	The charging feasibility road network
Output	The necessary charging path between the start point and the endpoint
Step 1	Given the set , initializing the distance from to each node in , and it is set to be infinite except the starting distance itself
	Step 2	Update all node distances in the set
		Path[].add(s)
end if
end for
Step 3		If , update all connected nodes
		Path[].add()
		end if
	end for
	Step 4	Determining a series of charging stations from the starting point to the endpoint