2007 | OriginalPaper | Buchkapitel
Using River Formation Dynamics to Design Heuristic Algorithms
verfasst von : Pablo Rabanal, Ismael Rodríguez, Fernando Rubio
Erschienen in: Unconventional Computation
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Finding the optimal solution to NP-hard problems requires at least exponential time. Thus, heuristic methods are usually applied to obtain
acceptable
solutions to this kind of problems. In this paper we propose a new type of heuristic algorithms to solve this kind of complex problems. Our algorithm is based on river formation dynamics and provides some advantages over other heuristic methods, like ant colony optimization methods. We present our basic scheme and we illustrate its usefulness applying it to a concrete example: The Traveling Salesman Problem.