著者
浅野 貴哉 弘畑 和秀
出版者
茨城工業高等専門学校
雑誌
茨城工業高等専門学校研究彙報 (ISSN:02863391)
巻号頁・発行日
vol.46, pp.71-75, 2011-03-01

Ant Colony Optimization (ACO) is a paradigm for designing meta heuristic algorithms on combinatorialoptimization problems. This paper proposes a improvement technique of Rank-based Ant System (ASrank). We applyproposed method to Travelling Salesman Problem (TSP) and show that proposed method gives better performancethan standard ASrank.n