Map Matching for Fixed Sensor Data Based on Utility Theory

Algorithm 1

Candidate set generation algorithm.

	Input: The road network RN and the link pair (ls, le), where ls and le are the links where the origin fixed sensor and destination fixed sensor are located.
	Output: The candidate set for sensor pair (, ).
	Initialization
	Set the candidate set:
	Set the size of the candidate set: DN
	Turning Probability
	For lx in road network RN:
	Calculate the turning probability based on equation (9).
	Random Walk
	While n < DN do
	lx = ls
	P = [ls]
	While lyle do
	Randomly select a next link ly based on the turning probability
	Update the generated path: P.append(ly)
	Update the current link: lx = ly
	End while
	n+ = 1
	Update the candidate set:
	End while