Metaheuristic optimization frameworks: a survey and benchmarking

@article{Parejo2012MetaheuristicOF,
  title={Metaheuristic optimization frameworks: a survey and benchmarking},
  author={J. A. Parejo and A. R. Cort{\'e}s and S. Lozano and Pablo Fern{\'a}ndez},
  journal={Soft Computing},
  year={2012},
  volume={16},
  pages={527-561}
}
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… Expand
MOSES: A Metaheuristic Optimization Software EcoSystem
TLDR
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. Expand
How Does the Number of Objective Function Evaluations Impact Our Understanding of Metaheuristics Behavior?
TLDR
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. Expand
JCLEC-MO: A Java suite for solving many-objective optimization engineering problems
TLDR
JCLEC-MO is introduced, a Java framework for both multi- and many- objective optimization that enables engineers to apply, or adapt, a great number of multi-objective algorithms with little coding effort. Expand
An Extensible JCLEC-based Solution for the Implementation of Multi-Objective Evolutionary Algorithms
TLDR
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. Expand
HyperSpark: A Software Engineering Approach to Parallel Metaheuristics
TLDR
HyperSpark is proposed, a metaheuristic optimization framework for the scalable execution of user-defined, computationally-intensive metaheuristics for the Permutation Flow-Shop Problem (PFSP), and its efficiency and generality are evaluated. Expand
A survey on new generation metaheuristic algorithms
TLDR
In this survey, fourteen new and outstanding metaheuristics that have been introduced for the last twenty years other than the classical ones such as genetic, particle swarm, and tabu search are distinguished. Expand
Hybrid metaheuristics and multi-agent systems for solving optimization problems: A review of frameworks and a comparative analysis
TLDR
It can be said that there are important gaps to be filled in the development of Frameworks for Optimization using metaheuristics, which open important possibilities for future works, particularly by implementing the approach of multi-agent systems. Expand
ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
TLDR
This paper presents a general-purpose software framework dedicated to the design, the analysis and the implementation of local search metaheuristics: ParadisEO-MO, which has proven its efficiency and high flexibility by enabling the resolution of many academic and real-world optimization problems from science and industry. Expand
HyperSpark: A Data-Intensive Programming Environment for Parallel Metaheuristics
TLDR
This paper designs HyperSpark as a flexible tool meant to harness the benefits and features of state-of-the-art big data technology for the benefit of optimization methods, and assesses its validity and generality on a library implementing several metaheuristics for the Permutation Flow-Shop Problem. Expand
Nature inspired meta heuristic algorithms for optimization problems
TLDR
This work’s major contribution is on building a hyper heuristics approach from a meta-heuristic algorithm for any general problem domain. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 144 REFERENCES
Metaheuristics for Hard Optimization: Methods and Case Studies
TLDR
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. Expand
Hyperheuristics: A Tool for Rapid Prototyping in Scheduling and Optimisation
TLDR
This paper reports another successful application of hyperheuristics to a rather different real-world problem of personnel scheduling occuring at a UK academic institution and results of a quality much superior to that of a manual solution are produced. Expand
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
TLDR
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. Expand
Hyperheuristics: Recent Developments
TLDR
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. Expand
FOM: A Framework for Metaheuristic Optimization
TLDR
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. Expand
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 simpleExpand
SPEA2: Improving the strength pareto evolutionary algorithm
TLDR
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. Expand
A Unified View on Hybrid Metaheuristics
  • G. Raidl
  • Mathematics, Computer Science
  • Hybrid Metaheuristics
  • 2006
TLDR
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. Expand
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 researchExpand
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 theExpand
...
1
2
3
4
5
...