תמונות העטיפה

Data Structures in Multi-Objective Evolutionary Algorithms

שמור ב:
הוצא לאור ב:Journal of Computer Science and Technology vol. 27, no. 6 (Nov 2012), p. 1197
מחבר ראשי: Altwaijry, Najwa
מחברים אחרים: El Bachir Menai, Mohamed
יצא לאור:
Springer Nature B.V.
נושאים:
Mathematical programming
Search process
Population
Computer science
Analysis
Populations
Studies
Data structures
Genetic algorithms
Optimization
Generations
Archives & records
Pareto optimization
Hierarchies
Multiple objective analysis
Pareto optimum
Evolutionary algorithms
Information science
גישה מקוונת:Citation/Abstract
Full Text - PDF
תגים: הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
Resumen: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.[PUBLICATION ABSTRACT]
ISSN:1000-9000
1860-4749
DOI:10.1007/s11390-012-1296-y
Fuente:ABI/INFORM Global