2015
DOI: 10.1016/j.compchemeng.2014.08.006
|View full text |Cite
|
Sign up to set email alerts
|

Design of memetic algorithms for the efficient optimization of chemical process synthesis problems with structural restrictions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
18
0
1

Year Published

2015
2015
2021
2021

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 29 publications
(19 citation statements)
references
References 45 publications
0
18
0
1
Order By: Relevance
“…To overcome these problems, different approaches have been proposed in the literature. Besides the hybrid method presented in the previous section, some mathematical approaches reduce the complexity of the optimization model by reducing the number of design variables or alternatives, proposing new modeling, applying iterative procedures, or including decomposition techniques as detailed by Urselmann and Engell (2015). However, these approaches exhibit some drawbacks: exclusion of the globally optimal solution for the approach based on the reduction of the complexity and convergence to local optima (for large-scale problems) of the MINLP, which depends on initialization.…”
Section: Optimization At Process Levelmentioning
confidence: 99%
See 3 more Smart Citations
“…To overcome these problems, different approaches have been proposed in the literature. Besides the hybrid method presented in the previous section, some mathematical approaches reduce the complexity of the optimization model by reducing the number of design variables or alternatives, proposing new modeling, applying iterative procedures, or including decomposition techniques as detailed by Urselmann and Engell (2015). However, these approaches exhibit some drawbacks: exclusion of the globally optimal solution for the approach based on the reduction of the complexity and convergence to local optima (for large-scale problems) of the MINLP, which depends on initialization.…”
Section: Optimization At Process Levelmentioning
confidence: 99%
“…To overcome some previous weaknesses and intensify and shorten the process synthesis task, Urselmann and Engell (2015) introduced a Memetic Algorithm (MA). MAs are population-based evolutionary algorithms, which are combined with local optimization strategies.…”
Section: Optimization At Process Levelmentioning
confidence: 99%
See 2 more Smart Citations
“…For addressing the global optimization with many discrete decision variables, hybrid algorithms combining metaheuristic algorithms and mathematical programming (memetic algorithm) become popular. For example, Urselmann et al [229] proposed a two-level memetic algorithm, where the upper level the integrity constraints and discontinuous cost functions are handled by genetic algorithm, while in the lower level continuous sub-problems are efficiently solved by robust solvers of mathematical programming for state variables [230].…”
Section: Superstructure-based Modeling and Solvingmentioning
confidence: 99%