Vehicle routing in urban areas based on the Oil Consumption Weight -Dijkstra algorithm
暂无分享,去创建一个
Gang Wang | Jindong Zhang | Yu-jie Feng | Xiao-yan Jia | G. Wang | Jindong Zhang | Xiaoyan Jia | Fei-fei Shi | Bin Ma | Rui-sheng Li | Rui Li | Yu-jie Feng | Feifei Shi | Bin Ma
[1] Fabrizio Altarelli,et al. The Edge-Disjoint Path Problem on Random Graphs by Message-Passing , 2015, PloS one.
[2] Yezid Donoso,et al. Congestion Based Mechanism for Route Discovery in a V2I-V2V System Applying Smart Devices and IoT , 2015, Sensors.
[3] Thomas J. Misa,et al. An interview with Edsger W. Dijkstra , 2010, Commun. ACM.
[4] José Luis Galán-García,et al. A new Probabilistic Extension of Dijkstra's Algorithm to simulate more realistic traffic flow in a smart city , 2015 .
[5] José D. Piñeiro,et al. Application of Time Dependent Probabilistic Collision State Checkers in Highly Dynamic Environments , 2015, PloS one.
[6] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[7] Matthew E. Kahn. Fueling the future , 2015 .
[8] M. Sweet. Does Traffic Congestion Slow the Economy? , 2011 .