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∣Cmax). The computational experiment on benchmark problems from TSPLIB library indicates practical applicability of optimal recombination in crossover operator of genetic algorithm for 1∣svu∣Cmax.
@article{arxiv.1412.5067,
title = {Analysis of Optimal Recombination in Genetic Algorithm for a Scheduling Problem with Setups},
author = {A. V. Eremeev and Ju. V. Kovalenko},
journal= {arXiv preprint arXiv:1412.5067},
year = {2014}
}