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...

Full description

Bibliographic Details
Published in:Demonstratio Mathematica
Main Authors: Jovanović Aleksandar, Uzelac Ana, Kukić Katarina, Teodorović Dušan
Format: Article
Language:English
Published: De Gruyter 2024-04-01
Subjects:
Online Access:https://doi.org/10.1515/dema-2023-0160