基于HITHS算法的多節點多加工路線訂單接受問題研究

王雷; 李鐵克; 王欣; 許紹云; 孫琦

doi:10.13374/j.issn1001-053x.2013.10.016

基于HITHS算法的多節點多加工路線訂單接受問題研究

doi: 10.13374/j.issn1001-053x.2013.10.016

王雷^1,2, ,,
李鐵克^1,2,
王欣³,
許紹云^1,2,
孫琦⁴

1. 北京科技大學東凌經濟管理學院, 北京 100083;
2. 鋼鐵生產制造執行系統技術教育部工程研究中心, 北京 100083;
3. 西北農林科技大學經濟管理學院, 楊凌 712100;
4. 浙江工商大學工商管理學院, 杭州 310018

基金項目:

中央高校基本科研業務費專項(FRF-SD-12-011B,FRF-SD-12-012B)

教育部博士學科點專項科研基金資助項目(20100006110006)

國家自然科學基金資助項目(70771008,71301146)

詳細信息

通訊作者:
王雷,E-mail:leonwang521@126.com

中圖分類號: TP278
計量
- 文章訪問數: 129
- HTML全文瀏覽量: 30
- PDF下載量: 6
- 被引次數: 0
出版歷程
- 收稿日期: 2012-09-21

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

WANG Lei^{1,2
, ,},
LI Tie-ke^1,2,
WANG Xin³,
XU Shao-yun^1,2,
SUN Qi⁴

1. Dongling School of Economics and Management, University of Science and Technology Beijing, Beijing 100083, China;
2. Engineering Research Center of MES Technology for Iron and Steel Production (Ministry of Education), Beijing 100083, China;
3. School of Economics and Management, Northwest A&F University, Yangling 712100, China;
4. School of Business Administration, Zhejiang Gongshang University, Hangzhou 310018, China

摘要

摘要: 針對具有提前/拖期特點的多節點多加工路線訂單接受問題,提出采用改進NEH啟發式算法、局部搜索和智能調諧和聲搜索算法的混合智能調諧和聲搜索算法(HITHS)來求解問題.該算法首先在初始解空間中采用改進NEH啟發式算法產生部分初始解,然后利用智能調諧和聲搜索算法更新初始解,在更新過程中再利用局部搜索的互換、交換和逆序操作使其避免陷入局部最優解,從而形成問題的近似最優解.最后采用所提出的混合算法對該問題進行算例分析,并和基本和聲搜索算法進行比較,表明了混合算法的有效性和可行性.
- 生產控制 /
- 訂單接受 /
- 和聲搜索 /
- 局部搜索 /
- 啟發式算法
Abstract: 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.
- production control /
- order acceptance /
- harmony search /
- local search /
- heuristic algorithms