Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 2

Optimizing ODP Device Placement on FTTH Network Using Genetic Algorithms

IJCCS (Indonesian Journal of Computing and Cybernetics Systems) · Vol. 17 No. 4 (2023) · pp. 383–394

DOI
10.22146/ijccs.84358
ISSN
2460-7258, 1978-1520
Published
2023-10-31
Publisher
IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

Currently the problem of Optical Distribution Point (ODP) infrastructure is important in fiber to the home (FTTH) network access because ODP infrastructure development is no longer dependent on demand, so placing ODP manually without a systematic method can cause an increase in the value of optical fiber attenuation. on the length of the cable and cause the cable distribution to be irregular. This study aims to optimize the placement of ODP devices in PT BCV's FTTH network by using the Traveling Salesman Problem (TSP) scheme with the genetic algorithm (GA) approach and using hybrid GA, testing is carried out using Matlab software. Testing with development using Hybrid GA gets the best path with a fitness value of 28.6457 and a computation time of 89.93 seconds.

Keywords

Collaboration network of the authors

14 authors · 49 co-authorship links · 30 across different organisations

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

  • Andalas University
  • Sultan Idris Education University
  • Tanjungpura University
  • Bandung Institute of Technology
  • Institut Teknologi Batam
  • Universitas Riau Kepulauan
  • University of Anbar
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Ismail IsmailBandung Institute of Technology1
Evan SyaputraInstitut Teknologi Batam1
Benny Dwika LeonandaAndalas University1
Nur IksanUniversitas Riau Kepulauan1
Azmi Shawkat AbdulbaqieUniversity of Anbar1
Mohd Razimi HusinSultan Idris Education University1
Hishamuddin AhmadSultan Idris Education University1

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://journal.ugm.ac.id/ijccs/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">Optimizing ODP Device Placement on FTTH Network Using Genetic Algorithms</dc:title>
	<dc:creator>Hendro Wahyudiono, Pratiwi</dc:creator>
	<dc:creator>Indrapriyatna, Ahmad Syafruddin</dc:creator>
	<dc:creator>Panessai, Ismail Yusuf</dc:creator>
	<dc:creator>Sabah, Nurus</dc:creator>
	<dc:creator>Yani, Achmad</dc:creator>
	<dc:creator>Manaf, Abdi</dc:creator>
	<dc:creator>Iksan, Nur</dc:creator>
	<dc:subject xml:lang="en-US">Computer Science</dc:subject>
	<dc:subject xml:lang="en-US">Genetic algorithm; infrastructure development; optical distribution Point</dc:subject>
	<dc:description xml:lang="en-US">Currently the problem of Optical Distribution Point (ODP) infrastructure is important in fiber to the home (FTTH) network access because ODP infrastructure development is no longer dependent on demand, so placing ODP manually without a systematic method can cause an increase in the value of optical fiber attenuation. on the length of the cable and cause the cable distribution to be irregular. This study aims to optimize the placement of ODP devices in PT BCV's FTTH network by using the Traveling Salesman Problem (TSP) scheme with the genetic algorithm (GA) approach and using hybrid GA, testing is carried out using Matlab software. Testing with development using Hybrid GA gets the best path with a fitness value of 28.6457 and a computation time of 89.93 seconds.</dc:description>
	<dc:publisher xml:lang="en-US">IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2023-10-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"></dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.ugm.ac.id/ijccs/article/view/84358</dc:identifier>
	<dc:identifier>10.22146/ijccs.84358</dc:identifier>
	<dc:source xml:lang="en-US">IJCCS (Indonesian Journal of Computing and Cybernetics Systems); Vol 17, No 4 (2023): October; 383-394</dc:source>
	<dc:source>2460-7258</dc:source>
	<dc:source>1978-1520</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journal.ugm.ac.id/ijccs/article/view/84358/37710</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2023 IJCCS (Indonesian Journal of Computing and Cybernetics Systems)</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>