Augmenting Genetic Algorithms with Memory to Solve TravelingSalesman

  title={Augmenting Genetic Algorithms with Memory to Solve TravelingSalesman},
  author={ProblemsSushil and Joseph Salerno Saint Louis and K L Gong and LiDept},
This paper explores the feasibility of augmenting genetic algorithms with a long term memory. During a genetic algorithm run, we periodically store individuals in a database. When confronted with a new problem , instead of starting from scratch, we inject the solutions to previously solved similar problems (from the database) into the initial population of the genetic algorithm. We evaluate the performance of the genetic algorithm with such a long term memory on a set of benchmark traveling… CONTINUE READING
Highly Cited
This paper has 33 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 21 extracted citations

Ant Colony Optimization and Swarm Intelligence

Lecture Notes in Computer Science • 2004
View 10 Excerpts
Highly Influenced

A Refined Case Based Genetic Algorithm for Intelligent Route Optimization

2015 11th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS) • 2015
View 2 Excerpts

Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling

IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) • 2011
View 1 Excerpt


Publications referenced by this paper.

Similar Papers

Loading similar papers…