| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 496562 | Applied Soft Computing | 2012 | 6 Pages |
Abstract
⺠The novel particle swarm optimization with random-key encoding to solve bi-objective personnel assignment problem. ⺠To swap between RK virtual space and candidate order of BOPAP using PSORK algorithm. ⺠To implement the linear-type of the time-varying coefficients Ï, K1, and K2 for BOPAP. ⺠The solution quality of BOPAP of the proposed method is far better than those of the f1_f2 heuristic algorithm.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
Shih-Ying Lin, Shi-Jinn Horng, Tzong-Wann Kao, Chin-Shyurng Fahn, Deng-Kui Huang, Ray-Shine Run, Yuh-Rau Wang, I.-Hong Kuo,