The shortest-path and bee colony optimization algorithms for traffic control at single intersection with NetworkX application
In this article, we study the application of NetworkX, a Python library for dealing with traffic networks, to the problem of signal optimization at a single intersection. We use the shortest-path algorithms such as Bellman-Ford (Dynamic Programming), A star (A*), and Dijkstra’s algorithm to compute...
| Main Authors: | , , , |
|---|---|
| 格式: | 文件 |
| 语言: | English |
| 出版: |
De Gruyter
2024-04-01
|
| 丛编: | Demonstratio Mathematica |
| 主题: | |
| 在线阅读: | https://doi.org/10.1515/dema-2023-0160 |