Applying river formation dynamics to solve NP-complete problems

Studies in Computational Intelligence

Volumn 193, Issue , 2009, Pages 333-368

  Rabanal, Pablo ^a   Rodríguez, Ismael ^a   Rubio, Fernando ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 65749120513     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-642-00267-0_12     Document Type: Article

References (20)

1. Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)
2. Brinksma, E., Tretmans, J.: Testing transition systems: An annotated bibliography. In: Cassez, F., Jard, C., Rozoy, B., Dermot, M. (eds.) MOVEP 2000. LNCS, vol. 2067, pp. 187-195. Springer, Heidelberg (2001)
3. Bui, T., Zrncic, C.: An ant-based algorithm for finding degree-constrained minimum spanning tree. In: GECCO, pp. 11-18. ACM Press, New York (2006)
4. Davis, L., et al.: Handbook of genetic algorithms. Van Nostrand Reinhold New York (1991)
5. Dorigo, M.: Ant Colony Optimization. MIT Press, Cambridge (2004)
6. Dorigo, M., Gambardella, L.: Ant colonies for the traveling salesman problem. BioSystems 43(2), 73-81 (1997)
7. DorigoO M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man and Cybernetics, Part B 26(1), 29-41 (1996)
8. Fleischer, M.: Pimulated annealing: past, present, and future. In: Proceedings of the 27th conference on Winter simulation, pp. 155-161 (1995)
9. Gutin, G., Punnen, A.: The Traveling Salesman Problem and Its Variations. Kluwer, Dordrecht (2002)
10. Jong, K.: EvolutionaAy computation: a unified approach. MIT Press, Cambridge (2006)
11. Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, Piscataway, NJ, pp. 1942-1948 (1995)
12. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220, 671-680 (1983)
13. Langton, C.: Studying artificial life with cellular automata. Physica D 22, 120-149 (1986)
14. Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines: A survey. Proceedings of the IEEE 84(8), 1090-1123 (1996)
15. López, N., Núñez, M., Rodríguez, I.: Specification, testing and implementation relations for symbolic-probabilistic systems. Theoretical Computer Science 353(1-3), 228-248 (2006)
16. 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. 2067, pp. 196-205. Springer, Heidelberg (2001)
17. Rabanal, P., Rodríguez, 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. 4618, pp. 163-177. Springer, Heidelberg (2007)
18. Rabanal, P., Rodríguez, I., Rubio, F.: Finding minimum spanning/ distances trees by using river formation dynamics. In: Dorigo, M., Birattari, M., Blum, C., Clerc, M., Stützle, T., Winfield, A.F.T. (eds.) ANTS 2008. LNCS, vol. 5217, pp. 60-71. Springer, Heidelberg (2008)
19. Reinelt, G.: TSPLIB 95. Research Report, Institut für Angewandte Mathematik, Universität Heidelberg, Heidelberg, Germany. Tech. rep. (1995), http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/
20. Rodríguez, I., Merayo, M., Núẽz, M.: HOTL: Hypotheses and observations testing logic. Journal of Logic and Algebraic Programming 74, 57-93 (2008).