.png){kind=icon}
返回
A hybrid electromagnetism-like algorithm for single machine scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2007.11.050.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Electromagnetism-like algorithm (EM) is a population-based meta-heuristic which has been proposed to solve continuous problems effectively. In this paper, we present a new meta-heuristic that applies the EM methodology to the single machine scheduling problem. To the best of our knowledge, there are only few researches in solving the combinatorial optimization problem (COP) by EM. This research attempts to employ the random-key concept combining with genetic operators in the hybrid algorithm to obtain the best/optimal schedule for the single machine problems. This new approach attempts to achieve the convergence and diversity effects when it is iteratively applied to solve the problem. This hybrid algorithm is tested oil a set of standard test problems available in the literature. The computational results show that this hybrid algorithm performs better than the standard genetic algorithm. (c) 2007 Elsevier Ltd. All rights reserved.
Keyword:
Single machine scheduling
Electromagnetism-like algorithm
Total deviations
Dominance property
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
The kinetics and mechanism of solvent extraction of Pr(iii) from chloride medium in the presence of two complexing agents with di-(2-ethylhexyl) phosphoric acid.png)
RSC Advances
RSC AdvancesIF0
PREAI
分享收藏
A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem单机提前和迟到调度问题的分支定界算法
PREAI
分享收藏
查看更多内容