.png){kind=icon}
返回
A hybrid evolutionary algorithm for solving two-stage stochastic integer programs in chemical batch scheduling
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compchemeng.2006.09.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This contribution deals with the solution of two-stage stochastic integer programs with discrete scenarios (2-SIPs) that arise in chemical batch scheduling under uncertainty. Since the number of integer variables in the second-stage increases linearly with the number of scenarios considered, the real world applications usually give rise to large scale deterministic equivalent mixed-integer linear programs (MILPs) which cannot be solved easily without incorporating decomposition methods or problem specific knowledge. In this paper a new hybrid algorithm is proposed to solve 2-SIPs based on stage decomposition: an evolutionary algorithm performs the search on the first-stage variables while the second-stage subproblems are solved by mixed-integer programming. The algorithm is tested for a real-world scheduling problem with uncertainties in the demands and in the production capacity. Numerical experiments have shown, that the new algorithm is robust and superior to state-of-the-art solvers if good solutions are needed in short CPU-times. (c) 2006 Elsevier Ltd. All rights reserved.
Keyword:
stochastic integer programming
evolutionary algorithms
hybrid algorithms
chemical batch scheduling
uncertainty
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.9
论文数:
8.1K
被引数:
1.7W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
分享收藏
Modeling and solving real-time scheduling problems by stochastic integer programming基于随机整数规划的实时调度问题建模与求解
PREAI
分享收藏
查看更多内容