Simulated annealing: past, present, and future
WSC '95 Proceedings of the 27th conference on Winter simulation
Ant Colony Optimization
An ant-based algorithm for finding degree-constrained minimum spanning tree
Proceedings of the 8th annual conference on Genetic and evolutionary computation
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
Using river formation dynamics to design heuristic algorithms
UC'07 Proceedings of the 6th international conference on Unconventional Computation
Applying Evolutionary Computation Methods to Formal Testing and Model Checking
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Applying Evolutionary Techniques to Debug Functional Programs
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient 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
An ACO-RFD hybrid method to solve NP-complete problems
Frontiers of Computer Science: Selected Publications from Chinese Universities
Smart data packet ad hoc routing protocol
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
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 solutionsare given in the form of decreasingaltitudes. We apply this method to solve two NP-complete problems, namely the problems of finding a minimum distances treeand finding a minimum spanning treein 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.