Hot Rolling Batch Planning Problem Model Based on Genetic Algorithm

摘要：

To solve the hot rolling batch planning problem in production scheduling of iron and steel enterprises， a hot rolling batch planning model is formulated based on multiple travelling salesmen problem(MTSP)model．The objective is to minimize the total limit penalty value of adjacent stripped steels in width．thickness and hardness．The main constraints include jumps in width,thickness and hardness between adjacent stripped steels，which are essential for steel production process．An improved genetic algorithm is designed to solve the model．A simulation example shows the reasonability of the model and validity of the algorithm．

关键词： hot rolling batch plan multiple travelling salesmen problem genetic algorithm

作者: LI Haitao HAN Fang LI Sujian WANG Fang WU Di

作者单位: Department of Logistics Engineering University of Science & Technology Beijing Beijing,China

会议类型: 国际会议

会议名称: 2011 International Conference on Manufacturing and Industrial Engineering(ICMIE 2011)(2011年制造及工业工程国际会议)

会议地点: 海口

会议语种:英文

页码: 86-89

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