Abstract
For obvious practical reasons, NP-complete problems are typically solved by applying heuristic methods. In this regard, nature has inspired many heuristic algorithms to obtain reasonable solutions to complex problems. One of these algorithms is River Formation Dynamics (RFD). This heuristic optimization method is based on imitating how water forms rivers by eroding the ground and depositing sediments. After drops transform the landscape by increasing/decreasing the altitude of places, solutions are given in the form of paths of decreasing altitudes. Decreasing gradients are constructed, and these gradients are followed by subsequent drops to compose new gradients and reinforce the best ones. In this chapter, we apply RFD to solve three NP-complete problems, and we compare our results with those obtained by using Ant Colony Optimization (ACO).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)
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)
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)
Davis, L., et al.: Handbook of genetic algorithms. Van Nostrand Reinhold New York (1991)
Dorigo, M.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Dorigo, M., Gambardella, L.: Ant colonies for the traveling salesman problem. BioSystems 43(2), 73–81 (1997)
Dorigo, 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)
Fleischer, M.: Simulated annealing: past, present, and future. In: Proceedings of the 27th conference on Winter simulation, pp. 155–161 (1995)
Gutin, G., Punnen, A.: The Traveling Salesman Problem and Its Variations. Kluwer, Dordrecht (2002)
Jong, K.: Evolutionary computation: a unified approach. MIT Press, Cambridge (2006)
Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, Piscataway, NJ, pp. 1942–1948 (1995)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220, 671–680 (1983)
Langton, C.: Studying artificial life with cellular automata. Physica D 22, 120–149 (1986)
Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines: A survey. Proceedings of the IEEE 84(8), 1090–1123 (1996)
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)
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)
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)
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)
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/
Rodríguez, I., Merayo, M., Núñez, M.: HOTL: Hypotheses and observations testing logic. Journal of Logic and Algebraic Programming 74, 57–93 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Rabanal, P., Rodríguez, I., Rubio, F. (2009). Applying River Formation Dynamics to Solve NP-Complete Problems. In: Chiong, R. (eds) Nature-Inspired Algorithms for Optimisation. Studies in Computational Intelligence, vol 193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00267-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-00267-0_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00266-3
Online ISBN: 978-3-642-00267-0
eBook Packages: EngineeringEngineering (R0)