In order to effectively address the lack of basic ant colony algorithm in terms of parameters, we use four-step method instead of the popular three-step, based on a large number of experiments of the parameters setting, this paper summed up an effective selection method for m, α, β, ρ and Q parameters to select the best combination of parameters. Applying the improved ant colony algorithms including optimal retention policy ant system, max-min ant system, ant-based sorting systems and best-worst ant system, performance comparison analysis was conducted with the same TSP problems, and experiments proved that the proposed method of parameter combinations greatly improves the speed of convergence.
목차
Abstract 1. Introduction 2. Ant Colony Algorithm Overview 2.1. Basic Principles of Ant Colony Algorithm 2.2. Shortness of Ant Colony Algorithm 3. Study of Ant colony Algorithm Parameter Setting 3.1. Hardware/software Platform 3.2. Effects of Ants Number on Basic ant Colony Algorithm 3.3. Information Heuristic Factor and Expectations Heuristic factor 4. Experimental Discussion for Ant colony Algorithm 4.1. Improved Ant Colony Optimization Algorithm 4.2. Comparative Analysis of Simulation and Algorithm Performance 5. Conclusion Acknowledgements References
보안공학연구지원센터(IJUNESST) [Science & Engineering Research Support Center, Republic of Korea(IJUNESST)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of u- and e- Service, Science and Technology
간기
격월간
pISSN
2005-4246
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of u- and e- Service, Science and Technology Vol.7 No.4