Implementation of K-Means and crossover ant colony optimization algorithm on multiple traveling salesman problem

N. Kusumahardhini, G. F. Hertono, B. D. Handari

Research output: Contribution to journalConference articlepeer-review

1 Citation (Scopus)

Abstract

Multiple Traveling Salesman Problem (MTSP) is a generalization of the Traveling Salesman Problem (TSP). MTSP is an optimization problem to find the minimum total distance of m salesmen tours to visit several cities in which each city is only visited exactly by one salesman, starting from origin city called depot and return to depot after the tour is completed. In this paper, K-Means and Crossover Ant Colony Optimization (ACO) are used to solve MTSP. The implementation is observed on three datasets from TSPLIB with 2, 3, 4, and 8 salesmen. Analysis of results using K-Means and Crossover ACO will be compared. The effect of selecting a city as depot on the total travel distance of tour will also be analyzed.

Original languageEnglish
Article number012035
JournalJournal of Physics: Conference Series
Volume1442
Issue number1
DOIs
Publication statusPublished - 29 Jan 2020
EventBasic and Applied Sciences Interdisciplinary Conference 2017, BASIC 2017 - , Indonesia
Duration: 18 Aug 201719 Aug 2017

Keywords

  • crossover ant colony optimization
  • K-Means
  • multiple traveling salesman problem

Fingerprint Dive into the research topics of 'Implementation of K-Means and crossover ant colony optimization algorithm on multiple traveling salesman problem'. Together they form a unique fingerprint.

Cite this