Introduction to Hybrid Algorithm

Computer Science Engineering

An algorithm is a set of step-by-step procedures, or a set of rules to follow, for completing a specific task or solving a particular problem. The word algorithm was first coined in the 9th century. Algorithms are all around us. Common examples include: the recipe for baking a cake, the method we use to solve a long division problem, the process of doing laundry, and the functionality of a search engine are all examples of an algorithm. Hybrid algorithms play a prominent role in improving the search capability of algorithms. Hybridization aims to combine the advantages of each algorithm to form a hybrid algorithm, while simultaneously trying to minimize any substantial disadvantage. In general, the outcome of hybridization can usually make some improvements in terms of either computational speed or accuracy. This chapter surveys recent advances in hybridizing different algorithms. Based on this survey, some crucial recommendations are suggested for further development of hybrid algorithms.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.