Solving the Travelling Salesman Problem by Using Artificial Bee Colony Algorithm

Journal of computing research and innovation

article

Siti Hafawati Jamaluddin¹  Noor Ainul Hayati Mohd Naziri¹  Norwaziah Mahmud¹  Nur Syuhada Muhammat Pazil² 

[1] Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA Perlis Branch;Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA Melaka Branch

关键词: Travelling Salesman Problem;    Artifical Bee Colony Algorithm;    Optimisation;   

DOI  :  10.24191/jcrinn.v7i2.295

学科分类：社会科学、人文和艺术（综合）

来源: Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA Perlis

【 摘 要 】

Travelling Salesman Problem (TSP) is a list of cities that must visit all cities that start and end in the same city to find the minimum cost of time or distance. The Artificial Bee Colony (ABC) algorithm was used in this study to resolve the TSP. ABC algorithms is an optimisation technique that simulates the foraging behaviour of honey bees and has been successfully applied to various practical issues. ABC algorithm has three types of bees that are used by bees, onlooker bees, and scout bees. In Bavaria from the Library of Traveling Salesman Problem, the distance from one city to another has been used to find the best solution for the shortest distance. The result shows that the best solution for the shortest distance that travellers have to travel in all the 29 cities in Bavaria is 3974km.

【 授权许可】

CC BY-SA