Application of evolutionary algorithms in traffic light scheduling
This report address urban traffic light scheduling problem (UTLSP). The urban traffic light control problem is describe by a centralized model in a scheduling framework. The concept of splits, offsets and cycles are not taken consideration in the proposed model, therefore the UTLSP is under the opti...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Final Year Project |
| 語言: | English |
| 出版: |
2016
|
| 主題: | |
| 在線閱讀: | http://hdl.handle.net/10356/69298 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |
| 語言: | English |
| 總結: | This report address urban traffic light scheduling problem (UTLSP). The urban traffic light control problem is describe by a centralized model in a scheduling framework. The concept of splits, offsets and cycles are not taken consideration in the proposed model, therefore the UTLSP is under the optimization problems. The network controller assigned each traffic light in a real-time manner. This project aim to minimize the network-wise total delay time in a given finite horizon. To solve this problem, the Jaya algorithm was proposed. An improvement strategy is also proposed to better the results. A feature based search operator is utilized to improve the search performance of the optimization method. The experiments are carried out based on the real traffic data in Singapore. The Jaya and iJaya algorithms are evaluated by solving twenty-seven cases of large-scale traffic network. The comparisons and discussions proven that the evolutionary algorithms can effectively use to solve the UTLSP. |
|---|