Open AccessMultiple Traveling Salesman Problem Menggunakan Algoritma Ant Colony Optimization dengan Operasi Elitism
Author(s) -
Sugiarto Cokrowibowo,
Ismail ISMAIL,
. Indra
Publication year - 2019
Publication title -
journal of computer and information system
Language(s) - English
Resource type - Journals
eISSN - 2622-5859
pISSN - 2622-0881
DOI - 10.31605/jcis.v1i2.619
Subject(s) - travelling salesman problem , mathematical optimization , extremal optimization , ant colony optimization algorithms , 2 opt , bottleneck traveling salesman problem , computer science , mathematics , job shop scheduling , elitism , genetic algorithm , meta optimization , routing (electronic design automation) , politics , political science , law , computer network
The Multiple Traveling Salesman Problem (MTSP) is a combinatorial optimization problem and extension of Traveling Salesman Problem (TSP). There are many implementation of MTSP on transportation and scheduling. MTSP is an NP-hard problem. This paper study about solving MTSP using Ant Colony Optimization and Elitisme operator from Genetic Algorithm. The result of this combination algorithm enhance the solution search performace because of the elitism operation which ensure the solution value always increase.