.png){kind=icon}
返回
Engineered versus standard evolutionary algorithms: A case study in batch scheduling with recourse
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compchemeng.2007.09.006.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
An engineered evolutionary algorithm for a realistic chemical batch scheduling problem with uncertain data is developed systematically. The problem is formulated as a two stage stochastic integer program with discrete scenarios. The model is solved by a stage decomposition-based hybrid algorithm using in evolutionary algorithm combined with mixed-integer programming. Earlier experiments with a standard evolutionary algorithm led to the hypothesis that the constrained search space is not covered well such that in some cases the population converges to a subset of the solution space which does not include the best known solution. An efficient engineered evolutionary algorithm is developed which is shown to cover the feasible set significantly better such that a high quality feasible schedule can be generated comparatively fast. As the hierarchical structure of the case study is typical for many batch scheduling problems, some general principles may be postulated from the experience gained here. (c) 2007 Elsevier Ltd. All rights reserved.
Keyword:
batch scheduling
recourse models
engineered algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.9
论文数:
8.1K
被引数:
1.7W
机构
引用论文
.png){kind=icon}
分享收藏
Modeling and solving real-time scheduling problems by stochastic integer programming基于随机整数规划的实时调度问题建模与求解
PREAI
分享收藏分享收藏
查看更多内容