순서화 문제에서 이산적 Particle Swarm Optimization들의 성능 비교

임동순

논문 상세보기

순서화 문제에서 이산적 Particle Swarm Optimization들의 성능 비교 KCI 등재

Performance Comparison of Discrete Particle Swarm Optimizations in Sequencing Problems

임동순

언어KOR
URLhttps://db.koreascholar.com/Article/Detail/22735

구독 기관 인증 시 무료 이용이 가능합니다. 4,200원

한국산업경영시스템학회지 (Journal of Society of Korea Industrial and Systems Engineering)

Vol. 33 No. 4 (2010.12)
pp.58-68

한국산업경영시스템학회 (Society of Korea Industrial and Systems Engineering)

초록

Particle Swarm Optimization (PSO) which has been well known to solve continuous problems can be applied to discrete combinatorial problems. Several DPSO (Discrete Particle Swarm Optimization) algorithms have been proposed to solve discrete problems such a

키워드

Particle Swarm Optimization PSO Traveling Salesman Problem TSP Genetic Algorithm GA

저자

임동순 | D. S. Yim

같은 권호 다른 논문