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 …

In this study, we review the covering problems in facility location. Here, besides a number of
reviews on covering problems, a comprehensive review of models, solutions and …

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 …

Swarm intelligence is a relatively new approach to problem solving that takes inspiration
from the social behaviors of insects and of other animals. In particular, ants have inspired a …

In the last 15 years, heuristics based on large neighborhood search (LNS) and the variant
adaptive large neighborhood search (ALNS) have become some of the most successful …

Multi-factory production planning and scheduling problems have been increasingly studied
by scholars recently due to market uncertainty, technological trends like Industry 4.0 and …

Stochastic local search (SLS) algorithms are among the most successful techniques for
solving computationally hard problems from computing science, operations research and …

Over the last decade, many metaheuristics have been applied to the flowshop scheduling
problem, ranging from Simulated Annealing or Tabu Search to complex hybrid techniques …

Metaheuristics are the most exciting development in approximate optimization techniques of
the last two decades. They have had widespread successes in attacking a variety of difficult …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …