An Adaptive Strategy for Colony Size Control in Artificial Bee Colony Algorithm for the Traveling Salesman Problem

Abstract

This study examines the Travelling Salesman Problem (TSP) application of Artificial Bee Colony Optimization (ABCO). The TSP is a well-known optimization issue that involves determining the quickest path between a beginning city and a number of cities. The suggested method employs a swarm- based optimization algorithm that is motivated by honey bee foraging behaviour to locate a close to ideal answer to the problem. A fitness function that calculates the overall distance covered by the salesman is used to assess the method. The experimental findings show that ABC can deliver effective TSP solutions in an acceptable period of time. A careful selection of these parameters can assure the optimal performance of the algorithm because many parameters impact the algorithm’s performance.