Abstract

This work describes basic features of genetic algorithms and their application in NP-hard problems solving. The work gives explanation of their principles and programming processes. In order to show genetic algorithm run, the work includes Java applet to allow users modify and experiment on algorithm settings. Program solves several problems, these are knapsack problem, travelling salesman problem, boolean satisfiability problem and function maximization problem. All these problems are described in more detail in the text. The work also includes tests, which aims to compare different settings of parameters of genetic algorithm. These tests were performed with help of demonstrational program and the results summary is in the further text.