Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks

We compare two different models for multicriterion routing in stochastic time-dependent networks: the classic ''time-adaptive'' model and the more flexible ''history-adaptive'' one. We point out several properties of the sets of efficient solutions found under the two models. We also devise a method for finding supported history-adaptive solutions.