基于HITHS算法的多节点多加工路线订单接受问题研究  

Research on order acceptance of multi-node and multi-process routes with HITHS algorithm

作　　者：王雷[1,2] 李铁克[1,2] 王欣[3] 许绍云[1,2] 孙琦[4] 

机构地区：[1]北京科技大学东凌经济管理学院,北京100083 [2]钢铁生产制造执行系统技术教育部工程研究中心,北京100083 [3]西北农林科技大学经济管理学院,杨凌712100 [4]浙江工商大学工商管理学院,杭州310018

出　　处：《北京科技大学学报》2013年第10期1390-1397,共8页Journal of University of Science and Technology Beijing

基　　金：教育部博士学科点专项科研基金资助项目(20100006110006);中央高校基本科研业务费专项(FRF-SD-12-011B;FRF-SD-12-012B);国家自然科学基金资助项目(70771008;71301146)

摘　　要：针对具有提前/拖期特点的多节点多加工路线订单接受问题,提出采用改进NEH启发式算法、局部搜索和智能调谐和声搜索算法的混合智能调谐和声搜索算法(HITHS)来求解问题.该算法首先在初始解空间中采用改进NEH启发式算法产生部分初始解,然后利用智能调谐和声搜索算法更新初始解,在更新过程中再利用局部搜索的互换、交换和逆序操作使其避免陷入局部最优解,从而形成问题的近似最优解.最后采用所提出的混合算法对该问题进行算例分析,并和基本和声搜索算法进行比较,表明了混合算法的有效性和可行性.Aiming at the order acceptance problem of nmlti-node and multi-process routes with the characteristics of earliness/tardiness, a mixed intelligent tuned harmony search algorithm （HITHS） with improved NEH heuristic algorithm, local search and intelligent tuned harmony search was proposed for resolving the problem. In this algorithm, some initial solutions in the initial solution space were generated by improved NEH heuristic algorithm. Then these initial solutions were updated with intelligent tuned harmony search. In the updating process, a series of operations such as interchange, exchange and reverse of local search were used to avoid falling into a local optimal solution, and thus the problem＇s approximate optimum solution was got. At last, a case of the problem was tested by the mixed algorithm. The effectiveness and efficiencies of the mixed algorithm was proved by the case＇s analysis and compared with harmony search.

关 键 词：生产控制 订单接受 和声搜索 局部搜索 启发式算法 

分 类 号：TP278[自动化与计算机技术—检测技术与自动化装置]