Abstract
River Formation Dynamics (RFD) is an heuristic method similar to Ant Colony Optimization (ACO). In fact, RFD can be seen as a gradient version of ACO, based on copying how water forms rivers by eroding the ground and depositing sediments. As water transforms the environment, altitudes of places are dynamically modified, and decreasing gradients are constructed. The gradients are followed by subsequent drops to create new gradients, reinforcing the best ones. By doing so, good solutions are given in the form of decreasing altitudes. We apply this method to solve two NP-complete problems, namely the problems of finding a minimum distances tree and finding a minimum spanning tree in a variable-cost graph. We show that the gradient orientation of RFD makes it specially suitable for solving these problems, and we compare our results with those given by ACO.
Research partially supported by projects TIN2006-15578-C02-01, PAC06-0008-6995, and MRTN-CT-2003-505121/TAROT.
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
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)
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)
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)
Gutin, G., Punnen, A.: The Traveling Salesman Problem and Its Variations. Kluwer, Dordrecht (2002)
Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)
Rabanal, P., Rodríguez, I., Rubio, F.: MDV and MSV NP-completeness proof (2008), http://kimba.mat.ucm.es/~fernando/mdvmsv.pdf
Kirkpatrick Jr., S., Gelatt, C.D., Vecchi, M.: Optimization by Simulated Annealing. Science 220(4598), 671 (1983)
Fleischer, M.: Simulated annealing: past, present, and future. In: Proceedings of the 27th conference on Winter simulation, pp. 155–161 (1995)
Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines: A survey. Proceedings of the IEEE 84(8), 1090–1123 (1996)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rabanal, P., Rodríguez, I., Rubio, F. (2008). 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) Ant Colony Optimization and Swarm Intelligence. ANTS 2008. Lecture Notes in Computer Science, vol 5217. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87527-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-87527-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87526-0
Online ISBN: 978-3-540-87527-7
eBook Packages: Computer ScienceComputer Science (R0)