A Dynamic Day-To-Day Departure Time and Route Choice Model for Bounded-Rational Individuals
Algorithm 1
RTCIA for the UE model.
(1)
Input: all the variables in Table 1; total path number ;
(2)
Output: flow variables ,.
(3)
Initialization: for each departure interval , divide demand into segments, set ,. Denote as outer iteration index and initial value . Denote as the inner iteration index and initial value .
(4)
Main loop.
(5)
Inner iteration: path flow assignment.
(6)
xFor , denote as the initial prospect, calculated using equations (7)–(9).
(7)
When ,,; then update , using equations (7)–(9); the is stochastic parameter for route choice;
(8)
If , do: , method of successive averages (MSA) to update flow , ;
(9)
If , exit the inner iteration.
(10)
Outer iteration: departure time assignment.
(11)
. For , set ,. is the stochastic parameter for time choice.
(12)
When ,.
(13)
When , if , do: MSA to update flow: . Output: , enter into the inner iteration.
