The directed search method for multi-objective memetic algorithms

We propose a new iterative search procedure for the numerical treatment of unconstrained multi-objective optimization problems (MOPs) which steers the search along a predefined direction given in objective space. Based on this idea we will present two methods: directed search (DS) descent which seek...

Full description

Saved in:

Bibliographic Details
Published in:	Computational optimization and applications Vol. 63; no. 2; pp. 305 - 332
Main Authors:	Schütze, Oliver, Martín, Adanay, Lara, Adriana, Alvarado, Sergio, Salinas, Eduardo, Coello, Carlos A. Coello
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.03.2016 Springer Nature B.V
Subjects:	Algorithms Computation Convex and Discrete Geometry Gain Genetic algorithms Management Science Mathematical models Mathematics Mathematics and Statistics Operations Research Operations Research/Decision Theory Optimization Optimization algorithms Pareto optimum Search engines Searches Searching Statistics Strategy Studies Memetic algorithm Continuation Multi-objective optimization Stochastic local search
ISSN:	0926-6003, 1573-2894
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!