Advertisement

Finding Minimum Spanning/Distances Trees by Using River Formation Dynamics

  • Pablo Rabanal
  • Ismael Rodríguez
  • Fernando Rubio
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5217)

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.

Keywords

Short Path Destination Node Minimum Span Tree Travel Salesman Problem Travel Salesman Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    Dorigo, M.: Ant Colony Optimization. MIT Press, Cambridge (2004)zbMATHGoogle Scholar
  3. 3.
    Dorigo, M., Gambardella, L.: Ant colonies for the traveling salesman problem. BioSystems 43(2), 73–81 (1997)CrossRefGoogle Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    Gutin, G., Punnen, A.: The Traveling Salesman Problem and Its Variations. Kluwer, Dordrecht (2002)zbMATHGoogle Scholar
  6. 6.
    Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)zbMATHGoogle Scholar
  7. 7.
    Rabanal, P., Rodríguez, I., Rubio, F.: MDV and MSV NP-completeness proof (2008), http://kimba.mat.ucm.es/~fernando/mdvmsv.pdf
  8. 8.
    Kirkpatrick Jr., S., Gelatt, C.D., Vecchi, M.: Optimization by Simulated Annealing. Science 220(4598), 671 (1983)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Fleischer, M.: Simulated annealing: past, present, and future. In: Proceedings of the 27th conference on Winter simulation, pp. 155–161 (1995)Google Scholar
  10. 10.
    Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines: A survey. Proceedings of the IEEE 84(8), 1090–1123 (1996)CrossRefGoogle Scholar
  11. 11.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Pablo Rabanal
    • 1
  • Ismael Rodríguez
    • 1
  • Fernando Rubio
    • 1
  1. 1.Dept. Sistemas Informáticos y ComputaciónFacultad de Informática Universidad Complutense de MadridMadridSpain

Personalised recommendations