Several different ways exist for approaching hard optimization problems. Mathematical
programming techniques, including (integer) linear programming based methods, and …

This article presents a review and a comparative analysis between frameworks for solving
optimization problems using metaheuristics. The aim is to identify both the desirable …

Problems with multiple objectives arise in a natural fashion in most disciplines and their
solution has been a challenge to researchers for a long time. Despite the considerable …

Research in exact algorithms, heuristics and metaheuristics for solving combinatorial
optimization problems is nowadays highly on the rise. The main advantage of using exact …

Structured parallel programs ought to be conceived as two separate and complementary
entities: computation, which expresses the calculations in a procedural manner, and …

In this paper, we present the ParadisEO white-box object-oriented framework dedicated to
the reusable design of parallel and distributed metaheuristics (PDM). ParadisEO provides a …

The interest about hybrid optimization methods has grown for the last few years. Indeed,
more and more papers about cooperation between heuristics and exact techniques are …

In this work we compare the use of a particle swarm optimization (PSO) and a genetic
algorithm (GA)(both augmented with support vector machines SVM) for the classification of …

This authoritative handbook reveals the connections between bioinspired techniques and
the development of solutions to problems that arise in diverse problem domains. It provides …

In the beginning of the twenty-first century, large unsolved combinatorial optimization
problems have been solved exactly. Two impressive cases should be mentioned. First are …