“The Stable marriage problem (SMP) is basically the problem of finding a stable matchingbetween two sets of persons, the men and the women, where each person in every group has a listcontaining every person that belongs to other group ordered by preference. The first ones to discovera stable solution for the problem were D. Gale and G.S. Shapley. Today the problem and most of itsvariations have been studied by many researchers, and for most of them polynomial time algorithmsdo not exist. Lately genetic algorithms have been used to solve such problems and have oftenproduced better solutions than specialized polynomial algorithms. In this thesis we study and showthat the Stable marriage problem has a number of important real-world applications. It theexperimentation, we model the original problem and one of its variations and show the benefits ofusing genetic algorithms for solving the SMP.” / Program: Magisterutbildning i informatik
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:hb-20401 |
| Date | January 2011 |
| Creators | Damianidis, Ioannis |
| Publisher | Högskolan i Borås, Institutionen Handels- och IT-högskolan, University of Borås/School of Business and Informatics |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | Magisteruppsats, ; 2010MI18 |
Page generated in 0.002 seconds