A population-based algorithm for the railroad blocking problem

Artikel

Railroad blocking problem (RBP) is one of the problems that need an important decision in freight railroads. The objective of solving this problem is to minimize the costs of delivering all commodities by deciding which inter-terminal blocks to build and by specifying the assignment of commodities to these blocks, while observing limits on the number and cumulative volume of the blocks assembled at each terminal. RBP is an NP-hard combinatorial optimization problem with billions of decision variables. To solve the real-life RBP, developing a metaheuristic algorithm is necessary. In this paper, for the first time, a new genetic algorithm-based solution method, which is a population-based algorithm, is proposed to solve the RBP. To evaluate the efficiency and the quality of solutions of the proposed algorithm, several simulated test problems are used. The quality and computational time of the generated solutions for the test problems with the proposed genetic algorithm are compared with the solutions of the CPLEX software. The results show high efficiency and effectiveness of the proposed algorithm.

Object Details

• Language: Englisch

References and Relationships

• Bibliographic citation: Journal: Journal of Industrial Engineering International ; ISSN: 2251-712X ; Volume: 8 ; Year: 2012 ; Pages: 1-11 ; Heidelberg: Springer

Classification and Topics

• Classification: Management
• Subject: railroad blocking problem ; genetic algorithm ; budget design problem

Contributors, Places and Time

• Event: Geistige Schöpfung
• (who): Yaghini, Masoud ; Seyedabadi, Masoud ; Khoshraftar, Mohamad M
• Event: Veröffentlichung
• (who): Springer
• (where): Heidelberg
• (when): 2012

Further information

• DOI: doi:10.1186/2251-712X-8-8
• Handle: http://hdl.handle.net/10419/78584
• Last update: 10.03.2025, 11:45 AM CET