Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools

DOI10.1016/j.cor.2014.05.020zbMath1348.68230OpenAlexW2134343654MaRDI QIDQ337131

Jérémie Dubois-Lacoste, Manuel López-Ibáñez, Franco Mascia, 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

heuristicsflowshop schedulingbin packingautomatic algorithm configurationgrammatical evolution

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Automatic generation of algorithms for robust optimisation problems using grammar-guided genetic programming ⋮ Evaluating the impact of grammar complexity in automatic algorithm design ⋮ Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems ⋮ Machine learning for combinatorial optimization: a methodological tour d'horizon ⋮ Automatic algorithm design for hybrid flowshop scheduling problems ⋮ Representative scenario construction and preprocessing for robust combinatorial optimization problems

Uses Software

• SPOT
• irace
• SMAC

Cites Work

• A hybrid TP+PLS algorithm for bi-objective flow-shop 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
• Tuning metaheuristics. A machine learning Perspective
• Benchmarks for basic scheduling problems
• Optimal two- and three-stage production schedules with setup times included
• A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem
• The Sequential Parameter Optimization Toolbox
• Minimizing Total Tardiness on One Machine is NP-Hard
• ParamILS: An Automatic Algorithm Configuration Framework
• The Complexity of Flowshop and Jobshop Scheduling
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item