Hybrid metaheuristics

10Citations
Citations of this article
300Readers
Mendeley users who have this article in their library.
Get full text

Abstract

One of the most interesting recent trends for what concerns research on metaheuristics is their hybridization with other techniques for optimization. In fact, the focus of research on metaheuristics has notably shifted from an algorithmoriented point of view to a problem-oriented point of view. In other words, in contrast to promoting a certain metaheuristic, as, for example, in the eighties and the first half of the nineties, nowadays researchers focus much more on solving, as best as possible, the problem at hand. This has inevitably led to research that aims at combining different algorithmic components for the design of algorithms that are more powerful than the ones resulting from the implementation of pure metaheuristic strategies. Interestingly, the trend of hybridization is not restricted to the combination of algorithmic components originating from different metaheuristics, but has also been extended to the combination of exact algorithms and metaheuristics. In this chapter, we provide an overview of the most important lines of hybridization. In addition to representative examples, we present a literature review for each of the considered hybridization types. Acknowledgements This work was supported by grant TIN2007-66523 (FORMALISM) of the Spanish Government. In addition, Christian Blum acknowledges support from the Ramón y Cajal program of the Spanish Ministry of Science and Innovation.

Cite

CITATION STYLE

APA

Blum, C., Puchinger, J., Raidl, G., & Roli, A. (2011). Hybrid metaheuristics. In Springer Optimization and Its Applications (Vol. 45, pp. 305–335). Springer International Publishing. https://doi.org/10.1007/978-1-4419-1644-0_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free