Use of Ant Colony Optimization Algorithm for Determining Traveling Salesman Problem Routes
Ant Colony Optimization is one of the meta-heuristic methods used to solve combinatorial optimization problems that are quite difficult. Ant Colony Optimization algorithm is inspired by ant behavior in the real world to build the shortest path between food sources and their nests. Traveling Salesman...
Guardado en:
Autores principales: | Bib Paruhum Silalahi, Nurul Fathiah, Prapto Tri Supriyo |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Department of Mathematics, UIN Sunan Ampel Surabaya
2019
|
Materias: | |
Acceso en línea: | https://doaj.org/article/744e312ec332472a883752ceacfcf3c5 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
A Novel Sparrow Search Algorithm for the Traveling Salesman Problem
por: Changyou Wu, et al.
Publicado: (2021) -
Solving the Traveling Salesman Problem on the D-Wave Quantum Computer
por: Siddharth Jain
Publicado: (2021) -
Exact Formulation and Analysis for the Bi-Objective Insular Traveling Salesman Problem
por: Pablo A. Miranda-Gonzalez, et al.
Publicado: (2021) -
Double Ant Colony Algorithm Based on Collaborative Mechanism and Dynamic Regulation Strategy
por: MENG Jingwen, YOU Xiaoming, LIU Sheng
Publicado: (2021) -
Complexity indices for the traveling salesman problem continued
por: Cvetković Dragoš, et al.
Publicado: (2021)