The Triangulation Problem for Input-Output Matrices has been intensively studied in order to understand the complex series of interactions among the sectors of an economy. The problem refers to finding a simultaneously permutation of rows and columns of a matrix such as the sum of the entries which are above the main diagonal is maximum. This is a linear ordering problem - a well-known NP-hard combinatorial optimization problem. A new hybrid heuristic based on ant algorithms is proposed to efficiently solve the triangulation problem. Starting from a greedy solution, the proposed model hybridizes the Ant Colony System (ACS) metaheuristic with an Insert-Move (IM) local search mechanism able to refine ant solutions. The proposed ACS-IM algorithm is tested with good results on some real-life economic data sets. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Pintea, C. M., Crisan, G. C., Chira, C., & Dumitrescu, D. (2009). A hybrid ant-based approach to the economic triangulation problem for input-output tables. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5572 LNAI, pp. 376–383). https://doi.org/10.1007/978-3-642-02319-4_45
Mendeley helps you to discover research relevant for your work.