The KIPS Transactions:PartB (정보처리학회논문지B)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

Solving Minimum Weight Triangulation Problem with Genetic Algorithm

유전 알고리즘을 이용한 최소 무게 삼각화 문제 연구

  • Published : 2008.08.29
Download PDF
⟨ Previous Next ⟩

Abstract

Minimum Weight Triangulation (MWT) problem is an optimization problem searching for the triangulation of a given graph with minimum weight. Like many other graph problems this problem is also known to be NP-hard for general graphs. Several heuristic algorithms have been proposed for this problem including simulated annealing and genetic algorithm. In this paper, we propose a new genetic algorithm called GA-FF and show that the performance of the proposed genetic algorithm outperforms the previous one.

Minimum Weight Triangulation (MWT) 는 최적화 문제로서 주어진 그래프에 대한 최소 무게 삼각화를 계산하는 문제이다. 본 문제는 많은 다른 그래프 문제들처럼 일반 그래프에 대하여 NP-hard 계열의 문제로 알려져 있으며 지금까지 simulated annealing 및 유전 알고리즘 등 heuristic algorithm 들이 제시되어 왔다. 본 논문에서는 MWT 문제에 대하여 GA-FF 라 불리우는 새로운 유전 알고리즘을 제시하며 또한 그성능이 기존의 유전 알고리즘보다 더욱 효율적임을 보인다.

Keywords

References

  1. Pinar Heggernes, “Minimal triangulations of graphs: A survey,” Discrete Mathematics 306, pp.297-317, 2006 https://doi.org/10.1016/j.disc.2005.12.003
  2. S. Arnborg, D.G. Corneil, A Proskurowsi, “Complexity of finding embeddings in a k-tree,” SIAM J. Algebraic Discrete Methods 8, pp.277-284, 1987 https://doi.org/10.1137/0608024
  3. M. Yannakakis, “Computing the minimum fill-in is NPcomplete,” SIAM J. Algebraic Discrete Methods 2, pp.77-79, 1981 https://doi.org/10.1137/0602010
  4. Finn V. Jensen, “An introduction to Bayesian networks,” UCL Press, 1996
  5. Wen, W. X., “Optimal decomposition of belief networks,” In Uncertainty in Artificial Intelligence 6 (P. P. Bonissone, M. Henrion, L. N. Kanal, and J. F. Lemmer, eds), North-Holland, Amsterdam, pp.209-224, 1990
  6. Pedro Larranaga, Cindy M. H. Kuijpers, Milel Poza and Roberto H. Murga, “Decomposing Bayesian networks: triangulation of the moral graphs with genetic algorithm,” Statistics and Computing 7, pp.19-34, 1997 https://doi.org/10.1023/A:1018553211613
  7. D.J. Rose, R.E. Tarjan and G.S. Lueker, “Algorithmic aspects of vertex elimination on graphs,” SIAM J. Comput. 5, pp.266-283, 1976 https://doi.org/10.1137/0205021
  8. Norsys Software Corp., http://www.norsys.com, 2006
  9. Uffe Kjaerulff, “Triangulation of graphs – Algorithms giving small total state space,” Research Report R-90-09, Department of Computer Science, Aalborg University, 1990
  10. Tarjan, Robert Endre, “Maximum Cardinality Search and chordal graphs,” Stanford Univ. Unpublished Lecture Notes CS 259
  11. Zbigniew Michalewicz, "Genetic Algorithms + Data Structures = Evolution Programs," Springer-Velag, Berlin, 1992
  12. De Jong, K. A., An analysis of the behavior of a class of genetic adaptive systems, Ph.D. Dissertation, University of Michigan, 1975