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

作者：

Highlights：

• 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.

摘要

•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

论文评审过程：Received 6 July 2016, Revised 27 April 2017, Accepted 27 May 2017, Available online 31 May 2017, Version of Record 8 June 2017.

论文官网地址：https://doi.org/10.1016/j.eswa.2017.05.066