Journal of the Korea Society of Computer and Information (한국컴퓨터정보학회논문지)

Korean Society of Computer Information (한국컴퓨터정보학회)
권호 표지
DOI QR코드

DOI QR Code

An Efficiency Analysis on Mutation Operation with TSP solved in Genetic Algorithm

  • Yoon, Hoijin (Dept. of Computer Engineering, Hyupsung University)
  • Received : 2020.09.23
  • Accepted : 2020.12.09
  • Published : 2020.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

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.

유전자 알고리즘은 명료한 방식으로 답을 찾기 어려운 문제, 즉 NP 문제의 경우 효과적인 솔루션을 찾을 수 있다. 단 유전자 알고리즘의 실행 비용은 기존 프로그래밍 방식에 비하여 높은 비용을 요구하게 되므로, 높은 성능의 실행환경을 전제로 한다. 이러한 문제를 조금이나마 줄여보기 위하여 본 연구는 유전자 알고리즘의 돌연변이 연산자를 초점을 맞추고, 돌연변이 연산의 복잡한 실행을 위한 비용을 고려하여, 과연 해당 연산자가 모든 문제 영역에서 반드시 요구될까를 분석하기 위한 실험을 진행한다. 우리 실험 주체는 유전자 알고리즘을 적용하는 대표적인 문제 중의 하나인 TSP(Travelling Salesman Problem)으로 하였다. 돌연변이 연산을 적용하는 경우와 적용하지 않는 경우에 대한 결과값들을 세대수와 적합도 값을 수집하여 분석한다. 그 결과 돌연변이 연산자를 적용하는 경우가 세대수 감소와 적합도 향상의 효과적인 결과를 반드시 보이지는 않았다.

Keywords

References

  1. Holland, J.H.. "Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence," MIT Press: Cambridge, MA, USA, pp.89-120, 1992.
  2. M. Mitchell, "An Introduction to Genetic Algorithms," MIT Press, pp.128-130, 1999
  3. H. Yoon, "Fitness-Orientated Mutation Operators in Genetic Algorithm," IJITEE, Vol. 9, No. 4, pp.1769-1772, Feb. 2020. doi:10.35940/jijtee.D1692.029420
  4. Alan T Piszcz, Terence Soule, "A Survey of Mutation Techniques in Genetic Programming," Proceedings of the 8th annual conference on Genetic and evolutionary computation, pp. 951-952, Seattle, Washington, USA, July 2006. DOI: 10.1145/1143997.1144165
  5. E. Osaba, R. Carballedo, F. Diaz, E. Onieva, I. de la Iglesia, A. Perallos, "Crossover versus Mutation: A Comparative Analysis of the Evolutionary Strategy of Genetic Algorithms Applied to Combinatorial Optimization Problems", The Scientific World Journal, vol. 2014, Article ID 154676, 22 pages, 2014. DOI: 10.1155/2014/154676
  6. Hee-Su Kim and Sung-Bae Cho, "An efficient genetic algorithm with less fitness evaluation by clustering," Proceedings of the 2001 IEEE Congress on Evolutionary Computation, pp.887-894, Seoul, South Korea, May 2001. DOI: 10.1109/CEC.2001.934284.
  7. L. Wang, J. Zhang and H. Li, "An Improved Genetic Algorithm for TSP," Proceedings of 2007 International Conference on Machine Learning and Cybernetics, pp.925-928, Hong Kong, Aug. 2007. DOI: 10.1109/ICMLC.2007.4370274.
  8. Clinton Sheppard, "Genetic Algorithms with Python," CreateSpace Independent Publishing Platform, pp.169-186, 2016
  9. Giancarlo Zaccone, "Natural Computing with Python," bpb publications, pp.85-118, 2019
  10. J. Lu, N. Fang, D. Shao and C. Liu, "An Improved Immune-Genetic Algorithm for the Traveling Salesman Problem," Proceedings of 3rd International Conference on Natural Computation (ICNC 2007), pp. 297-301, Haikou, Aug. 2007. DOI: 10.1109/ICNC.2007.217.
  11. Y. Liu and J. Huang, "A Novel Genetic Algorithm and Its Application in TSP," Proceedings of 2008 IFIP International Conference on Network and Parallel Computing, pp. 263-266, Shanghai, Oct. 2008. DOI: 10.1109/NPC.2008.27
  12. B. H. Hasan and M. S. Mustafa, "Comparative Study of Mutation Operators on the Behavior of Genetic Algorithms Applied to Non-deterministic Polynomial (NP) Problems," Proceedings of 2011 Second International Conference on Intelligent Systems, Modelling and Simulation, pp. 7-12, Kuala Lumpur, Jan. 2011.DOI: 10.1109/ISMS.2011.11.