Article Per Year (5 Year)
p-Index From 2021 - 2026
0.444
P-Index
This Author published in this journals
All Journal IAES International Journal of Artificial Intelligence (IJ-AI)
Gabor Fazekas
University of Debrecen
Computer Science & IT Engineering

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
Solving a traveling salesman problem using meta-heuristics Anahita Sabagh Nejad; Gabor Fazekas
IAES International Journal of Artificial Intelligence (IJ-AI) Vol 11, No 1: March 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijai.v11.i1.pp41-49

Abstract

In this article, we have introduced an advanced new method of solving a traveling salesman problem (TSP) with the whale optimization algorithm (WOA), and K-means which is a partitioning-based algorithm used in clustering. The whale optimization algorithm first was introduced in 2016 and later used to solve a TSP problem. In the TSP problem, finding the best path, which is the path with the lowest value in the fitness function, has always been difficult and time-consuming. In our algorithm, we want to find the best tour by combining it with K-means which is a clustering method. In other words, we want to divide our problem into smaller parts called clusters, and then we join the clusters based on their distances. To do this, the WOA algorithm, TSP, and K-means must be combined. Separately, the WOA-TSP algorithm which is an unclustered algorithm is also implemented to be compared with the proposed algorithm. The results are shown through some figures and tables, which prove the effectiveness of this new method.
Reducing the time needed to solve a traveling salesman problem by clustering with a Hierarchy-based algorithm Anahita Sabagh Nejad; Gabor Fazekas
IAES International Journal of Artificial Intelligence (IJ-AI) Vol 12, No 4: December 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijai.v12.i4.pp1619-1627

Abstract

In this study, we compare a cluster-based whale optimization algorithm (WOA) with an uncombined method to find a more optimized solution for a traveling salesman problem (TSP). The main goal is to reduce the time of solving a TSP. First, we solve the TSP with the Whale optimization algorithm, later we solve it with the combined method of solving TSP which uses the clustering method, called BIRCH (balanced iterative reducing and clustering using hierarchies). Birch builds a clustering feature (CF) tree and then applies one of the clustering methods (for ex. K-means) to cluster data. Experiments performed on three datasets show that the convergence time improves by using the combined algorithm.
Co-Authors Anahita Sabagh Nejad