湖北文理学院学报
湖北文理學院學報
호북문이학원학보
Journal of Hubei University of Arts and Science
2014年
5期
9-14
,共6页
MOEA/D-EGO算法%并行计算%候选解%种群优化
MOEA/D-EGO算法%併行計算%候選解%種群優化
MOEA/D-EGO산법%병행계산%후선해%충군우화
MOEA/D-EGO algorithm%Parallel computing%Candidate solution%Population optimization
在MOEA/D-EGO算法中,当建模样本点集合元素太多和种群规模较大时,会导致算法运行时间过长。为了减少 MOEA/D-EGO 算法的运行时间,文章对 MOEA/D-EGO 算法的建模过程和种群优化过程同时并行化。在综合考虑实验条件限制的情况下,使用了基于主从式的并行模型,模型在充分考虑计算机资源的使用效率与负载均衡等因素下,增加了主进程的任务,主进程不仅需要为子进程分配计算任务、分发数据、进行算法配置、收集子进程返回的计算结果,还需要参与子进程的任务,完成与子进程相当量的计算任务。实验结果表明文章的并行MOEA/D-EGO算法能有效求解多目标优化问题,且能够大幅缩短算法运行时间。
在MOEA/D-EGO算法中,噹建模樣本點集閤元素太多和種群規模較大時,會導緻算法運行時間過長。為瞭減少 MOEA/D-EGO 算法的運行時間,文章對 MOEA/D-EGO 算法的建模過程和種群優化過程同時併行化。在綜閤攷慮實驗條件限製的情況下,使用瞭基于主從式的併行模型,模型在充分攷慮計算機資源的使用效率與負載均衡等因素下,增加瞭主進程的任務,主進程不僅需要為子進程分配計算任務、分髮數據、進行算法配置、收集子進程返迴的計算結果,還需要參與子進程的任務,完成與子進程相噹量的計算任務。實驗結果錶明文章的併行MOEA/D-EGO算法能有效求解多目標優化問題,且能夠大幅縮短算法運行時間。
재MOEA/D-EGO산법중,당건모양본점집합원소태다화충군규모교대시,회도치산법운행시간과장。위료감소 MOEA/D-EGO 산법적운행시간,문장대 MOEA/D-EGO 산법적건모과정화충군우화과정동시병행화。재종합고필실험조건한제적정황하,사용료기우주종식적병행모형,모형재충분고필계산궤자원적사용효솔여부재균형등인소하,증가료주진정적임무,주진정불부수요위자진정분배계산임무、분발수거、진행산법배치、수집자진정반회적계산결과,환수요삼여자진정적임무,완성여자진정상당량적계산임무。실험결과표명문장적병행MOEA/D-EGO산법능유효구해다목표우화문제,차능구대폭축단산법운행시간。
In MOEA/D-EGO algorithm, when there are too many modeling sample set elements or the population scale is large , it will lead to a long computation time. In order to reduce the run time of the MOEA/D-EGO algorithm, this paper parallelizes both the modeling process and the population optimization process. considering the experimental conditions, this paper uses the master-slave parallel model which adds the task to the main process in the condition of fully considering the efficiency of computer resources and load balance. The main process not only assigns computation task, distributes data, configures algorithm, collects the computation results, but also participates in the task of child process and complete the same amount of computation task as child process. The experimental result shows that the paralleled MOEA/D-EGO algorithm can effectively solve the multi-objective optimization problem, and can significantly shorten the running time of the algorithm.