.png){kind=icon}
返回
Algebraic Differential Evolution Algorithm for the Permutation Flowshop Scheduling Problem With Total Flowtime Criterion
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2015.2507785.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces an original algebraic approach to differential evolution (DE) algorithms for combinatorial search spaces. An abstract algebraic differential mutation for generic combinatorial spaces is defined by exploiting the concept of a finitely generated group. This operator is specialized for the permutations space by means of an original randomized bubble sort algorithm. Then, a discrete DE algorithm is derived for permutation problems and it is applied to the permutation flow-shop scheduling problem with the total flowtime criterion. Other relevant components of the proposed algorithm are: a crossover operator for permutations, a novel biased selection strategy, a heuristic-based initialization, and a memetic restart procedure. Extensive experimental tests have been performed on a widely accepted benchmark suite in order to analyze the dynamics of the proposed approach and to compare it with the state-of-theart algorithms. The experimental results clearly show that the proposed algorithm reaches state-of-the-art performances and, most remarkably, it is able to find some new best known results. Furthermore, the experimental analysis on the impact of the algorithmic components shows that the two main contributions of this paper, i.e., the discrete differential mutation and the biased selection operator, greatly contribute to the overall performance of the algorithm.
Keyword:
Algebraic differential mutation
differential evolution (DE)
permutation flowshop scheduling
permutations space
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
引用论文
.png){kind=icon}
An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
PREAI
分享收藏A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms关于使用非参数统计检验作为比较进化和群体智能算法的方法的实用教程
PREAI
分享收藏
Efficient composite heuristics for total flowtime minimization in permutation flow shops有效的复合启发式方法，用于在置换流水车间中最小化总流动时间
PREAI
分享收藏分享收藏
查看更多内容