Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP)
Vol 12 No 2 (2020): Jurnal Ilmiah Matematika dan Pendidikan Matematika

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)

Article Info

Publish Date
11 Feb 2021

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.

Copyrights © 2021




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP)
Website

Abbrev

jmp

Publisher

Universitas Jenderal Soedirman

Subject

Mathematics

Description

JMP is a an open access journal which publishes research articles, reviews, case studies, guest edited thematic issues and short communications/letters in all areas of mathematics, applied mathematics, applied commutative algebra and algebraic geometry, mathematical biology, physics and engineering, ...