Analysis of Optimal Recombination in Genetic Algorithm for a Scheduling Problem with Setups
Eremeev, A. V. · Kovalenko, Ju. V.
Original · EN
In this paper, we perform an experimental study of optimal recombination operator for makespan minimization problem on single machine with sequence-dependent setup times (1|svu|C). The computational experiment on benchmark problems from TSPLIB library indicates practical applicability of optimal recombination in crossover operator of genetic algorithm for 1|svu|C.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.