Solving railway line planning problems using a decomposition algorithm

The passenger line planning is a process of strategic long-term decision-making problem in the field of railway passenger planning. A line is a route between starting point and destination with certain stops, which has a certain frequency of train schedule. A new solution based on decomposition algorithm has been proposed in this paper, which is defined in a master problem and two sub problems. Since the solution provided by decomposition algorithm is not of the integer number type, a heuristic algorithm has been proposed for converting the results to integer numbers. The objective function for the line planning problem in this article is to maximize the number of direct passengers. Results on the proposed solution method, for the test problems, are compared to those of solutions generated via CPLEX software. Results show that the proposed solution method has high performance and accuracy. As a case study, optimized passenger railway lines in Iranian railway have been determined using the proposed algorithm.

Keywords:

railway transportation planning , passenger railway planning , line planning problem , decomposition algorithm