Melola Discovery

← Melola Discovery

Jurnal SINTA 1

OPTIMIZATION OF GOODS DISTRIBUTION ROUTE ASSISTED BY GOOGLE MAP WITH CHEAPEST INSERTION HEURISTIC ALGORITHM (CIH)

Sinergi · Vol. 22 No. 2 (2018) · hlm. 132–138

DOI
10.22441/sinergi.2018.2.010
ISSN
2460-1217, 1410-2331
Terbit
2018-06-27
Penerbit
Universitas Mercu Buana
Bahasa
eng

Abstrak

In the distribution of goods, the efficiency of goods delivery one of which was determined by the path that passed to deliver the goods. The problem of choosing the shortest route was known as the Traveling Salesman Problem (TSP). To solve the problem of choosing the shortest route in the distribution of goods, the algorithm to be used was Cheapest Insertion Heuristic (CIH). This study aims to determine the minimum distance traveled by using the CIH algorithm. Researchers determine the route and distance of each place visited by using google map. The concept in the CIH algorithm was to insert an unexpired city with an additional minimum distance until all cities are passed to get the solution of the problem. The step completion problem with CIH algorithm was: 1) search, 2) making sub tour; 3) change the direction of the relationship, 4) repeat the steps so that all places are included in the sub tour. Theoretically, the total distance calculated using the CIH algorithm is 20.2 km, while the total distance calculated previously traveled with the ordered route is 25.2 km. There was a difference of 5 km with the application of CIH algorithm. The difference between the distance certainly has an impact on the optimal distribution of goods to the destination. Therefore, CIH algorithm application can provide a solution for determining the shortest route from the distribution of goods delivery.

Kata kunci

Jaringan kolaborasi para penulis

2 penulis · 1 tautan kepenulisan bersama

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

  • Universitas Mahendradatta
  • 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

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://publikasi.mercubuana.ac.id/index.php/sinergi/oai, pertama di-harvest 10 Nov 2026, terakhir terlihat 16 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-US">OPTIMIZATION OF GOODS DISTRIBUTION ROUTE ASSISTED  BY GOOGLE MAP WITH CHEAPEST INSERTION  HEURISTIC ALGORITHM (CIH)</dc:title>
	<dc:creator>Hignasari, L. Virginayoga</dc:creator>
	<dc:creator>Mahira, Eka Diana</dc:creator>
	<dc:subject xml:lang="en-US">Optimization</dc:subject>
	<dc:subject xml:lang="en-US">Route</dc:subject>
	<dc:subject xml:lang="en-US">Sub tour</dc:subject>
	<dc:subject xml:lang="en-US">Algorithm</dc:subject>
	<dc:subject xml:lang="en-US">Graph</dc:subject>
	<dc:description xml:lang="en-US">In the distribution of goods, the efficiency of goods delivery one of which was determined by the path that passed to deliver the goods. The problem of choosing the shortest route was known as the Traveling Salesman Problem (TSP). To solve the problem of choosing the shortest route in the distribution of goods, the algorithm to be used was Cheapest Insertion Heuristic (CIH). This study aims to determine the minimum distance traveled by using the CIH algorithm.  Researchers determine the route and distance of each place visited by using google map. The concept in the CIH algorithm was to insert an unexpired city with an additional minimum distance until all cities are passed to get the solution of the problem. The step completion problem with CIH algorithm was: 1) search, 2) making sub tour; 3) change the direction of the relationship, 4) repeat the steps so that all places are included in the sub tour. Theoretically, the total distance calculated using the CIH algorithm is 20.2 km, while the total distance calculated previously traveled with the ordered route is 25.2 km. There was a difference of 5 km with the application of CIH algorithm. The difference between the distance certainly has an impact on the optimal distribution of goods to the destination. Therefore, CIH algorithm application can provide a solution for determining the shortest route from the distribution of goods delivery.</dc:description>
	<dc:publisher xml:lang="en-US">Universitas Mercu Buana</dc:publisher>
	<dc:date>2018-06-27</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://publikasi.mercubuana.ac.id/index.php/sinergi/article/view/2501</dc:identifier>
	<dc:identifier>10.22441/sinergi.2018.2.010</dc:identifier>
	<dc:source xml:lang="en-US">SINERGI; Vol. 22 No. 2 (2018); 132-138</dc:source>
	<dc:source>2460-1217</dc:source>
	<dc:source>1410-2331</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://publikasi.mercubuana.ac.id/index.php/sinergi/article/view/2501/1730</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 SINERGI</dc:rights>
</oai_dc:dc>