1. 대규모 협력적 교통 혼잡 완화를 위한 차량 흐름 제어 방법.
- Author
-
전영원 and 박대진
- Subjects
GREEDY algorithms ,ALGORITHMS - Abstract
This paper shows that a typical algorithm for finding the optimal route based on each vehicle focuses on the total distance of the shortest path, and that the algorithm can be modified to achieve the desired result if other factors other than the shortest distance should be targeted. We then explain that when applying the algorithm to multiple vehicles, the complexity of the system makes it difficult to describe it on an individual vehicle basis, and the greedy characteristics of the algorithm can be costly in terms of time. To minimize this damage, we also consider the impact of other vehicles and modify the algorithm to avoid congested areas. To test this, we use the microtraffic simulations SUMO and TraCI to measure the Mean Time and Total Distance for multiple vehicles to all reach their destination in a scenario on a specific Net, and show that we can reduce the Mean Time by up to 22.8% for multiple traffic scenarios. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF