Abstract: |
Traffic congestion remains a critical issue in urban areas, necessitating innovative solutions for efficient traffic signal control—a central component in enhancing traffic flow and reducing delays for all participants. In the literature, this challenge is referred to as the Intersection Traffic Signal Control Problem (ITSCP) (Eom and Kim, 2020), which involves the optimization of three primary components: the cycle, representing the overall time allocated for a signalization period; the phase sequence over this period, indicating the order of individual directional movements at the intersection; and the duration, encapsulating the total green signal timings for specific phases, during which signalling remains constant. In our case, we tackle the ITSCP variant that was introduced within the qualification round of Google Hash Code Competition in 2021 under the name Traffic Signaling Problem. Our approach to tackling the Traffic Signaling Problem is based on an Artificial Bee Colony (ABC) optimization method inspired by the foraging behaviour of honeybees (Pham et al., 2006). In our framework, a point in the search space, representing a solution, is defined using an array whose length corresponds to the number of intersections in the given problem instance. Each element within this array is a tuple object, storing information about the phase order and signaling time (i.e., green time) for each incoming street at the respective intersection. The neighbourhood comprises three operators: ShufflePhaseOrder, which randomly shuffles phase orders for selected intersections, with a selection probability of 47.5%; SwapPhaseOrder, which swaps positions of two randomly chosen incoming streets' green time phases at selected intersections, with a probability of 47.5%; and ChangeGreenTime, which randomly modifies the green time for one incoming street at selected intersections, with a probability of 5%. In each iteration, the waggle dance mechanism is employed to distinguish between various regions in the search space, represented by elite, best, and the remaining scout bees. These entities determine regions deemed very promising, moderately promising, or not promising at all. While the first two are used for exploitation purposes, the last one is used for exploration because they are replaced with new initialized solutions. For experimentation purposes, we utilized a challenging dataset comprising 10 problem instances, with 5 introduced in the Google Hash Code Competition and another 5 generated by our group. The size of these instances ranges up to 10,000 intersections, 95,000 streets, and 1,000 cars. The results indicate that our approach is competitive with state-of-the-art solvers. Among the 10 instances, the gap from the best-known solutions is less than 0.05% for four instances. For two instances, the gap is around 1%, for three instances it is around 5%, whereas for the remaining two instances, the gaps are at 12% and 39%, respectively. Furthermore, by implementing our approach in conjunction with the state-of-the-art solver, we were able to discover two best new solutions, one exhibiting a slight advantage of 0.001% and the other with a margin of 0.187%. Such results seem promising, with potential applications in smart city initiatives and the integration of intelligent traffic management systems in real-life cases. The solver source code and solutions are available on github.com/atlantiklimani/Traffic-Signaling/tree/new-idea-for-bee-hive. |