A diversity preservation method for expensive multi-objective combinatorial optimization problems using Novel-First Tabu Search and MOEA/D

Expensive multi-objective combinatorial optimization problems have constraints in the number of objective function evaluations due to time, financial, or resource restrictions. As most combinatorial problems, they are subject to a high number of duplicated solutions. Given the fact that expensive en...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Expert systems with applications Ročník 202; s. 117251
Hlavní autoři:	de Moraes, Matheus Bernardelli, Coelho, Guilherme Palermo
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Elsevier Ltd 15.09.2022 Elsevier BV
Témata:	Algorithms Benchmarks Black-box optimization Combinatorial analysis Constraints Convergence Decomposition-based methods Diversity preservation Expensive multi-objective combinatorial optimization Multiple objective analysis Novel-First Tabu Search Oil fields Optimization Reproduction (copying) Search methods Tabu search Diversity preservation Expensive multi-objective combinatorial optimization Decomposition-based methods Novel-First Tabu Search Black-box optimization
ISSN:	0957-4174, 1873-6793
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!