Hybrid Evolutionary Algorithm with Optimized Operators for Scheduling on Permutations

Yulia Zakharova

Keywords: evolution, optimal recombination, adaptation, scheduling

Abstract: New evolutionary algorithm with optimized operators is proposed for a scheduling problem on permutations. The optimal recombination problem is solved in a crossover operator. The computational complexity of this problem is analysed. Adaptive mutation and local search heuristics are integrated in our algorithm. We construct the initial population by means of greedy constructive heuristics. A computational experiment on the OR-Library instances shows that the proposed algorithm yields results competitive to those of well-known algorithms and confirms that the optimal recombination may be used successfully in evolutionary algorithms.

Submission Number: 4