Published February 1, 2024 | Version v1

Smart Traffic Signal Optimization with an Artificial Bee Colony Algorithm

Description

The Intersection Traffic Signal Control Problem (ITSCP) [1] involves determining the optimal duration for green light signaling for each incoming street at an intersection, assigning the sequence order of signaling times for individual streets, and establishing the length of the signaling cycle for all incoming streets, with these signaling times repeating over the assigned simulation period. We focus on a variant of ITSCP as defined in the Google Hash Code Competition 2021 [2], which is characterized by a general network type that considers single vehicle types with a fixed scheduling strategy employing an offline scheduling mechanism. The objective function aims to minimize delay for all vehicles without constraints on cycle length, phase sequence order, or green timing duration. Scenario: For didactic purposes, let us consider a scenario involving 5 intersections (depicted as blue nodes), 12 roads (illustrated as grey edges), and 35 cars (represented by red, green, and blue edges), within a scheduling horizon of 180 seconds. While we've omitted certain details for conciseness, the fundamental structure is evident. Each intersection accommodates a varying number of incoming streets, with each street within a single intersection sharing the green time (i.e., phase) during a cycle. Additionally, the figure visually traces the paths of three individual groups of cars, distinguished by red (10 cars), green (15 cars), and blue (10 cars) colors.

Files

Smart Traffic Signal Optimization with an Artificial Bee Colony Algorithm.pdf

Files (418.7 kB)

Additional details

Related works

Is cited by
Journal article: 10.1007/s42452-025-07054-6 (DOI)