Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
699083 | Control Engineering Practice | 2013 | 11 Pages |
The N-stages control problem for isolated signalized intersections is defined as the control problem to disperse initial queue lengths to their optimal steady-state values in N cycles. Based on a discrete-event model of a simplified isolated signalized intersection, the N-stages control problem is formulated as a linear programming problem as well as a quadratic programming problem. A new algorithm is proposed for solving the discrete optimization problem by simple calculations, based on the optimal solution of the corresponding continuous-time problem. Numerical comparisons between the continuous-time optimal solution and the discrete-event optimal solutions, obtained from linear programming and sequential quadratic programming, are given for a few examples.