{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:43:32Z","timestamp":1725579812135},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642199332"},{"type":"electronic","value":"9783642199349"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19934-9_25","type":"book-chapter","created":{"date-parts":[[2011,3,28]],"date-time":"2011-03-28T05:28:09Z","timestamp":1301290089000},"page":"199-208","source":"Crossref","is-referenced-by-count":0,"title":["Ant Colony to Fast Search of Paths in Huge Networks"],"prefix":"10.1007","author":[{"given":"Jessica","family":"Rivero","sequence":"first","affiliation":[]},{"given":"Dolores","family":"Cuadra","sequence":"additional","affiliation":[]},{"given":"F. Javier","family":"Calle","sequence":"additional","affiliation":[]},{"given":"Pedro","family":"Isasi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Alba, E., Chicano, F.: ACOhg: Dealing with Huge Graph. In: Genetic and Evolutionary Computation Conference, London, UK, July 2007, pp. 10\u201317 (2007)","DOI":"10.1145\/1276958.1276961"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R. Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.-L.: Statistical mechanics of complex networks. Reviews of Modern Physics\u00a074, 47 (2002)","journal-title":"Reviews of Modern Physics"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Bast, H., Funke, S., Matijevic, D., Sanders, P., Schultes, D.: In Transit to Constant Shortest-Path Queries in Road Networks. In: Workshop on Algorithm Engineering and Experiments (ALENEX 2007) (January 2007)","DOI":"10.1137\/1.9781611972870.5"},{"issue":"3","key":"25_CR4","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s00778-005-0177-1","volume":"16","author":"E.P.F. Chan","year":"2007","unstructured":"Chan, E.P.F., Lim, H.: Optimization and evaluation of shortest path queries. VLDB J.\u00a016(3), 343\u2013369 (2007)","journal-title":"VLDB J."},{"key":"25_CR5","unstructured":"De Oliveira, S.M. A study of Pheromone Modification Strategies for using ACO on the Dynamic Vehicle Routing Problem. Doctoral Symposium on Engineering Stochastic Local Search Algorithms (SLS-DS), Brussels, September 3-4 (2009)"},{"key":"25_CR6","series-title":"DIMACS Book","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1090\/dimacs\/074\/04","volume-title":"The Shortest Path Problem: Ninth DIMACS Implementation Challenge","author":"D. Delling","year":"2009","unstructured":"Delling, D., Holzer, M., M\u00fcller, K., Schulz, F., Wagner, D.: High-Performance Multi-Level Routing. In: The Shortest Path Problem: Ninth DIMACS Implementation Challenge. DIMACS Book, vol.\u00a074, pp. 73\u201392. AMS, Providence (2009)"},{"key":"25_CR7","unstructured":"Delling, D., Sanders, P., Schultes, D., Wagner, D.: Highway Hierarchies Star. In: 9th DIMACS Challenge on Shortest Paths (November 2006)"},{"issue":"5","key":"25_CR8","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, L.M.: AntHocNet: An Adaptive Nature-Inspired Algorithm for Routing in Mobile Ad Hoc Networks. European Transactions on Telecommunications (ETT), Special Issue on Self Organization in Mobile Networking\u00a016(5), 443\u2013455 (2005)","journal-title":"European Transactions on Telecommunications (ETT), Special Issue on Self Organization in Mobile Networking"},{"key":"25_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/b99492","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. The MIT Press, Cambridge (2004)"},{"issue":"1","key":"25_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10589-008-9172-y","volume":"45","author":"G. Nannicini","year":"2010","unstructured":"Nannicini, G., Baptiste, P., Barbier, G., Krob, D., Liberti, L.: Fast paths in large-scale dynamic road networks. Computational Optimization and Applications\u00a045(1), 143\u2013158 (2010)","journal-title":"Computational Optimization and Applications"},{"issue":"2","key":"25_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M.E.J. Newman","year":"2003","unstructured":"Newman, M.E.J.: The Structure and Function of Complex Networks. SIAM Review\u00a045(2), 167\u2013256 (2003), ISSN 0036-1445","journal-title":"SIAM Review"},{"key":"25_CR12","unstructured":"Rivero, J.: Fast Search of Paths through Huge Networks. In: Doctoral Symposium on Engineering Stochastic Local Search Algorithms (SLS-DS), Brussels, pp. 3\u20134 (2009)"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan, J., Samet, H.: Distance oracles for spatial networks. In: Proceedings of the 25th IEEE International Conference on Data Engineering, Shanghai (2009)","DOI":"10.1109\/ICDE.2009.53"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan, J., Samet, H., Alborzi, H.: Path oracles for spatial networks. In: Proceedings of the 35th International Conference on Very Large Data Bases (VLDB), Lyon, France (September 2009)","DOI":"10.14778\/1687627.1687763"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-540-72845-0_6","volume-title":"Experimental Algorithms","author":"D. Schultes","year":"2007","unstructured":"Schultes, D., Sanders, P.: Dynamic Highway-Node Routing. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 66\u201379. Springer, Heidelberg (2007)"}],"container-title":["Advances in Intelligent and Soft Computing","International Symposium on Distributed Computing and Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19934-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T10:54:37Z","timestamp":1558522477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19934-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642199332","9783642199349"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19934-9_25","relation":{},"ISSN":["1867-5662","1867-5670"],"issn-type":[{"type":"print","value":"1867-5662"},{"type":"electronic","value":"1867-5670"}],"subject":[],"published":{"date-parts":[[2011]]}}}