A Dynamic Travel Time Estimation Model Based on Connected Vehicles

Algorithm 1

Road link dynamic dividing algorithm.

Input:

Data set LinkD =

Output:

Cell Labels (CellID or “noise”) of Data set LinkD

Initialization:

Eps and MinPts;

Mark all points with “untouched”;

CellID = 0;

Program:

for each point in LinkD

  if   is not marked as “touched” then

   Mark as “touched”;

   Calculate the Number (denotes as ) of points in the Eps-neighborhood of ;

   if   < MinPts then

  Mark each point in Eps-neighborhood of as “noise”;

     else

   CellID = CellID + 1;

   Mark each point in Eps-neighborhood of with “CellID”;

   Insert the points without “touched” in Epcs-neighborhood of into a queue;

      while  the queue is not empty do

        Select the head object in the queue;

        Mark as “touched”;

        Calculate the Number (denotes as ) of points in the Eps-neighborhood of ;

        Delete from the queue;

         if   MinPts then

          Mark each point without “touched” in Eps-neighborhood of with “CellID”;

         end if

      end while

   end if

  end if

end for