Hybrid Algorithm for Line Planning Problem

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.