Name
Title | ||
|---|---|---|
Set-Based Discrete Particle Swarm Optimization Based on Decomposition for Permutation-Based Multiobjective Combinatorial Optimization Problems. |
Abstract | ||
|---|---|---|
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 and they can be very different. However, as the permutation-based MOCOPs share the inherent similar... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TCYB.2017.2728120 | IEEE Transactions on Cybernetics |
Keywords | Field | DocType |
Computer science,Urban areas,Encoding,Particle swarm optimization,Pareto optimization,Schedules | Continuous optimization,Mathematical optimization,Extremal optimization,Discrete optimization,Quadratic assignment problem,Multi-swarm optimization,Combinatorial optimization,Optimization problem,Mathematics,Metaheuristic | Journal |
Volume | Issue | ISSN |
48 | 7 | 2168-2267 |
Citations | PageRank | References |
8 | 0.42 | 43 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xue Yu | 1 | 17 | 3.53 |
| Wei-Neng Chen | 2 | 143 | 13.16 |
| Tianlong Gu | 3 | 471 | 46.73 |
| Huaxiang Zhang | 4 | 436 | 56.32 |
| Huaqiang Yuan | 5 | 107 | 11.47 |
| Sam Kwong | 6 | 4590 | 315.78 |
| Jun Zhang | 7 | 2491 | 127.27 |