Abstract
With the rapid growing popularity of cellular phones, cellular vehicle probe (CVP)-based travel time information systems become comparatively advantageous. Due to the vague positioning problem of CVP, to directly determine the travel path with the closest travel time may lead to an erroneous result. This paper proposes a virtual trip line matching model to determine the travel path of a call user by using the Yen's K-shortest paths algorithm to obtain potential paths and the multinomial logit (MNL) model to develop the map-matching model. A simplified network is used to estimate the MNL models and to validate the performance of the proposed model under various traffic conditions simulated by Paramics traffic simulator. The results show that the proposed model remarkably outperforms than the traditional model which simply chooses the path with the closest travel time to time lag of paired cellular geolocation points.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
