摘要:Globally optimal triangulations are difficult to be foundby deterministic methods as, for most type of criteria, nopolynomial algorithm is known. In this work, we considerthe Minimum Weight Triangulation (MWT) problem of agiven set of n points in the plane. Our aim is to showhow the Ant Colony Optimization (ACO) metaheuristiccan be used to search for globally optimal triangulationsof minimum weight. We present an experimental studyfor a set of instances for MWT problem. We createthese instances since no reference to benchmarks for thisproblem were found in the literature. We assess throughthe experimental evaluation the applicability of the ACOmetaheuristic for MWT problem