2011
DOI: 10.1109/tevc.2011.2150753
|View full text |Cite
|
Sign up to set email alerts
|

A Memetic Algorithm for Global Optimization in Chemical Process Synthesis Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
25
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
7
2
1

Relationship

1
9

Authors

Journals

citations
Cited by 37 publications
(25 citation statements)
references
References 47 publications
0
25
0
Order By: Relevance
“…Moreover, stochastic optimisation methods are easy to implement and do not require the calculation of derivatives of the objective function, making the optimisation procedure very robust, which is especially advantageous for the optimisation of largescale, nonlinear, nonconvex problems. The two most important examples of stochastic algorithms that were used to optimise RD processes are the simulated annealing method (Cardoso et al, 2000;Gomez et al, 2006;Kiss et al, 2012) and evolutionary algorithms (Babu and Khan, 2007;Rahman et al, 2008;Urselmann et al, 2011). An evolutionary algorithm was applied in the present work to optimise the RD column described in Section 2.2 towards EMC or DEC selectivity while still having high reactant conversions.…”
Section: Optimisationmentioning
confidence: 99%
“…Moreover, stochastic optimisation methods are easy to implement and do not require the calculation of derivatives of the objective function, making the optimisation procedure very robust, which is especially advantageous for the optimisation of largescale, nonlinear, nonconvex problems. The two most important examples of stochastic algorithms that were used to optimise RD processes are the simulated annealing method (Cardoso et al, 2000;Gomez et al, 2006;Kiss et al, 2012) and evolutionary algorithms (Babu and Khan, 2007;Rahman et al, 2008;Urselmann et al, 2011). An evolutionary algorithm was applied in the present work to optimise the RD column described in Section 2.2 towards EMC or DEC selectivity while still having high reactant conversions.…”
Section: Optimisationmentioning
confidence: 99%
“…Moscato (1989) first introduced a memetic algorithm that combines population-based stochastic algorithms with local refinement strategies. Since then, many combined stochastic and deterministic algorithms have been proposed and applied to various optimization problems including chemical process synthesis (Athier et al, 1997;Urselmann et al, 2011a;Skiborowski et al, 2015) and industry-scale distillation and reactive distillation design (Gómez et al, 2006;Urselmann et al, 2011b). Studies have shown that the optimization approach that combines advantages of stochastic and deterministic algorithms can considerably improve the optimization performance in terms of solution quality and computational cost (Lima et al, 2006;Molina et al, 2010).…”
Section: Hybrid Stochastic-deterministic Algorithmmentioning
confidence: 99%
“…It has been shown by Urselmann et al (2011) and Tometzki and Engell (2010) that hybrid evolutionary algorithms (also called memetic algorithms) are well suited for solving large scale planning and design problems. As the problem size in process synthesis can be quite large, and typical flowsheet synthesis problems have a significant combinatorial aspect, a hybrid evolutionary algorithm was chosen.…”
Section: The Optimization Algorithmmentioning
confidence: 99%