Solving Minimum Weight Triangulation Problem with Genetic Algorithm


The KIPS Transactions:PartB , Vol. 15, No. 4, pp. 341-346, Aug. 2008
10.3745/KIPSTB.2008.15.4.341,   PDF Download:

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.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. H. Han and C. S. Kim, "Solving Minimum Weight Triangulation Problem with Genetic Algorithm," The KIPS Transactions:PartB , vol. 15, no. 4, pp. 341-346, 2008. DOI: 10.3745/KIPSTB.2008.15.4.341.

[ACM Style]
Keun Hee Han and Chan Soo Kim. 2008. Solving Minimum Weight Triangulation Problem with Genetic Algorithm. The KIPS Transactions:PartB , 15, 4, (2008), 341-346. DOI: 10.3745/KIPSTB.2008.15.4.341.