Optimalizace pomocí kolonií mravenců

Abstract

This diploma thesis is focused on optimization of the alphabet for compression of text data using optimization using ant colonies. First describes the types of ant algorithms with subsequent implementation. The thesis includes the testing of ant algorithms on the travelling salesman problem and division of compression algorithms with focus on LZW algorithm. At the end is experiment comparing the results of the optimization of the alphabet.