scholarly journals A Graph-Based Optimal On-Ramp Merging of Connected Vehicles on the Highway

Machines ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 290
Author(s):  
Yanjun Shi ◽  
Zhiheng Yuan ◽  
Hao Yu ◽  
Yijia Guo ◽  
Yuhan Qi

Connected and automated vehicles (CAVs) are a very promising alternative for reducing fuel consumption and improving traffic efficiency when vehicles merge at on-ramps. In this study, we propose a graph-based method to coordinate CAVs to merge at the highway ramp. First, the optimized vehicles were divided into groups to pass the merging point. Then we built a directed graph model for each group of vehicles, where each path of the graph corresponds to one of all possible merging sequences. The improved shortest path algorithm is proposed to find the optimal merging sequence for minimizing total fuel consumption. The results of the simulation showed that the proposed graph-based method reduced fuel consumption and ensured high traffic efficiency; moreover, the vehicles can form a platoon after passing the merge point.

2017 ◽  
Vol 79 (3) ◽  
Author(s):  
Nor Amalina Mohd Sabri ◽  
Abd Samad Hasan Basari ◽  
Burairah Hussin ◽  
Khyrina Airin Fariza Abu Samah

The successfulness of evacuation is defined by the ability of the evacuees to escape from the danger place safely in a short time. The three problems highlighted in this study are evacuees do not know the right route should they take to safe themselves especially in high rise building due to the complexity of the building. Moreover, the provided evacuation map in the building is commonly not showing the shortest and safest path to assist evacuees in choosing the best route. Furthermore, the shortest path algorithm needs additional features to support the directed graph in order to obtain the best result. The objectives of this study are to design and develop the evacuation route via the shortest path algorithm and to evaluate the evacuation route model in high rise building evacuation maps. The methods used are modelling the evacuation route from the original floor plan into 2D floor plan, and then generating the directed graph based on the distance between nodes and coordinate of nodes to generate the shortest and safest path based on the utilisation of Dijkstra’s algorithm and Dijkstra-Ant Colony Optimization (DACO). The results obtained are proven consistent in generating the shortest and safest path with the same distance.


A new directed backward variant of the Single Source Shortest Path algorithm was described in this paper. This algorithm accept that approaching adjacency list of the given graph vertex loads showed up in expanding request. The running time of forward, based strategy algorithm is the best aftereffect of O (n), which are the most ideal forward-backward SSSP consequences of Wilson et al. Moreover, the likelihood of the new algorithm additionally requires O (n) time.This is an equally improved version of exponentially and polynomial small probability derived by Wilson et al.


2021 ◽  
Vol 13 (12) ◽  
pp. 6917
Author(s):  
Binghong Pan ◽  
Shasha Luo ◽  
Jinfeng Ying ◽  
Yang Shao ◽  
Shangru Liu ◽  
...  

As an unconventional design to alleviate the conflict between left-turn and through vehicles, Continuous Flow Intersection (CFI) has obvious advantages in improving the sustainability of roadway. So far, the design manuals and guidelines for CFI are not enough sufficient, especially for the displaced left-turn lane length of CFI. And the results of existing research studies are not operational, making it difficult to put CFI into application. To address this issue, this paper presents a methodological procedure for determination and evaluation of displaced left-turn lane length based on the entropy method considering multiple performance measures for sustainable transportation, including traffic efficiency index, environment effect index and fuel consumption. VISSIM and the surrogate safety assessment model (SSAM) were used to simulate the operational and safety performance of CFI. The multi-attribute decision-making method (MADM) based on an entropy method was adopted to determine the suitability of the CFI schemes under different traffic demand patterns. Finally, the procedure was applied to a typical congested intersection of the arterial road with heavy traffic volume and high left-turn ratio in Xi’an, China, the results showed the methodological procedure is reasonable and practical. According to the results, for the studied intersection, when the Volume-to-Capacity ratio (V/C) in the westbound and eastbound lanes is less than 0.5, the length of the displaced left-turn lanes can be selected in the range of 80 to 170 m. Otherwise, other solutions should be considered to improve the traffic efficiency. The simulation results of the case showed CFI can significantly improve the traffic efficiency. In the best case, compared with the conventional intersection, the number of vehicles increases by 13%, delay, travel time, number of stops, CO emission, and fuel consumption decrease by 41%, 29%, 25%, 17%, and 17%, respectively.


Sign in / Sign up

Export Citation Format

Share Document