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

• 영문명: Particle Swarm Optimizations to Solve Multi-Valued Discrete Problems
• 발행기관: 한국산업경영시스템학회
• 저자명: 임동순(Dong-Soon Yim)
• 간행물 정보: 『산업경영시스템학회지』제36권 제3호, 63~70쪽, 전체 8쪽
• 주제분류: 경제경영 > 경영학
• 파일형태: PDF
• 발행일자: 2013.09.30

영문 초록

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.

목차

Abstract

1. 서론

2. 이산적 값을 갖는 문제에 적용되는 유전 알고리즘과 PSO

3. 성능분석을 위한 평가함수

4. 실험 및 분석

5. 결론

References

키워드

Multi-valued Discrete Problem Genetic Algorithm Particle Swarm Optimization