{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T12:54:49Z","timestamp":1773752089477,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642002663","type":"print"},{"value":"9783642002670","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00267-0_12","type":"book-chapter","created":{"date-parts":[[2009,5,4]],"date-time":"2009-05-04T16:36:41Z","timestamp":1241455001000},"page":"333-368","source":"Crossref","is-referenced-by-count":17,"title":["Applying River Formation Dynamics to Solve NP-Complete Problems"],"prefix":"10.1007","author":[{"given":"Pablo","family":"Rabanal","sequence":"first","affiliation":[]},{"given":"Ismael","family":"Rodr\u00edguez","sequence":"additional","affiliation":[]},{"given":"Fernando","family":"Rubio","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"D.L. Applegate","year":"2006","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-45510-8_9","volume-title":"Modeling and Verification of Parallel Processes","author":"E. Brinksma","year":"2001","unstructured":"Brinksma, E., Tretmans, J.: Testing transition systems: An annotated bibliography. In: Cassez, F., Jard, C., Rozoy, B., Dermot, M. (eds.) MOVEP 2000. LNCS, vol.\u00a02067, pp. 187\u2013195. Springer, Heidelberg (2001)"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1143997.1144000","volume-title":"GECCO","author":"T. Bui","year":"2006","unstructured":"Bui, T., Zrncic, C.: An ant-based algorithm for finding degree-constrained minimum spanning tree. In: GECCO, pp. 11\u201318. ACM Press, New York (2006)"},{"key":"12_CR4","unstructured":"Davis, L., et al.: Handbook of genetic algorithms. Van Nostrand Reinhold New York (1991)"},{"key":"12_CR5","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.: Ant colonies for the traveling salesman problem. BioSystems\u00a043(2), 73\u201381 (1997)","journal-title":"BioSystems"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man and Cybernetics, Part B\u00a026(1), 29\u201341 (1996)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics, Part B"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Fleischer, M.: Simulated annealing: past, present, and future. In: Proceedings of the 27th conference on Winter simulation, pp. 155\u2013161 (1995)","DOI":"10.1145\/224401.224457"},{"key":"12_CR9","volume-title":"The Traveling Salesman Problem and Its Variations","author":"G. Gutin","year":"2002","unstructured":"Gutin, G., Punnen, A.: The Traveling Salesman Problem and Its Variations. Kluwer, Dordrecht (2002)"},{"key":"12_CR10","volume-title":"Evolutionary computation: a unified approach","author":"K. Jong","year":"2006","unstructured":"Jong, K.: Evolutionary computation: a unified approach. MIT Press, Cambridge (2006)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, Piscataway, NJ, pp. 1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science\u00a0220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/0167-2789(86)90237-X","volume":"22","author":"C. Langton","year":"1986","unstructured":"Langton, C.: Studying artificial life with cellular automata. Physica D\u00a022, 120\u2013149 (1986)","journal-title":"Physica D"},{"issue":"8","key":"12_CR14","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1109\/5.533956","volume":"84","author":"D. Lee","year":"1996","unstructured":"Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines: A survey. Proceedings of the IEEE\u00a084(8), 1090\u20131123 (1996)","journal-title":"Proceedings of the IEEE"},{"issue":"1\u20133","key":"12_CR15","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.tcs.2005.10.047","volume":"353","author":"N. L\u00f3pez","year":"2006","unstructured":"L\u00f3pez, N., N\u00fa\u00f1ez, M., Rodr\u00edguez, I.: Specification, testing and implementation relations for symbolic-probabilistic systems. Theoretical Computer Science\u00a0353(1\u20133), 228\u2013248 (2006)","journal-title":"Theoretical Computer Science"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-45510-8_10","volume-title":"Modeling and Verification of Parallel Processes","author":"A. Petrenko","year":"2001","unstructured":"Petrenko, A.: Fault model-driven test derivation from finite state models: Annotated bibliography. In: Cassez, F., Jard, C., Rozoy, B., Dermot, M. (eds.) MOVEP 2000. LNCS, vol.\u00a02067, pp. 196\u2013205. Springer, Heidelberg (2001)"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-540-73554-0_16","volume-title":"Unconventional Computation","author":"P. Rabanal","year":"2007","unstructured":"Rabanal, P., Rodr\u00edguez, I., Rubio, F.: Using river formation dynamics to design heuristic algorithms. In: Akl, S.G., Calude, C.S., Dinneen, M.J., Rozenberg, G., Wareham, H.T. (eds.) UC 2007. LNCS, vol.\u00a04618, pp. 163\u2013177. Springer, Heidelberg (2007)"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-540-87527-7_6","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"P. Rabanal","year":"2008","unstructured":"Rabanal, P., Rodr\u00edguez, I., Rubio, F.: Finding minimum spanning\/distances trees by using river formation dynamics. In: Dorigo, M., Birattari, M., Blum, C., Clerc, M., St\u00fctzle, T., Winfield, A.F.T. (eds.) ANTS 2008. LNCS, vol.\u00a05217, pp. 60\u201371. Springer, Heidelberg (2008)"},{"key":"12_CR19","unstructured":"Reinelt, G.: TSPLIB 95. Research Report, Institut f\u00fcr Angewandte Mathematik, Universit\u00e4t Heidelberg, Heidelberg, Germany. Tech. rep. (1995), http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.jlap.2007.03.002","volume":"74","author":"I. Rodr\u00edguez","year":"2008","unstructured":"Rodr\u00edguez, I., Merayo, M., N\u00fa\u00f1ez, M.: HOTL: Hypotheses and observations testing logic. Journal of Logic and Algebraic Programming\u00a074, 57\u201393 (2008)","journal-title":"Journal of Logic and Algebraic Programming"}],"container-title":["Studies in Computational Intelligence","Nature-Inspired Algorithms for Optimisation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00267-0_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T10:15:28Z","timestamp":1619777728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00267-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002663","9783642002670"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00267-0_12","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"value":"1860-949X","type":"print"},{"value":"1860-9503","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}