Abstract
This paper introduces ant colony system (ACS), a distributed algorithm that is applied to the Stable Marriage Problem (SM). The stable marriage problem is an extensivelystudied combinatorial problem with many practical applications. It is well known that at least one stable matching exists for every stable marriage instance. However, the classical Gale-Shapley [2] algorithm produces a marriage that greatly favors the men at the expense of the women, or vice versa. In our proposed ACS, a set of cooperating agents called ants cooperate to find stable matchings such as stable matching with man-optimal, womanoptimal, egalitarian stable matching, sex-fair stable matching. So this ACS is a novel method to solve Stable Marriage Problem. Our simulation results show the effectiveness of the proposed ACS.
| Original language | English |
|---|---|
| Title of host publication | Advances and Innovations in Systems, Computing Sciences and Software Engineering |
| Pages | 457-461 |
| Number of pages | 5 |
| DOIs | |
| Publication status | Published - 01 Dec 2007 |
| Externally published | Yes |
| Event | 2006 International Conference on Systems, Computing Sciences and Software Engineering, SCSS 2006, Part of the International Joint Conferences on Computer, Information, and Systems Sciences, and Engineering, CISSE 2006 - Duration: 04 Dec 2006 → 14 Dec 2006 |
Conference
| Conference | 2006 International Conference on Systems, Computing Sciences and Software Engineering, SCSS 2006, Part of the International Joint Conferences on Computer, Information, and Systems Sciences, and Engineering, CISSE 2006 |
|---|---|
| Period | 04/12/2006 → 14/12/2006 |
ASJC Scopus subject areas
- Software