An integer programming model and a modified genetic algorithm for optimal turn-out slab piles for hot rolling schedule

In order to solve the turn-out slab problem (TOSP), this paper develops a modified genetic algorithm (MGA) for this problem, which needs a means to construct the genetic coding suitable for the optimal TOSP problem, that can not only generate feasible initial chromosomes, but also ensure chromosome feasibility after crossover and mutation. Then, to form an MGA framework, a new combination operation is introduced; crossover operation is improved. The computational experiments with selected cases of randomly produced problems show that the proposed new MGA is remarkably better than the original heuristics for TOSP problem, with the best improvement of 7.04%.