Navrhování signálních plánů křižovatek metodami lineárního programování

Abstract

The submitted thesis deals with the comparison of results and usability of linear programming methods aimed at designing the signal plans of traffic light controlled intersections. The usability is being assessed via computational experiments in circumstances of a larger-scale intersection. Decomposition approach and exact approach were assessed. In most computational experiments, decomposition approach showed worse results. Though a more effective way of data processing was devised in the last of the three subtasks, which precede compiling of model, its solving takes significantly more time to prepare input data. The only advantage is an easy and fast search of other solutions for the same intersection. In most cases, the exact approach showed better results; in the process, it is not so time-demanding for preparation of data as well. However, its disadvantage is high computer technology performance requirements which projects also to the economical point of view.