Izvorni znanstveni članak
https://doi.org/10.7307/ptt.v34i3.3946
A Systematic Cooperation Method for In-Car Navigation Based on Future Time Windows
Peiqun Lin
; School of Civil Engineering and Transportation, South China University of Technology
Chuhao Zhou
; School of Civil Engineering and Transportation, South China University of Technology
Yang Cheng
; Wisconsin Traffic Operations and Safety Laboratory, University of Wisconsin Madison
Sažetak
Traffic congestion has become a severe problem, af-fecting travellers both mentally and economically. To al-leviate traffic congestion, this paper proposes a method using a concept of future time windows to estimate the future state of the road network for navigation. Through our method, we can estimate the travel time not only based on the current traffic state, but the state that ve-hicles will arrive in the future. To test our method, we conduct experiments based on Simulation of Urban MO-bility (SUMO). The experimental results show that the proposed method can significantly reduce the overall travel time of all vehicles, compared to the benchmark Dijkstra algorithm. We also compared our method to the Dynamic User Equilibrium (DUE) provided by SUMO. The experimental results show that the performance of our method is a little better than the DUE. In practice, the proposed method takes less time for computation and is insensitive to low driver compliance: with as low as 40% compliance rate, our method can significantly im-prove the efficiency of the unsignalised road network. We also verify the effectiveness of our method in a signalised road network. It also demonstrates that our method can assign traffic efficiently.
Ključne riječi
navigation; greedy algorithm; future time windows; dynamic traffic assignment; simulation
Hrčak ID:
278612
URI
Datum izdavanja:
1.6.2022.
Posjeta: 290 *