Federico Pagnozzi and Thomas Stützle (September 2019)
|
Table of Contents |
Automatic design of stochastic local search (SLS) algorithms has been shown to be very effective in generating algorithms for the permutation flowshop problem for the most studied objectives including makespan, flowtime and total tardiness. The automatic design system employed, uses an automatic configuration tool to combine algorithmic components following a set of rules defined as a context free grammar. In this paper we use the same system to tackle two of the most studied additional constraints for these objectives: sequence dependent setup times and no-idle. Additional components have been added to adapt the system to the new problems while keeping intact the grammar structure and the experimental setup. The experiments show that the generated algorithms outperforms the state of the art in each case.
Supplementary Material (code and configurations)