{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T04:17:42Z","timestamp":1665375462460},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,6,10]],"date-time":"2011-06-10T00:00:00Z","timestamp":1307664000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10489-011-0304-1","type":"journal-article","created":{"date-parts":[[2011,6,9]],"date-time":"2011-06-09T16:22:52Z","timestamp":1307636572000},"page":"899-917","source":"Crossref","is-referenced-by-count":16,"title":["Using the ACO algorithm for path searches in social networks"],"prefix":"10.1007","volume":"36","author":[{"given":"Jessica","family":"Rivero","sequence":"first","affiliation":[]},{"given":"Dolores","family":"Cuadra","sequence":"additional","affiliation":[]},{"given":"Javier","family":"Calle","sequence":"additional","affiliation":[]},{"given":"Pedro","family":"Isasi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,10]]},"reference":[{"issue":"3","key":"304_CR1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.socnet.2005.01.007","volume":"27","author":"L Adamic","year":"2005","unstructured":"Adamic L, Adar E (2005) How to search a social network. Soc Netw 27(3):187\u2013203","journal-title":"Soc Netw"},{"key":"304_CR2","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/1276958.1276961","volume-title":"Proceedings of the genetic and evolutionary computation conference of 2007","author":"E Alba","year":"2007","unstructured":"Alba E, Chicano F (2007) ACOhg: dealing with huge graph. In: Proceedings of the genetic and evolutionary computation conference of 2007, pp\u00a010\u201317"},{"issue":"1","key":"304_CR3","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10489-005-2370-8","volume":"23","author":"D Angus","year":"2005","unstructured":"Angus D, Hendtlass T (2005) Dynamic ant colony optimisation. Appl Intell 23(1):33\u201338","journal-title":"Appl Intell"},{"key":"304_CR4","volume-title":"Proceedings of workshop on algorithm engineering and experiments of 2007","author":"H Bast","year":"2007","unstructured":"Bast H, Funke S, Matijevic D, Sanders P, Schultes D (2007) In transit to constant shortest-path queries in road networks. In: Proceedings of workshop on algorithm engineering and experiments of 2007"},{"issue":"3","key":"304_CR5","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s00778-005-0177-1","volume":"16","author":"EPF Chan","year":"2007","unstructured":"Chan EPF, Lim H (2007) Optimization and evaluation of shortest path queries. VLDB J 16(3):343\u2013369","journal-title":"VLDB J"},{"key":"304_CR6","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/1321440.1321494","volume-title":"Proceedings of the 16th ACM conference on conference on information and knowledge management","author":"EPF Chan","year":"2007","unstructured":"Chan EPF, Zhang J (2007) A fast unified optimal route query evaluation algorithm. In: Proceedings of the 16th ACM conference on conference on information and knowledge management, pp\u00a0371\u2013380"},{"issue":"1","key":"304_CR7","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.future.2008.06.004","volume":"25","author":"R-S Chang","year":"2009","unstructured":"Chang R-S, Chang J-S, Lin P-S (2009) An ant algorithm for balanced job scheduling in grids. Future Gener Comput Syst 25(1):20\u201327","journal-title":"Future Gener Comput Syst"},{"key":"304_CR8","first-page":"6","volume-title":"Doctoral symposium on engineering stochastic local search algorithms of 2009","author":"SM Oliveira De","year":"2009","unstructured":"De Oliveira SM (2009) A\u00a0study of pheromone modification strategies for using ACO on the dynamic vehicle routing problem. In: Doctoral symposium on engineering stochastic local search algorithms of 2009, pp\u00a06\u201310"},{"key":"304_CR9","series-title":"DIMACS book","first-page":"141","volume-title":"The shortest path problem: 9th DIMACS implementation challenge","author":"D Delling","year":"2006","unstructured":"Delling D, Sanders P, Schultes D, Wagner D (2006) Highway hierarchies star. In: The shortest path problem: 9th DIMACS implementation challenge. DIMACS book, vol\u00a074, pp\u00a0141\u2013174"},{"key":"304_CR10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1090\/dimacs\/074\/04","volume":"74","author":"D Delling","year":"2009","unstructured":"Delling D, Holzer M, M\u00fcller K, Schulz F, Wagner D (2009) High-performance multi-level routing. Ser Discrete Math Theor Comput Sci 74:73\u201392","journal-title":"Ser Discrete Math Theor Comput Sci"},{"issue":"5","key":"304_CR11","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1002\/ett.1062","volume":"16","author":"G Caro Di","year":"2005","unstructured":"Di Caro G, Ducatelle F, Gambardella LM (2005) AntHocNet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks. Eur Trans Telecommun 16(5):443\u2013455. Special Issue on Self Organ Mob Netw","journal-title":"Eur Trans Telecommun"},{"key":"304_CR12","unstructured":"Dorigo M (1992) Optimization, learning and natural algorithms. Doctoral Thesis, Dipartamento di Elettronica, Politecnico di Milano, Italy"},{"key":"304_CR13","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M Dorigo","year":"2005","unstructured":"Dorigo M, Blum C (2005) Ant colony optimization theory: a survey. Theor Comput Sci 344:243\u2013278","journal-title":"Theor Comput Sci"},{"key":"304_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","volume-title":"Ant colony optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo M, St\u00fctzle T (2004) Ant colony optimization. MIT Press, Cambridge"},{"issue":"1","key":"304_CR15","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s10489-006-6927-y","volume":"24","author":"S Favuzza","year":"2006","unstructured":"Favuzza S, Graditi G, Sanseverino E (2006) Adaptive and dynamic ant colony search algorithm for optimal distribution systems reinforcement strategy. Appl Intell 24(1):31\u201342","journal-title":"Appl Intell"},{"key":"304_CR16","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1109\/GCCW.2006.87","volume-title":"Proceedings on the international conference on grid and cooperative computing workshops of 2006","author":"G Feng","year":"2006","unstructured":"Feng G, Li C, Gu Q, Lu S, Chen D (2006) SWS: small world based search in structured peer-to-peer systems. In: Proceedings on the international conference on grid and cooperative computing workshops of 2006, pp\u00a0341\u2013348"},{"issue":"3","key":"304_CR17","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s10489-005-4604-1","volume":"23","author":"MG Ippolito","year":"2005","unstructured":"Ippolito MG, Morana G, Riva Sanseverino E, Vuinovich F (2005) Ant colony search algorithm for optimal strategical planning of electrical distribution systems expansion. Appl Intell 23(3):139\u2013152","journal-title":"Appl Intell"},{"issue":"1","key":"304_CR18","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.asoc.2009.11.002","volume":"11","author":"J Ja\u00e9n","year":"2011","unstructured":"Ja\u00e9n J, Mochol\u00ed JA, Catal\u00e1 A, Navarro E (2011) Digital ants as the best cicerones for museum visitors. Appl Soft Comput 11(1):111\u2013119","journal-title":"Appl Soft Comput"},{"issue":"3","key":"304_CR19","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/245108.245123","volume":"40","author":"H Kautz","year":"1997","unstructured":"Kautz H, Selman B, Shah M (1997) Referral Web: combining social networks and collaborative filtering. Commun ACM 40(3):63\u201365","journal-title":"Commun ACM"},{"issue":"1","key":"304_CR20","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/s10489-008-0136-9","volume":"32","author":"C-Y Lee","year":"2010","unstructured":"Lee C-Y, Lee Z-J, Lin S-W, Ying K-C (2010) An enhanced ant colony optimization (EACO) applied to capacitated vehicle routing problem. Appl Intell 32(1):88\u201395","journal-title":"Appl Intell"},{"key":"304_CR21","unstructured":"Leskovec J (2010) SNAP: network datasets: epinions social network. Stanford University. http:\/\/snap.stanford.edu\/data\/soc-sign-epinions.html . Accessed 09 November 2010"},{"key":"304_CR22","unstructured":"Leskovec J (2010) SNAP: network datasets: slashdot social network. Stanford University. http:\/\/snap.stanford.edu\/data\/soc-Slashdot0902.html . Accessed 09 November 2010"},{"issue":"2","key":"304_CR23","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45(2):167\u2013256","journal-title":"SIAM Rev"},{"issue":"2","key":"304_CR24","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1016\/j.asoc.2008.09.004","volume":"9","author":"GN Ramos","year":"2009","unstructured":"Ramos GN, Hatakeyama Y, Dong F, Hirota K (2009) Hyperbox clustering with ant colony optimization (HACO) method and its application to medical risk profile recognition. Appl Soft Comput 9(2):632\u2013640","journal-title":"Appl Soft Comput"},{"key":"304_CR25","first-page":"46","volume-title":"Doctoral symposium on engineering stochastic local search algorithms of 2009","author":"J Rivero","year":"2009","unstructured":"Rivero J (2009) Fast search of paths through huge networks. In: Doctoral symposium on engineering stochastic local search algorithms of 2009, pp\u00a046\u201350"},{"key":"304_CR26","first-page":"144","volume-title":"Proceedings of the 8th workshop on algorithm engineering and experiments","author":"O Sandberg","year":"2006","unstructured":"Sandberg O (2006) Distributed routing in small-world networks. In: Proceedings of the 8th workshop on algorithm engineering and experiments, pp\u00a0144\u2013155"},{"key":"304_CR27","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1109\/ICDE.2009.53","volume-title":"Proceedings of the 25th IEEE international conference on data engineering","author":"J Sankaranarayanan","year":"2009","unstructured":"Sankaranarayanan J, Samet H (2009) Distance oracles for spatial networks. In: Proceedings of the 25th IEEE international conference on data engineering, pp\u00a0652\u2013663"},{"key":"304_CR28","first-page":"1210","volume-title":"Proceedings of the 35th international conference on very large data bases","author":"J Sankaranarayanan","year":"2009","unstructured":"Sankaranarayanan J, Samet H, Alborzi H (2009) Path oracles for spatial networks. In: Proceedings of the 35th international conference on very large data bases, pp\u00a01210\u20131221"},{"issue":"2","key":"304_CR29","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/s10489-008-0117-z","volume":"31","author":"S Supratid","year":"2009","unstructured":"Supratid S, Kim H (2009) Modified fuzzy ants clustering approach. Appl Intell 31(2):122\u2013134","journal-title":"Appl Intell"},{"key":"304_CR30","series-title":"Advances in DataBase systems","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/978-1-4419-6045-0_16","volume-title":"Managing and mining graph data","author":"L Tang","year":"2010","unstructured":"Tang L, Liu H (2010) Graph mining applications to social network an\u00e1lisis. In: Aggarwal C, Wang H (eds) Managing and mining graph data. Advances in DataBase systems, vol\u00a040, pp\u00a0487\u2013514"},{"key":"304_CR31","series-title":"Advances in DataBase systems","first-page":"181","volume-title":"Managing and mining graph data","author":"JX Yu","year":"2010","unstructured":"Yu JX, Cheng J (2010) Graph reachability queries: a survey. In: Aggarwal C, Wang H (eds) Managing and mining graph data. Advances in DataBase systems, vol\u00a040, pp\u00a0181\u2013215"},{"key":"304_CR32","unstructured":"Yuan W, Guan D, Lee Y-K, Lee S (2010) The small-world trust network. Appl Intell 1\u201312. ISSN 0924-669X"},{"key":"304_CR33","unstructured":"Zhang N, Feng Z-R, Ke L-J (2010) Guidance-solution based ant colony optimization for satellite control resource scheduling problem. Appl Intell 1\u20139. ISSN 0924-669X"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-011-0304-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-011-0304-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-011-0304-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:25:46Z","timestamp":1559154346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-011-0304-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,10]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["304"],"URL":"https:\/\/doi.org\/10.1007\/s10489-011-0304-1","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,10]]}}}