Solving Four-Objective Flow Shop Problem with Fast Hypervolume-based Local Search Algorithm

摘要：

　　In this paper,we present a fast hypervolume-based multi-objective local search algorithm using the approximating computation of hypervolume contribution.In this algorithm,we define an approximate hypervolume contribution indicator as the selection mechanism.We carry out the experiments on four-objective flow shop problem.Experimental results indicate that our algorithm is highly effective in comparison with the algorithms based on the binary indicators and the exact hypervolume contribution indicator.

关键词： Multi-Objective Optimization Approximate Hypervolume Contribution Local Search Flow Shop Problem

作者: Rong-Qiang ZENG Li-Li YANG Luo-Ping CHEN Hao PENG

作者单位: School of Mathematics,Southwest Jiaotong University,Chengdu,Sichuan 610031,P.R.China;School of Compu School of Mathematics,Southwest Jiaotong University,Chengdu,Sichuan 610031,P.R.China

会议类型: 国内会议

会议名称: 2014年国际计算机科学与软件工程学术会议

会议地点: 杭州

会议语种:英文

页码: 1-7

在线出版日期: 2014-10-18（万方平台首次上网日期，不代表论文的发表时间）