I am currently working through the Computational Intelligence: An Introductionbook by Andries Engelbrecht.
I forked a simple implementation of a genetic algorithm trying to solve a path planning problem from path a to b.
I have previously completed the graph search chapters in Russel and Norvig's AIMA book.
I was curious to know if their have been any graph search variants for a genetic algorithm that like DFS or BFS keeps track of paths visited and then influences the fitness function or the generation of a new population.
From a novice's point of view it seems that the GA wastes search time by visiting states repeatedly.
Is anyone familiar with such a variant? I have been unable to find anything available on the web.