@article{IPI2467901, title = "Multiple Traveling Salesman Problem menggunakan Algoritma Ant Colony Optimization dengan Operasi Elitism", journal = "Universitas Sulawesi Barat", volume = "Vol 3 No 1 (2020): J-CIS Volume 3 Issue 1 2020", pages = "", year = "2020", url = https://ojs.unsulbar.ac.id/index.php/jcis/article/view/619/364 author = "Sugiarto Cokrowibowo; Ismail; Indra", abstract = "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.", }