Utilizing historical and current travel times based on floating car data for management of an express truck fleet
暂无分享,去创建一个
Peter Wagner | Alexander Sohr | Rüdiger Ebendt | Touko Tcheumadjeu | Louis Calvin | P. Wagner | A. Sohr | Rüdiger Ebendt | Touko Tcheumadjeu | Louis Calvin
[1] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[2] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[3] Malik Ghallab,et al. A: an efficient near admissible heuristic search algorithm , 1983, IJCAI 1983.
[4] S.S. Chawathe,et al. Segment-Based Map Matching , 2007, 2007 IEEE Intelligent Vehicles Symposium.
[5] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[6] Peter Wagner,et al. A TRAFFIC INFORMATION SYSTEM BY MEANS OF REAL-TIME FLOATING-CAR DATA , 2002 .
[7] Ira Pohl,et al. Heuristic Search Viewed as Path Finding in a Graph , 1970, Artif. Intell..
[8] Elmar Brockfeld,et al. Validating travel times calculated on the basis of taxi floating car data with test drives , 2007 .
[9] Günter Rote,et al. Matching planar maps , 2003, SODA '03.