An iterated greedy algorithm (IGA) is a simple and powerful heuristic algorithm. It is widely
used to solve flow-shop scheduling problems (FSPs), an important branch of production …

Hyper-heuristics have recently emerged as a powerful approach to automate the design of
heuristics for a number of different problems. Production scheduling is a particularly popular …

Genetic programming has been a powerful technique for automated design of production
scheduling heuristics. Many studies have shown that heuristics evolved by genetic …

Simulated Annealing (SA) is one of the oldest metaheuristics and has been adapted to solve
many combinatorial optimization problems. Over the years, many authors have proposed …

We introduce AutoMoDe: a novel approach to the automatic design of control software for
robot swarms. The core idea in AutoMoDe recalls the approach commonly adopted in …

In this paper we address the non-permutation flow shop scheduling problem, a more
general variant of the flow shop problem in which the machines can have different …

Vehicle routing is a well-known optimization research topic with significant practical
importance. Among different approaches to solving vehicle routing, heuristics can produce a …

Stochastic local search methods are at the core of many effective heuristics for tackling
different permutation flowshop problems (PFSPs). Usually, such algorithms require a careful …

This paper proposes AutoGCOP, a new general framework for automated design of local
search algorithms. In a recently established General Combinatorial Optimisation Problem …

Several grammar-based genetic programming algorithms have been proposed in the
literature to automatically generate heuristics for hard optimization problems. These …