Effective Neighborhood Search Algorithm for Slab Sequencing Problem

摘要：

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.

关键词： slab sequencing neighborhood search 3-opt

作者: Zhixin Gao Tieke Li

作者单位: School of Economics and Management,University of Science and Technology Beijing Beijing,China;Colleg School of Economics and Management,University of Scienceand Technology BeijingBeijing,China

会议类型: 国际会议

会议名称: 2008 IEEE International Conference on Service Operations and Logistics, and Informatics(IEEE/SOLI’2008)(IEEE服务运作、物流与信息年会)

会议地点: 北京

会议语种:英文

在线出版日期: 2008-10-12（万方平台首次上网日期，不代表论文的发表时间）