Development of a Framework for Genetic Algorithms

Abstract: Genetic algorithms is a method of optimization that can be used tosolve many different kinds of problems. This thesis focuses ondeveloping a framework for genetic algorithms that is capable ofsolving at least the two problems explored in the work. Otherproblems are supported by allowing user-made extensions.The purpose of this thesis is to explore the possibilities of geneticalgorithms for optimization problems and artificial intelligenceapplications.To test the framework two applications are developed that look attwo distinct problems, both of which aim at demonstrating differentparts. The first problem is the so called Travelling SalesmanProblem. The second problem is a kind of artificial life simulator,where two groups of creatures, designated predator and prey, aretrying to survive.The application for the Travelling Salesman Problem measures theperformance of the framework by solving such problems usingdifferent settings. The creature simulator on the other hand is apractical application of a different aspect of the framework, wherethe results are compared against predefined data. The purpose is tosee whether the framework can be used to create useful data forthe creatures.The work showed how important a detailed design is. When thework began on the demonstration applications, things were noticedthat needed changing inside the framework. This led to redesigningparts of the framework to support the missing details. A conclusionfrom this is that being more thorough in the planning, andconsidering the possible use cases could have helped avoid thissituation.The results from the simulations showed that the framework iscapable of solving the specified problems, but the performance isnot the best. The framework can be used to solve arbitrary problemsby user-created extensions quite easily.