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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computational optimization and applications Jg. 63; H. 2; S. 305 - 332
Hauptverfasser:	Schütze, Oliver, Martín, Adanay, Lara, Adriana, Alvarado, Sergio, Salinas, Eduardo, Coello, Carlos A. Coello
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.03.2016 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!