Metaheuristic optimization frameworks: a survey and benchmarking

  title={Metaheuristic optimization frameworks: a survey and benchmarking},
  author={Jos{\'e} Antonio Parejo and Antonio Ruiz Cort{\'e}s and Sebasti{\'a}n Lozano and Pablo Fern{\'a}ndez},
  journal={Soft Computing},
This paper performs an unprecedented comparative study of Metaheuristic optimization frameworks. As criteria for comparison a set of 271 features grouped in 30 characteristics and 6 areas has been selected. These features include the different metaheuristic techniques covered, mechanisms for solution encoding, constraint handling, neighborhood specification, hybridization, parallel and distributed computation, software engineering best practices, documentation and user interface, etc. A metric… 
MOSES: A Metaheuristic Optimization Software EcoSystem
A set of tools to support the selection, configuration and evaluation of metaheuristic-based applications is presented to reduce the cost of applying metaheuristics for solving optimization problems.
How Does the Number of Objective Function Evaluations Impact Our Understanding of Metaheuristics Behavior?
The effect of a raised evaluation budget on overall performance, mean convergence, and population diversity of selected swarm algorithms and IEEE CEC competition winners is examined.
An Extensible JCLEC-based Solution for the Implementation of Multi-Objective Evolutionary Algorithms
A number of relevant features serving to satisfy the requirements demanded by MOO nowadays are identified, and a solution is proposed, called JcleC-MOEA, on the basis of the JCLEC framework, designed with a twofold purpose: reusing all the features already given by a mature framework like J CLEC and extending it to enable new developments more flexibly than current alternatives.
Combinatorial Optimization Problems and Metaheuristics: Review, Challenges, Design, and Development
This study discusses the main concepts and challenges in this area and proposes a formalism to classify, design, and code combinatorial optimization problems and metaheuristics that may support the progress of the field and increase the maturity of meta heuristics as problem solvers analogous to other machine learning algorithms.
Metaheuristics "In the Large"
Nature inspired meta heuristic algorithms for optimization problems
This work’s major contribution is on building a hyper heuristics approach from a meta-heuristic algorithm for any general problem domain.
A Walk into Metaheuristics for Engineering Optimization: Principles, Methods and Recent Trends
The principles and the state-of-the-art of metaheuristic methods for engineering optimization, both the classic and emerging approaches to optimization using metaheuristics are reviewed and analyzed.


Metaheuristics for Hard Optimization: Methods and Case Studies
Some extensions of metaheuristics for continuous optimization, multimodal optimization, multiobjective optimization and contrained evolutionary optimization are described and some of the existing techniques and some ways of research are presented.
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
The proof-of-principle results obtained on two artificial problems as well as a larger problem, the synthesis of a digital hardware-software multiprocessor system, suggest that SPEA can be very effective in sampling from along the entire Pareto-optimal front and distributing the generated solutions over the tradeoff surface.
Hyperheuristics: Recent Developments
A wide range of modern heuristics known from the literature are specifically designed and tuned to solve certain classes of optimisation problems, which are based on the partial search of the solution space and often referred as metaheuristics.
FOM: A Framework for Metaheuristic Optimization
FOM, an object-oriented framework for meta heuristic optimization to be used as a general tool for the development and the implementation of metaheuristic algorithms, is introduced and discussed.
The Pareto Envelope-Based Selection Algorithm for Multi-objective Optimisation
We introduce a new multiobjective evolutionary algorithm called PESA (the Pareto Envelope-based Selection Algorithm), in which selection and diversity maintenance are controlled via a simple
SPEA2: Improving the strength pareto evolutionary algorithm
An improved version of SPEA, namely SPEA2, is proposed, which incorporates in contrast to its predecessor a fine-grained fitness assignment strategy, a density estimation technique, and an enhanced archive truncation method.
A Unified View on Hybrid Metaheuristics
  • G. Raidl
  • Computer Science
    Hybrid Metaheuristics
  • 2006
This article overviews several popular hybridization approaches and classifies them based on various characteristics, including a unified view based on a common pool template for low-level hybrids of different metaheuristics.
MOSA method: a tool for solving multiobjective combinatorial optimization problems
The success of modern heuristics (Simulated Annealing (S.A.), Tabu Search, Genetic Algorithms, …) in solving classical combinatorial optimization problems has drawn the attention of the research
The EvA2 Optimization Framework
We present EvA2, a comprehensive metaheuristic optimization framework with emphasis on Evolutionary Algorithms. It presents a modular structure of interfaces and abstract classes for the
A Taxonomy of Hybrid Metaheuristics
  • E. Talbi
  • Computer Science
    J. Heuristics
  • 2002
A taxonomy of hybrid metaheuristics is presented in an attempt to provide a common terminology and classification mechanisms and is also applicable to most types of heuristics and exact optimization algorithms.