Great Deluge Algorithm for The Linear Ordering Problem: the case of Tanzanian Input-Output table

Simple item page
dc.creatorMushi, Allen R.
dc.creatorMathias, A.
dc.date2016-03-16T15:05:05Z
dc.date2016-03-16T15:05:05Z
dc.date2014
dc.date.accessioned2018-04-18T11:50:12Z
dc.date.available2018-04-18T11:50:12Z
dc.descriptionGiven 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%.
dc.identifierMathias, A. and Mushi, A.R., 2015. Great Deluge Algorithm for the Linear Ordering Problem: The Case of Tanzanian Input-Output Table.
dc.identifierhttp://hdl.handle.net/123456789/1030
dc.identifier10.5815/ijitcs.2015.07.04
dc.identifier.urihttp://hdl.handle.net/123456789/10629
dc.languageen
dc.publisherInternational Journal of Information Technology & Computer Science
dc.subjectOptimization
dc.subjectLinear Ordering
dc.subjectInput-Output Tables
dc.subjectGreat Deluge Algorithm
dc.titleGreat Deluge Algorithm for The Linear Ordering Problem: the case of Tanzanian Input-Output table
dc.typeJournal Article

Files

Collections

Department of Geography