Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Implementasi Algoritma Cheapest Insertion Heuristic (CIH) dalam Penyelesaian Travelling Salesman Problem (TSP)

Jurnal Online Informatika · Vol. 3 No. 1 (2018) · hlm. 61–61

DOI
10.15575/join.v3i1.218
ISSN
2527-9165, 2528-1682
Terbit
2018-06-30
Penerbit
Sunan Gunung Djati State Islamic University Bandung
Bahasa
id
Lisensi
creativecommons.org/licenses/by-nd/4.0/

Abstrak

Traveling salesman problem (TSP) is the problem of a salesman to visit the city of each city connected to each other and there is the weight of travel between the cities so as to form a complete weighted graph. Departing from a certain initial city, a salesman had to visit (n-1) another city exactly once and return on the initial city of departure. The purpose of TSP is to find the route of all cities with minimum total weight.Many algorithms have been found to solve the TSP, one of which is the Cheapest Insertion Heuristic (CIH) algorithm in the process of inserting weighted steps obtained from the equation c (i, k, j) = d (i, k) + d (k, j) - d (i, j). This algorithm provides different travel routes depending on the order of insertion of cities on the subtour in question.In this final project, the writer took the problem of distribution route of mineral water of al-ma'some 240 ml cup type, with vehicle capacity to meet 1200 carton and have different customer / agent demand that is the distance of depot and agent far from each other, distribution costs.

Kata kunci

Jaringan kolaborasi para penulis

24 penulis · 54 tautan kepenulisan bersama · 25 lintas organisasi

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

  • Sunan Gunung Djati State Islamic University Bandung
  • University of Mataram
  • Telkom University
  • Universiti Teknikal Malaysia Melaka
  • King Mongkut's Institute of Technology Ladkrabang
  • University of Technology Malaysia
  • Universitas Islam Negeri Siber Syekh Nurjati Cirebon
  • 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
Rahmat YasirandiKing Mongkut's Institute of Technology Ladkrabang3
Muhammad Ali RamdhaniSunan Gunung Djati State Islamic University Bandung2
Novian Anggis SuwastikaUniversity of Technology Malaysia2
Agung WahanaSunan Gunung Djati State Islamic University Bandung2
Tedi PriatnaSunan Gunung Djati State Islamic University Bandung1
Hamdan SugilarSunan Gunung Djati State Islamic University Bandung1
Fauziah Binti KasminUniversiti Teknikal Malaysia Melaka1
Yogan Jaya KumarUniversiti Teknikal Malaysia Melaka1
Mi’raj FuadiUniversity of Mataram1
Kurniawan YniartoUniversity of Mataram1
Yuhendra APUniversity of Mataram1
Rizky Rahmat NugrahaSunan Gunung Djati State Islamic University Bandung1
Akbar Hidayatullah HarahapSunan Gunung Djati State Islamic University Bandung1
Rohmat MulyanaSunan Gunung Djati State Islamic University Bandung1
Parman SukarnoTelkom University1
Undang SyaripudinSunan Gunung Djati State Islamic University Bandung1
Mohamad IrfanSunan Gunung Djati State Islamic University Bandung1
Muhammad HamdaniSunan Gunung Djati State Islamic University Bandung1
Siti Nur RohmahSunan Gunung Djati State Islamic University Bandung1
Siah Khosyi’ahSunan Gunung Djati State Islamic University Bandung1
Achmad KholiqUniversitas Islam Negeri Siber Syekh Nurjati Cirebon1

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: OpenAlex API (jurnal SINTA, ADR 0048) https://openalex.org/S4210216628, pertama di-harvest 21 Nov 2026, terakhir terlihat 21 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title xml:lang="id">Implementasi Algoritma Cheapest Insertion Heuristic (CIH) dalam Penyelesaian Travelling Salesman Problem (TSP)</dc:title><dc:creator>Rio Guntur Utomo</dc:creator><dc:creator>Dian Sa’adillah Maylawati</dc:creator><dc:creator>Cecep Nurul Alam</dc:creator><dc:subject>traveling salesman problem</dc:subject><dc:subject>cheapest insertion heuristic</dc:subject><dc:subject>vehicle routing</dc:subject><dc:subject>delivery route planning</dc:subject><dc:subject>mineral water distribution</dc:subject><dc:subject>distribution cost minimization</dc:subject><dc:description xml:lang="id">Traveling salesman problem (TSP) is the problem of a salesman to visit the city of each city connected to each other and there is the weight of travel between the cities so as to form a complete weighted graph. Departing from a certain initial city, a salesman had to visit (n-1) another city exactly once and return on the initial city of departure. The purpose of TSP is to find the route of all cities with minimum total weight.Many algorithms have been found to solve the TSP, one of which is the Cheapest Insertion Heuristic (CIH) algorithm in the process of inserting weighted steps obtained from the equation c (i, k, j) = d (i, k) + d (k, j) - d (i, j). This algorithm provides different travel routes depending on the order of insertion of cities on the subtour in question.In this final project, the writer took the problem of distribution route of mineral water of al-ma'some 240 ml cup type, with vehicle capacity to meet 1200 carton and have different customer / agent demand that is the distance of depot and agent far from each other, distribution costs.</dc:description><dc:publisher>Sunan Gunung Djati State Islamic University Bandung</dc:publisher><dc:date>2018-06-30</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.15575/join.v3i1.218</dc:identifier><dc:identifier>10.15575/join.v3i1.218</dc:identifier><dc:source>Jurnal Online Informatika; Vol 3 No 1 (2018); 61-61</dc:source><dc:source>2527-9165</dc:source><dc:source>2528-1682</dc:source><dc:language>id</dc:language><dc:relation>http://join.if.uinsgd.ac.id/index.php/join/article/download/v3i110/94</dc:relation><dc:rights>https://creativecommons.org/licenses/by-nd/4.0/</dc:rights></oai_dc:dc>