A hybrid Pareto-based algorithm for multi-objective resource allocation problem
This paper introduces a hybrid algorithm combining discrete harmony search(DHS)and iterated local search(ILS)for solving the multi-objective resource allocation problem(RAP).Two objectives are considered simultaneously,i.e.minimization of the overall cost and overall efficiency.The harmony search algorithm is used to conduct the global exploration task,while the iterated local search performs the exploitation work.In addition,an external Pareto archive set was introduced to memory the non-dominated solutions found so far.Experimental results on the well-known benchmarks verify the efficiency and effectiveness of the propose algorithm.
Harmony search resource allocation problem Pareto archive set multi-objective optimization
Jun-qing Li Quan-ke Pan Kun Mao
State Key Laboratory of Synthetic Automation for Process Industries,Northeastern University,ShenYang State Key Laboratory of Synthetic Automation for Process Industries,Northeastern University,ShenYang
国际会议
长沙
英文
581-585
2014-05-31（万方平台首次上网日期，不代表论文的发表时间）