Solving the travelling salesman problem by using artificial bee colony algorithm / Noor Ainul Hayati Mohd Naziri

Travelling Salesman Problem (TSP) is defined as a list of cities that must visit all cities that start and end in the same city with the aim of finding the minimum cost of time or distance. In this study, the Artificial Bee Colony (ABC) algorithm was used to resolve the TSP. ABC algorithms is an opt...

Full description

Saved in:
Bibliographic Details
Main Author: Mohd Naziri, Noor Ainul Hayati
Format: Student Project
Language:English
Published: 2021
Subjects:
Online Access:https://ir.uitm.edu.my/id/eprint/44375/1/44375.pdf
https://ir.uitm.edu.my/id/eprint/44375/
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first