Automated guided vehicles (AGVs) form a large and important part of the logistic transport
systems in today's industry. They are used on a large scale, especially in Europe, for over a …

The field of metaheuristics for the application to combinatorial optimization problems is a
rapidly growing field of research. This is due to the importance of combinatorial optimization …

The key idea underlying iterated local search is to focus the search not on the full space of
all candidate solutions but on the solutions that are returned by some underlying algorithm …

The identification of performance-optimizing parameter settings is an important part of the
development and application of algorithms. We describe an automatic framework for this …

Ant colony optimization (ACO) is a metaheuristic approach to tackle hard combinatorial
optimization problems. The basic component of ACO is a probabilistic solution construction …

We deal with the application of ant colony optimization to group shop scheduling, which is a
general shop scheduling problem that includes, among others, the open shop scheduling …

In This work we present a particle swarm optimization algorithm to solve the single machine
total weighted tardiness problem. A heuristic rule, the smallest position value (SPV) rule, is …

In many real life settings, high quality solutions to hard optimization problems such as flight
scheduling or load balancing in telecommunication networks are required in a short amount …

The single machine total weighted tardiness problem with sequence-dependent setup times
(often known as problem) requires a given set of jobs to be sequenced on a single machine …

In this paper we present two recent metaheuristics, particle swarm optimization and
differential evolution algorithms, to solve the single machine total weighted tardiness …