.png){kind=icon}
返回
An improved shuffled complex evolution algorithm with sequence mapping mechanism for job shop scheduling problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2015.01.007.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The job shop problem is an important part of scheduling in the manufacturing industry. A new intelligent algorithm named Shuffled Complex Evolution (SCE) algorithm is proposed in this paper with the aim of getting the minimized makespan. The sequence mapping mechanism is used to change the variables in the continuous domain to discrete variables in the combinational optimization problem; the sequence, which is based on job permutation, is adopted for encoding mechanism and sequence insertion mechanism for decoding. While considering that the basic SCE algorithm has the drawbacks of poor solution and lower rate of convergence, a new strategy is used to change the individual's evolution in the basic SCE algorithm. The strategy makes the new individual closer to best individual in the current population. The improved SCE algorithm (ISCE) was used to solve the typical job shop problems and the results show that the improved algorithm is effective to the job shop scheduling. (C) 2015 Elsevier Ltd. All rights reserved.
Keyword:
Job shop scheduling
Shuffled complex evolution
Job permutation
Sequence mapping mechanism
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
2.9W
被引数:
10.2W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏Multi-objective scheduling of dynamic job shop using variable neighborhood search基于变邻域搜索的动态作业车间多目标调度
PREAI
分享收藏
查看更多内容