【摘要】：針對(duì)批量流水線調(diào)度問題,提出了以總流經(jīng)時(shí)間為目標(biāo)的改進(jìn)離散和聲算法。與基本的和聲算法相比,該算法首先采用了基于工件序列的編碼方式,使其直接應(yīng)用于調(diào)度問題,同時(shí)運(yùn)用NEH和SWAP方法產(chǎn)生初始和聲庫(kù),保證了初始種群具有較高的質(zhì)量和多樣性。使用自適應(yīng)和聲微調(diào)概率參數(shù)和INSERT方法產(chǎn)生新解,提高了算法的優(yōu)化性能。為了提高算法的局部搜索能力,結(jié)合交換擾動(dòng)策略和插入鄰域搜索算法給出了兩種混合求解策略。仿真實(shí)驗(yàn)表明所提算法的有效性。
[Abstract]:For batch pipeline scheduling problem, an improved discrete harmonic algorithm aiming at total passage time is proposed. Compared with the basic harmonic algorithm, the algorithm firstly adopts the coding method based on the sequence of jobs, and makes it directly applied to the scheduling problem. At the same time, the NEH and SWAP methods are used to generate the initial harmony sound library. The initial population has high quality and diversity. The adaptive harmonic fine tuning probability parameter and INSERT method are used to generate new solutions, and the optimization performance of the algorithm is improved. In order to improve the local search ability of the algorithm, two hybrid solutions are proposed by combining the exchange perturbation strategy and the insert neighborhood search algorithm. Simulation results show that the proposed algorithm is effective.
【作者單位】： 聊城大學(xué)數(shù)學(xué)科學(xué)學(xué)院;東北大學(xué)流程工業(yè)綜合自動(dòng)化國(guó)家重點(diǎn)實(shí)驗(yàn)室;
【基金】：國(guó)家自然科學(xué)基金(No.60874075) 新世紀(jì)優(yōu)秀人才支持計(jì)劃(No.NCET-13-0106) 高等學(xué)校博士學(xué)科點(diǎn)專項(xiàng)科研基金(No.20130042110035) 遼寧省教育廳重點(diǎn)實(shí)驗(yàn)室基礎(chǔ)研究項(xiàng)目(No.LZ2014014)
【分類號(hào)】：TB497
，

本文編號(hào)：2264939