ITSC 2001. 2001 IEEE Intelligent Transportation Systems. Proceedings (Cat. No.01TH8585)
DOI: 10.1109/itsc.2001.948655
|View full text |Cite
|
Sign up to set email alerts
|

Implementation of the OPAC adaptive control strategy in a traffic signal network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
61
0

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 89 publications
(61 citation statements)
references
References 2 publications
0
61
0
Order By: Relevance
“…Most of the literature falls into the following two classes: mathematical programming approach and simulation-based approach [9]. Mathematical programming approach employed a set of mixed integer linear programming (MILP) formulations to minimize the total intersection delays or to maximize the green bandwidth [10][11][12], while simulation-based approach are developed to represent the complicated interactions between traffic flow interactions and signal timing parameters [13][14][15].…”
Section: Introductionmentioning
confidence: 99%
“…Most of the literature falls into the following two classes: mathematical programming approach and simulation-based approach [9]. Mathematical programming approach employed a set of mixed integer linear programming (MILP) formulations to minimize the total intersection delays or to maximize the green bandwidth [10][11][12], while simulation-based approach are developed to represent the complicated interactions between traffic flow interactions and signal timing parameters [13][14][15].…”
Section: Introductionmentioning
confidence: 99%
“…Due to the exponential complexity of these solution algorithms, the control strategies (though conceptually applicable to a whole network) are not real-time feasible for more than one intersection. Hence, we end up with a number of decentralized (by intersection) optimal strategies, whose actions may be coordinated heuristically by a superior control layer (see, e.g., [26], [27]). On the other hand, CRONOS employs a heuristic global optimization method with polynomial complexity which allows for simultaneous consideration of several intersections, albeit for the price of specifying a local (rather than the global) minimum.…”
Section: Coordinated Traffic-responsive Strategies 1) Scootmentioning
confidence: 99%
“…Finally the traffic flow is by definition The ramp metering constraints are given by (18) while the queue constraints read (28) where are queue lengths. The total time spent in the whole system over a time horizon may be expressed (29) Thus, for given current (initial) state from corresponding measurements, and given disturbance predictions , the problem consists in specifying the ramp flows , so as to minimize the total time spent (29) subject to the nonlinear traffic flow dynamics (27) and the constraints (18) and (28).…”
Section: Nonlinear Optimal Ramp Metering Strategiesmentioning
confidence: 99%
“…Adaptive UTCs attempt to harmonise the interplay between all aspects of traffic (private vehicles, public transportation, cyclist and pedestrians) in areas ranging in size from a few city blocks to entire cities. Adaptive centralised systems have been developed that apply optimisation algorithms, such as RHODES [17], OPAC [9] and SCOOT [18,31].…”
Section: Introductionmentioning
confidence: 99%