Melola Discovery

← Melola Discovery

Jurnal SINTA 2

DT-MSOF Strategy and its Application to Reduce the Number of Operations in AHP

Journal of ICT Research and Applications (JICTRA) · Vol. 12 No. 3 (2018) · pp. 237–255

DOI
10.5614/itbj.ict.res.appl.2018.12.3.3
ISSN
2338-5499, 2337-5787
Published
2018-12-31
Publisher
DRI - ITB
Language
eng

Abstract

A computing strategy called Double Track"“Most Significant Operation First (DT-MSOF) is proposed. The goal of this strategy is to reduce computation time by reducing the number of operations that need to be executed, while maintaining a correct final result. Executions are conducted on a sequence of computing operations that have previously been sorted based on significance. Computation will only run until the result meets the needs of the user. In this study, the DT-MSOF strategy was used to modify the Analytic Hierarchy Process (AHP) algorithm into MD-AHP in order to reduce the number of operations that need to be done. The conventional AHP uses a run-to-completion approach, in which decisions can only be obtained after all of the operations have been completed. On the other hand, the calculations in MD-AHP are carried out iteratively only until the conditions are reached where a decision can be made. The simulation results show that MD-AHP can reduce the number of operations that need to be done to obtain the same results (decisions) as obtained by conventional AHP. It was also found that the more uneven the distribution of priority values, the more the number of operations could be reduced.

Keywords

Collaboration network of the authors

10 authors · 19 co-authorship links · 4 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Bandung Institute of Technology
  • Politeknik Negeri Bandung
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Marisa W. ParyastoBandung Institute of Technology1
Budi RahardjoBandung Institute of Technology1
Fajar YuliawanBandung Institute of Technology1
Intan Muchtadi-AlamsyahBandung Institute of Technology1
Noor Cholis BasjaruddinBandung Institute of Technology1
Didin SaefudinPoliteknik Negeri Bandung1
Ilham Khrisna NugrahaPoliteknik Negeri Bandung1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://journals.itb.ac.id/index.php/jictra/oai, first harvested 26 Okt 2026, last seen 26 Okt 2026.
Original metadata (oai_dc) 
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">DT-MSOF Strategy and its Application to Reduce the Number of Operations in AHP</dc:title>
	<dc:creator>Yulianto, Fazmah Arif</dc:creator>
	<dc:creator>Kuspriyanto, Kuspriyanto</dc:creator>
	<dc:creator>Suharsono, Teguh Nurhadi</dc:creator>
	<dc:subject xml:lang="en-US">analytic hierarchy process</dc:subject>
	<dc:subject xml:lang="en-US">computational time</dc:subject>
	<dc:subject xml:lang="en-US">double-track</dc:subject>
	<dc:subject xml:lang="en-US">most significant operation first</dc:subject>
	<dc:subject xml:lang="en-US">operation reduction</dc:subject>
	<dc:description xml:lang="en-US">A computing strategy called Double Track"“Most Significant Operation First (DT-MSOF) is proposed. The goal of this strategy is to reduce computation time by reducing the number of operations that need to be executed, while maintaining a correct final result. Executions are conducted on a sequence of computing operations that have previously been sorted based on significance. Computation will only run until the result meets the needs of the user. In this study, the DT-MSOF strategy was used to modify the Analytic Hierarchy Process (AHP) algorithm into MD-AHP in order to reduce the number of operations that need to be done. The conventional AHP uses a run-to-completion approach, in which decisions can only be obtained after all of the operations have been completed. On the other hand, the calculations in MD-AHP are carried out iteratively only until the conditions are reached where a decision can be made. The simulation results show that MD-AHP can reduce the number of operations that need to be done to obtain the same results (decisions) as obtained by conventional AHP. It was also found that the more uneven the distribution of priority values, the more the number of operations could be reduced.  </dc:description>
	<dc:publisher xml:lang="en-US">DRI - ITB</dc:publisher>
	<dc:date>2018-12-31</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journals.itb.ac.id/index.php/jictra/article/view/6257</dc:identifier>
	<dc:identifier>10.5614/itbj.ict.res.appl.2018.12.3.3</dc:identifier>
	<dc:source xml:lang="en-US">Journal of ICT Research and Applications; Vol. 12 No. 3 (2018); 237-255</dc:source>
	<dc:source>2338-5499</dc:source>
	<dc:source>2337-5787</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journals.itb.ac.id/index.php/jictra/article/view/6257/3845</dc:relation>
</oai_dc:dc>