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

Abstract This paper presents the bio-inspired algorithm SoSACO-v2 that is explained as an extension of the Ant Colony Optimization in which the ants are empowered with the sense of smell, directing them straightly to privileged nodes when they are near enough of them. This algorithm is an evolution of a former version which main feature is efficiency through path search task in huge graphs of high connectivity. New requirements regarding this task in most applications include processing vast graphs, immediate comeback, and dealing with dynamicity. The here proposed algorithm gives response to new needs the former approaches cannot fulfill: fast finding of paths between two nodes through vast dynamic graphs. SoSACO-v2 does not provide the optimum path, but it is the quicker algorithm in providing a response. It stands for domains where optimality is not required, and often the path search takes more time than covering the path. The approach is evaluated, both in a generic huge graph and in a small-world type graph from a real social network, showing satisfactory results.

[1]  Kurt Mehlhorn,et al.  A Faster Approximation Algorithm for the Steiner Problem in Graphs , 1988, Inf. Process. Lett..

[2]  Haibin Duan,et al.  Improved Ant Colony Algorithm for Global Optimal Trajectory Planning of UAV under Complex Environment , 2007, Int. J. Comput. Sci. Appl..

[3]  Hanan Samet,et al.  Path Oracles for Spatial Networks , 2009, Proc. VLDB Endow..

[4]  Shuo Wang,et al.  A novel membrane algorithm for capacitated vehicle routing problem , 2015, Soft Comput..

[5]  Peter Sanders,et al.  In Transit to Constant Time Shortest-Path Queries in Road Networks , 2007, ALENEX.

[6]  Huynh Thi Thanh Binh,et al.  Heuristic and genetic algorithms for solving survivability problem in the design of last mile communication networks , 2015, Soft Comput..

[7]  Devdatt P. Dubhashi,et al.  Adaptive Dynamics of Realistic Small-World Networks , 2008, ArXiv.

[8]  Edward P. F. Chan,et al.  Optimization and evaluation of shortest path queries , 2007, The VLDB Journal.

[9]  Stephen P. Borgatti,et al.  Centrality and network flow , 2005, Soc. Networks.

[10]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[11]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[12]  Dorothea Wagner,et al.  High-Performance Multi-Level Routing , 2006, The Shortest Path Problem.

[13]  Jeffrey Xu Yu,et al.  Graph Reachability Queries: A Survey , 2010, Managing and Mining Graph Data.

[14]  Jie Zhang,et al.  A fast unified optimal route query evaluation algorithm , 2007, CIKM '07.

[15]  Gonzalo Álvarez,et al.  A Model for Scale-Free Networks: Application to Twitter , 2015, Entropy.

[16]  Danielle Azar,et al.  An ant colony optimization algorithm to improve software quality prediction models: Case of class stability , 2011, Inf. Softw. Technol..

[17]  Pedro Isasi Viñuela,et al.  Using the ACO algorithm for path searches in social networks , 2011, Applied Intelligence.

[18]  Andrew V. Goldberg,et al.  Route Planning in Transportation Networks , 2015, Algorithm Engineering.

[19]  Daoxu Chen,et al.  SWS: Small World Based Search in Structured Peer-to-Peer Systems , 2006, 2006 Fifth International Conference on Grid and Cooperative Computing Workshops.

[20]  Punam Bedi,et al.  Reducing Travel Time in VANETs with Parallel Implementation of MACO (Modified ACO) , 2015, IBICA.

[21]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[22]  Arnon Rungsawang,et al.  Web spam detection using trust and distrust-based ant colony optimization learning , 2015, Int. J. Web Inf. Syst..

[23]  Peter Sanders,et al.  Highway Hierarchies Star , 2006, The Shortest Path Problem.

[24]  Oskar Sandberg,et al.  Distributed Routing in Small-World Networks , 2006, ALENEX.

[25]  David Liben-Nowell,et al.  Wayfinding in Social Networks , 2010, Algorithms for Next Generation Networks.

[26]  Shengxiang Yang,et al.  Ant colony optimization with immigrants schemes for the dynamic railway junction rescheduling problem with multiple delays , 2016, Soft Comput..

[27]  G. Breeuwsma.  Geruchten als besmettelijke ziekte. Het succesverhaal van de Hush Puppies. Bespreking van Malcolm Gladwell, The tipping point. How little things can make a big difference. London: Little, Brown and Company, 2000 , 2000 .

[28]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[29]  Arpan Kumar Kar,et al.  Bio inspired computing - A review of algorithms and scope of applications , 2016, Expert Syst. Appl..

[30]  Marc Reimann,et al.  Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP , 2016, Central Eur. J. Oper. Res..

[31]  M. Erwig.  The graph Voronoi diagram with applications , 2000 .

[32]  Hassan M. Emara,et al.  Using Ant Colony Optimization algorithm for solving project management problems , 2009, Expert Syst. Appl..

[33]  Sunghee Choi,et al.  Efficient algorithms for updating betweenness centrality in fully dynamic graphs , 2016, Inf. Sci..

[34]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[35]  Huan Liu,et al.  Graph Mining Applications to Social Network Analysis , 2010, Managing and Mining Graph Data.

[36]  Hanan Samet,et al.  Distance Oracles for Spatial Networks , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[37]  Jaideep Srivastava,et al.  An Ant Colony Optimization Approach to Expert Identification in Social Networks , 2008 .

[38]  Guanrong Chen,et al.  Complex networks: small-world, scale-free and beyond , 2003 .

[39]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[40]  Bart Selman,et al.  Referral Web: combining social networks and collaborative filtering , 1997, CACM.

[41]  Kaoru Hirota,et al.  Hyperbox clustering with Ant Colony Optimization (HACO) method and its application to medical risk profile recognition , 2009, Appl. Soft Comput..

[42]  B. S. Manoj,et al.  An efficient heuristics to realize near-optimal small-world networks , 2015, 2015 Twenty First National Conference on Communications (NCC).

[43]  Ping Wang,et al.  An improved ant colony system algorithm for solving the IP traceback problem , 2016, Inf. Sci..

[44]  José A. Moreno-Pérez,et al.  An ACO hybrid metaheuristic for close-open vehicle routing problems with time windows and fuzzy constraints , 2015, Appl. Soft Comput..

[45]  Lotfi Ben Romdhane,et al.  A robust ant colony optimization-based algorithm for community mining in large scale oriented social graphs , 2013, Expert Syst. Appl..

[46]  Albert-László Barabási,et al.  Scale-Free Networks: A Decade and Beyond , 2009, Science.

[47]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[48]  Pawel B. Myszkowski,et al.  Hybrid ant colony optimization in solving multi-skill resource-constrained project scheduling problem , 2014, Soft Computing.

[49]  Shih-Wei Lin,et al.  An enhanced ant colony optimization (EACO) applied to capacitated vehicle routing problem , 2010, Applied Intelligence.

[50]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[51]  Marco Dorigo,et al.  Ant colony optimization theory: A survey , 2005, Theor. Comput. Sci..