Memory-based CHC algorithms for the dynamic Traveling Salesman Problem

Genetic and Evolutionary Computation Conference, GECCO'11

Volumn , Issue , 2011, Pages 1037-1044

  Simões, Anabela ^a   Costa, Ernesto ^b  

^a POLYTECHNIC INSTITUTE OF COIMBRA   (Portugal)

^b UNIVERSITY OF COIMBRA   (Portugal)

Author keywords

Dynamic environments; Evolutionary algorithms; Memory

Indexed keywords

CHC ALGORITHM; DYNAMIC ENVIRONMENTS; DYNAMIC OPTIMIZATION PROBLEMS; DYNAMIC TRAVELING SALESMAN PROBLEMS; ENVIRONMENTAL CHANGE; MEMORY; MEMORY SCHEMES; POPULATION DIVERSITY; RANDOM ENVIRONMENT; SELECTION METHODS; STATIC OPTIMIZATION;

PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

EVOLUTIONARY ALGORITHMS;

EID: 84860422780     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2001576.2001717     Document Type: Conference Paper

References (24)

1. S. Baluja. Population-Based Incremental Learning: a method for integrating genetic search based function optimization and competitive learning. Technical Report TR CMU-CS-94-163, Carnegie Mellon University, 1994.
2. J. Branke. Memory Enhanced Evolutionary Algorithms for Changing Optimization Problems. In Proceedings of the IEEE Congress on Evolutionary Computation, pages 1875-1882. IEEE Press, 1999.
3. J. Branke, T. KauBler, C. Schmidt. A Multi-Population Approach to Dynamic Optimization Problems. In I. Parmee (ed), Proceedin gs of Adaptive Computing in Design and Manufacture, pages 299-308. Springer-Verlag, 2000.
4. C. Li, M. Yang, L. Kang. A New Approach to Solving Dynamic Traveling Salesman Problems. In Wang, T.-D. and et al. (eds), Proceedings of 6th International Conference on Simulated Evolution and Learning, pages 236-243, LNCS 4247. Springer, 2006. (Pubitemid 44812344)
5. H. G. Cobb. An Investigation into the Use of Hypermutation as an Adaptive Operator in Genetic Algorithms having Continuous, Time-Dependent Nonstationary Environments. TR AIC-90-001, Naval Research Laboratory, 1990.
6. L. J. Eshelman. The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination. In Gregory J. E. Rawlins (ed), Foundations of Genetic Algorithms I, pages 265-283. Morgan Kaufmann, 1991.
7. M. Guntsch, M. Middendorf. A Population Based Approach for ACO, In S. Cagnoni and et al. (eds), editors, Applications of Evolutionary Computing, LNCS 2279, pages 72-81. Springer-Verlag, 2002.
8. A. Karaman, S. Uyar, G. Eryigit. The Memory Indexing Evolutionary Algorithm for Dynamic Environments. In Applications of Evolutionary Computing, LNCS 3449, pages 563-573. Springer-Verlag, 2005. (Pubitemid 41273973)
9. L. Liu, D. Wang, S. Yang. An Immune System Based Genetic Algorithm Using Permutation-Based Dualism for Dynamic Traveling Salesman Problems. In M. Giacobini and et al. (eds), Applications of Evolutionary Computing, LNCS 5484, pages 725-734. Springer-Verlag, 2009.
10. H. N. Psaraftis. Dynamic Vehicle Routing Problems. In B. L. Golden and A. A. Assad (eds), Vehicle Routing: Methods and Studies, pages 223-248. Elsevier, 1988.
11. G. Reinelt. TSPLIB. University of Heidelberg. http://comopt.ifi.uni- heidelberg.de/software/TSPLIB95/, 1995.
12. A. Simões, E. Costa. Prediction in Evolutionary Algorithms for Dynamic Environments using Markov Chains and Nonlinear Regression. In Proc. of the 11th Int. Genetic and Evolutionary Computation Conference, pages 883-890. ACM Press, 2009.
13. A. Simões, E. Costa. CHC-based Algorithms for the Dynamic Traveling Salesman Problem. In C. Di Chio et al. (eds.), EvoApplications 2011, Part I, LNCS 6624, pages 354-363. Springer-Verlag, 2011.
14. A. S. Uyar, A. E. Harmanci. A New Population Based Adaptive Dominance Change Mechanism for Diploid Genetic Algorithms in Dynamic Environments. Soft Computing, 9(11): 803-814, Springer, 2005. (Pubitemid 43012780)
15. D. Wang, S. Liu. An Agent-based Evolutionary Search for Dynamic Traveling Salesman Problem. In International Conference on Information Engineering, pages 111-114. IEEE Press, 2010.
16. D. Whitley, S. Rana, J. Dzubera, E. Mathias. Evaluating Evolutionary Algorithms. Artificial Intelligence, Number 85, pages 245-276, 1996. (Pubitemid 126363731)
17. X-S. Yan, H-M. Liu, J. Yan, Q-H. Wu. A Fast Evolutionary Algorithm for Traveling Salesman Problem. In Proceedings of the 3rd International Conference on Natural Computation, pages 85-90. IEEE Press, 2007.
18. S. Yang. Memory-based Immigrants for Genetic Algorithms in Dynamic Environments. In Hans-Georg Beyer (ed). Proceedings of the Seventh International Genetic and Evolutionary Computation Conference, pages 1115-1122. ACM Press, 2005. (Pubitemid 43226422)
19. S. Yang. Population-based Incremental Learning with Memory Scheme for Changing Environments. In Hans-Georg Beyer (ed). Proceedings of the Seventh International Genetic and Evolutionary Computation Conference, pages 711-718. ACM Press, 2005. (Pubitemid 43226364)
20. S. Yang. Explicit Memory Schemes for Evolutionary Algorithms in Dynamic Environments. In S. Yang et al. (eds). Evolutionary Computation in Dynamic and Uncertain Environments, pages 3-28. Springer-Verlag, 2007.
21. S. Yang. GAs with Elitism-based Immigrants for Changing Optimization Problems. In M. Giacobini et al. (eds). Applications of Evolutionary Computing, LNCS 4448, pages 627-636. Springer-Verlag, 2007. (Pubitemid 47290121)
22. S. Yang. Genetic algorithms with memory- and elitism-based immigrants in dynamic environments. Evolutionary Computation, 3(16): 385-416, MIT Press, 2008.
23. A. Younes, O. Basir, P. Calamai. A Benchmark Generator for Dynamic Optimization. In Proceedings of the 3rd Int. Conf. on Soft Computing, Optimization, Simulation & Manufacturing Systems, 2003.
24. A. Zhou, L. Kang, Z. Yan. Solving DTSP with Evolutionary Approach in Real Time. Proceedings of the 2003 IEEE Congress on Evolutionary Computation, pages 951-957. IEEE, 2003.