Difference between revisions of "Optimization problem"
From BioUML platform
| Line 14: | Line 14: | ||
The problem could be solved by different optimization methods. We implemented the following of them in the BioUML software: | The problem could be solved by different optimization methods. We implemented the following of them in the BioUML software: | ||
| − | <li>stochastic ranking evolution strategy (SRES) [1];< | + | <li>stochastic ranking evolution strategy (SRES) [1]; |
| − | cellular genetic algorithm MOCell [2]; | + | <li>cellular genetic algorithm MOCell [2]; |
particle swarm optimization (PSO) [Sierra and Coello, 2005]; | particle swarm optimization (PSO) [Sierra and Coello, 2005]; | ||
deterministic method of global optimization glbSolve [Björkman and Holmström, 1999]; | deterministic method of global optimization glbSolve [Björkman and Holmström, 1999]; | ||
Revision as of 16:27, 12 March 2019
The general nonlinear optimization problem [1] can be formulated as follows: find a minimum of the objective function ϕ(x), where x lies in the intersection of the N-dimensional search space
and the admissible region ℱ ⊆ ℝN defined by a set of equality and/or inequality constraints on x. Since the equality gs(x) = 0 can be replaced by two inequalities gs(x) ≤ 0 and –gs(x) ≤ 0, the admissible region can be defined without loss of generality as
In order to get solution situated inside ℱ, we minimize the penalty function
The problem could be solved by different optimization methods. We implemented the following of them in the BioUML software:
References
- Runarsson T.P., Yao X. Stochastic ranking for constrained evolutionary optimization. IEEE Transactions on Evolutionary Computation. 2000. 4(3):284–294
