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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on cybernetics Ročník 48; číslo 7; s. 2139 - 2153
Hlavní autori:	Yu, Xue, Chen, Wei-Neng, Gu, Tianlong, Zhang, Huaxiang, Yuan, Huaqiang, Kwong, Sam, Zhang, Jun
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	United States IEEE 01.07.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!