Macroscopic Fundamental Diagram Based Discrete Transportation Network Design

Algorithm 1

Step 0: Initialization: .

 Draw network in VISSIM;

 Termination condition: all building plans have been enumerated;

 Get the information of drawn VISSIM network by calling COM interface;

 Remove all routes of vehicles by calling Remove Vehicle Route Static method;

Step 1: Update traffic network and plot MFDs by calling VISSIM COM:

 While termination condition is false, for each building plan do.

  For each link in do:  //Update traffic network through update travel time.

   If link in plan .

    ;

   Else.

    ;

  End for.

  For each in do:

   //Input traffic demand.

   Find all links whose upstream vertexes generate traffic demand, and denote the link set as ;

   For each link in do:

    Set link = The generated traffic demand in link upstream vertex;

   End for.

   //Solve UE model.

   Solve UE model by Frank–Wolfe Algorithm;

   Get link equilibrium flow ;

   //Reset vehicle routes and simulate traffic assignment state.

   For each link in do:

    Find link downstream link set ;

    For each downstream links in set do:

     Link (Destination link = , Relative flow = );

    End for.

   End for.

   VISSIM. Simulation;

   Output simulation data;

  End for.

  Plot MFD;

 End while