Operationalization

Departure time choice will be operationalized in the following way. We will take Eq. (14.2) as an example, and set $\beta = 1$. Let us in addition decide that we look at 5min time bins, and that we consider times only between 5am and 10am. Let us consider a traveler who wants to arrive at $t_{des}$.

This traveler would calculate, for all times between 5am and 10am in 5min time steps, and for her/his desired arrival time $t_{des}$, the value $f(t_{dep}) = e^{U(t_{dep})}$. She/he would then calculate the sum of all these values, $\Sigma$. The probabilities would then come out as

$$p(t_{dep}) = \frac{f(t_{dep})}{\Sigma} \ .$$

The traveler would then randomly select one of these departure time options according to the weights given by Eq. (14.10).

Figure 14.2: Data flow for simple activities replanning.

The data flow for activities replanning is given in Fig. 14.2. Note that travelers with new departure times also get new routes. At this point we do not perform separate re-routing for travelers whose activities have not changed. [[This will be changed in Chap. .]]

Implementation