Set-Based Discrete Particle Swarm Optimization Based on Decomposition for Permutation-Based Multiobjective Combinatorial Optimization Problems

This paper studies a specific class of multiobjective combinatorial optimization problems (MOCOPs), namely the permutation-based MOCOPs. Many commonly seen MOCOPs, e.g., multiobjective traveling salesman problem (MOTSP), multiobjective project scheduling problem (MOPSP), belong to this problem class...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on cybernetics Vol. 48; no. 7; pp. 2139 - 2153
Main Authors:	Yu, Xue, Chen, Wei-Neng, Gu, Tianlong, Zhang, Huaxiang, Yuan, Huaqiang, Kwong, Sam, Zhang, Jun
Format:	Journal Article
Language:	English
Published:	United States IEEE 01.07.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Combinatorial analysis Combinatorial optimization Computer science Construction Decomposition Encoding Mathematical programming multiobjective optimization Multiple objective analysis Pareto optimization Particle swarm optimization particle swarm optimization (PSO) permutation-based Permutations Schedules set-based Traveling salesman problem Urban areas Weight
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!