用小生境模拟退火算法求解热轧调度问题  

A Solution to Hot Rolling Scheduling Problem by Using Niching Simulated Annealing Algorithm

作　　者：郭秀丽[1] 叶贤东[2] 郭秀萍[3] 

机构地区：[1]西华大学电气信息学院,四川成都610039 [2]西南交通大学机械学院,四川成都610031 [3]上海交通大学自动化系,上海200030

出　　处：《西华大学学报（自然科学版）》2007年第1期59-62,共4页Journal of Xihua University:Natural Science Edition

基　　金：国家自然科学基金资助项目(60174009)

摘　　要：建立了特殊生产工艺约束下热轧调度问题的非对称旅行商问题的数学模型,采用小生境模拟退火算法求解该模型,提出用小生境邻域构造法构造搜索子空间,以提高模拟退火算法的效率。实验结果表明小生境模拟退火算法能够更快地找到更好的解,并优于局部搜索算法和传统模拟退火算法。A mathematical model of asymmetric traveling salesman problem for hot rolling scheduling problem with special production constraints is developed.A niching simulated annealing algorithm is adopted to solve the model,i.e.,a niching neighborhood construction method is proposed to construct the search subspace,so as to improve the efficiency of simulated annealing algorithm.The result obtained from the experiment shows that the proposed algorithm can obtain better solution with faster speed,and it is superior to local search algorithm and conventional simulated annealing algorithm.

关 键 词：热轧调度问题 非对称旅行商问题 小生境模拟退火算法 小生境邻域构造法 

分 类 号：TG33[金属学及工艺—金属压力加工] N94[自然科学总论—系统科学]