Solving the traffic signaling problem using the iterated local search metaheuristic
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 l...
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer
2025-07-01
|
| Series: | Discover Applied Sciences |
| Subjects: | |
| Online Access: | https://doi.org/10.1007/s42452-025-07054-6 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849332511840141312 |
|---|---|
| author | Elvir Misini Uran Lajçi Kadri Sylejmani Atlantik Limani Fjolla Gashi Lavdim Kurtaj Arben Ahmeti Erzen Krasniqi |
| author_facet | Elvir Misini Uran Lajçi Kadri Sylejmani Atlantik Limani Fjolla Gashi Lavdim Kurtaj Arben Ahmeti Erzen Krasniqi |
| author_sort | Elvir Misini |
| collection | DOAJ |
| 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. |
| format | Article |
| id | doaj-art-2be15f62dddc40549825391df0caedfc |
| institution | Kabale University |
| issn | 3004-9261 |
| language | English |
| publishDate | 2025-07-01 |
| publisher | Springer |
| record_format | Article |
| series | Discover Applied Sciences |
| spelling | doaj-art-2be15f62dddc40549825391df0caedfc2025-08-20T03:46:11ZengSpringerDiscover Applied Sciences3004-92612025-07-017813410.1007/s42452-025-07054-6Solving the traffic signaling problem using the iterated local search metaheuristicElvir Misini0Uran Lajçi1Kadri Sylejmani2Atlantik Limani3Fjolla Gashi4Lavdim Kurtaj5Arben Ahmeti6Erzen Krasniqi7Faculty of Electrical and Computer Engineering, University of PrishtinaFaculty of Electrical and Computer Engineering, University of PrishtinaFaculty of Electrical and Computer Engineering, University of PrishtinaFaculty of Electrical and Computer Engineering, University of PrishtinaFaculty of Electrical and Computer Engineering, University of PrishtinaFaculty of Electrical and Computer Engineering, University of PrishtinaFaculty of Computer Sciences, AAB CollegeFaculty of Electrical and Computer Engineering, University of PrishtinaAbstract 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.https://doi.org/10.1007/s42452-025-07054-6Traffic signaling problemIterated local searchGreedy heuristics |
| spellingShingle | Elvir Misini Uran Lajçi Kadri Sylejmani Atlantik Limani Fjolla Gashi Lavdim Kurtaj Arben Ahmeti Erzen Krasniqi Solving the traffic signaling problem using the iterated local search metaheuristic Discover Applied Sciences Traffic signaling problem Iterated local search Greedy heuristics |
| title | Solving the traffic signaling problem using the iterated local search metaheuristic |
| title_full | Solving the traffic signaling problem using the iterated local search metaheuristic |
| title_fullStr | Solving the traffic signaling problem using the iterated local search metaheuristic |
| title_full_unstemmed | Solving the traffic signaling problem using the iterated local search metaheuristic |
| title_short | Solving the traffic signaling problem using the iterated local search metaheuristic |
| title_sort | solving the traffic signaling problem using the iterated local search metaheuristic |
| topic | Traffic signaling problem Iterated local search Greedy heuristics |
| url | https://doi.org/10.1007/s42452-025-07054-6 |
| work_keys_str_mv | AT elvirmisini solvingthetrafficsignalingproblemusingtheiteratedlocalsearchmetaheuristic AT uranlajci solvingthetrafficsignalingproblemusingtheiteratedlocalsearchmetaheuristic AT kadrisylejmani solvingthetrafficsignalingproblemusingtheiteratedlocalsearchmetaheuristic AT atlantiklimani solvingthetrafficsignalingproblemusingtheiteratedlocalsearchmetaheuristic AT fjollagashi solvingthetrafficsignalingproblemusingtheiteratedlocalsearchmetaheuristic AT lavdimkurtaj solvingthetrafficsignalingproblemusingtheiteratedlocalsearchmetaheuristic AT arbenahmeti solvingthetrafficsignalingproblemusingtheiteratedlocalsearchmetaheuristic AT erzenkrasniqi solvingthetrafficsignalingproblemusingtheiteratedlocalsearchmetaheuristic |