Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools
DOI10.1016/J.COR.2014.05.020zbMATH Open1348.68230OpenAlexW2134343654MaRDI QIDQ337131FDOQ337131
Authors: Franco Mascia, Manuel López-Ibáñez, Jérémie Dubois-Lacoste, Thomas Stützle 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.05.020
Recommendations
- Automatic generation of algorithms for robust optimisation problems using grammar-guided genetic programming
- A local search algorithm for grammatical inference
- A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)
- Publication:3484386
- From fitness landscapes evolution to automatic local search algorithm generation
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Paramils: an automatic algorithm configuration framework
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal two- and three-stage production schedules with set-up time included
- Title not available (Why is that?)
- The Complexity of Flowshop and Jobshop Scheduling
- Minimizing Total Tardiness on One Machine is NP-Hard
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
- Tuning metaheuristics. A machine learning Perspective
- Benchmarks for basic scheduling problems
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Lower bounds and reduction procedures for the bin packing problem
- A review and evaluation of multiobjective algorithms for the flowshop scheduling problem
- The Sequential Parameter Optimization Toolbox
- Title not available (Why is that?)
Cited In (7)
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Automatic algorithm design for hybrid flowshop scheduling problems
- Automatic generation of algorithms for robust optimisation problems using grammar-guided genetic programming
- Evaluating the impact of grammar complexity in automatic algorithm design
- Generating meta-heuristic optimization code using ADATE
- Representative scenario construction and preprocessing for robust combinatorial optimization problems
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
Uses Software
This page was built for publication: Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337131)
