A New Hybrid Mutation Operator for Multiobjective Optimization with Differential Evolution
Sindhya, K., Ruuska, S., Haanpää, T., & Miettinen, K. (2011). A New Hybrid Mutation Operator for Multiobjective Optimization with Differential Evolution. Soft Computing, 15(10), 2041-2055. https://doi.org/10.1007/s00500-011-0704-5
Julkaistu sarjassa
Soft ComputingPäivämäärä
2011Tekijänoikeudet
© Springer. This is an electronic final draft version of an article whose final and definitive form has been published in the Soft Computing published by Springer.
Differential evolution has become one of the most widely used evolution-
ary algorithms in multiobjective optimization. Its linear mutation operator is a sim-
ple and powerful mechanism to generate trial vectors. However, the performance
of the mutation operator can be improved by including a nonlinear part. In this pa-
per, we propose a new hybrid mutation operator consisting of a polynomial based
operator with nonlinear curve tracking capabilities and the differential evolution’s original mutation operator, to be efficiently able to handle various interdependencies
between decision variables. The resulting hybrid operator is straightforward
to implement and can be used within most evolutionary algorithms. Particularly,
it can be used as a replacement in all algorithms utilizing the original mutation
operator of differential evolution. We demonstrate how the new hybrid operator
can be used by incorporating it into MOEA/D, a winning evolutionary multiobjective
algorithm in a recent competition. The usefulness of the hybrid operator
is demonstrated with extensive numerical experiments showing improvements in
performance compared to the previous state of the art.
...
Julkaisija
SpringerISSN Hae Julkaisufoorumista
1432-7643Asiasanat
Alkuperäislähde
http://www.springerlink.com/content/dh056511337w452r/Julkaisu tutkimustietojärjestelmässä
https://converis.jyu.fi/converis/portal/detail/Publication/20765463
Metadata
Näytä kaikki kuvailutiedotKokoelmat
Samankaltainen aineisto
Näytetään aineistoja, joilla on samankaltainen nimeke tai asiasanat.
-
PAINT: Pareto front interpolation for nonlinear multiobjective optimization
Hartikainen, Markus; Miettinen, Kaisa; Wiecek, Margaret M. (Springer, 2012)A method called PAINT is introduced for computationally expensive multiobjective optimization problems. The method interpolates between a given set of Pareto optimal outcomes. The interpolation provided by the PAINT method ... -
A survey on handling computationally expensive multiobjective optimization problems with evolutionary algorithms
Chugh, Tinkle; Sindhya, Karthik; Hakanen, Jussi; Miettinen, Kaisa (Springer, 2019)Evolutionary algorithms are widely used for solving multiobjective optimization problems but are often criticized because of a large number of function evaluations needed. Approximations, especially function approximations, ... -
Multiobjective shape design in a ventilation system with a preference-driven surrogate-assisted evolutionary algorithm
Chugh, Tinkle; Kratky, Tomas; Miettinen, Kaisa; Jin, Yaochu; Makkonen, Pekka (ACM, 2019)We formulate and solve a real-world shape design optimization problem of an air intake ventilation system in a tractor cabin by using a preference-based surrogate-assisted evolutionary multiobjective optimization algorithm. ... -
Why Use Interactive Multi-Objective Optimization in Chemical Process Design?
Miettinen, Kaisa; Hakanen, Jussi (World Scientific, 2017)Problems in chemical engineering, like most real-world optimization problems, typically, have several conflicting performance criteria or objectives and they often are computationally demanding, which sets special requirements ... -
Why Use Interactive Multi-Objective Optimization in Chemical Process Design?
Miettinen, Kaisa; Hakanen, Jussi (World Scientific, 2009)Problems in chemical engineering, like most real-world optimization problems, typically, have several conflicting performance criteria or objectives and they often are computationally demanding, which sets special requirements ...
Ellei toisin mainittu, julkisesti saatavilla olevia JYX-metatietoja (poislukien tiivistelmät) saa vapaasti uudelleenkäyttää CC0-lisenssillä.