Title page for etd-0828107-073809


[Back to Results | New Search]

URN etd-0828107-073809
Author Shiuan-wen Chen
Author's Email Address chensw@par.cse.nsysu.edu.tw
Statistics This thesis had been viewed 5351 times. Download 1419 times.
Department Computer Science and Engineering
Year 2006
Semester 2
Degree Master
Type of Document
Language English
Title Algorithms for the Traffic Light Setting Problem on the Graph Model
Date of Defense 2007-07-05
Page Count 63
Keyword
  • graph model
  • algorithm
  • traffic light
  • Abstract As the number of vehicles increases rapidly, traffic congestion has become a serious problem in a city. Over the past years, a considerable number of studies have been made on traffic light setting. The traffic light setting problem is to investigate how to set the given traffic lights such that the total waiting time of vehicles on the roads is minimized. In this thesis, we use a graph model to represent the traffic network. On this model, some characteristics of the setting problem can be presented and analyzed. We first devise a branch and bound algorithm for obtaining the optimal solution of the traffic light setting problem. In addition, the genetic algorithm (GA), the particle swarm optimization (PSO) and the ant colony optimization (ACO) algorithm are also adopted to get the near optimal solution. Then, to extend this model, we add the assumption that each vehicle can change its direction. By comparing the results of various algorithms, we can study the impact of these algorithms on the traffic light setting problem. In our experiments, we also transform the map of Kaohsiung city into our graph model and test each algorithm on this graph.
    Advisory Committee
  • Yue-Li Wang - chair
  • Jensen Lin - co-chair
  • Shiue-Hung Shiau - co-chair
  • Ngai-Ching Wong - co-chair
  • Chang-Biau Yang - advisor
  • Files
  • etd-0828107-073809.pdf
  • indicate in-campus access immediately and off_campus access in a year
    Date of Submission 2007-08-28

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys