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

Simple item page
dc.affiliation.dptoUC3M. Departamento de Informáticaes
dc.affiliation.grupoinvUC3M. Grupo de Investigación: Computación Evolutiva y Redes Neuronales (EVANNAI)es
dc.contributor.authorCalle Gómez, Francisco Javier
dc.contributor.authorRivero Espinosa, Jessica
dc.contributor.authorCuadra Fernández, María Dolores
dc.contributor.authorIsasi, Pedro
dc.date.accessioned2020-09-30T09:56:54Z
dc.date.available2020-09-30T09:56:54Z
dc.date.issued2017-11-15
dc.description.abstractThis 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.en
dc.description.sponsorshipThis study was partially funded by the Spanish Ministry of Industry, Tourism and Commerce through the CADOOH research project ( TSI-020302201121 ), and the Spanish Ministry of Sci- ence and Innovation under the MOVES research project ( TIN- 201128336 ). Our sincere thanks to everyone involved in those projects, and to all who have supported us during this work.en
dc.identifier.bibliographicCitationCalle, J., Rivero, J., Cuadra, D., Isasi, P. (2017). Extending ACO for fast path search in huge graphs and social networks. Expert Systems with Applications, 86, pp. 292-306en
dc.identifier.doihttps://doi.org/10.1016/j.eswa.2017.05.066
dc.identifier.issn0957-4174
dc.identifier.publicationfirstpage292
dc.identifier.publicationlastpage306
dc.identifier.publicationtitleEXPERT SYSTEMS WITH APPLICATIONSen
dc.identifier.publicationvolume86
dc.identifier.urihttps://hdl.handle.net/10016/30904
dc.identifier.uxxiAR/0000020355
dc.language.isoenges
dc.publisherElsevieren
dc.relation.projectIDGobierno de España. TIN2011-28336es
dc.relation.projectIDGobierno de España. TSI-020302201121es
dc.rights© 2017 Elsevier Ltd. All rights reserved.es
dc.rightsAtribución-NoComercial-SinDerivadas 3.0 España*
dc.rights.accessRightsrestricted accesses
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/*
dc.subject.ecienciaInformáticaes
dc.subject.otherHuge Graphsen
dc.subject.otherAcoen
dc.subject.otherBio inspired algorithmsen
dc.subject.otherPath searchen
dc.subject.otherSocial networksen
dc.titleExtending ACO for fast path search in huge graphs and social networksen
dc.typeresearch article*
dc.type.hasVersionVoR*
dspace.entity.typePublication
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
extending_ESWA_2017.pdf
Size:
2.36 MB
Format:
Adobe Portable Document Format
Description:
Download
Collections
DI - GCERN - Artículos de revistas científicas