Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems with additional constraints

Automatic design of stochastic local search 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 uses a configuration tool to combine...

Full description

Saved in:

Bibliographic Details
Published in:	Operations Research Perspectives Vol. 8; pp. 1 - 17
Main Authors:	Pagnozzi, Federico, Stützle, Thomas G
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier 2021 Elsevier Ltd
Subjects:	Automatic algorithm design Combinatorial optimization No-idle Permutation flowshop problem Sequence dependent setup times Stochastic local search algorithms Sequence dependent setup times Permutation flowshop problem Stochastic local search algorithms No-idle Combinatorial optimization Automatic algorithm design
ISSN:	2214-7160, 2214-7160
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	Automatic design of stochastic local search 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 uses a 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 constraint. 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 outperform the state of the art in each case.
ISSN:	2214-7160 2214-7160
DOI:	10.1016/j.orp.2021.100180