Application of a Hybrid Genetic Algorithm to Slab Design Problem
Katsumi HIRAYAMA, Hideyuki KAJIHARA, Yoshiyuki NAKAGAWA
This paper describes a new approach to solving the problem of slab design in the iron and steel industries. The problem is a kind of bin-packing problems, which are known as NP-complete (Nondeterministic Polynomial-complete) problem. Getting the optimal solution for slab design problem is very difficult, because which involves many restrictions of order, rolling and slab. We propose an approach applying a Genetic Algorithm (GA). This paper's GA is a Hybrid GA which is combined with heuristics in order to carry out an effective search process and obtain a near-optimal solution. The main feature of this approach is a coding scheme designed to combined ordered plates by using heuristics. The results demonstrate that a Hybrid Genetic Algorithm within certain restrictions is a viable tool for solving large scale combinatorial optimization problems.