Title
AbYSS: Adapting Scatter Search to Multiobjective Optimization
Abstract
We propose the use of a new algorithm to solve multiobjective optimization problems. Our proposal adapts the well-known scatter search template for single-objective optimization to the multiobjective domain. The result is a hybrid metaheuristic algorithm called Archive-Based hYbrid Scatter Search (AbYSS), which follows the scatter search structure but uses mutation and crossover operators from evolutionary algorithms. AbYSS incorporates typical concepts from the multiobjective field, such as Pareto dominance, density estimation, and an external archive to store the nondominated solutions. We evaluate AbYSS with a standard benchmark including both unconstrained and constrained problems, and it is compared with two state-of-the-art multiobjective optimizers, NSGA-II and SPEA2. The results obtained indicate that, according to the benchmark and parameter settings used, AbYSS outperforms the other two algorithms as regards the diversity of the solutions, and it obtains very competitive results according to the convergence to the true Pareto fronts and the hypervolume metric.
Year
DOI
Venue
2008
10.1109/TEVC.2007.913109
Evolutionary Computation, IEEE Transactions
Keywords
Field
DocType
Hybrid metaheuristics,multiobjective optimization,scatter search
Mathematical optimization,Crossover,Evolutionary algorithm,Evolutionary computation,Multi-objective optimization,Genetic algorithm,Mathematics,Pareto principle,Constrained optimization,Metaheuristic
Journal
Volume
Issue
ISSN
12
4
1089-778X
Citations 
PageRank 
References 
122
3.49
24
Authors
4
Search Limit
100122
Name
Order
Citations
PageRank
Nebro, A.J.12738.88
Luna, F.21233.86
Alba Enrique31438.74
Bernabé Dorronsoro Díaz435612.96