APLIKASI TRAVELLING SALESMAN PROBLEM PADA PENGEDROPAN BARANG DI ANJUNGAN MENGGUNAKAN METODE INSERTION

  • Priska Sari Dewi Universitas Jenderal Soedirman
  • Triyani Triyani Department of Mathematics, Jenderal Soedirman University
  • Siti Rahmah Nurshiami Department of Mathematics, Jenderal Soedirman University

Abstract

Travelling Salesman Problem (TSP) is a problem to find the shortest path a salesman visitS all the cities exactly once, and return to the starting city. In this reseacrh, the methods for TSP used are the nearest insertion method, the cheapest insertion method, and the farthest insertion method. With help the function of Software R to creat a minimum TSP Program from three insertion methods.The TSP results for same number of point using three insertion methods do not always have the same weight and route but depending on the data used.

Published
2021-02-11
How to Cite
DEWI, Priska Sari; TRIYANI, Triyani; NURSHIAMI, Siti Rahmah. APLIKASI TRAVELLING SALESMAN PROBLEM PADA PENGEDROPAN BARANG DI ANJUNGAN MENGGUNAKAN METODE INSERTION. Jurnal Ilmiah Matematika dan Pendidikan Matematika, [S.l.], v. 12, n. 2, p. 63-79, feb. 2021. ISSN 2550-0422. Available at: <http://jos.unsoed.ac.id/index.php/jmp/article/view/3617>. Date accessed: 25 feb. 2021. doi: https://doi.org/10.20884/1.jmp.2020.12.2.3617.

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.