BRAIN Journal - A Hybrid Heuristic for Solving the Triangulation Problem

<i>Abstract</i><div><br></div><div><br></div><div>The Triangulation Problem consists in finding a simultaneous permutation of rows and columns of a given square matrix, so that the sum of the upper-diagonal entries is maximal. The researchers study this problem intensively, as it has major applications in broad domains. A new hybrid Ant Colony Optimization algorithm is introduced. The algorithm starts with a greedy search procedure. It is followed by an improved version of the Ant Colony System mixed with a problem-specific local search.<br></div><div><br></div><div><br></div><div><b>Learn more at:</b></div><div><b>https://www.edusoft.ro/brain/index.php/brain/article/view/53</b><br></div