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...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Bib Paruhum Silalahi, Nurul Fathiah, Prapto Tri Supriyo
Formato:	article
Lenguaje:	EN
Publicado:	Department of Mathematics, UIN Sunan Ampel Surabaya 2019
Materias:	algorithm, optimization, ant colony optimization, traveling salesman problem Mathematics QA1-939
Acceso en línea:	https://doaj.org/article/744e312ec332472a883752ceacfcf3c5
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:744e312ec332472a883752ceacfcf3c5
record_format	dspace
spelling	oai:doaj.org-article:744e312ec332472a883752ceacfcf3c52021-12-02T14:53:46ZUse of Ant Colony Optimization Algorithm for Determining Traveling Salesman Problem Routes2527-31592527-316710.15642/mantik.2019.5.2.100-111https://doaj.org/article/744e312ec332472a883752ceacfcf3c52019-10-01T00:00:00Zhttp://jurnalsaintek.uinsby.ac.id/index.php/mantik/article/view/695https://doaj.org/toc/2527-3159https://doaj.org/toc/2527-3167Ant 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 Problem is a problem in optimization. Traveling Salesman Problem is a problem to find the minimum distance from the initial node to the whole node with each node must be visited exactly once and must return to the initial node. Traveling Salesman Problem is a non-deterministic polynomial-time complete problem. This research discusses the solution of the Traveling Salesman Problem using the Ant Colony Optimization algorithm and also using the exact algorithm. The results showed that the greater the size of the Traveling Salesman Problem case, the longer the execution time required. The results also showed that the execution times of the Ant Colony Optimization are much faster than the execution time of the exact method.Bib Paruhum SilalahiNurul FathiahPrapto Tri SupriyoDepartment of Mathematics, UIN Sunan Ampel Surabayaarticlealgorithm, optimization, ant colony optimization, traveling salesman problemMathematicsQA1-939ENMantik: Jurnal Matematika, Vol 5, Iss 2, Pp 100-111 (2019)
institution	DOAJ
collection	DOAJ
language	EN
topic	algorithm, optimization, ant colony optimization, traveling salesman problem Mathematics QA1-939
spellingShingle	algorithm, optimization, ant colony optimization, traveling salesman problem Mathematics QA1-939 Bib Paruhum Silalahi Nurul Fathiah Prapto Tri Supriyo Use of Ant Colony Optimization Algorithm for Determining Traveling Salesman Problem Routes
description	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 Problem is a problem in optimization. Traveling Salesman Problem is a problem to find the minimum distance from the initial node to the whole node with each node must be visited exactly once and must return to the initial node. Traveling Salesman Problem is a non-deterministic polynomial-time complete problem. This research discusses the solution of the Traveling Salesman Problem using the Ant Colony Optimization algorithm and also using the exact algorithm. The results showed that the greater the size of the Traveling Salesman Problem case, the longer the execution time required. The results also showed that the execution times of the Ant Colony Optimization are much faster than the execution time of the exact method.
format	article
author	Bib Paruhum Silalahi Nurul Fathiah Prapto Tri Supriyo
author_facet	Bib Paruhum Silalahi Nurul Fathiah Prapto Tri Supriyo
author_sort	Bib Paruhum Silalahi
title	Use of Ant Colony Optimization Algorithm for Determining Traveling Salesman Problem Routes
title_short	Use of Ant Colony Optimization Algorithm for Determining Traveling Salesman Problem Routes
title_full	Use of Ant Colony Optimization Algorithm for Determining Traveling Salesman Problem Routes
title_fullStr	Use of Ant Colony Optimization Algorithm for Determining Traveling Salesman Problem Routes
title_full_unstemmed	Use of Ant Colony Optimization Algorithm for Determining Traveling Salesman Problem Routes
title_sort	use of ant colony optimization algorithm for determining traveling salesman problem routes
publisher	Department of Mathematics, UIN Sunan Ampel Surabaya
publishDate	2019
url	https://doaj.org/article/744e312ec332472a883752ceacfcf3c5
work_keys_str_mv	AT bibparuhumsilalahi useofantcolonyoptimizationalgorithmfordeterminingtravelingsalesmanproblemroutes AT nurulfathiah useofantcolonyoptimizationalgorithmfordeterminingtravelingsalesmanproblemroutes AT praptotrisupriyo useofantcolonyoptimizationalgorithmfordeterminingtravelingsalesmanproblemroutes
_version_	1718389390980415488

Use of Ant Colony Optimization Algorithm for Determining Traveling Salesman Problem Routes

Ejemplares similares