计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (19): 192-194.DOI: 10.3778/j.issn.1002-8331.2009.19.059

• 工程与应用 • 上一篇    下一篇

Memetic算法在板坯排序中的应用

高知新1,2,李铁克1,苏志雄1   

  1. 1.北京科技大学 经济管理学院,北京 100083
    2.辽宁工程技术大学 理学院,辽宁 阜新 123000
  • 收稿日期:2008-10-06 修回日期:2008-11-19 出版日期:2009-07-01 发布日期:2009-07-01
  • 通讯作者: 高知新

Application of Memetic algorithm on slab sequencing

GAO Zhi-xin1,2,LI Tie-ke1,SU Zhi-xiong1   

  1. 1.School of Economics and Management,University of Science and Technology Beijing,Beijing 100083,China
    2.College of Science,Liaoning Technical University,Fuxin,Liaoning 123000,China
  • Received:2008-10-06 Revised:2008-11-19 Online:2009-07-01 Published:2009-07-01
  • Contact: GAO Zhi-xin

摘要: 热轧带钢生产中的板坯排序是一种复杂的组合优化问题,可以归结为一个PCTSP问题。Memetic算法(种群全局搜索和启发式局部搜索的结合),被用来求解热轧板坯排序。考虑到热轧生产约束的特点,提出了一种初始解构造策略,并利用缩减3-opt邻域搜索算法进行局部优化。仿真结果表明了该算法的优化效果和时间效率都是令人满意的。

关键词: 板坯排序, PCTSP, Memetic算法, 3-opt

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.

Key words: slab sequencing, Prize Collecting Traveling Salesman Problem(PCTSP), Memetic algorithm, 3-opt