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.
Block Container Trains Formation Plan between Railway Network Container Freight Stations Based on Genetic Algorithm
Ninth International Conference on Applications of Advanced Technology in Transportation (AATT) ; 2006 ; Chicago, Illinois, United States
2006-08-04
Conference paper
Electronic Resource
English
British Library Conference Proceedings | 2005
|The Optimization of Container Flow Routing Between Railway Network Container Freight Stations
British Library Conference Proceedings | 2007
|Empty Containers Distribution among Railway Network Container Freight Stations
British Library Conference Proceedings | 2007
|