Journal of the Korean Institute of Intelligent Systems (한국지능시스템학회논문지)

Korean Institute of Intelligent Systems (한국지능시스템학회)
권호 표지
DOI QR코드

DOI QR Code

DNA Computing Adopting DNA coding Method to solve effective Knapsack Problem

효과적인 배낭 문제 해결을 위해 DNA 코딩 방법을 적용한 DNA 컴퓨팅

  • 김은경 (공주대학교 컴퓨터 공학과) ;
  • 이상용 (공주대학교 정보통신공학부)
  • Published : 2005.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

Though Knapsack Problem appears to be simple, it is a NP-hard problem that is not solved in polynomial time as combinational optimization problems. To solve this problem, GA(Genetic Algorithms) was used in the past. However, there were difficulties in real experiments because the conventional method didn't reflect the precise characteristics of DNA. In this paper we proposed ACO (Algorithm for Code Optimization) that applies DNA coding method to DNA computing to solve problems of Knapsack Problem. ACO was applied to (0,1) Knapsack Problem; as a result, it reduced experimental errors as compared with conventional methods, and found accurate solutions more rapidly.

배낭 문제는 단순한 것 같지만 조합 최적화 문제로서, 다항 시간(polynomial time)에 풀리지 않는 NP-hard 문제이다. 이 문제를 해결하기 위해 기존에는 GA(Genetic Algorithms)를 이용하여 해결하였다. 하지만 기존의 방법은 DNA의 정확한 특성을 고려하지 않아, 실제 실험과의 결과 차이가 발생하고 있다. 본 논문에서는 배낭 문제의 문제점을 해결하기 위해 DNA 컴퓨팅 기법에 DNA 코딩 방법을 적용한 ACO(Algorithm for Code Optimization)를 제안한다. ACO는 배낭 문제 중 (0,1)-배낭 문제에 적용하였고, 그 결과 기존의 방법보다 실험적 오류를 최소화하였으며, 또한 적합한 해를 빠른 시간내에 찾을 수 있었다.

Keywords

References

  1. Z. Michalewicz, Genetic Algorithms + Data Structures=Evolution Programs, Springer- Verlag, 3rd, revised and extended edition, 1999
  2. L. M., Adleman, 'Molecular computation of solutions to combinatorial problems', Science, vol. 266 pp. 1021-1024, 1994 https://doi.org/10.1126/science.7973651
  3. 진강규, '유전알고리즘과 그 응용', 교우사, pp. 282-289, 2000
  4. S. Khuri, T. Bӓck, J. Heitkotter, 'The Zero/one Multiple Knapsack Problem and Genetic Algorithms', Proceedings '94 ACM Symp. on Applied Computing, Phoenix, AZ, 1994
  5. http://pl.changwon.ac.kr/algorithm/99/algorithm_ sche.html
  6. http://www.biggood.com
  7. Gilles Brassard, Paul Bratley, 'Fundamentals of algorithmics', 그린, pp. 239-584, 1998
  8. P. Wasiewicz, T. Janczak, J. J. Mulawka, A. Plucienniczak, : 'The Inference vai DNA Computing', In [CEC99], pp. 988-993, 1999
  9. L. Kari. DNA computing : the arrival of biological mathematics. The mathematical Intelligencer, vol. 19, no. 2, 1997
  10. G. H. Gonnet, C. Korostensky, S. A. Benner, 'Evaluation Measures of Multiple Sequence Alignments', Journal of Computational Biology, vol. 7, no. 1-2, pp. 261-276, 2000 https://doi.org/10.1089/10665270050081513
  11. R. Deaton, S. A. Karl, 'Introduction to DNA Computing', 1999 Genetic and Evolutionary Computation Conference Tutorial Program, pp. 75-93, Orlando, Florida, July 14, 1999
  12. T. Yoshikawa, T. Furuhashi, Y. Uchidawa, 'Acquisition of Fuzzy Rules of Constructing Intelligent Systems using Genetic Algorithm based on DNA Coding Method' Proceedings of International Joint Conference of CFSA/IFIS/SOFT'95 on Fuzzy Theory and Applications