Solving Dynamic TSP by Using River Formation Dynamics

River formation dynamics (RFD) is an heuristic optimization algorithm based on copying 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 al...

Full description

Saved in:
Bibliographic Details
Published in2008 Fourth International Conference on Natural Computation Vol. 1; pp. 246 - 250
Main Authors Rabanal, P., Rodriguez, I., Rubio, F.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2008
Subjects
Ant colony optimization
Ant Colony Optimization algorithms
Costs
Decision making
Dynamic Traveling Salesman problem
Heuristic algorithms
Nature-based algorithms
NP-complete problem
NP-hard problem
Rivers
Routing
Sediments
Traveling salesman problems
Online AccessGet full text
ISBN9780769533049
0769533043
ISSN2157-9555
DOI10.1109/ICNC.2008.760

Cover

More Information
Summary:River formation dynamics (RFD) is an heuristic optimization algorithm based on copying 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. We apply this method to solve dynamic TSP. We show that the gradient orientation of RFD makes it specially suitable for solving this problem, and we compare our results with those given by ant colony optimization (ACO).
ISBN:9780769533049
0769533043
ISSN:2157-9555
DOI:10.1109/ICNC.2008.760