Name
Abstract | ||
|---|---|---|
Mating scheme is the way of selecting two parents to make offspring. It takes effect on the performance of genetic algorithms. In this paper, we investigate mating schemes using the Hungarian method. The schemes include i) minimizing the sum of matching distances, ii) maximizing the sum, and iii) random matching for comparison. We apply the schemes to well-known combinatorial optimization problems, the traveling salesman problem and the graph bisection problem, and analyze how the quality of the best individual changes over generations. Based on the analysis, we finally suggest a new hybrid mating scheme. The suggested scheme showed better performance than the non-hybrid schemes. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2554850.2554882 | SAC |
Keywords | Field | DocType |
mating scheme,algorithms,experimentation,genetic algorithm,problem solving, control methods, and search | Hungarian algorithm,Mathematical optimization,Combinatorial optimization problem,Computer science,Graph bisection,Theoretical computer science,Travelling salesman problem,Genetic algorithm | Conference |
Citations | PageRank | References |
1 | 0.63 | 19 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chanju Jung | 1 | 1 | 0.96 |
| Yong-Hyuk Kim | 2 | 355 | 40.27 |
| Yourim Yoon | 3 | 185 | 17.18 |
| Byung Ro Moon | 4 | 366 | 31.12 |