抄録
This paper investigates the departure time and route choice problem (DTARCP) for the development of online routing applications in advanced traveler information system (ATIS). The DTARCP is concerned with the problem of determining the best departure time and reliable shortest path simultaneously in stochastic and time-dependent networks. It is motivated by the fact that travelers make these two choices simultaneously for their travel. A new model is proposed for modeling the DTARCP with particular application in ATIS. An efficient solution algorithm is developed to solve the DTARCP. Numerical results based on real-world ATIS are also presented to demonstrate the features of the proposed model and solution algorithm. The computational results suggest that the proposed algorithm could be applicable to the online ATIS-based routing applications in large-scale road network.
