Abstract
Abstract 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 an optimal solution to the problem. We consider both undersaturated and oversaturated traffic conditions. The results show that we find optimal results with short Central Processor Unit (CPU) time using all the applied algorithms, where Dijkstra’s algorithm slightly outperformed others. Moreover, we show that bee colony optimization can find the optimal solution for all tested problems with different degrees of computational complexity for less CPU time, which is a new contribution to knowledge in this field.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
