Melola Discovery

← Melola Discovery

Jurnal

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) · hlm. 34–42

DOI
10.15294/ujm.v15i1.25547
ISSN
2460-5859, 2252-6943
Terbit
2026-10-21
Penerbit
Universitas Negeri Semarang
Bahasa
eng

Abstrak

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.

Kata kunci

Jaringan kolaborasi para penulis

5 penulis · 7 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • State University of Semarang
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
St. Budi WaluyaAfiliasi tidak diketahui1
Iqbal KharisudinState University of Semarang1
Noviana Dini RahmawatiState University of Semarang1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://journal.unnes.ac.id/journals/ujm/oai, pertama di-harvest 6 Nov 2026, terakhir terlihat 8 Nov 2026.
Metadata asli (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>