Validation of the results of Kaspi and Raviv (2013) on the Cross-Entropy heuristic for the integrated line planning and timetabling problem.

Kaspi and Raviv (2013) were the first to successfully implement the cross-entropy metaheuristic for the integrated line planning and timetabling problem, with the objective of minimizing both total operational costs and the user inconvenience, which is expressed by the total travel time of all passengers. In this thesis, their results are successfully verified by implementing and testing the CE algorithm in Java.