Extending ACO for fast path search in huge graphs and social networks.

Javier Calle-Gómez, Jesica Rivero,Dolores Cuadra,Pedro Isasi

Expert Systems with Applications（2017）

引用 16|浏览25

暂无评分

摘要

•Proposal of algorithm based to ACO for fast pathfinding in huge graphs.•Evaluated in general topology graphs and Social Networks.•It is faster than Dijkstra (547 times faster) and ACO (20 times faster).•The quality of the solutions is quasi-optimal better than those provided by ACO.

查看译文

关键词

Huge graphs,ACO,Bio inspired algorithms,Path search,Social networks

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要