2019
DOI: 10.1016/j.trb.2019.01.012
|View full text |Cite
|
Sign up to set email alerts
|

Optimal network-level traffic signal control: A benders decomposition-based solution algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 48 publications
(18 citation statements)
references
References 63 publications
0
17
0
Order By: Relevance
“…The search for 2015-2020 resulted in a total of 10 such papers [76,84,88,91,[101][102][103][104][105][106] utilizing an analytical approach. Only 3 papers [84,103,105] considered a network problem, and the remaining 7 considered a single network problem. But the size of the realistic problems and the amount of interaction that needs to be included in the model for them to be interesting, make use of analytical methods significantly less practical (promising) for TST problems.…”
Section: Analytical Vs Simulation-optimization and CI Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…The search for 2015-2020 resulted in a total of 10 such papers [76,84,88,91,[101][102][103][104][105][106] utilizing an analytical approach. Only 3 papers [84,103,105] considered a network problem, and the remaining 7 considered a single network problem. But the size of the realistic problems and the amount of interaction that needs to be included in the model for them to be interesting, make use of analytical methods significantly less practical (promising) for TST problems.…”
Section: Analytical Vs Simulation-optimization and CI Methodsmentioning
confidence: 99%
“…References, [79][80][81][82][83] formulated the TST optimization problem as mixed-integer linear programming (MILP) whereas references [84,85] presented as the non-linear programming models…”
Section: Dynamic Milp and Non-linear Programming Based Approachesmentioning
confidence: 99%
See 1 more Smart Citation
“…We have used a single set of constraints for diverge, merge, and ordinary cells by considering summation of flows over all incoming links to or outgoing links from a cell in any constraint. Mohebifard and Hajbabaie () have provided a set of constraints for each cell type and captured the flow feasibility conditions with a set of mixed integer nonlinear constraints. The constraints ensure that flow of vehicles follow the CTM flow‐density diagram; however, at the expense of adding many binary variables to the mathematical program.…”
Section: Problem Formulationmentioning
confidence: 99%
“…In [9], authors made an attempt of topological formalization of the motor transport flow as a set (C) of vehicles, consisting of oppositely directed subsets (С 1 and С 2 ). The combined movement along some section of the highway is characterized by such physical features as dimension (G), dynamic gauge (DG), interval of movement (I) of vehicles.…”
Section: Literature Review and Problem Statementmentioning
confidence: 99%