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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on cybernetics Jg. 48; H. 7; S. 2139 - 2153
Hauptverfasser:	Yu, Xue, Chen, Wei-Neng, Gu, Tianlong, Zhang, Huaxiang, Yuan, Huaqiang, Kwong, Sam, Zhang, Jun
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	United States IEEE 01.07.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!