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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computational optimization and applications Ročník 63; číslo 2; s. 305 - 332
Hlavní autori:	Schütze, Oliver, Martín, Adanay, Lara, Adriana, Alvarado, Sergio, Salinas, Eduardo, Coello, Carlos A. Coello
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.03.2016 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!