检索结果-内蒙古大学图书馆

A new history-guided multi-objective evolutionary algorithm based on decomposition for batching scheduling

EXPERT SYSTEMS WITH APPLICATIONS 2020年 141卷 112920-000页

作者： Jia, Zhao-hong Gao, Le-yang Zhang, Xing-yi Minist Educ Key Lab Intelligent Comp & Signal Proc Beijing Peoples R China Anhui Univ Hefei Sch Comp Sci & Technol Hefei 230039 Anhui Peoples R China

In this paper, a multi-objective scheduling problem on parallel batching machines is investigated with three objectives, the minimization of the makespan, the total weighted earliness/tardiness penalty and the total energy consumption, simultaneously. It is known that the batch scheduling problem is a type of NP-hard problems and the solutions to this problem have quite valuable structural features that are difficult to be formulated. One of the main issues is to make full use of the structural features of the existing solutions. Aiming at this issue, two effective strategies, local competition and internal replacement, are designed. Firstly, the local competition searches for the competitive neighboring solutions to accelerate convergence, through adjusting job positions based on two structural indicators. Secondly, the internal replacement uniformly retains half of the population as elites by elitist preservation based on decomposition. Thereafter, the other half of the population is replaced by the new solutions generated under the guidance of historical information. Moreover, the historical information is updated with the structural features extracted from the elites. As a result, a history-guided evolutionary algorithm based on decomposition with the above two strategies is proposed. To verify the performance of the proposed algorithm, extensive experiments are conducted on 18 groups of instances, in comparison with four state-of-the-art multi-objective optimization algorithms. Experimental results demonstrate that the proposed algorithm shows considerable competitiveness in addressing the studied multi-objective scheduling problems. (C) 2019 Elsevier Ltd. All rights reserved.

关键词： Multi-objective evolutionary algorithm constrained scheduling problem Local competition Historical information Elitist preservation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：