Implementing Parallel Metaheuristic Optimization Framework Using Metaprogramming and Design Patterns

Article Preview

Abstract:

In the present paper we introduce an approach to implementing parallel metaheuristic optimization frameworks which is used in the design of the framework HeO. This experimental cross-platform framework is a collection of popular optimization methods implemented in C++ as algorithmic skeletons. The key feature of the discussed approach is the wide usage of metaprogramming and design patterns which allow to increase the reusability of the code and ease the process of hybrid algorithms construction for the end-user. We consider framework structure and implementation details and provide the results of numerical experiments for some well-known optimization problems.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1864-1873

Citation:

Online since:

December 2012

Export:

Price:

[1] E. Alba, G. Luque, J. García-Nieto, G. Ordóñez, and G. Leguizamón: MALLBA: a software library to design efficient optimisation algorithms, Int. J. Innov. Comput. Appl., vol. 1, p.74–85, April 2007.

DOI: 10.1504/ijica.2007.013403

Google Scholar

[2] S. Cahon, N. Melab, and E.-G. Talbi: ParadisEO: a framework for the reusable design of parallel and distributed metaheuristics, Journal of Heuristics, vol. 10, p.357–380, 2004.

DOI: 10.1023/b:heur.0000026900.92269.ec

Google Scholar

[3] D. White: Software review: the ECJ toolkit: Genetic Programming and Evolvable Machines, vol. 13, p.65–67, 2012, 10.1007/s10710-011-9148-z. [Online]. Available:

DOI: 10.1007/s10710-011-9148-z

Google Scholar

[4] S. Wagner: Heuristic optimization software systems — modeling of heuristic optimization algorithms in the HeuristicLab software environment, Ph.D. dissertation, Institute for Formal Models and Verification, Johannes Kepler University Linz, Austria, 2009.

Google Scholar

[5] J. Parejo, A. Ruiz-Cortés, S. Lozano, and P. Fernandez: Metaheuristic optimization frameworks: a survey and benchmarking, Soft Computing - A Fusion of Foundations, Methodologies and Applications, vol. 16, p.527–561, 2012, 10.1007/s00500-011-0754-8. [Online]. Available:

DOI: 10.1007/s00500-011-0754-8

Google Scholar

[6] J. Hromkovič: Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics. Berlin, Heidelberg: Springer-Verlag, 2010.

DOI: 10.1145/882116.882121

Google Scholar

[7] T. Kameda and P. Weiner: On the state minimization of nondeterministic finite automata, IEEE Transactions on Computers, vol. 19, p.617–627, 1970.

DOI: 10.1109/t-c.1970.222994

Google Scholar

[8] E. Gamma, R. Helm, R. Johnson, and J. Vlissides: Design patterns: elements of reusable object-oriented software. Boston, MA, USA: Addison-Wesley Longman Publishing Co., Inc., 1995.

Google Scholar