Data Structures in Multi-Objective Evolutionary Algorithms
- 9 November 2012
- journal article
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 27 (6) , 1197-1210
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A fast multi-objective evolutionary algorithm based on a tree structureApplied Soft Computing, 2010
- A dominance tree and its application in evolutionary multi-objective optimizationInformation Sciences, 2009
- An Improved Multiobjective Evolutionary Algorithm Based on Dominating Tree2006
- Quad-trees: A Data Structure for Storing Pareto Sets in Multiobjective Evolutionary Algorithms with Elitism2005
- Using unconstrained elite archives for multiobjective optimizationIEEE Transactions on Evolutionary Computation, 2003
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- On The Effects of Archiving, Elitism, and Density Based Selection in Evolutionary Multi-objective Optimization2001
- Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approachIEEE Transactions on Evolutionary Computation, 1999
- Multicriteria optimization using a genetic algorithm for determining a Pareto setInternational Journal of Systems Science, 1996
- Quad trees a data structure for retrieval on composite keysActa Informatica, 1974