Applying river formation dynamics to solve NP-complete problems

25Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

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). © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Rabanal, P., Rodríguez, I., & Rubio, F. (2009). Applying river formation dynamics to solve NP-complete problems. Studies in Computational Intelligence, 193, 333–368. https://doi.org/10.1007/978-3-642-00267-0_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free