摘要
针对钢铁企业中的热轧生产调度问题,考虑了生产工艺中的多重约束,建立了基于奖金收集车辆路径问题模型的批量计划模型。模型综合考虑了同宽轧制长度的限制和烫辊材的约束,并针对约束复杂冲突的特点,设计一种基于遗传算法和禁忌搜索的混合算法来求解。生产实际数据的仿真实验表明模型和算法的有效性。
To solve the hot rolling lot planning problem in production scheduling of iron and steel enterprises, a hot rolling lot planning model is formulated based on prize collecting vehicle routing problem （pcvrp） model with multiple constraints. Also, a mixed algorithm is developed based on genetic algorithm and tabu search to solve the problem involving conflicting constraints. A case study using real data shows the effectiveness of the proposed model and algorithm.
出处
《辽宁工程技术大学学报（自然科学版）》
CAS
北大核心
2010年第1期139-142,共4页
Journal of Liaoning Technical University (Natural Science)
基金
国家自然科学基金资助项目(70771008
70371057)
关键词
热轧生产调度
遗传算法
禁忌搜索
hot rolling schedule
genetic algorithm
tabu search
