DocumentCode
3116702
Title
Genetic algorithm for sex-fair stable marriage problem
Author
Nakamura, Morikazu ; Onaga, Kenji ; Kyan, Seiki ; Silva, Manual
Author_Institution
Dept. of Inf. Eng., Ryukyus Univ., Okinawa, Japan
Volume
1
fYear
1995
fDate
30 Apr-3 May 1995
Firstpage
509
Abstract
In this paper we consider a sex-fair matching in the stable marriage problem. The sex-fair stable matching defined in this paper has a property that the sum of the partner´s rank of each man in his preference list is as close as possible to the sum of the partner´s rank of each woman in her preference list. We transform the sex-fair marriage problem into a graph problem which is suitable for a genetic algorithm. We propose a genetic algorithm for the sex-fair stable matching. The transformation into the graph problem makes application of the GA easier and effective. Computer experiments show the effectiveness of the proposed genetic algorithm
Keywords
gender issues; genetic algorithms; graph theory; genetic algorithm; graph problem; sex-fair matching; stable marriage problem; Application software; Genetic algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1995. ISCAS '95., 1995 IEEE International Symposium on
Conference_Location
Seattle, WA
Print_ISBN
0-7803-2570-2
Type
conf
DOI
10.1109/ISCAS.1995.521562
Filename
521562
Link To Document