A unified view on hybrid metaheuristics

Authors:
Günther R. Raidl
Affiliations:
Institute of Computer Graphics and Algorithms, Vienna University of Technology, Vienna, Austria
Venue:
HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
Year:
2006

Citing 17
Cited 33

Integer and combinatorial optimization

Integer and combinatorial optimization
New search spaces for sequencing problems with application to job shop scheduling

Management Science
Memetic algorithms: a short introduction

New ideas in optimization
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization

Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization
Asynchronous Teams: Cooperation Schemes for Autonomous Agents

Journal of Heuristics
A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization

Journal of Heuristics
A Taxonomy of Hybrid Metaheuristics

Journal of Heuristics
Embedding Branch and Bound within Evolutionary Algorithms

Applied Intelligence
A survey of very large-scale neighborhood search techniques

Discrete Applied Mathematics
Metaheuristics in combinatorial optimization: Overview and conceptual comparison

ACM Computing Surveys (CSUR)
Parallel Metaheuristics: A New Class of Algorithms

Parallel Metaheuristics: A New Class of Algorithms
A study of hybridisation techniques and their application to the design of evolutionary algorithms

AI Communications
Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification

IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
Proceedings of the Second international conference on Hybrid Metaheuristics

HM'05 Proceedings of the Second international conference on Hybrid Metaheuristics
A taxonomy of cooperative search algorithms

HM'05 Proceedings of the Second international conference on Hybrid Metaheuristics
No free lunch theorems for optimization

IEEE Transactions on Evolutionary Computation

Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms

Proceedings of the 10th annual conference on Genetic and evolutionary computation
Improvement of genetic algorithm performance for identification of cultivation process models

EC'08 Proceedings of the 9th WSEAS International Conference on Evolutionary Computing
Solving Dial-a-Ride Problems with a Low-Level Hybridization of Ants and Constraint Programming

IWINAC '07 Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II
Improving Metaheuristics for Mapping Independent Tasks into Heterogeneous Memory-Constrained Systems

ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Using Metaheuristics in a Parallel Computing Course

ICCS '08 Proceedings of the 8th international conference on Computational Science, Part II
An Evolutionary ILS-Perturbation Technique

HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
Lagrangian Decomposition, Metaheuristics, and Hybrid Approaches for the Design of the Last Mile in Fiber Optic Networks

HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
On the hybridization of SMS-EMOA and local search for continuous multiobjective optimization

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: Overview and progress report

Computers and Operations Research
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems

Computers and Operations Research
Decomposition, reformulation, and diving in university course timetabling

Computers and Operations Research
Multipopulation genetic algorithms: a tool for parameter optimization of cultivation processes models

NMA'06 Proceedings of the 6th international conference on Numerical methods and applications
Power-efficient radio configuration in fixed broadband wireless networks

Computer Communications
Development and analysis of cooperative model-based metaheuristics

Cybernetics and Systems Analysis
A hybrid metaheuristic for the longest common subsequence problem

HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
SearchCol: metaheuristic search by column generation

HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
A hybrid genetic algorithm for mixed model assembly line balancing problem with parallel workstations and zoning constraints

Engineering Applications of Artificial Intelligence
Control of dead-time systems using derivative free particle swarm optimisation

International Journal of Bio-Inspired Computation
Hybrid metaheuristics in combinatorial optimization: A survey

Applied Soft Computing
Outlier analysis for plastic card fraud detection a hybridized and multi-objective approach

HAIS'11 Proceedings of the 6th international conference on Hybrid artificial intelligent systems - Volume Part II
On the concept of density control and its application to a hybrid optimization framework: Investigation into cutting problems

Computers and Industrial Engineering
Coupling Genetic Local Search and Recovering Beam Search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates

Computers and Operations Research
A simulated annealing method based on a specialised evolutionary algorithm

Applied Soft Computing
A genetic algorithm hybridized with the discrete lagrangian method for trap escaping

LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Applying backtracking heuristics for constrained two-dimensional guillotine cutting problems

ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
Hybrid Adaptive Large Neighborhood Search for the Optimal Statistic Median Problem

Computers and Operations Research
A framework for the application of metaheuristics to tasks-to-processors assignation problems

The Journal of Supercomputing
Hybridizing ant colony optimization via genetic algorithm for mixed-model assembly line balancing problem with sequence dependent setup times between tasks

Applied Soft Computing
Hybrid metaheuristics in combinatorial optimization: a tutorial

TPNC'12 Proceedings of the First international conference on Theory and Practice of Natural Computing
Glass container production scheduling through hybrid multi-population based evolutionary algorithm

Applied Soft Computing
A comparative study of different local search application strategies in hybrid metaheuristics

Applied Soft Computing
Three improved hybrid metaheuristic algorithms for engineering design optimization

Applied Soft Computing
On the performance of ACO-based methods in p2p resource discovery

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Manifold possibilities of hybridizing individual metaheuristics with each other and/or with algorithms from other fields exist. A large number of publications documents the benefits and great success of such hybrids. This article overviews several popular hybridization approaches and classifies them based on various characteristics. In particular with respect to low-level hybrids of different metaheuristics, a unified view based on a common pool template is described. It helps in making similarities and different key components of existing metaheuristics explicit. We then consider these key components as a toolbox for building new, effective hybrid metaheuristics. This approach of thinking seems to be superior to sticking too strongly to the philosophies and historical backgrounds behind the different metaheuristic paradigms. Finally, particularly promising possibilities of combining metaheuristics with constraint programming and integer programming techniques are highlighted.