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

Authors

  • Rio Guntur Utomo University of Southampton, United Kingdom
  • Dian Sa’adillah Maylawati Sekolah Tinggi Teknologi Garut, Indonesia, Indonesia
  • Cecep Nurul Alam Asia E University, Malaysia, Indonesia

DOI:

https://doi.org/10.15575/join.v3i1.218

Keywords:

Traveling Salesman Problem (TSP), Cheapest Insertion Heuristic (CIH), Demand

Abstract

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.

Author Biography

Rio Guntur Utomo, University of Southampton

Scopus ID : 56524631900

References

M. Irfan, “Implementasi Computer Based Instruction Model Instructional Games pada Pembelajaran Interaktif,” vol. VIII, no. 2, pp. 162–176, 2014.

D. Suryani, M. Irfan, W. Uriawan, and W. Budiawan, “Implementasi Algoritma Divide and Conquer pada Aplikasi Belajar Ilmu Tajwid,” *J. Online Inform.*, vol. 1, no. 1, pp. 13–19, 2016.

A. Zarman, M. Irfan, and W. Uriawan, “Implementasi Algoritma Ant Colony Optimization pada Aplikasi Pencarian Lokasi Tempat Ibadah Terdekat di Kota Bandung,” *JOIN (Jurnal Online Inform.)*, vol. 1, no. 1, pp. 6–12, 2016.

R. Naufal, “Implementasi Firefly Algorithm - Tabu Search untuk Penyelesaian Traveling Salesman Problem,” *JOIN (Jurnal Online Inform.)*, vol. 2, no. 1, pp. 42–48, 2017.

X. Li, D. Zhou, Z. Yang, J. Huang, K. Zhang, and Q. Pan, “UAV route evaluation algorithm based on CSA-AHP and TOPSIS,” in *2017 IEEE International Conference on Information and Automation (ICIA)*, 2017, pp. 915–914.

C. N. Alam, K. Manaf, A. R. Atmadja, and D. K. Aurum, “Implementation of Haversine Formula for Counting Event Visitor in The Radius Based on Android Application,” in *Proceedings of 2016 4th International Conference on Cyber and IT Service Management (CITSM 2016)*, 2016.

Jumadi, “Penentuan Rute Terpendek Menuju Kampus Menggunakan Algoritma Dynamic Programming,” *ISTEK*, vol. VIII, no. 1, pp. 214–225, 2014.

A. Wahana, D. S. Maylawati, M. Irfan, and H. Effendy, “Supply chain management using fp-growth algorithm for medicine distribution,” in *Journal of Physics: Conference Series*, 2018, vol. 978, no. 1.

B. L. Golden, S. Raghavan, and E. A. Wasil, “The Vehicle Routing Problem: Latest Advances and New Challenges,” *Oper. Res. - Comput. Sci. Interface*, no. 43, p. 584, 2008.

K. Saleh and B. Prihandono, “Penentuan Rute Terpendek dengan Menggunakan Algoritma (Studi Kasus: PT. Wicaksana Overseas International Tbk. Cabang Pontianak),” vol. 4, no. 3, pp. 295–304, 2015.

Downloads

Published

2018-06-30

Issue

Vol. 3 No. 1 (2018)

Section

Article

Citation Check

License

Copyright (c) 2018 Jurnal Online Informatika

Creative Commons License

This work is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License.

You are free to:

 

Under the following terms:

  • Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.

  • NoDerivatives — If you remix, transform, or build upon the material, you may not distribute the modified material.

  • No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.

 

Notices:

  • You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation.
  • No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License