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!
Popis
Shrnutí: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 parallel computation and problem decomposition. It decomposes the original search space into L subregions and executes L parallel processes searching in these subregions simultaneously. Inside each subregion, the PPLS/D process is guided by a unique scalar objective function. PPLS/D differs from the well-known two phase PLS in that it uses the scalar objective function to guide every move of the PLS procedure in a fine-grained manner. In the experimental studies, PPLS/D is compared against the basic PLS and a recently proposed PLS variant on the multiobjective unconstrained binary quadratic programming problems and the multiobjective traveling salesman problems with, at most, four objectives. The experimental results show that regardless of whether the initial solutions are randomly generated or generated by heuristic methods, PPLS/D always performs significantly better than the other two PLS variants.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:2168-2267
2168-2275
2168-2275
DOI:10.1109/TCYB.2018.2880256