Relationship between the Significant Solutions of Static Traffic Assignment Problems for Mixed Traffic Flow of Connected and Automated Vehicles and Human-Driven Vehicles
Connected and automated vehicles can reduce the traffic congestion level of the entire network through platoon-driving technologies compared to human-driven vehicles. One promising approach to enhancing platoon-driving technology’s efficiency is deploying dedicated lanes or roads for connected and a...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2024/9400721 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849765682142511104 |
|---|---|
| author | Jaewoong Yun |
| author_facet | Jaewoong Yun |
| author_sort | Jaewoong Yun |
| collection | DOAJ |
| description | Connected and automated vehicles can reduce the traffic congestion level of the entire network through platoon-driving technologies compared to human-driven vehicles. One promising approach to enhancing platoon-driving technology’s efficiency is deploying dedicated lanes or roads for connected and automated vehicles. Since asymmetric interactions between different vehicle types increase road congestion, it is necessary to distinguish routes for efficient traffic management. However, the traditional traffic assignment problem, which uses only user equilibrium as a constraint with no difference in travel time between users, could not be proposed as a globally optimal solution because it generates an infinite number of locally optimal solutions. Recent studies have attempted to overcome the limitations by considering the sum of system-wide travel times as an additional constraint. Their research sought to help propose optimal deployment strategies through the lowest total travel time solution (best-case) or design robust transport planning strategies through the highest total travel time solution (worst-case). However, past studies have not focused on the possibility of the best/worst case appearing in reality. This study focused on the relationship between the two solutions pointed out in past studies and traffic patterns likely to appear in reality. This study interprets the Karush–Kun–Tucker condition of the static traffic assignment problem, considering the asymmetric interaction, and proposes a solution algorithm using discrete dynamics. The proposed algorithm extends the most widely used method in transportation planning research, which can overcome the limitations of asymmetric interaction problems through simple variations. The proposed algorithm can reliably derive two solutions, and entropy theory shows that both solutions are unlikely to appear in reality without additional policies such as dedicated lanes or roads. |
| format | Article |
| id | doaj-art-cb8ab29187dc4d20903b76bda6346e9d |
| institution | DOAJ |
| issn | 1607-887X |
| language | English |
| publishDate | 2024-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Discrete Dynamics in Nature and Society |
| spelling | doaj-art-cb8ab29187dc4d20903b76bda6346e9d2025-08-20T03:04:47ZengWileyDiscrete Dynamics in Nature and Society1607-887X2024-01-01202410.1155/2024/9400721Relationship between the Significant Solutions of Static Traffic Assignment Problems for Mixed Traffic Flow of Connected and Automated Vehicles and Human-Driven VehiclesJaewoong Yun0Department of Urban Planning and EngineeringConnected and automated vehicles can reduce the traffic congestion level of the entire network through platoon-driving technologies compared to human-driven vehicles. One promising approach to enhancing platoon-driving technology’s efficiency is deploying dedicated lanes or roads for connected and automated vehicles. Since asymmetric interactions between different vehicle types increase road congestion, it is necessary to distinguish routes for efficient traffic management. However, the traditional traffic assignment problem, which uses only user equilibrium as a constraint with no difference in travel time between users, could not be proposed as a globally optimal solution because it generates an infinite number of locally optimal solutions. Recent studies have attempted to overcome the limitations by considering the sum of system-wide travel times as an additional constraint. Their research sought to help propose optimal deployment strategies through the lowest total travel time solution (best-case) or design robust transport planning strategies through the highest total travel time solution (worst-case). However, past studies have not focused on the possibility of the best/worst case appearing in reality. This study focused on the relationship between the two solutions pointed out in past studies and traffic patterns likely to appear in reality. This study interprets the Karush–Kun–Tucker condition of the static traffic assignment problem, considering the asymmetric interaction, and proposes a solution algorithm using discrete dynamics. The proposed algorithm extends the most widely used method in transportation planning research, which can overcome the limitations of asymmetric interaction problems through simple variations. The proposed algorithm can reliably derive two solutions, and entropy theory shows that both solutions are unlikely to appear in reality without additional policies such as dedicated lanes or roads.http://dx.doi.org/10.1155/2024/9400721 |
| spellingShingle | Jaewoong Yun Relationship between the Significant Solutions of Static Traffic Assignment Problems for Mixed Traffic Flow of Connected and Automated Vehicles and Human-Driven Vehicles Discrete Dynamics in Nature and Society |
| title | Relationship between the Significant Solutions of Static Traffic Assignment Problems for Mixed Traffic Flow of Connected and Automated Vehicles and Human-Driven Vehicles |
| title_full | Relationship between the Significant Solutions of Static Traffic Assignment Problems for Mixed Traffic Flow of Connected and Automated Vehicles and Human-Driven Vehicles |
| title_fullStr | Relationship between the Significant Solutions of Static Traffic Assignment Problems for Mixed Traffic Flow of Connected and Automated Vehicles and Human-Driven Vehicles |
| title_full_unstemmed | Relationship between the Significant Solutions of Static Traffic Assignment Problems for Mixed Traffic Flow of Connected and Automated Vehicles and Human-Driven Vehicles |
| title_short | Relationship between the Significant Solutions of Static Traffic Assignment Problems for Mixed Traffic Flow of Connected and Automated Vehicles and Human-Driven Vehicles |
| title_sort | relationship between the significant solutions of static traffic assignment problems for mixed traffic flow of connected and automated vehicles and human driven vehicles |
| url | http://dx.doi.org/10.1155/2024/9400721 |
| work_keys_str_mv | AT jaewoongyun relationshipbetweenthesignificantsolutionsofstatictrafficassignmentproblemsformixedtrafficflowofconnectedandautomatedvehiclesandhumandrivenvehicles |