摘要
为解决热轧生产计划中出现的板坯倒垛问题,建立了基于轧制位置与库内板坯多对多对应关系的问题模型,提出了一种新的邻域搜索算法。该算法考虑到轧制计划中的板坯规格组在库内垛位中连续堆放的特点,引入了Sequence邻域概念,使算法能够更好地利用问题的特征,并通过两阶段的寻优替换对问题进行求解。实验结果表明了所提模型和算法的可行性和有效性。
To deal with the slab stack shuffling problem in the hot rolling schedule,a programming model based on many-to-many match-up relationship between the rolling position and the slabs in the slab yard was constructed.And a new neighborhood search algorithm was designed to solve the proposed model.Considering the specification slabs in the rolling planning may stack in the piles continuously,a concept of Sequence Neighborhood with the feature of non-static and serial was introduced Being different from existing static and independent neighborhood structures,the algorithm could make better use of the problem characteristics,and the two-stage optimization replacement procedure was adopted to solve the problem.The experimental results revealed the feasibility and effectiveness of the proposed models and algorithm.
出处
《计算机集成制造系统》
EI
CSCD
北大核心
2010年第3期658-662,671,共6页
Computer Integrated Manufacturing Systems
基金
国家自然科学基金资助项目(70771008
70371057)~~
