Genetic Algorithm for the Stable Marriage Problem (SMP)

The Genetic Algorithm is one of the most important techniques used to solve many combinatorial optimization problems. This paper proposed a Genetic Algorithm for the Stable Marriage Problem. The goal of Stable Marriage Problem is to find a stable matching between two sets (men and women) with various preferences of each other. The Genetic Algorithm results for the Stable Marriage Problem were then compared to Gale-Shapley algorithms results. The result of the comparison shows that Genetic Algorithm has better results for happiness and egalitarian happiness. There is however a small drop in the number of stable pairs with the Genetic Algorithm as compared to the Gale-Shapley result. This goes in accordance with the theory since every person tries to get as best matching as possible and that is at the expense of stability (Caldarelli and Capocci, 2000).