Abstract
In this paper we propose a genetic algorithm (GA)-based approach to find out stable matchings in the stable marriage problem depending on different criteria such as stable matching with man-optimal, woman-optimal, egalitarian and sex-fair. The stable marriage problem is an extensively-studied combinatorial problem with many practical applications. Gale-Shapley (GS) algorithm is well known by which the stable matching found is extrema1 among many (for the worst case, in exponential order) stable matchings. So that Gale-Shapley algorithm can only search the man-optimal (or woman-pessimal) stable matching. The proposed algorithm has been evaluated by simulation experiment compared to other existing algorithms. It has been found that the proposed algorithm is quite efficient in finding stable matchings depending on different criteria.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
