http://iet.metastore.ingenta.com
1887

Time-of-day breakpoints optimisation through recursive time series partitioning

Time-of-day breakpoints optimisation through recursive time series partitioning

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Intelligent Transport Systems — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Traffic signal control systems often operate with a fixed time strategy when practical conditions prohibit adaptive traffic control built upon real-time traffic data. One of the most important challenges to have good performance for a fixed time strategy is to optimally identify the breakpoints that divide one day into different partitions, which is a time-of-day (TOD) breakpoints optimisation problem. Various solutions to this problem have been proposed based on classic clustering methods. However, these methods require empirical adjustment since they are not capable of incorporating the temporal information among traffic data. In this study, the TOD breakpoints optimisation problem is formulated as a time series data partitioning problem. A recursive algorithm is proposed to partition one day into several time periods based on the dynamic programming reformulation of the original problem. The appropriate number of partitions is determined through the elbow method. Then the authors present a case study based on the real data from Qingdao City in China that evaluates the proposed method against the existing ones. From simulation experiments, they illustrate that the proposed method is more effective in terms of operational performance measures such as maximum queue length and delay time than the existing ones.

http://iet.metastore.ingenta.com/content/journals/10.1049/iet-its.2018.5162
Loading

Related content

content/journals/10.1049/iet-its.2018.5162
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address