Meta-heuristic and MILP for Solving Urban Traffic Signal Control

This paper studies the urban traffic light control problem. A model is proposed to describe the problem as an urban traffic light scheduling problem (UTLSP). The objective is to minimize total delay time of all vehicles in a fixed time window. To overcome the potentially high computational complexity involved in UTLSP, an improved artificial bee colony (IABC) algorithm, is proposed. Extensive computational experiments are carried out using sixteen instances. The IABC algorithm is compared to several meta-heuristics and standard solvers of the mixed integer linear programming (MILP) problem such as CPLEX. The comparisons and discussions show the competitiveness of IABC for solving UTLSP.