Block Container Trains Formation Plan between Railway Network Container Freight Stations Based on Genetic Algorithm

Freight railroad operations involve complex classification and train formation decisions. Optimization with respect to these decisions can be quite difficult due to discrete and non-linear characteristics of the problem. The train formation plan is one of the important elements of railroad system operations. While mathematical programming formulations and algorithms are available for solving train formulation problem but CPU time required for their convergence is excessive. In this paper, 0–1 bi-level Linear Programming (BLP) is examined for obtaining good solutions with reduced complexity for block container trains formation plan (BCTFP). The minimum spending of container hour is taken as linear step function for optimization of the train formation plan. Cooperative multi-colony genetic algorithm (GA) is proposed for the solution of the block container train formation plan. Finally, the main contribution of the paper is to show the reduced complexity of the algorithm i.e. O(αn4lnβn2). The efficiency of the algorithm is also shown for convergence to global optimum.