检索结果-南通市图书馆

Neighborhood Combination search for Single-Machine Scheduling with Sequence-Dependent Setup Time

Journal of Computer Science & Technology 2024年第3期39卷 737-752页

作者：刘晓路徐宏云陈嘉铭苏宙行吕志鹏丁俊文 College of System Engineering National University of Defense TechnologyChangsha 410015China School of Artificial Intelligence Jianghan UniversityWuhan 430056China Xi’an Satellite Control Center Xi’an 710043China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China CCF

In a local search algorithm,one of its most important features is the definition of its neighborhood which is crucial to the algorithm's *** this paper,we present an analysis of neighborhood combination search for solv-ing the single-machine scheduling problem with sequence-dependent setup time with the objective of minimizing total weighted tardiness(SMSWT).First,We propose a new neighborhood structure named Block Swap(B1)which can be con-sidered as an extension of the previously widely used Block Move(B2)neighborhood,and a fast incremental evaluation technique to enhance its evaluation ***,based on the Block Swap and Block Move neighborhoods,we present two kinds of neighborhood structures:neighborhood union(denoted by B1UB2)and token-ring search(denoted by B1→B2),both of which are combinations of B1 and ***,we incorporate the neighborhood union and token-ring search into two representative metaheuristic algorithms:the Iterated Local search Algorithm(ILSnew)and the Hybrid Evolutionary Algorithm(HEA_(new))to investigate the performance of the neighborhood union and token-ring ***-sive experiments show the competitiveness of the token-ring search combination mechanism of the two *** on the 120 public benchmark instances,our HEA_(new)has a highly competitive performance in solution quality and computational time compared with both the exact algorithms and recent *** have also tested the HEA,new algorithm with the selected neighborhood combination search to deal with the 64 public benchmark instances of the single-machine scheduling problem with sequence-dependent setup *** is able to match the optimal or the best known results for all the 64 *** particular,the computational time for reaching the best well-known results for five chal-lenging instances is reduced by at least 61.25%.

关键词： single-machine scheduling sequence-dependent setup time neighborhood combination search token-ring search hybrid evolutionary algorithm

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：