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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on cybernetics Jg. 50; H. 3; S. 1060 - 1071
Hauptverfasser:	Shi, Jialong, Zhang, Qingfu, Sun, Jianyong
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	United States IEEE 01.03.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!