Title :
Effective neighborhood search algorithm for slab sequencing problem
Author :
Gao, Zhixin ; Li, Tieke
Author_Institution :
Sch. of Econ. & Manage., Univ. of Sci. & Technol., Beijing
Abstract :
The slab sequencing problem in hot strip production is a complicated combination optimization problem. It can be formulated as Asymmetric Traveling Salesman Problem (ATSP). Considering the production constraints, a new scheme for initial solution generation is presented, and reduced 3-opt algorithm with constraints is used for sequencing optimization. The experiment results show that the effectiveness and efficiency of this algorithm are satisfactory.
Keywords :
production management; search problems; slabs; travelling salesman problems; asymmetric traveling salesman problem; combination optimization problem; effective neighborhood search; hot strip production; production constraints; reduced 3-opt algorithm; sequencing optimization; slab sequencing problem; 3-opt; neighborhood search; slab sequencing;
Conference_Titel :
Service Operations and Logistics, and Informatics, 2008. IEEE/SOLI 2008. IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-2012-4
Electronic_ISBN :
978-1-4244-2013-1
DOI :
10.1109/SOLI.2008.4682807
