Great Deluge Algorithm for the Linear Ordering Problem: The Case of Tanzanian Input-Output Table | Zendy

Amos Mathias | Zendy; Allen Mushi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Great Deluge Algorithm for the Linear Ordering Problem: The Case of Tanzanian Input-Output Table

Author(s) -

Amos Mathias,

Allen Mushi

Publication year - 2015

Publication title -

international journal of information technology and computer science

Language(s) - English

Resource type - Journals

eISSN - 2074-9015

pISSN - 2074-9007

DOI - 10.5815/ijitcs.2015.07.04

Subject(s) - computer science , triangulation , table (database) , permutation (music) , digraph , linear programming , context (archaeology) , algorithm , order (exchange) , heuristic , input/output , tournament , mathematics , artificial intelligence , data mining , discrete mathematics , combinatorics , paleontology , physics , geometry , finance , biology , acoustics , economics , operating system

Given a weighted complete digraph, the Linear\udOrdering Problem (LOP) consists of finding and acyclic\udtournament with maximum weight. It is sometimes referred to\udas triangulation problem or permutation problem depending on\udthe context of its application. This study introduces an\udalgorithm for LOP and applied for triangulation of Tanzanian\udInput-Output tables. The algorithm development process uses\udGreat Deluge heuristic method. It is implemented using C++\udprogramming language and tested on a personal computer with\ud2.40GHZ speed processor. The algorithm has been able to\udtriangulate the Tanzanian input-output tables of size 79×79\udwithin a reasonable time (1.17 seconds). It has been able to\udorder the corresponding economic sectors in the linear order,\udwith upper triangle weight increased from 585,481 to 839,842\udgiving the degree of linearity of 94.3%

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research