2014
DOI: 10.1016/j.ijleo.2013.08.032
|View full text |Cite
|
Sign up to set email alerts
|

A hybrid membrane evolutionary algorithm for solving constrained optimization problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
13
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 32 publications
(13 citation statements)
references
References 17 publications
0
13
0
Order By: Relevance
“…A recent approach (Long 2014) combined different constraint handling strategy and EAs to select the best combination. Another recent method proposed a hybrid EAs to handle the constraints (Xiao et al 2014). One-level membrane structure is combined with PSO.…”
Section: Related Studiesmentioning
confidence: 99%
“…A recent approach (Long 2014) combined different constraint handling strategy and EAs to select the best combination. Another recent method proposed a hybrid EAs to handle the constraints (Xiao et al 2014). One-level membrane structure is combined with PSO.…”
Section: Related Studiesmentioning
confidence: 99%
“…Over the past years, a variety of membrane systems integrated with PSO have been proposed and proved powerful and efficient in solving optimization problems. Xiao et al [37] proposed a hybrid membrane evolutionary algorithm, which combines a one-level membrane structure with a PSO local search algorithm. Xiao et al [38] developed an improved dynamic membrane evolutionary algorithm based on PSO and DE to solve constrained engineering design problems.…”
Section: Introductionmentioning
confidence: 99%
“…Until now, many kinds of P system have been proposed to solve NP-complete problems, such as SAT [9][10][11][12][13], HPP [14][15], Subset [16], Knapsack Problem [17], optimization problem [18][19][20]. There are two main ways for P systems solving NP-complete problem: the semi-uniform way, which associates with each instance of the problem one P system solving it, and the uniform way, which associates with each possible size of the instances of the problem one P system that can solve all instances of that size [21].…”
Section: Introductionmentioning
confidence: 99%