Hybrid Cuckoo Search - Genetic Algorithm (CSGA): An Approach to Solve Some Combinatorial Problems

Abstract

Combinatorial problems involve finding a grouping, ordering, or assignment of a discrete, finite set of objects that satisfies given conditions. This paper presents a hybrid approach to solve some combinatorial problems using cuckoo search and genetic algorithm. The proposed approach obtains a good result compare with the classical cuckoo search and standard genetic algorithm. Two problems have been solved, Minimum Spanning Tree and Traveling Salesman Problem. The experimental results show that the suggested approach is very suitable for solving these two problems.