DocumentCode
3081390
Title
Hybrid Algorithm for Line Planning Problem
Author
Ratajczak, P. ; Michaluszko, Malgorzata ; Polak, Dawid ; Koszalka, Leszek ; Pozniak-Koszalka, Iwona ; Kasprzak, Andrzej
Author_Institution
Dept. of Syst. & Comput. Networks, Wroclaw Univ. of Technol., Wroclaw, Poland
fYear
2013
fDate
24-26 Aug. 2013
Firstpage
174
Lastpage
177
Abstract
The line planning problem belongs to the area of the public transportation strategic planning. In this paper, we propose a new hybrid algorithm dealing with this problem. Its performance is verified against a simulated annealing algorithm and random search. The obtained results are promising, the hybrid algorithm has produced good solutions in almost all of tested scenarios.
Keywords
planning; search problems; simulated annealing; transportation; hybrid algorithm; line planning problem; public transportation strategic planning; random search; simulated annealing algorithm; tested scenarios; Algorithm design and analysis; Data structures; Educational institutions; Evolutionary computation; Planning; Simulated annealing; Transportation; evolutionary algorithm; experimentation system; hybrid algorithm; line planning problem; public transport;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational and Business Intelligence (ISCBI), 2013 International Symposium on
Conference_Location
New Delhi
Print_ISBN
978-0-7695-5066-4
Type
conf
DOI
10.1109/ISCBI.2013.42
Filename
6724347
Link To Document