Simulated annealing: past, present, and future
WSC '95 Proceedings of the 27th conference on Winter simulation
Lindenmayer Systems: Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology
Ant Colony Optimization
Practical Genetic Algorithms with CD-ROM
Practical Genetic Algorithms with CD-ROM
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Finding Minimum Spanning/Distances Trees by Using River Formation Dynamics
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
Testing Restorable Systems by Using RFD
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
A Formal Approach to Heuristically Test Restorable Systems
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Hybridizing river formation dynamics and ant colony optimization
ECAL'09 Proceedings of the 10th European conference on Advances in artificial life: Darwin meets von Neumann - Volume Part II
A preliminary general testing method based on genetic algorithms
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II
Wisdom of artificial crowds algorithm for solving NP-hard problems
International Journal of Bio-Inspired Computation
Proceedings of the 28th Annual ACM Symposium on Applied Computing
An ACO-RFD hybrid method to solve NP-complete problems
Frontiers of Computer Science: Selected Publications from Chinese Universities
CAPSO: Centripetal accelerated particle swarm optimization
Information Sciences: an International Journal
Smart data packet ad hoc routing protocol
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
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.