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

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on cybernetics Vol. 50; no. 3; pp. 1060 - 1071
Main Authors:	Shi, Jialong, Zhang, Qingfu, Sun, Jianyong
Format:	Journal Article
Language:	English
Published:	United States IEEE 01.03.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!