Example I: The Artificial Ant

In genetic algorithms, deception (i.e. false peaks in the fitness landscape) has long been recognised as an important barrier to performance however in genetic programming it has not received the recognition it deserves. In this and the next chapter we study two benchmark problems using the techniques described in the previous chapters. These show that deception is one of the reasons why these problems appear to be hard.