Flow-shop ütemezési feladatokat megoldó genetikus algoritmus mutáció operátorainak érzékenységvizsgálata

Abstract

The main goal of this scientific work is the sensitivity analysis of mutation operators of my own genetic algorithm (GA) for the permutation flow-shop scheduling problems (FSSP). This paper covers the comparison of the different mutation operators such as reciprocal exchange, simple inversion, swap and displacement used by the algorithm in function of the efficiency of the near optimal solutions. I analyze how the efficiency of the algorithm changes by some values of the mutation operators, I evaluate the obtained results and I search for relations that help to apply the GA more effectively and efficiently. The practical importance of my research results is to determine in what setting the mutation operators have to be used in order to supply near optimal solutions at the fastest possible time.