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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10839374/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832592930508898304 |
|---|---|
| author | Yamauchi Shuki Tokunaga Junpei Ebara Hiroyuki Ueda Naonori |
| author_facet | Yamauchi Shuki Tokunaga Junpei Ebara Hiroyuki Ueda Naonori |
| author_sort | Yamauchi Shuki |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-6a91abb1e1854399b08ff3ad602c26d9 |
| institution | Kabale University |
| issn | 2169-3536 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj-art-6a91abb1e1854399b08ff3ad602c26d92025-01-21T00:01:05ZengIEEEIEEE Access2169-35362025-01-0113108841089710.1109/ACCESS.2025.352902710839374Searching Optimum Route With Variable Travel TimeYamauchi Shuki0https://orcid.org/0009-0008-5558-5022Tokunaga Junpei1Ebara Hiroyuki2https://orcid.org/0000-0002-0725-3495Ueda Naonori3https://orcid.org/0000-0001-5701-9333Graduate School of Science and Engineering, Kansai University, Suita-shi, Osaka, JapanGraduate School of Science and Engineering, Kansai University, Suita-shi, Osaka, JapanFaculty of Engineering Science, Kansai University, Suita-shi, Osaka, JapanRIKEN Center for Advanced Intelligence Project, Chuo-ku, Tokyo, JapanIn 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.https://ieeexplore.ieee.org/document/10839374/Time-expansion-networkcar-navigationsearching-routeDijkstra algorithmnetwork-flow |
| spellingShingle | Yamauchi Shuki Tokunaga Junpei Ebara Hiroyuki Ueda Naonori Searching Optimum Route With Variable Travel Time IEEE Access Time-expansion-network car-navigation searching-route Dijkstra algorithm network-flow |
| title | Searching Optimum Route With Variable Travel Time |
| title_full | Searching Optimum Route With Variable Travel Time |
| title_fullStr | Searching Optimum Route With Variable Travel Time |
| title_full_unstemmed | Searching Optimum Route With Variable Travel Time |
| title_short | Searching Optimum Route With Variable Travel Time |
| title_sort | searching optimum route with variable travel time |
| topic | Time-expansion-network car-navigation searching-route Dijkstra algorithm network-flow |
| url | https://ieeexplore.ieee.org/document/10839374/ |
| work_keys_str_mv | AT yamauchishuki searchingoptimumroutewithvariabletraveltime AT tokunagajunpei searchingoptimumroutewithvariabletraveltime AT ebarahiroyuki searchingoptimumroutewithvariabletraveltime AT uedanaonori searchingoptimumroutewithvariabletraveltime |