Information Theoretic Measures for Ant Colony Optimization

ANALYSIS OF LARGE AND COMPLEX DATA(2016)

引用 0|浏览14
暂无评分
摘要
We survey existing measures to analyze the search behavior of Ant Colony Optimization (ACO) algorithms and introduce a new uncertainty measure for characterizing three ACO variants. Unlike previous measures, the group uncertainty allows for quantifying the exploration of the search space with respect to the group assignment. We use the group uncertainty to analyze the search behavior of Group- Based Ant Colony Optimization.
更多
查看译文
关键词
Uncertainty Measure, Shannon Entropy, Combinatorial Optimization Problem, Vehicle Route Problem, Solution Component
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要