Title
Heuristic algorithms to solve 0 – 1 mixed integer LP formulations for traffic signal control problems
Abstract
In this paper, three heuristic solution algorithms, (the Dive-and-Fix method, the Ratio-cluster method, and the Cumulative-departure method) are specially designed to solve the traffic signal control problem formulated as a 0-1 mixed-integer linear programming problem with cell transmission model. These three solution algorithms are based on two fundamental approaches. First, the 0-1 mixed-integer linear program is solved via linear relaxation (LR). Second, the non-integer solutions obtained from the LR are converted into the integer solutions by taking advantage of the underlying physical mechanism embedded in the LR solutions that lead to the optimal signal control. In particular, proportional capacities for different approaches and the cumulative exit flow at each intersection obtained from the LR solutions are utilized to determine green time allocation for each approach. It is demonstrated that the near-optimal solutions obtained with these algorithms are very close to the optimal solutions under both uncongested and congested traffic conditions.
Year
DOI
Venue
2010
10.1109/SOLI.2010.5551595
Service Operations and Logistics and Informatics
Keywords
DocType
ISBN
integer programming,linear programming,optimal control,road traffic,traffic control,0-1 mixed-integer linear programming,cell transmission model,cumulative departure method,dive-and-fix method,green time allocation,heuristic solution algorithm,linear relaxation,optimal signal control,physical mechanism,ratio cluster method,traffic signal control,Traffic signal control,cell transmission model,heuristic algorithms,linear relaxations
Conference
978-1-4244-7118-8
Citations 
PageRank 
References 
4
0.47
4
Authors
4
Name
Order
Citations
PageRank
Qing He140.47
Wei-Hua Lin240.47
Hongchao Liu340.81
k larry head440.47