Article Per Year (5 Year)
p-Index From 2019 - 2024
0.444
P-Index
This Author published in this journals
All Journal Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP)
Priska Sari Dewi
Universitas Jenderal Soedirman
Mathematics

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
APLIKASI TRAVELLING SALESMAN PROBLEM PADA PENGEDROPAN BARANG DI ANJUNGAN MENGGUNAKAN METODE INSERTION Priska Sari Dewi; Triyani Triyani; Siti Rahmah Nurshiami
Jurnal Ilmiah Matematika dan Pendidikan Matematika Vol 12 No 2 (2020): Jurnal Ilmiah Matematika dan Pendidikan Matematika
Publisher : Jurusan Matematika FMIPA Universitas Jenderal Soedirman

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20884/1.jmp.2020.12.2.3617

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.
APLIKASI TRAVELLING SALESMAN PROBLEM PADA PENGEDROPAN BARANG DI ANJUNGAN MENGGUNAKAN METODE INSERTION Priska Sari Dewi; Triyani Triyani; Siti Rahmah Nurshiami
Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP) Vol 12 No 2 (2020): Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP)
Publisher : Universitas Jenderal Soedirman

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20884/1.jmp.2020.12.2.3617

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.
Co-Authors Siti Rahmah Nurshiami, Siti Rahmah Triyani Triyani