A Hybrid Ant-Based Approach to the Economic Triangulation Problem for Input-Output Tables

Authors:
Camelia-M. Pintea;Gloria Cerasela Crisan;Camelia Chira;D. Dumitrescu
Affiliations:
Babes-Bolyai University, Cluj-Napoca, Romania 400084;Bacau University, Calea Marasesti 157, 600115 Bacau, Romania, and, Centre Interuniversitaire de Recherche sur les Reseaux d'Entreprise, la Logistique et le Transport, C.P. 8888, Succursale Centre- ...;Babes-Bolyai University, Cluj-Napoca, Romania 400084;Babes-Bolyai University, Cluj-Napoca, Romania 400084
Venue:
HAIS '09 Proceedings of the 4th International Conference on Hybrid Artificial Intelligence Systems
Year:
2009

Citing 10
Cited 1

The Stanford GraphBase: a platform for combinatorial computing

The Stanford GraphBase: a platform for combinatorial computing
A new heuristic algorithm solving the linear ordering problem

Computational Optimization and Applications
Tabu Search

Tabu Search
Approximation Algorithms for Maximum Linear Arrangement

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
A Template for Scatter Search and Path Relinking

AE '97 Selected Papers from the Third European Conference on Artificial Evolution
Ant Colony Optimization

Ant Colony Optimization
On approximability of linear ordering and related NP-optimization problems on graphs

Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Variable neighborhood search for the linear ordering problem

Computers and Operations Research
Evolutionary Approaches to Linear Ordering Problem

DEXA '08 Proceedings of the 2008 19th International Conference on Database and Expert Systems Application
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

A genetic programming approach for solving the linear ordering problem

HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.