The joint signal timing and route choice on networks considering increment
T. Xu, S. Fan, A. Cheng, L. Zhang, X. Shu
Pages: 3-18
Abstract:
Selecting the length of the
increment is important in solving the optimal signal timing (OST) and the
dynamic user optimal route choice (DUORC) problem. How large should the
increment in the solution process be? The study of this problem is rare. In
this paper, the OST and the DUORC problem was studied with the consideration
of assignment increment. The problem is modeled as a three-level problem and
the experimental study is done. The first level is setting the increment. The
second level minimizes total travel time.
The third level is a variational inequality (VI) DUORC model. The
result of the experimental study shows that a smaller increment can increase
the precision of the solution. Since the signal cycle at an intersection
cannot be less than the minimum cycle, the study indicates that a small
increment is preferred in solving the OST-DUORC problem as long as the
minimum green time is reached. Furthermore, this paper presents a conception
of a new OST-DUORC travel guidance system, including the framework of the
system and the algorithm for it. With the method, the traffic center selects
an appropriate increment based on the result of this study, and then finds
the OST for intersections and the optimal routes for travelers by running the
second and third level model. The method helps implement a transport system
integrated with a traffic control system and a DUORC guidance system.
Keywords: dynamic user optimal; increment; route choice; signal timing; transportation network
2025 ISSUES
2024 ISSUES
LXII - April 2024LXIII - July 2024LXIV - November 2024Special 2024 Vol1Special 2024 Vol2Special 2024 Vol3Special 2024 Vol4
2023 ISSUES
LIX - April 2023LX - July 2023LXI - November 2023Special Issue 2023 Vol1Special Issue 2023 Vol2Special Issue 2023 Vol3
2022 ISSUES
LVI - April 2022LVII - July 2022LVIII - November 2022Special Issue 2022 Vol1Special Issue 2022 Vol2Special Issue 2022 Vol3Special Issue 2022 Vol4
2021 ISSUES
LIII - April 2021LIV - July 2021LV - November 2021Special Issue 2021 Vol1Special Issue 2021 Vol2Special Issue 2021 Vol3
2020 ISSUES
2019 ISSUES
Special Issue 2019 Vol1Special Issue 2019 Vol2Special Issue 2019 Vol3XLIX - November 2019XLVII - April 2019XLVIII - July 2019
2018 ISSUES
Special Issue 2018 Vol1Special Issue 2018 Vol2Special Issue 2018 Vol3XLIV - April 2018XLV - July 2018XLVI - November 2018
2017 ISSUES
Special Issue 2017 Vol1Special Issue 2017 Vol2Special Issue 2017 Vol3XLI - April 2017XLII - July 2017XLIII - November 2017
2016 ISSUES
Special Issue 2016 Vol1Special Issue 2016 Vol2Special Issue 2016 Vol3XL - November 2016XXXIX - July 2016XXXVIII - April 2016
2015 ISSUES
Special Issue 2015 Vol1Special Issue 2015 Vol2XXXV - April 2015XXXVI - July 2015XXXVII - November 2015
2014 ISSUES
Special Issue 2014 Vol1Special Issue 2014 Vol2Special Issue 2014 Vol3XXXII - April 2014XXXIII - July 2014XXXIV - November 2014
2013 ISSUES
2012 ISSUES
2011 ISSUES
2010 ISSUES
2009 ISSUES
2008 ISSUES
2007 ISSUES
2006 ISSUES
2005 ISSUES
2004 ISSUES
2003 ISSUES