Abstract
Data structures used for an algorithm can have a great impact on its performance, particularly for the solution of large and complex problems, such as multi-objective optimization problems (MOPs). Multi-objective evolutionary algorithms (MOEAs) are considered an attractive approach for solving MOPs, since they are able to explore several parts of the Pareto front simultaneously. The data structures for storing and updating populations and non-dominated solutions (archives) may affect the efficiency of the search process. This article describes data structures used in MOEAs for realizing populations and archives in a comparative way, emphasizing their computational requirements and general applicability reported in the original work.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Horn J. Multicriterion decision making. In Handbook of Evolutionary Computation, Back T, Fogel D, Michalewicz Z (eds.), Bristol, UK: IOP Publisher, 1997, pp.F1.9:1-F1.9:15.
Parks G T, Miller I. Selective breeding in a multiobjective genetic algorithm. In Lecture Notes in Computer Science 1498, Eiben A E et al. (eds.), Amsterdam, Holland: Springer-Verlag, 1998, pp.250-259.
Bhanu B, Lee S. Genetic Learning for Adaptive Image Segmentation. Boston, USA: Kluwer Academic Publishers, 1994.
Viennet R, Fontiex C, Marc I. Multicriteria optimization using a genetic algorithm for determining a Pareto set. Journal of Systems Science, 1996, 27(2): 255–260.
Laumanns M, Zitzler E, Thiele L. On the effects of archiving, elitism, and density based selection in evolutionary multi-objective optimization. In Proc. the 1st EMO, March 2001, pp.181-196.
Fieldsend J E, Everson R M, Singh S. Using unconstrained elite archives for multiobjective optimization. IEEE Trans. Evolutionary Computation, 2003, 7(3): 305–323.
Everson R M, Fieldsend J E, Singh S. Full elite sets for multi-objective optimisation. In Proc. the 5th Int. Conf. Adaptive Computing Design and Manufacture, Apr. 2002, pp.343-354.
Finkel R A, Bentley J L. Quad trees a data structure for retrieval on composite keys. Acta Informatica, 1974, 4(1): 1–9.
Shi C, Li Y, Kang L S. A new simple and highly efficient multi-objective optimal evolutionary algorithm. In Proc. the 2003 CEC, Dec. 2003, pp.1536-1542.
Zitzler E, Laumanns M, Thiele L. SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization. In Proc. EUROGEN 2001, Sept. 2001, pp.95-100.
Mostaghim S, Teich J, Tyagi A. Comparison of data structures for storing Pareto-sets in MOEAs. In Proc. Cong. Evolutionary Computation, May 2002, pp.843-848.
Coello Coello A C, Lamont G B, Veldhuizen D A. Evolutionary Algorithms for Solving Multi-Objective Problems (2nd edition), Springer, 2007.
Zitzler E, Thiele L. Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach. IEEE Trans. Evolutionary Computation, 1999, 3(4): 257–271.
Mostaghim S, Teich J. Quad-trees: A data structure for storing Pareto sets in multiobjective evolutionary algorithms with elitism. In Evolutionary Multiobjective Optimization. Theoretical Advances and Applications, Abraham A, Jain L, Goldberg R (eds.), Springer, 2005, pp.81-104.
Mostaghim S. Multi-objective evolutionary algorithms: Data structures, convergence and diversity [Ph.D. Thesis]. Fakultät Elektrotechnik, Informatik und Mathematik der Universität Paderborn, Paderborn, Germany, Nov. 2004.
Mostaghim S, Teich J, Tyagi A. Comparison of different data structures for storing Pareto-points. Technical Report, Paderborn Univ., In Date report number 02, Electrical Engineering Lab, Germany, 2001. (in Datentechnik)
Fieldsend J E. Novel algorithms for multi-objective search and their application in multi-objective evolutionary neural network training [Ph.D. Thesis]. Dept. Comp. Sci., Univ. Exeter, Exeter, UK, Jun. 2003.
Fieldsend J E, Singh S. A multi-objective algorithm based upon particle swarm optimisation, an efficient data structure and turbulence. In Proc. the 2002 UK Workshop on Computational Intelligence, Sept. 2002, pp.37-44.
Schütze O. A new data structure for the nondominance problem in multi-objective optimization. In Proc. the 2nd EMO, Apr. 2003, pp.509-518.
Chen X. Pareto tree searching genetic algorithm: Approaching Pareto optimal front by searching Pareto optimal tree. Technical Report NK-CS-2001-002, Dept. Comp. Sci., Nankai Univ., Tianjin, China, 2001.
Shi C, Li Q, Zhang Z, Shi Z. An improved multiobjective evolutionary algorithm based on dominating tree. In Proc. the 9th PRICAI, Aug. 2006, pp.691-700.
Shi C, Yan Z, Shi Z, Zhang L. A fast multi-objective evolutionary algorithm based on a tree structure. Applied Soft Computing, 2009, 10(2): 468–480.
Shi C, Yan Z, Lv K, Shi Z, Wang B. A dominance tree and its application in evolutionary multi-objective optimization. Information Sciences, 2009, 179(20): 3540–3560.
Alberto I, Mateo P M. Representation and management of MOEA populations based on graphs. European Journal of Operational Research, 2004, 159(1): 52–65.
Deb K, Pratap A, Agarwal S, Meyarivan T. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evolutionary Computation, 2002, 6(2): 182–197.
Li M, Zheng J, Xiao G. An efficient multi-objective evolutionary algorithm based on minimum spanning tree. In Proc. 2008 CEC, Jun. 2008, pp.617-624.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by the Research Center of College of Computer and Information Sciences, King Saud University, Saudi Arabia.
Rights and permissions
About this article
Cite this article
Altwaijry, N., El Bachir Menai, M. Data Structures in Multi-Objective Evolutionary Algorithms. J. Comput. Sci. Technol. 27, 1197–1210 (2012). https://doi.org/10.1007/s11390-012-1296-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11390-012-1296-y