PPLS/D: Parallel Pareto Local Search Based on Decomposition

Pareto local search (PLS) is a basic building block in many metaheuristics for a multiobjective combinatorial optimization problem. In this paper, an enhanced PLS variant called parallel PLS based on decomposition (PPLS/D) is proposed. PPLS/D improves the efficiency of PLS using the techniques of pa...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on cybernetics Ročník 50; číslo 3; s. 1060 - 1071
Hlavní autoři:	Shi, Jialong, Zhang, Qingfu, Sun, Jianyong
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	United States IEEE 01.03.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Combinatorial analysis Combinatorial mathematics Decomposition Evolutionary computation Heuristic methods Linear programming Multiobjective combinatorial optimization Multiple objective analysis Optimization parallel metaheuristic Parallel processing Pareto local search Quadratic programming Search problems Searching Traveling salesman problem Traveling salesman problems unconstrained binary quadratic programming
ISSN:	2168-2267, 2168-2275, 2168-2275
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!