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

Rahma Try Iriani, Sapti Wahyuningsih, Darmawan Satyananda

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.


Full Text:

FULL PDF


DOI: http://dx.doi.org/10.17977/um055v1i1p10-17

Refbacks

  • There are currently no refbacks.


Copyright (c) 2020 Jurnal Kajian Matematika dan Aplikasinya (JKMA)

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


Jurnal Kajian Matematika dan Aplikasinya
e-ISSN: 2722-7650

Department of Mathematics, FMIPA, Universitas Negeri Malang
Jalan Semarang 5, Malang,
Gedung O-7 (Matematika)
Homepage: http://journal2.um.ac.id/index.php/jkma
Shortened homepage: bit.ly/jkma_um
E-mail: jkma.journal@um.ac.id