Journal article // Jurnal TICOM






Ant Colony Optimization
May 2016
Karjono Karjono, Moedjiono Moedjiono, Denni Kurniawan -. Universitas Budi Luhur

Metrics

  • Eye Icon 281 views
  • Download Icon 1658 downloads
Metrics Icon 281 views  //  1658 downloads
Abstract

Si — Metode Optimasi Abstrak lebih dikenal salah satunya adalah metode pendekatan. Metode pendekatan tidak menjamin solusi optimal. Namun, meskipun metode ini tidak menjamin hasil yang optimal, tetapi hasil penyelesaian umumnya cukup baik. Metaheuristik sebenarnya adalah pendekatan yang didasarkan pada metode heuristik. Jadi tidak mengherankan bahwa metode heuristik sering terintegrasi dalam metode metaheuristik. Ant Colony Optimization ( ACO ) adalah salah satu contoh dari metode metaheuristik yang dapat digunakan untuk masalah Traveling Salesman Problem . Kata kunci : Optimization, Ant Colony Optimization, Metaheristik Abstract — Optimization methods are often known one of them is the method of approach. Approximation method does not ensure that the solution is optimal. However, although this method does not guarantee optimal results, but generally pretty good settlement outcomes. Metaheuristic in fact is the approach that is based on heuristic methods. So no wonder that the heuristic methods are often integrated within metaheuristic method. Ant Colony Optimization (ACO) is one example of a metaheuristic method that can be used for problem Traveling Salesman Problem. Keywords — Optimization, Ant Colony Optimization, Metaheristik.

Full text
Show more arrow
 

Metrics

  • Eye Icon 281 views
  • Download Icon 1658 downloads
Metrics Icon 281 views  //  1658 downloads