A linear programming formulation for autonomous intersection control within a dynamic traffic assignment and connected vehicle environment

•Develops a linear programming formulation for autonomous intersection.•It also accounts for system optimal route choice behavior.•Intersection safety is guaranteed.•There are no holding flows in the solution.•Various tests have been conducted to verify the formulation’s properties. This paper devel...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Transportation research. Part C, Emerging technologies Ročník 55; s. 363 - 378
Hlavní autori: Zhu, Feng, Ukkusuri, Satish V.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier India Pvt Ltd 01.06.2015
Predmet:
Autonomous
Autonomous intersection control
Connected vehicles
Dynamic traffic assignment
Dynamical systems
Intersections
Linear programming
Mathematical models
Nonlinear dynamics
Optimization
System optimum
Traffic flow
Autonomous intersection control
Linear programming
Connected vehicles
System optimum
Dynamic traffic assignment
ISSN:0968-090X, 1879-2359
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:•Develops a linear programming formulation for autonomous intersection.•It also accounts for system optimal route choice behavior.•Intersection safety is guaranteed.•There are no holding flows in the solution.•Various tests have been conducted to verify the formulation’s properties. This paper develops a novel linear programming formulation for autonomous intersection control (LPAIC) accounting for traffic dynamics within a connected vehicle environment. Firstly, a lane based bi-level optimization model is introduced to propagate traffic flows in the network, accounting for dynamic departure time, dynamic route choice, and autonomous intersection control in the context of system optimum network model. Then the bi-level optimization model is transformed to the linear programming formulation by relaxing the nonlinear constraints with a set of linear inequalities. One special feature of the LPAIC formulation is that the entries of the constraint matrix has only {−1,0,1} values. Moreover, it is proved that the constraint matrix is totally unimodular, the optimal solution exists and contains only integer values. It is also shown that the traffic flows from different lanes pass through the conflict points of the intersection safely and there are no holding flows in the solution. Three numerical case studies are conducted to demonstrate the properties and effectiveness of the LPAIC formulation to solve autonomous intersection control.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0968-090X
1879-2359
DOI:10.1016/j.trc.2015.01.006