An Interactive Evolutionary Multiobjective Optimization Method: Interactive WASF-GA
Ruiz, A. B., Luque, M., Miettinen, K., & Saborido, R. (2015). An Interactive Evolutionary Multiobjective Optimization Method: Interactive WASF-GA. In A. Gaspar-Cunha, C. H. Antunes, & C. C. Coello (Eds.), Evolutionary Multi-Criterion Optimization : 8th International Conference, EMO 2015, Guimarães, Portugal, March 29 --April 1, 2015. Proceedings, Part II (pp. 249-263). Springer. Lecture Notes in Computer Science, 9019. https://doi.org/10.1007/978-3-319-15892-1_17
Julkaistu sarjassa
Lecture Notes in Computer SciencePäivämäärä
2015Tekijänoikeudet
© Springer International 2015. This is a final draft version of an article whose final and definitive form has been published by Springer International. Published in this repository with the kind permission of the publisher.
In this paper, we describe an interactive evolutionary algorithm
called Interactive WASF-GA to solve multiobjective optimization
problems. This algorithm is based on a preference-based evolutionary
multiobjective optimization algorithm called WASF-GA. In Interactive
WASF-GA, a decision maker (DM) provides preference information at
each iteration simple as a reference point consisting of desirable objective
function values and the number of solutions to be compared. Using
this information, the desired number of solutions are generated to represent
the region of interest of the Pareto optimal front associated to the
reference point given. Interactive WASF-GA implies a much lower computational
cost than the original WASF-GA because it generates a small
number of solutions. This speeds up the convergence of the algorithm,
making it suitable for many decision-making problems. Its e ciency and
usefulness is demonstrated with a ve-objective optimization problem.
Julkaisija
SpringerEmojulkaisun ISBN
978-3-319-15891-4Konferenssi
International Conference on Evolutionary Multi-Criterion OptimizationKuuluu julkaisuun
Evolutionary Multi-Criterion Optimization : 8th International Conference, EMO 2015, Guimarães, Portugal, March 29 --April 1, 2015. Proceedings, Part IIISSN Hae Julkaisufoorumista
0302-9743Asiasanat
Julkaisu tutkimustietojärjestelmässä
https://converis.jyu.fi/converis/portal/detail/Publication/24644711
Metadata
Näytä kaikki kuvailutiedotKokoelmat
Samankaltainen aineisto
Näytetään aineistoja, joilla on samankaltainen nimeke tai asiasanat.
-
Probabilistic Selection Approaches in Decomposition-based Evolutionary Algorithms for Offline Data-Driven Multiobjective Optimization
Mazumdar, Atanu; Chugh, Tinkle; Hakanen, Jussi; Miettinen, Kaisa (IEEE, 2022)In offline data-driven multiobjective optimization, no new data is available during the optimization process. Approximation models, also known as surrogates, are built using the provided offline data. A multiobjective ... -
A Performance Indicator for Interactive Evolutionary Multiobjective Optimization Methods
Aghaei Pour, Pouya; Bandaru, Sunith; Afsar, Bekir; Emmerich, Michael; Miettinen, Kaisa (IEEE, 2024)In recent years, interactive evolutionary multiobjective optimization methods have been getting more and more attention. In these methods, a decision maker, who is a domain expert, is iteratively involved in the solution ... -
Approximation method for computationally expensive nonconvex multiobjective optimization problems
Haanpää, Tomi (University of Jyväskylä, 2012) -
On solving computationally expensive multiobjective optimization problems with interactive methods
Ojalehto, Vesa (University of Jyväskylä, 2014) -
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. ...
Ellei toisin mainittu, julkisesti saatavilla olevia JYX-metatietoja (poislukien tiivistelmät) saa vapaasti uudelleenkäyttää CC0-lisenssillä.