Abstract
This paper studies the departure time and route choice problem (DTARCP) for the development of online routing applications in advanced traveler information system (ATIS). The DTARCP is defined as to determine optimal departure time and reliable shortest path simultaneously in stochastic and time-dependent (STD) networks. It is motivated by the fact that travelers make these two decisions inter-related in STD networks. We propose a new model for modeling the DTARCP. An efficient heuristic solution algorithm is developed to solve the new proposed model. Numerical results based on real-world ATIS are also presented to demonstrate the features of proposed model and solution algorithm.