| contributor author | Nedal T. Ratrout | |
| date accessioned | 2017-05-08T21:40:22Z | |
| date available | 2017-05-08T21:40:22Z | |
| date copyright | September 2011 | |
| date issued | 2011 | |
| identifier other | %28asce%29cp%2E1943-5487%2E0000106.pdf | |
| identifier uri | http://yetl.yabesh.ir/yetl/handle/yetl/59070 | |
| description abstract | In many countries, the most widely used method for timing plan selection and implementation is the time-of-day (TOD) method. In TOD mode, a few traffic patterns that exist in the historical volume data are recognized and used to find the signal timing plans needed to achieve optimum performance of the intersections during the day. Traffic engineers usually determine TOD breakpoints by analyzing 1 or 2 days worth of traffic data and relying on their engineering judgment. The current statistical methods, such as hierarchical and | |
| publisher | American Society of Civil Engineers | |
| title | Subtractive Clustering-Based K-means Technique for Determining Optimum Time-of-Day Breakpoints | |
| type | Journal Paper | |
| journal volume | 25 | |
| journal issue | 5 | |
| journal title | Journal of Computing in Civil Engineering | |
| identifier doi | 10.1061/(ASCE)CP.1943-5487.0000099 | |
| tree | Journal of Computing in Civil Engineering:;2011:;Volume ( 025 ):;issue: 005 | |
| contenttype | Fulltext | |