Abstract
In this paper, we define a matchmaking party assignment problem and propose a system to solve it. The problem is to assign male and female participants to several small groups so that each group consists of the same number of men and women who have a good affinity for each other. The proposed system solves the problem based on an IEC (interactive evolutionary computation) framework, which can treat indefinable evaluation functions such as affinity between men and women by feeding back the empirically obtained values of those functions. Given each participant’s attributes such as bodily characteristics, academic background, and personality, which are obtained by questionnaire in advance, the system assigns the participants to several small groups in order to maximize the number of man and woman pairs likely to begin relationships. After each groups party, the number of pairs who liked each other can be obtained as a value of the evaluation function for EC (evolutionary computation). To evaluate the system, we define the NMax Problem assuming that there would be N good affinity patterns between men and women. Through computer simulations with N from 2 to 5, we confirmed that the proposed system could find a much better group assignment than a greedy approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Foster, J.A.: Evolutionary Computation. Nature Rev. Genet. 2, 428–436 (2001)
Dawkins, R.: The Blind Watcmaker. W.W.Norton (1986)
Takagi, H.: Interactive Evolutionary Computation: Fusion of the Capacities of EC Optimization and Human Evaluation. Proc. of IEEE 89(9), 1275–1296 (2001)
Takagi, H., Ohsaki, M.: Interactive Evolutionary Computation-Based Hearing-Aid Fitting. IEEE Trans. on Evolutionary Computation 11(3), 414–427 (2007)
Kalyanmoy, D., Abhishek, K.: Interactive evolutionary multi-objective optimization and decision-making using reference direction method. In: Proc. of Genetic and Evolutionary Computation 2007, pp. 781–788 (2007)
Kosorukoff, A., Goldberg, D.: Genetic algorithms for social innovation and creativity, IlliGAL Report 20001005, University of Illinois, Urbana-Champaign (2001)
Goldberg, D., Hall, W.B., Krussow, L., Lee, E., Walker, A.: Teamwork for a quality education: Low-cost, effective educational reform, through department-wide competition of teams, IlliGAL Report 98005, University of Illinois, Urbana-Champaign (1998)
Schaffer, J.D., Eshelman, L.J.: On crossover as an evolutionary viable strategy. In: Proc. Int’l Conf. on Genetic Algorithms, pp. 61–68 (1991)
Julia, H., Joshua, K.: Evolutionary Multiobjective Clustering. IEEE Trans. on Evolutionary Computation 11(1) (2007)
Della, C.A., De Stefano, C., Marcelli, A.: Where Are the Niches? Dynamic Fitness Sharing. IEEE Trans. on Evolutionary Computation 11(4), 453–465 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuroiwa, S., Murata, Y., Kitani, T., Yasumoto, K., Ito, M. (2008). A Method for Assigning Men and Women with Good Affinity to Matchmaking Parties through Interactive Evolutionary Computation. In: Li, X., et al. Simulated Evolution and Learning. SEAL 2008. Lecture Notes in Computer Science, vol 5361. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89694-4_65
Download citation
DOI: https://doi.org/10.1007/978-3-540-89694-4_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89693-7
Online ISBN: 978-3-540-89694-4
eBook Packages: Computer ScienceComputer Science (R0)