本文選題：遺傳算法　切入點(diǎn)：分層優(yōu)化策略　出處：《運(yùn)籌與管理》2017年08期

【摘要】：針對(duì)遺傳算法解決異構(gòu)多核系統(tǒng)的任務(wù)調(diào)度問(wèn)題容易產(chǎn)生早熟現(xiàn)象及其局部尋優(yōu)能力較差的缺點(diǎn),將局部搜索算法與遺傳算法相結(jié)合,創(chuàng)新性地提出一種求解異構(gòu)多核系統(tǒng)的任務(wù)調(diào)度問(wèn)題的分層混合局部搜索遺傳算法。該算法提出一種新的分層優(yōu)化策略以產(chǎn)生初始種群,在變異操作中,對(duì)部分個(gè)體設(shè)計(jì)3-opt優(yōu)化變異,對(duì)種群中的優(yōu)秀個(gè)體用改進(jìn)的Lin-Kernighan算法進(jìn)行優(yōu)化。仿真實(shí)驗(yàn)結(jié)果表明,分層混合局部搜索遺傳算法求解異構(gòu)多核系統(tǒng)的任務(wù)調(diào)度問(wèn)題時(shí)可以高效獲得高質(zhì)量的解。
[Abstract]:In order to solve the problem of task scheduling in heterogeneous multi-core systems by genetic algorithm (GA), it is easy to produce premature phenomenon and the ability of local optimization is poor, so the local search algorithm is combined with genetic algorithm (GA).A hierarchical hybrid local search genetic algorithm is proposed to solve the task scheduling problem of heterogeneous multi-core systems.In this algorithm, a new hierarchical optimization strategy is proposed to generate the initial population. In the mutation operation, some individuals are designed to optimize the 3-opt mutation, and the improved Lin-Kernighan algorithm is used to optimize the excellent individuals in the population.Simulation results show that the hierarchical hybrid local search genetic algorithm can efficiently obtain high quality solutions to the task scheduling problem of heterogeneous multi-core systems.
【作者單位】： 安徽新華學(xué)院信息工程學(xué)院;巢湖學(xué)院計(jì)算機(jī)與信息工程學(xué)院;
【基金】：安徽省高校自然科學(xué)重點(diǎn)研究項(xiàng)目,指紋IRLRD特征加密技術(shù)在手機(jī)支付中的研究與應(yīng)用(KJ2015A309) 國(guó)家級(jí)大學(xué)生創(chuàng)新訓(xùn)練計(jì)劃項(xiàng)目(基于二維碼的圖書(shū)管理系統(tǒng)的設(shè)計(jì)與實(shí)現(xiàn)(201512216007);國(guó)家級(jí)大學(xué)生創(chuàng)新訓(xùn)練計(jì)劃項(xiàng)目(指紋IRLRD特征加密的移動(dòng)支付系統(tǒng)(201512216008)
【分類(lèi)號(hào)】：TP18

【相似文獻(xiàn)】

相關(guān)期刊論文 前1條

1 楊蕾;林紅;;基于多核系統(tǒng)的混合神經(jīng)網(wǎng)絡(luò)及應(yīng)用[J];智能計(jì)算機(jī)與應(yīng)用;2011年06期

，

本文編號(hào)：1712559