Vehicle routing in urban areas based on the Oil Consumption Weight -Dijkstra algorithm

被引:70
作者
Zhang, Jin-dong [1 ,2 ,3 ]
Feng, Yu-jie [1 ]
Shi, Fei-fei [1 ]
Wang, Gang [1 ]
Ma, Bin [1 ]
Li, Rui-sheng [1 ]
Jia, Xiao-yan [4 ]
机构
[1] Jilin Univ, Coll Comp Sci & Technol, Changchun 130012, Peoples R China
[2] Jilin Univ, Key Lab Symbol Computat & Knowledge Engn, Minist Educ, Changchun 130012, Peoples R China
[3] Jilin Univ, State Key Lab Automobile Simulat & Control, Changchun 130012, Peoples R China
[4] Jilin Univ, Dept Hand Surg, Hosp 1, Changchun 130021, Peoples R China
基金
中国国家自然科学基金;
关键词
vehicle routing; matrix algebra; urban areas; oil consumption weight -Dijkstra algorithm; route planning algorithm; OCW; driving environment; vehicle environment; weighted calculation; adjacency matrix; loading segment description; regional routing;
D O I
10.1049/iet-its.2015.0168
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
080906 [电磁信息功能材料与结构]; 082806 [农业信息与电气工程];
摘要
In this study, the authors refine a route-planning algorithm, in order to improve the route planning strategy in urban areas under traffic congestion. Considering the Oil Consumption Weight (OCW) and route planning methods, they propose an OCW-Dijkstra algorithm. In the algorithm, the parameters concerning the vehicle and driving environment, such as distance, speed, driving time, idling time, travel flow, driving oil consumption and idling oil consumption, are used for producing the OCW with weighted calculation in each section of the journey. In the execution of the algorithm, an adjacency matrix of the OCW is first generated by loading segment description, regional routing and the point information in an urban map. After the initial point and the destination point are selected, the optimal route is planned and generated automatically. In addition, the algorithm has self-learning methods, which can update the parameters and the OCW in real time. From the results of simulating experiments and the comparison with exhaustive algorithm, they find that the OCW-Dijkstra algorithm performs more effectively and robustly, which consequently saves driving time, as well as decreases oil consumption.
引用
收藏
页码:495 / 502
页数:8
相关论文
共 9 条
[1]
The Edge-Disjoint Path Problem on Random Graphs by Message-Passing [J].
Altarelli, Fabrizio ;
Braunstein, Alfredo ;
Dall'Asta, Luca ;
De Bacco, Caterina ;
Franz, Silvio .
PLOS ONE, 2015, 10 (12)
[2]
Dijkstra E.W., 1959, Numerische Mathematik, V1, P269, DOI 10.1007/BF01386390
[3]
A new Probabilistic Extension of Dijkstra's Algorithm to simulate more realistic traffic flow in a smart city [J].
Galan-Garcia, Jose L. ;
Aguilera-Venegas, Gabriel ;
Galan-Garcia, Maria A. ;
Rodriguez-Cielos, Pedro .
APPLIED MATHEMATICS AND COMPUTATION, 2015, 267 :780-789
[4]
Outdoor air pollution and asthma [J].
Guarnieri, Michael ;
Balmes, John R. .
LANCET, 2014, 383 (9928) :1581-1592
[5]
Application of Time Dependent Probabilistic Collision State Checkers in Highly Dynamic Environments [J].
Hernandez-Aceituno, Javier ;
Acosta, Leopoldo ;
Pineiro, Jose D. .
PLOS ONE, 2015, 10 (03)
[6]
Cheap and Clean How Americans Think About Energy in the Age of Global Warming [J].
Kahn, Matthew E. .
SCIENCE, 2015, 347 (6219) :238-238
[7]
Matthias S., 2011, J PLAN LIT, V26, P391, DOI [10.1177/0885412211409754, DOI 10.1177/0885412211409754]
[8]
An Interview with Edsger W. Dijkstra [J].
Misa, Thomas J. .
COMMUNICATIONS OF THE ACM, 2010, 53 (08) :41-47
[9]
Congestion Based Mechanism for Route Discovery in a V2I-V2V System Applying Smart Devices and IoT [J].
Parrado, Natalia ;
Donoso, Yezid .
SENSORS, 2015, 15 (04) :7768-7806