Date of Award
2019
Publisher
North Dakota State University
Document Type
Master's Paper
Degree Awarded
Master of Science (MS)
Program
Computer Science
Department
Computer Science
College
Engineering
Faculty Advisor
Ludwig, Simone
Description
The Strength Pareto Evaluation Algorithm (SPEA) (Zitzler and Thiele 1999) is one of the prominent technique for approximating the pareto-optimal set for the Multiple Objective Optimization (MOO) algorithm. The Strength Pareto Evaluation Algorithm 2 (SPEA2) is an improved version of SPEA that was introduced in the year 2001. SPEA2 in contrast to SPEA incorporates a fine-grained fitness assignment strategy, an improved archive truncation technique, and a density assessment procedure. In this paper, we studied the influence of the optimization ability of SPEA2 on different benchmark functions by evaluating different performance metrics. The benchmark functions used in the paper include 10 constrained functions (CF’s) and 10 unconstrained functions (UF’s), through which, by varying parameters such as number of iterations, variable size, population and archives, we performed our experiments.
Recommended Citation
Kakarlapudi, Madhumitha, "Investigation of Strength Pareto Evolutionary Algorithm" (2019). Computer Science. 132.
https://digitalcommons.ndsu.edu/computer-sci/132
Rights
NDSU Policy 190.6.2
Rights Link
https://www.ndsu.edu/fileadmin/policy/190.pdf
Handle Identifier
https://hdl.handle.net/10365/29449