A new adaptive hungarian mating scheme in genetic algorithms

Abstract

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.OAIID:RECH_ACHV_DSTSH_NO:T201700180RECH_ACHV_FG:RR00200001ADJUST_YN:EMP_ID:A001584CITE_RATE:.646DEPT_NM:컴퓨터공학부EMAIL:[email protected]_YN:YCONFIRM:YY