Jurnal Kajian Matematika dan Aplikasinya
Vol 1, No 1 (2020): July

TWO PHASE HEURISTIC ALGORITHM (TPHA) PADA MULTIPLE TRAVELLING SALESMAN PROBLEM (MTSP) DAN IMPLEMENTASI PROGRAMNYA

Rahma Try Iriani (Jurusan Matematika, FMIPA, Universitas Negeri Malang)
Sapti Wahyuningsih (Jurusan Matematika, FMIPA, Universitas Negeri Malang)
Darmawan Satyananda (Jurusan Matematika, FMIPA, Universitas Negeri Malang)

Article Info

Publish Date
17 Jun 2020

Abstract

Multiple Traveling Salesman Problem (MTSP) is one variant of Traveling Salesman Problem (TSP) which involves several salesmen in making a trip to visit several customers. In this article, the Two-Phase Heuristic Algorithm (TPHA) is used to solve MTSP problems. The algorithm classifies customers into several regions using the K-Means algorithm, which will then find a route solution for each region using a genetic algorithm. The MTSP problems that were resolved using TPHA were implemented into the Borland Delphi 7.0 programming language. Application testing was conducted using 21, 32, and 46 point cases.

Copyrights © 2020




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Jurnal Kajian Matematika dan Aplikasinya
Website

Abbrev

jkma

Publisher

Universitas Negeri Malang

Subject

Mathematics

Description

The aim of this journal publication is to disseminate research results and new theories that have been achieved in the area of mathematics. Jurnal Kajian Matematika dan Aplikasinya (JKMA) particularly focuses on the main issues in the development of the sciences of mathematics, in the fields of ...