논문 상세보기

다수의 값을 갖는 이산적 문제에 적용되는 Particle Swarm Optimization KCI 등재

Particle Swarm Optimizations to Solve Multi-Valued Discrete Problems

  • 언어KOR
  • URLhttps://db.koreascholar.com/Article/Detail/240999
구독 기관 인증 시 무료 이용이 가능합니다. 4,000원
한국산업경영시스템학회지 (Journal of Society of Korea Industrial and Systems Engineering)
한국산업경영시스템학회 (Society of Korea Industrial and Systems Engineering)
초록

Many real world optimization problems are discrete and multi-valued. Meta heuristics including Genetic Algorithm and Particle Swarm Optimization have been effectively used to solve these multi-valued optimization problems. However, extensive comparative study on the performance of these algorithms is still required. In this study, performance of these algorithms is evaluated with multi-modal and multi-dimensional test functions. From the experimental results, it is shown that Discrete Particle Swarm Optimization (DPSO) provides better and more reliable solutions among the considered algorithms. Also, additional experiments shows that solution quality of DPSO is not lowered significantly when bit size representing a solution increases. It means that bit representation of multi-valued discrete numbers provides reliable solutions instead of becoming barrier to performance of DPSO.

저자
  • 임동순(한남대학교 산업경영공학과) | Dong-Soon Yim Corresponding Author