A comparison of multiobjective evolutionary algorithms.
Groşan, Crina, Dumitrescu, Dumitru D. (2002)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Groşan, Crina, Dumitrescu, Dumitru D. (2002)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Rotar, Corina, Dumitrescu, Dan, Lung, Rodica (2006)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Rotar, Corina (2003)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
F. Bicking, C. Fonteix, J.-P. Corriou, I. Marc (1994)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Angelova, Maria, Tzonkov, Stoyan, Pencheva, Tania (2010)
Serdica Journal of Computing
Similarity:
Fermentation processes as objects of modelling and high-quality control are characterized with interdependence and time-varying of process variables that lead to non-linear models with a very complex structure. This is why the conventional optimization methods cannot lead to a satisfied solution. As an alternative, genetic algorithms, like the stochastic global optimization method, can be applied to overcome these limitations. The application of genetic algorithms is a precondition for...
Mesloub, Said, Mansour, Abdelouahab (2009)
International Journal of Open Problems in Computer Science and Mathematics. IJOPCM
Similarity:
Groşan, Crina, Oltean, Mihai, Dumitrescu, D. (2003)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Groşan, Crina, Oltean, Mihai, Oltean, Mihaela (2003)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Jozef Kratica, Dušan Tošić, Vladimir Filipović, Đorđe Dugošija (2011)
The Yugoslav Journal of Operations Research
Similarity:
Thibaut Lust, Jacques Teghem (2008)
RAIRO - Operations Research
Similarity:
We present in this paper a new multiobjective memetic algorithm scheme called MEMOX. In current multiobjective memetic algorithms, the parents used for recombination are randomly selected. We improve this approach by using a dynamic hypergrid which allows to select a parent located in a region of minimal density. The second parent selected is a solution close, in the objective space, to the first parent. A local search is then applied to the offspring. We experiment this scheme with...