Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
The Stable Marriage Problem: Optimizing Different Criteria Using Genetic Algorithms
University of Borås, School of Business and IT.
2011 (English)Independent thesis Advanced level (degree of Master (One Year))Student thesis
Abstract [en]

“The Stable marriage problem (SMP) is basically the problem of finding a stable matching between two sets of persons, the men and the women, where each person in every group has a list containing every person that belongs to other group ordered by preference. The first ones to discover a stable solution for the problem were D. Gale and G.S. Shapley. Today the problem and most of its variations have been studied by many researchers, and for most of them polynomial time algorithms do not exist. Lately genetic algorithms have been used to solve such problems and have often produced better solutions than specialized polynomial algorithms. In this thesis we study and show that the Stable marriage problem has a number of important real-world applications. It the experimentation, we model the original problem and one of its variations and show the benefits of using genetic algorithms for solving the SMP.”

Place, publisher, year, edition, pages
University of Borås/School of Business and Informatics , 2011.
Series
Magisteruppsats ; 2010MI18
Keywords [en]
stable marriage problem, genetic algorithm, maximum egalitarian happiness matching, maximizing criteria
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:hb:diva-20401Local ID: 2320/7987OAI: oai:DiVA.org:hb-20401DiVA, id: diva2:1312335
Note
Program: Magisterutbildning i informatikAvailable from: 2019-04-30 Created: 2019-04-30

Open Access in DiVA

fulltext(514 kB)10 downloads
File information
File name FULLTEXT01.pdfFile size 514 kBChecksum SHA-512
60907b40a8016e40294cb8aae2b9498a2a28dc047ef442ed48c0f704e7ee22d04f9849205706acf16ed17c3f98cf214c96da3fba2bf8a232c560c148c5b91e54
Type fulltextMimetype application/pdf

By organisation
School of Business and IT
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 10 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 2 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf