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

zbMATH Keywords

heuristicsbin packingflowshop schedulingautomatic algorithm configurationgrammatical evolution

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 5829047 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2048626 (Why is no real title available?)
• scientific article; zbMATH DE number 795587 (Why is no real title available?)
• A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
• A review and evaluation of multiobjective algorithms for the flowshop scheduling problem
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• Benchmarks for basic scheduling problems
• Lower bounds and reduction procedures for the bin packing problem
• Minimizing Total Tardiness on One Machine is NP-Hard
• Optimal two- and three-stage production schedules with set-up time included
• Paramils: an automatic algorithm configuration framework
• The Complexity of Flowshop and Jobshop Scheduling
• The Sequential Parameter Optimization Toolbox
• Tuning metaheuristics. A machine learning Perspective

Cited in

(8)

• Automatic generation of algorithms for robust optimisation problems using grammar-guided genetic programming
• Representative scenario construction and preprocessing for robust combinatorial optimization problems
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
• Generating meta-heuristic optimization code using ADATE
• Towards the design of heuristics by means of self-assembly
• Evaluating the impact of grammar complexity in automatic algorithm design
• Automatic algorithm design for hybrid flowshop scheduling problems

Describes a project that uses

Uses Software

• SPOT
• irace
• SMAC

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)