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 extremal 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.
| Original language | English |
|---|---|
| Title of host publication | 2006 SICE-ICASE International Joint Conference |
| Pages | 5500-5503 |
| Number of pages | 4 |
| DOIs | |
| Publication status | Published - 01 Dec 2006 |
| Externally published | Yes |
| Event | 2006 SICE-ICASE International Joint Conference - Busan, Korea, Republic of Duration: 18 Oct 2006 → 21 Oct 2006 |
Conference
| Conference | 2006 SICE-ICASE International Joint Conference |
|---|---|
| Country/Territory | Korea, Republic of |
| City | Busan |
| Period | 18/10/2006 → 21/10/2006 |
Keywords
- Genetic algorithm
- Stable marriage
- Stable matching
ASJC Scopus subject areas
- Computer Science Applications
- Control and Systems Engineering
- Electrical and Electronic Engineering