Modified differential evolution based on global competitive ranking for engineering design optimization problems
Engineering design optimization problems are formulated as large-scale mathematical programming problems with nonlinear objective function and constraints. Global optimization finds a solution while satisfying the constraints. Differential evolution is a population-based heuristic approach that is s...
Saved in:
Published in | Computational Science and Its Applications - ICCSA 2011 Vol. 6784; no. PART 3; pp. 245 - 260 |
---|---|
Main Authors | , |
Format | Conference Proceeding Book Chapter |
Language | English |
Published |
Berlin, Heidelberg
Springer Verlag
01.06.2011
Springer Berlin Heidelberg |
Series | Lecture Notes in Computer Science |
Subjects | |
Online Access | Get full text |
ISBN | 3642219306 9783642219306 |
ISSN | 0302-9743 1611-3349 |
DOI | 10.1007/978-3-642-21931-3_20 |
Cover
Summary: | Engineering design optimization problems are formulated as large-scale mathematical programming problems with nonlinear objective function and constraints. Global optimization finds a solution while satisfying the constraints. Differential evolution is a population-based heuristic approach that is shown to be very efficient to solve global optimization problems with simple bounds. In this paper, we propose a modified differential evolution introducing self-adaptive control parameters, modified mutation, inversion operation and modified selection for obtaining global optimization. To handle constraints effectively, in modified selection we incorporate global competitive ranking which strikes the right balance between the objective function and the constraint violation. Sixteen well-known engineering design optimization problems are considered and the results compared with other solution methods. It is shown that our method is competitive when solving these problems.
Fundação para a Ciência e a Tecnologia (FCT) |
---|---|
ISBN: | 3642219306 9783642219306 |
ISSN: | 0302-9743 1611-3349 |
DOI: | 10.1007/978-3-642-21931-3_20 |