2018
DOI: 10.1049/iet-its.2018.5308
|View full text |Cite
|
Sign up to set email alerts
|

Real‐time traffic signal control for intersections based on dynamic O–D estimation and multi‐objective optimisation: combined model and algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 20 publications
0
3
0
Order By: Relevance
“…Later, with the development of wireless sensors, the control method began to become intelligent. Heuristic signal control methods appeared; the signal control scheme can be formulated according to the traffic information at the intersection [3], such as Jiao et al [4] switched phase sequence to achieve congested phase priority traffic. In actual application scenarios, this method greatly reduces the traffic congestion problem compared to the fixed mode control method.…”
Section: Related Workmentioning
confidence: 99%
“…Later, with the development of wireless sensors, the control method began to become intelligent. Heuristic signal control methods appeared; the signal control scheme can be formulated according to the traffic information at the intersection [3], such as Jiao et al [4] switched phase sequence to achieve congested phase priority traffic. In actual application scenarios, this method greatly reduces the traffic congestion problem compared to the fixed mode control method.…”
Section: Related Workmentioning
confidence: 99%
“…In this paper, the fitness function of TSC is defined as the average travel time of all vehicles that are generated according to the flow demands of the transportation network.Definition The flow demands of a network boldF consist of the trips of all Origin‐Destination (OD) pairs [26], as expressed by F={Fo,d|o,dN}.Without further explanations, this paper follows Stabler [25] to describe the flow demands with the hourly flow.…”
Section: Problem Formulationmentioning
confidence: 99%
“…). The flow demands of a network F consist of the trips of all Origin-Destination (OD) pairs [26], as expressed by…”
Section: Definition 8 (Flow Demandmentioning
confidence: 99%