A hybrid evolutionary algorithm for solving two-stage stochastic integer programs in chemical batch scheduling

doi:10.1016/j.compchemeng.2006.09.003

Return

A hybrid evolutionary algorithm for solving two-stage stochastic integer programs in chemical batch scheduling

2007-05-01

PRE

DOI：10.1016/j.compchemeng.2006.09.003

Original

Original request for help

Save

Abstract

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.

Keywords:

stochastic integer programming

evolutionary algorithms

hybrid algorithms

chemical batch scheduling

uncertainty

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.