KJCKorea
Journal Central

@article{ART002665199},
author={Yoon, Hoijin},
title={An Efficiency Analysis on Mutation Operation with TSP solved in Genetic Algorithm},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2020},
volume={25},
number={12},
pages={55-61},
doi={10.9708/jksci.2020.25.12.055}

TY - JOUR
AU - Yoon, Hoijin
TI - An Efficiency Analysis on Mutation Operation with TSP solved in Genetic Algorithm
JO - Journal of The Korea Society of Computer and Information
PY - 2020
VL - 25
IS - 12
PB - The Korean Society Of Computer And Information
SP - 55
EP - 61
SN - 1598-849X
AB - Genetic Algorithm(GA) is applied to a problem that could not figure out its solution in a straightway. It is called as NP-hard problem. GA requires a high-performance system to be run on since the high-cost operations are needed such as crossover, selection, and mutation. Moreover, the scale of the problem domain is normally huge. That is why the straightway cannot be applied. To reduce the drawback of high-cost requirements, we try to answer if all the operations including mutation are necessary for all cases. In the experiment, we set up two cases of with/without mutation operations and gather the number of generations and the fitness of a solution. The subject in the experiment is Travelling Salesman Problem(TSP), which is one of the popular problems solved by GA. As a result, the cases with mutation operation are not faster and the solution is fitter than the case with mutation operation. From the result, the conclusion is that mutation operation does not always need for a better solution in a faster way.
KW - Mutation Operation;Genetic Algorithm;Travelling Salesman Problem;Efficiency;Fitness
DO - 10.9708/jksci.2020.25.12.055
ER -

Yoon, Hoijin. (2020). An Efficiency Analysis on Mutation Operation with TSP solved in Genetic Algorithm. Journal of The Korea Society of Computer and Information, 25(12), 55-61.

Yoon, Hoijin. 2020, "An Efficiency Analysis on Mutation Operation with TSP solved in Genetic Algorithm", Journal of The Korea Society of Computer and Information, vol.25, no.12 pp.55-61. Available from: doi:10.9708/jksci.2020.25.12.055

Yoon, Hoijin "An Efficiency Analysis on Mutation Operation with TSP solved in Genetic Algorithm" Journal of The Korea Society of Computer and Information 25.12 pp.55-61 (2020) : 55.

Yoon, Hoijin. An Efficiency Analysis on Mutation Operation with TSP solved in Genetic Algorithm. 2020; 25(12), 55-61. Available from: doi:10.9708/jksci.2020.25.12.055

Yoon, Hoijin. "An Efficiency Analysis on Mutation Operation with TSP solved in Genetic Algorithm" Journal of The Korea Society of Computer and Information 25, no.12 (2020) : 55-61.doi: 10.9708/jksci.2020.25.12.055

Yoon, Hoijin. An Efficiency Analysis on Mutation Operation with TSP solved in Genetic Algorithm. Journal of The Korea Society of Computer and Information, 25(12), 55-61. doi: 10.9708/jksci.2020.25.12.055

Yoon, Hoijin. An Efficiency Analysis on Mutation Operation with TSP solved in Genetic Algorithm. Journal of The Korea Society of Computer and Information. 2020; 25(12) 55-61. doi: 10.9708/jksci.2020.25.12.055

Yoon, Hoijin. An Efficiency Analysis on Mutation Operation with TSP solved in Genetic Algorithm. 2020; 25(12), 55-61. Available from: doi:10.9708/jksci.2020.25.12.055

Yoon, Hoijin. "An Efficiency Analysis on Mutation Operation with TSP solved in Genetic Algorithm" Journal of The Korea Society of Computer and Information 25, no.12 (2020) : 55-61.doi: 10.9708/jksci.2020.25.12.055