Benchmarking algorithms for dynamic travelling salesman problems

Proceedings of the 2004 Congress on Evolutionary Computation, CEC2004

Volumn 2, Issue , 2004, Pages 1286-1292

  Kang, Lishan ^a,b   Zhou, Aimin ^b   McKay, Bob ^c   Li, Yan ^a,b   Kang, Zhuo ^b  

^a CHINA UNIVERSITY OF GEOSCIENCES   (China)

^b WUHAN UNIVERSITY   (China)

^c UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL RESOURCES; DYNAMIC INVER-OVER EVOLUTIONARY ALGORITHM (DIOEA); DYNAMIC OPTIMIZATION PROBLEMS; PROBLEM COMPLEXITY;

BENCHMARKING; COMPUTATIONAL METHODS; EVOLUTIONARY ALGORITHMS; MATHEMATICAL MODELS; MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING;

TRAVELING SALESMAN PROBLEM;

EID: 4344707895     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Airborne Communications Node at DARPA. www.darpa.mil/ato/programs/acn.htm.
2. J.Branke. Evolutionary Optimization in Dynamic Environments.Norwell:Kluwer Academic Publishers,2002.
3. D.W.Corne, M.J.Oates and G.D.Smith eds. Telecommunications Optimization: Heuristic and Adaptive Techniques. Chichester:John Wiley&Sons LTD,2000.
4. L.S.Kang, Y.Xie, S.Y.You,etc. Nonnumerical Parallel Algorithms:Simulated Annealing Algorithm. Being:Science Press,1997.
5. M.Milenkovic, S.H.Robinson, R.C.Knauerbase, etc. Toward Internet Distributed Computing. Computer,36(5),pp.38 46,2003.
6. D.Saba and A.Mukberje. Pervasive Computing:A Paradigm for the 21th Century. Computer,36(3),pp.25 31,2003.
7. Y.C.Tseng, C.C.Shen and W.T.Chen. Integrating Mobile IP with Ad Hoc Networks. Computer,36(5),pp.48 55,2003.
8. A.M.Zhou, L.S.Kang and Z.Y.Yan. Solving Dynamic TSP with Evolutionary Approach in Real Time. Proceedings of the Congress on Evolutionary Computation, Canberra, Austrilia, 8-12, December 2003, IEEE Press, 951-957,2003
9. C.J.Eyckelhof. Ant System for Dynamic Problem, the TSP Case - Ant Canght in a Traffic Jam. Master's thesis, Unversity of Twente, the Netherlands, August, 2001. (http://www.eyckelhof.nl)
10. M.Guntsch, J.Branke, M.Middendorf and H.Schmeck. ACO Strategies for Dynamic TSP. In M.Dorrigo et al.,editor, Abstract Proceedings of ANTS'2000, 59-62, 2000.
11. M.Guntsch and M.Middendorf. Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP. in Applications of Evolutionary Computing, Lecture Notes in Computer Science, Vol.2037, 213-220, 2001
12. M.Guntsch, M.Middendorf and H.Schmeck. An Ant Colony Optimization Approach to Dynamic TSP. Proceedings of the GECCO 2001. San Francisco, USA, 7-11 July, 2001, Morgan Kaufmann, 860-867, 2001.
13. G.Ausiello, E.Feuestein, S.Leonardi, L.Stougie, and M.Talamo. Algorithms for the On-line Traveling Salesman. Algorithmica, Vol. 29, No.4, 560-581, 2001.
14. W.Power, P.Jaillet and A.Odoni. Stochastic and Dynamic Networks and Routing. Network Rougting, M.Ball, T.Maganti, C. Monma and G.Namhauser(eds.). North-Holland, Amsterdam, 1995.
15. H.N.Psaraftis. Dynamic Vehicle Routing Problems. In Vehicle Routing: Methods and Studies, B.L.Golen and A.A.Assad(eds.), elsevier Science Publishers, 223-248, 1988
16. T. Guo and Z. Michalewicz, Evolutionary Algorithm for the TSP. In Parallel Problem Solving from Nature(PPSN V), Springer, Berlin, 803-812, 1998.