Great Deluge Algorithm for the Linear Ordering Problem
Loading...
Date
2015
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
International Journal of Information Technology and Computer Science
Abstract
Given a weighted complete digraph, the Linear
Ordering Problem (LOP) consists of finding and acyclic
tournament with maximum weight. It is sometimes referred to
as triangulation problem or permutation problem depending on
the context of its application. This study introduces an
algorithm for LOP and applied for triangulation of Tanzanian
Input-Output tables. The algorithm development process uses
Great Deluge heuristic method. It is implemented using C++
programming language and tested on a personal computer with
2.40GHZ speed processor. The algorithm has been able to
triangulate the Tanzanian input-output tables of size 79×79
within a reasonable time (1.17 seconds). It has been able to
order the corresponding economic sectors in the linear order,
with upper triangle weight increased from 585,481 to 839,842
giving the degree of linearity of 94.3%.
Description
Keywords
Optimization, Linear Ordering, Input-Output Tables, Great Deluge Algorithm