From Grammars to Parameters: Automatic Iterated Greedy Design for the Permutation Flow-Shop Problem with Weighted Tardiness

@inproceedings{Mascia2013FromGT,
  title={From Grammars to Parameters: Automatic Iterated Greedy Design for the Permutation Flow-Shop Problem with Weighted Tardiness},
  author={Franco Mascia and Manuel L{\'o}pez-Ib{\'a}{\~n}ez and J{\'e}r{\'e}mie Dubois-Lacoste and Thomas St{\"u}tzle},
  booktitle={LION},
  year={2013}
}
Recent advances in automatic algorithm configuration have made it possible to configure very flexible algorithmic frameworks in order to fine-tune them for particular problems. This is often done by the use of automatic methods to set the values of algorithm parameters. A rather different approach uses grammatical evolution, where the possible algorithms are implicitly defined by a context-free grammar. Possible algorithms may then be instantiated by repeated applications of the rules in the… 
Automatic Design of Heuristics for Minimizing the Makespan in Permutation Flow Shops
  • Artur Brum, Marcus Ritt
  • Business, Computer Science
    2018 IEEE Congress on Evolutionary Computation (CEC)
  • 2018
TLDR
This paper study the application of automatic algorithm configuration to the permutation flow shop scheduling problem with makespan minimization using a grammar to determine how to combine individual algorithmic components into an iterated local search, coupled with a parametric representation for the instantiations of such a grammar.
Automatic Grammar-Based Design of Heuristic Algorithms for Unconstrained Binary Quadratic Programming
TLDR
A grammar-based approach to the automatic design of heuristics and apply it to binary quadratic programming that can find algorithms which perform better than or comparable to state-of-the-art methods, and can even find new best solutions for some instances of standard benchmark sets.
A Study of the Automatic Design of Heuristics for Binary Quadratic Programming
TLDR
This paper proposes a grammar that can generate eight heuristic algorithms based on local search, tabu search, and constructive approaches, which includes the parameters of these methods, and proposes an iterated F-race to find the best instantiation of the proposed grammar.
Automatic Design of Hybrid Stochastic Local Search Algorithms
TLDR
The method presented in this work implements a general local search structure as a grammar; an instantiation of such a grammar is a program that can be compiled into executable form and is able to generate powerful hybrid SLS algorithms.
Automatic Algorithm Configuration for the Permutation Flow Shop Scheduling Problem Minimizing Total Completion Time
TLDR
This work addresses the permutation flow shop scheduling problem minimizing total completion time with a context-free grammar that defines how algorithmic components can be combined to form a full heuristic search method.
Algorithm Comparison by Automatically Configurable Stochastic Local Search Frameworks: A Case Study Using Flow-Shop Scheduling Problems
TLDR
This paper studies the generation of hybrid SLS algorithms versus selecting one classical SLS method among several by means of tools for automatic algorithm design, and indicates that the hybrid algorithms instantiate are able to match and improve over the best classical S LS method.
Using iterated local search for solving the flow-shop problem: Parallelization, parametrization, and randomization issues
TLDR
The new ILS-ESP (where ESP is efficient, simple, and parallelizable) algorithm is introduced that is specifically designed to take advantage of parallel computing, allowing for competitive results in “real time” for all tested instances.
Automatic Design of a Hybrid Iterated Local Search for the Multi-Mode Resource-Constrained Multi-Project Scheduling Problem
TLDR
This paper details the submission to the MISTA 2013 challenge, which deals with the multi-mode resource-constrained multi-project scheduling problem (MRCMPSP), and uses a recent automatic method to combine a description of the space of potentially valid algorithms for a problem and a method for searching the best algorithm by instantiating algorithms from this grammar.
...
1
2
3
4
...

References

SHOWING 1-10 OF 14 REFERENCES
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
On the automatic discovery of variants of the NEH procedure for flow shop scheduling using genetic programming
TLDR
The results indicate that the NEH variants discovered by genetic programming are superior to the original NEH and its stochastic version on most of the problems investigated.
Grammatical Evolution of Local Search Heuristics
TLDR
This paper presents a grammatical evolution methodology which automatically designs good quality local search heuristics that maintain their performance on new problem instances.
Grammar-based Genetic Programming: a survey
TLDR
This work surveys the various grammar-based formalisms that have been used in GP and discusses the contributions they have made to the progress of GP, showing how grammar formalisms contributed to the solutions of these problems.
The Automatic Design of Multi-Objective Ant Colony Optimization Algorithms
TLDR
The experimental results presented in this paper show that the automatically configured MOACO framework outperforms theMOACO algorithms that inspired the framework itself, and is among the first to apply automatic algorithm configuration techniques to multi-objective algorithms.
A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement
TLDR
This paper proposes two modifications to the usual way of applying F-Race that make it suitable for tuning tasks with a very large number of initial candidate parameter settings and allow a significant reduction of the number of function evaluations without any major loss in solution quality.
The Complexity of Flowshop and Jobshop Scheduling
TLDR
The results are strong in that they hold whether the problem size is measured by number of tasks, number of bits required to express the task lengths, or by the sum of thetask lengths.
Minimizing Total Tardiness on One Machine is NP-Hard
TLDR
The problem of minimizing the total tardiness for a set of independent jobs on one machine is considered and is shown to be NP-hard in the ordinary sense.
...
1
2
...