Melola Discovery

← Melola Discovery

Journal

Implementation of the Cheapest Insertion Heuristic Algorithm for Optimizing the Shortest Route of the Semarang City Health Office to Inpatient Health Centers

Unnes Journal of Mathematics · Vol. 15 No. 1 (2026) · pp. 34–42

DOI
10.15294/ujm.v15i1.25547
ISSN
2460-5859, 2252-6943
Published
2026-10-21
Publisher
Universitas Negeri Semarang
Language
eng

Abstract

The supervision activities conducted by the Semarang City Health Office to Inpatient Community Health Centers play a strategic role in ensuring the quality of healthcare services. However, limited time and resources often hinder the effectiveness of these supervisory visits. This study aims to improve the efficiency of supervision travel routes by minimizing the total travel distance using the Cheapest Insertion Heuristic (CIH) algorithm. The data used consists of asymmetric distances between the Health Office and 10 Inpatient Community Health Centers. The process was carried out manually by forming an initial subtour, followed by inserting nodes based on the smallest additional distance. The manually constructed route was then validated using a Python simulation to ensure accuracy. In addition, the resulting route was compared with the actual supervision route as a form of efficiency evaluation. The findings show that the application of the CIH algorithm can produce routes with shorter total travel distances compared to the actual route, thus providing a useful basis for more efficient supervision planning.

Keywords

Collaboration network of the authors

26 authors · 53 co-authorship links · 6 across different organisations

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

  • Goethe University Frankfurt
  • State University of Semarang
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Adi Nur CahyonoState University of Semarang1
Simone JablonskiGoethe University Frankfurt1
MasrukanState University of Semarang1
Matthias LudwigGoethe University Frankfurt1
Deng-Xin Ken OehlerGoethe University Frankfurt1
Rizal Maulana DarmawanAffiliation unknown1
Isti HidayahAffiliation unknown1
Aliya RohaniAffiliation unknown1
Nugraha Ardi SetyawanAffiliation unknown1
Ahmad Syaifudin -Affiliation unknown1
Iqbal KharisudinAffiliation unknown1
St. Budi WaluyaAffiliation unknown1
Noviana Dini RahmawatiAffiliation unknown1
YL SukestiyarnoAffiliation unknown1
Subagyo .Affiliation unknown1
Tri Noor AsihAffiliation unknown1
WardonoAffiliation unknown1
Afit IstiandaruAffiliation unknown1
Budi WaluyaAffiliation unknown1
Taufik FadholiAffiliation unknown1
R. AnggraeniAffiliation unknown1
R. MurwaniAffiliation unknown1
M. H. MuslihAffiliation unknown1
A. O. YogantaraAffiliation unknown1

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.unnes.ac.id/journals/ujm/oai, first harvested 6 Nov 2026, last seen 8 Nov 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">Implementation of the Cheapest Insertion Heuristic Algorithm for Optimizing the Shortest Route of the Semarang City Health Office to Inpatient Health Centers</dc:title>
	<dc:creator xml:lang="en">Kusuma, Suci Permata</dc:creator>
	<dc:creator xml:lang="en">Mulyono</dc:creator>
	<dc:subject xml:lang="en">Cheapest Insertion Heuristic,  Health Supervision, Semarang City Health Office </dc:subject>
	<dc:description xml:lang="en">The supervision activities conducted by the Semarang City Health Office to Inpatient Community Health Centers play a strategic role in ensuring the quality of healthcare services. However, limited time and resources often hinder the effectiveness of these supervisory visits. This study aims to improve the efficiency of supervision travel routes by minimizing the total travel distance using the Cheapest Insertion Heuristic (CIH) algorithm. The data used consists of asymmetric distances between the Health Office and 10 Inpatient Community Health Centers. The process was carried out manually by forming an initial subtour, followed by inserting nodes based on the smallest additional distance. The manually constructed route was then validated using a Python simulation to ensure accuracy. In addition, the resulting route was compared with the actual supervision route as a form of efficiency evaluation. The findings show that the application of the CIH algorithm can produce routes with shorter total travel distances compared to the actual route, thus providing a useful basis for more efficient supervision planning.  </dc:description>
	<dc:publisher xml:lang="en">Universitas Negeri Semarang</dc:publisher>
	<dc:date>2026-10-21</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">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.unnes.ac.id/journals/ujm/article/view/25547</dc:identifier>
	<dc:identifier>10.15294/ujm.v15i1.25547</dc:identifier>
	<dc:source xml:lang="en">Unnes Journal of Mathematics; Vol. 15 No. 1 (2026): Unnes Journal of Mathematics Volume 1, 2026; 34-42</dc:source>
	<dc:source>2460-5859</dc:source>
	<dc:source>2252-6943</dc:source>
	<dc:source>10.15294/ujm.v15i1</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journal.unnes.ac.id/journals/ujm/article/view/25547/11869</dc:relation>
	<dc:rights xml:lang="en">Copyright (c) 2026 Unnes Journal of Mathematics</dc:rights>
</oai_dc:dc>