A New Adaptive Hungarian Mating Scheme in Genetic Algorithms
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 ma...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2016-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2016/3512546 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832566567647313920 |
|---|---|
| author | Chanju Jung Yong-Hyuk Kim Yourim Yoon Byung-Ro Moon |
| author_facet | Chanju Jung Yong-Hyuk Kim Yourim Yoon Byung-Ro Moon |
| author_sort | Chanju Jung |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-ba51c6df00214873baaea94f870f9fdb |
| institution | Kabale University |
| issn | 1026-0226 1607-887X |
| language | English |
| publishDate | 2016-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Discrete Dynamics in Nature and Society |
| spelling | doaj-art-ba51c6df00214873baaea94f870f9fdb2025-02-03T01:03:49ZengWileyDiscrete Dynamics in Nature and Society1026-02261607-887X2016-01-01201610.1155/2016/35125463512546A New Adaptive Hungarian Mating Scheme in Genetic AlgorithmsChanju Jung0Yong-Hyuk Kim1Yourim Yoon2Byung-Ro Moon3Department of Computer Science and Engineering, Seoul National University, 1 Gwanak-ro, Gwanak-gu, Seoul 08826, Republic of KoreaDepartment of Computer Science and Engineering, Kwangwoon University, 20 Kwangwoon-ro, Nowon-gu, Seoul 01890, Republic of KoreaDepartment of Computer Engineering, Gachon University, 1342 Sengnamdaero, Sujeong-gu, Seongnam-si, Gyeonggi-do 13120, Republic of KoreaDepartment of Computer Science and Engineering, Seoul National University, 1 Gwanak-ro, Gwanak-gu, Seoul 08826, Republic of KoreaIn 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.http://dx.doi.org/10.1155/2016/3512546 |
| spellingShingle | Chanju Jung Yong-Hyuk Kim Yourim Yoon Byung-Ro Moon A New Adaptive Hungarian Mating Scheme in Genetic Algorithms Discrete Dynamics in Nature and Society |
| title | A New Adaptive Hungarian Mating Scheme in Genetic Algorithms |
| title_full | A New Adaptive Hungarian Mating Scheme in Genetic Algorithms |
| title_fullStr | A New Adaptive Hungarian Mating Scheme in Genetic Algorithms |
| title_full_unstemmed | A New Adaptive Hungarian Mating Scheme in Genetic Algorithms |
| title_short | A New Adaptive Hungarian Mating Scheme in Genetic Algorithms |
| title_sort | new adaptive hungarian mating scheme in genetic algorithms |
| url | http://dx.doi.org/10.1155/2016/3512546 |
| work_keys_str_mv | AT chanjujung anewadaptivehungarianmatingschemeingeneticalgorithms AT yonghyukkim anewadaptivehungarianmatingschemeingeneticalgorithms AT yourimyoon anewadaptivehungarianmatingschemeingeneticalgorithms AT byungromoon anewadaptivehungarianmatingschemeingeneticalgorithms AT chanjujung newadaptivehungarianmatingschemeingeneticalgorithms AT yonghyukkim newadaptivehungarianmatingschemeingeneticalgorithms AT yourimyoon newadaptivehungarianmatingschemeingeneticalgorithms AT byungromoon newadaptivehungarianmatingschemeingeneticalgorithms |