S-Space College of Engineering/Engineering Practice School (공과대학/대학원) Dept. of Computer Science and Engineering (컴퓨터공학부) Journal Papers (저널논문_컴퓨터공학부)
A New Hungarian Mating Scheme in Genetic Algorithms
Cited 0 time in Web of Science Cited 0 time in Scopus
- Issue Date
- HINDAWI PUBLISHING CORP
- Discrete Dynamics in Nature and Society, Vol.2016, pp. 1-13
- In genetic algorithms, selection or mating scheme is one of the important operations. In this paper, we suggest an adaptive mating scheme using previously suggested Hungarian mating schemes. Hungarian mating schemes consist of maximizing the sum of mating distances, minimizing the sum, and random matching. We propose an algorithm to elect one of these Hungarian mating schemes. Every mated pair of solutions has to vote for the next generation mating scheme. The distance between parents and the distance between parent and offspring are considered when they vote. Well-known combinatorial optimization problems, the traveling salesperson problem, and the graph bisection problem are used for the test bed of our method. Our adaptive strategy showed better results than not only pure and previous hybrid schemes but also existing distance-based mating schemes.
- Files in This Item: There are no files associated with this item.
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.