Aplikace hybridního evolučního algoritmu pro kombinatorické optimalizační problémy s omezeními

Abstract

The goal of this thesis is hybridization of evolutioanary algorythms. For the purpose of this thesis there have been chosen three algorythms that are widdely used in practice. For their hy- bridization there have been used two local search algorithms Tabu-mechanism improved iterated greedy and Enhanced self adaptive iterated local search with pertrubation . The solved com- binatorial problem was flowshop with blocking. Specificaly the test have been done on Taillars data files