DocumentCode :
3296107
Title :
Solving Dynamic TSP by Using River Formation Dynamics
Author :
Rabanal, Pablo ; Rodriguez, I. ; Rubio, Fernando
Author_Institution :
Dept. Sist. Informaticos y Comput. Fac. de Inf., Univ. Complutense de Madrid, Madrid
Volume :
1
fYear :
2008
fDate :
18-20 Oct. 2008
Firstpage :
246
Lastpage :
250
Abstract :
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).
Keywords :
travelling salesman problems; ant colony optimization; dynamic travelling salesman problems; heuristic optimization algorithm; river formation dynamics; Ant colony optimization; Costs; Decision making; Heuristic algorithms; NP-complete problem; NP-hard problem; Rivers; Routing; Sediments; Traveling salesman problems; Ant Colony Optimization algorithms; Dynamic Traveling Salesman problem; Heuristic algorithms; Nature-based algorithms;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Natural Computation, 2008. ICNC '08. Fourth International Conference on
Conference_Location :
Jinan
Print_ISBN :
978-0-7695-3304-9
Type :
conf
DOI :
10.1109/ICNC.2008.760
Filename :
4666848
Link To Document :
بازگشت