Searching Optimum Route With Variable Travel Time

In the near future, in a society where connected and autonomous vehicles (connected automated vehicles) enable the transmission and sharing of traffic information, the demand for navigation systems is expected to increase; based on this background, this study proposes a shortest route search method using a time-expansion network. Assuming that the travel time to the destination can be accurately predicted, the proposed Method 1 finds a route that can reach the destination in the shortest possible travel time. This results in more realistic and accurate travel times than those provided by the current method. The proposed Method 2 facilitates vehicle dispersion by allowing drivers to set arrival times at their destinations in advance. We believe that this will alleviate the total level of congestion on the road by distributing routes according to the arrival time established by the drivers.We are convinced that if more vehicles were to use our proposed methods, energy consumption would be reduced in society as a whole.

Authors

Institutions

Publication Details

Journal
IEEE Access
Published
2025-01-01
DOI
https://doi.org/10.1109/access.2025.3529027
Citations
1
Primary Topic
Data Management and Algorithms
Type
article
Field-Weighted Citation Impact
1.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Searching Optimum Route With Variable Travel Time

Hiroyuki Ebara, Naonori Ueda, Yamauchi Shuki, Tokunaga Junpei
1 citations
IEEE Access
Data Management and Algorithms
1.49
article

Searching Optimum Route With Variable Travel Time

Hiroyuki Ebara, Naonori Ueda, Yamauchi Shuki, Tokunaga Junpei
article en
1 citations

Abstract

In the near future, in a society where connected and autonomous vehicles (connected automated vehicles) enable the transmission and sharing of traffic information, the demand for navigation systems is expected to increase; based on this background, this study proposes a shortest route search method using a time-expansion network. Assuming that the travel time to the destination can be accurately predicted, the proposed Method 1 finds a route that can reach the destination in the shortest possible travel time. This results in more realistic and accurate travel times than those provided by the current method. The proposed Method 2 facilitates vehicle dispersion by allowing drivers to set arrival times at their destinations in advance. We believe that this will alleviate the total level of congestion on the road by distributing routes according to the arrival time established by the drivers.We are convinced that if more vehicles were to use our proposed methods, energy consumption would be reduced in society as a whole.

IEEE AccessVol. 13
RIKEN Center for Advanced Intelligence Project (JP), Kansai University (JP)
Openalex Percentile: Top 24%
Data Management and Algorithms
1.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Searching Optimum Route With Variable Travel Time — Hiroyuki Ebara, Naonori Ueda, et al. · IEEE Access (2025) | TGRS Research Map | TGRS