The Application of Memetic Algorithm on the Slab Sequencing

Author

Zhixing, Gao ; Zuogang, Zhang

Author_Institution

Sch. of Electron. & Inf. Eng., Liaoning Tech. Univ., Fuxin, China

fYear

2010

fDate

25-27 June 2010

Firstpage

2260

Lastpage

2263

Abstract

The slab sequencing problem in hot strip production is a complex combination optimization problem. It can be formulated as Prize Collecting Traveling Salesman Problem (PCTSP). Memetic algorithm is a marriage between a population-based global search and the heuristic local search, used to solve this problem. Considering the production constraints, a new scheme for initial solution generation is presented, and reduced 3-opt algorithm is used as local search strategy. The experiment results show that the effectiveness and efficiency of this algorithm are satisfactory.

Keywords

constraint theory; hot working; search problems; slabs; strips; travelling salesman problems; 3-opt algorithm; combination optimization problem; heuristic local search; hot strip production; memetic algorithm; population-based global search; prize collecting traveling salesman problem; production constraint; slab sequencing; Algorithm design and analysis; Job shop scheduling; Memetics; Planning; Slabs; Traveling salesman problems; 3-opt; Memetic algorithm; PCTSP; slab sequencing;

fLanguage

English

Publisher

ieee

Conference_Titel

Electrical and Control Engineering (ICECE), 2010 International Conference on

Conference_Location

Wuhan

Print_ISBN

978-1-4244-6880-5

Type

conf

DOI

10.1109/iCECE.2010.557

Filename

5629530