• Title/Summary/Keyword: 문제풀이

Search Result 407, Processing Time 0.029 seconds

Performance Comparison between Genetic Algorithms and Dynamic Programming in the Subset-Sum Problem (부분집합 합 문제에서의 유전 알고리즘과 동적 계획법의 성능 비교)

  • Cho, Hwi-Yeon;Kim, Yong-Hyuk
    • Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
    • /
    • v.8 no.4
    • /
    • pp.259-267
    • /
    • 2018

  • The subset-sum problem is to find out whether or not the element sum of a subset within a finite set of numbers is equal to a given value. The problem is a well-known NP-complete problem, which is difficult to solve within a polynomial time. Genetic algorithm is a method for finding the optimal solution of a given problem through operations such as selection, crossover, and mutation. Dynamic programming is a method of solving a given problem from one or several subproblems. In this paper, we design and implement a genetic algorithm that solves the subset-sum problem, and experimentally compared the time performance to find the answer with the case of dynamic programming method. We selected a total of 17 test cases considering the difficulty in a set with 63 elements of positive number, and compared the performance of the two algorithms. The presented genetic algorithms showed time performance improved by 84% on 13 of 17 problems when compared with dynamic programming.

  • https://doi.org/10.21742/AJMAHS.2018.04.21 인용

다양한 보조선을 이용한 문제 풀이

  • Sin, Hyeon-Yong;Han, In-Gi;Lee, Gyeong-Eon
    • Communications of Mathematical Education
    • /
    • v.14
    • /
    • pp.297-326
    • /
    • 2001

  • 중학교 수학교과서에는 보조선을 이용하여 해결하는 문제가 많이 제시되고 있다. 그러나 학생들에게는 앞서 배운 성질을 직접적으로 적용한 보조선만이 제시되고 있어서 스스로 보조선을 생각해보거나 이를 통해 추론해보는 경험을 하지 못하고 있다. 그러므로, 본 연구에서는 교과서에서 제시되는 보조선 이외에 다양한 보조선을 이용한 풀이를 제시하고자 한다.

  • PDF