Hybrid Optimal Control for Time-Efficient Highway Traffic Management


== Abstract ==

This article examines the hybrid traffic control problem to minimize total travel time (TTT) of a highway network through traffic management infrastructures, including dynamic speed limit signs, ramp metering, and information board. We first build the traffic flow model based on the Moskowitz function for each highway link to predict traffic status within a control horizon. The traffic density is predicted based on the flow dynamic model and corrected periodically by the measured traffic flow data. The minimum TTT traffic control problem is then formulated as a mixed-integer quadratic programming problem with quadratic constraints. Numerical simulation of a real world highway network is provided to demonstrate a significant reduction of TTT and alleviation of traffic congestion compared to results obtained from ALINEA and PI-ALINEA methods.


== Original document ==

The different versions of the original document can be found in:

* [https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1088&context=ccee_conf https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1088&context=ccee_conf]

* [http://xplorestaging.ieee.org/ielx7/8410068/8430677/08431704.pdf?arnumber=8431704 http://xplorestaging.ieee.org/ielx7/8410068/8430677/08431704.pdf?arnumber=8431704],
: [http://dx.doi.org/10.23919/acc.2018.8431704 http://dx.doi.org/10.23919/acc.2018.8431704]

* [https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1088&context=ccee_conf https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1088&context=ccee_conf],
: [https://lib.dr.iastate.edu/ccee_conf/88 https://lib.dr.iastate.edu/ccee_conf/88],
: [https://dblp.uni-trier.de/db/conf/amcc/acc2018.html#ZuLDS18 https://dblp.uni-trier.de/db/conf/amcc/acc2018.html#ZuLDS18],
: [https://works.bepress.com/anuj_sharma1/66 https://works.bepress.com/anuj_sharma1/66],
: [https://works.bepress.com/anuj_sharma1/66/download https://works.bepress.com/anuj_sharma1/66/download],
: [https://academic.microsoft.com/#/detail/2800446899 https://academic.microsoft.com/#/detail/2800446899]