View in EDS

Solving the traffic signaling problem using the iterated local search metaheuristic.

Saved in:
Bibliographic Details
Title: Solving the traffic signaling problem using the iterated local search metaheuristic.
Authors: Misini, Elvir, Lajçi, Uran, Sylejmani, Kadri, Limani, Atlantik, Gashi, Fjolla, Kurtaj, Lavdim, Ahmeti, Arben, Krasniqi, Erzen
Source: Discover Applied Sciences; Aug2025, Vol. 7 Issue 8, p1-34, 34p
Abstract: Traffic lights are pivotal for urban mobility in large cities, with optimal scheduling at intersections being a complex task. This encompasses determining the optimal duration for green light signaling, assigning the sequence of signaling times for individual streets, and establishing the length of the signaling cycle for all streets, with these signaling times repeating over the assigned simulation period. In this paper, we present a meta-heuristic approach for the traffic signaling problem from the Google Hash Code Competition 2021. Our approach, based on the Iterated Local Search (ILS) algorithm, employs a tailored neighborhood structure designed for the selected solution encoding. This structure includes two basic moves, each extended into four additional variants, which can be applied in either a guided or greedy format. Additionally, it integrates a mechanism for search space exploitation, embedding Hill Climbing in individual algorithm iterations, and an exploration mechanism through a perturbation operator. Empirical studies were conducted on 48 challenging instances, including five from the Google Hash Code competition and 43 additional cases for extensive testing. The results highlight the competitiveness of our ILS approach compared to state-of-the-art solvers, achieving top rankings in 8 specific instances within a 30-minute execution timeframe, underscoring its potential for real-life applications. Highlights: Optimized traffic signals enhance urban mobility, reducing congestion and delays. Efficient adjustments to cycle length, green time, and phase order in traffic lights lead to smoother transitions and reduced waiting times at intersections. The Iterated Local Search algorithm may effectively minimizes delays in complex urban traffic networks. [ABSTRACT FROM AUTHOR]
Copyright of Discover Applied Sciences is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Complementary Index
Description
Abstract:Traffic lights are pivotal for urban mobility in large cities, with optimal scheduling at intersections being a complex task. This encompasses determining the optimal duration for green light signaling, assigning the sequence of signaling times for individual streets, and establishing the length of the signaling cycle for all streets, with these signaling times repeating over the assigned simulation period. In this paper, we present a meta-heuristic approach for the traffic signaling problem from the Google Hash Code Competition 2021. Our approach, based on the Iterated Local Search (ILS) algorithm, employs a tailored neighborhood structure designed for the selected solution encoding. This structure includes two basic moves, each extended into four additional variants, which can be applied in either a guided or greedy format. Additionally, it integrates a mechanism for search space exploitation, embedding Hill Climbing in individual algorithm iterations, and an exploration mechanism through a perturbation operator. Empirical studies were conducted on 48 challenging instances, including five from the Google Hash Code competition and 43 additional cases for extensive testing. The results highlight the competitiveness of our ILS approach compared to state-of-the-art solvers, achieving top rankings in 8 specific instances within a 30-minute execution timeframe, underscoring its potential for real-life applications. Highlights: Optimized traffic signals enhance urban mobility, reducing congestion and delays. Efficient adjustments to cycle length, green time, and phase order in traffic lights lead to smoother transitions and reduced waiting times at intersections. The Iterated Local Search algorithm may effectively minimizes delays in complex urban traffic networks. [ABSTRACT FROM AUTHOR]
ISSN:30049261
DOI:10.1007/s42452-025-07054-6