Chosen optimization methods for search data

This work deals with comparison and testing of chosen heuristic methods for searching minimum value. Chosen methods are local search method, hill climbing algorithm, tabu search method and simulated annealing method. For comparison algorithms of all selected heuristic method have been created application. Every method is possible to set to algorithm with different way, while method is keeping its principle. In most of cases, comparison method is possible to use on different number of values, for example for searching in one column in accurate range or in all columns in a same range. So in application was created nineteen different algorithms of chosen heuristic methods. Algorithms are used three types of databases: Continuous, Random and Similar Continuous. Effectiveness of algorithms for searching minimum sum of values from all columns of database is tested on these data. Progresses of the way of every algorithm are shown on the graph.