In this paper we address optimal routing problems in networks where travel times are both stochastic and time-dependent. In these networks, the best route choice is not necessarily a path, but rather a time-adaptive strategy that assigns successors to nodes as a function of time. Nevertheless,...

There have lately been several suggestions for parametrized distances on a graph that generalize the shortest path distance and the commute time or resistance distance. The need for developing such distances has risen from the observation that the above-mentioned common distances in many...

We compare two different models for multicriterion routing in stochastic time-dependent networks: the classic "time-adaptive'' route choice and the more flexible "history-adaptive'' route choice. We point out some interesting properties of the sets of efficient solutions ("strategies'') found...