Solving the travelling salesman problem by using artificial bee colony algorithm / Siti Hafawati Jamaluddin ... [et al.]

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

Full description

Saved in:
Bibliographic Details
Main Authors: Jamaluddin, Siti Hafawati, Mohd Naziri, Noor Ainul Hayati, Mahmud, Norwaziah, Muhammat Pazil, Nur Syuhada
Format: Article
Language:English
Published: Universiti Teknologi MARA, Perlis 2022
Subjects:
Online Access:https://ir.uitm.edu.my/id/eprint/68899/1/68899.pdf
https://ir.uitm.edu.my/id/eprint/68899/
https://crinn.conferencehunter.com/index.php/jcrinn
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Teknologi Mara
Language: English
id my.uitm.ir.68899
record_format eprints
spelling my.uitm.ir.688992023-01-18T08:00:21Z https://ir.uitm.edu.my/id/eprint/68899/ Solving the travelling salesman problem by using artificial bee colony algorithm / Siti Hafawati Jamaluddin ... [et al.] Jamaluddin, Siti Hafawati Mohd Naziri, Noor Ainul Hayati Mahmud, Norwaziah Muhammat Pazil, Nur Syuhada Analytical methods used in the solution of physical problems Algorithms 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. Universiti Teknologi MARA, Perlis 2022 Article PeerReviewed text en https://ir.uitm.edu.my/id/eprint/68899/1/68899.pdf Solving the travelling salesman problem by using artificial bee colony algorithm / Siti Hafawati Jamaluddin ... [et al.]. (2022) Journal of Computing Research and Innovation (JCRINN), 7 (2): 13. pp. 121-131. ISSN 2600-8793 https://crinn.conferencehunter.com/index.php/jcrinn 10.24191/jcrinn.v7i2.295 10.24191/jcrinn.v7i2.295 10.24191/jcrinn.v7i2.295
institution Universiti Teknologi Mara
building Tun Abdul Razak Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Mara
content_source UiTM Institutional Repository
url_provider http://ir.uitm.edu.my/
language English
topic Analytical methods used in the solution of physical problems
Algorithms
spellingShingle Analytical methods used in the solution of physical problems
Algorithms
Jamaluddin, Siti Hafawati
Mohd Naziri, Noor Ainul Hayati
Mahmud, Norwaziah
Muhammat Pazil, Nur Syuhada
Solving the travelling salesman problem by using artificial bee colony algorithm / Siti Hafawati Jamaluddin ... [et al.]
description 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.
format Article
author Jamaluddin, Siti Hafawati
Mohd Naziri, Noor Ainul Hayati
Mahmud, Norwaziah
Muhammat Pazil, Nur Syuhada
author_facet Jamaluddin, Siti Hafawati
Mohd Naziri, Noor Ainul Hayati
Mahmud, Norwaziah
Muhammat Pazil, Nur Syuhada
author_sort Jamaluddin, Siti Hafawati
title Solving the travelling salesman problem by using artificial bee colony algorithm / Siti Hafawati Jamaluddin ... [et al.]
title_short Solving the travelling salesman problem by using artificial bee colony algorithm / Siti Hafawati Jamaluddin ... [et al.]
title_full Solving the travelling salesman problem by using artificial bee colony algorithm / Siti Hafawati Jamaluddin ... [et al.]
title_fullStr Solving the travelling salesman problem by using artificial bee colony algorithm / Siti Hafawati Jamaluddin ... [et al.]
title_full_unstemmed Solving the travelling salesman problem by using artificial bee colony algorithm / Siti Hafawati Jamaluddin ... [et al.]
title_sort solving the travelling salesman problem by using artificial bee colony algorithm / siti hafawati jamaluddin ... [et al.]
publisher Universiti Teknologi MARA, Perlis
publishDate 2022
url https://ir.uitm.edu.my/id/eprint/68899/1/68899.pdf
https://ir.uitm.edu.my/id/eprint/68899/
https://crinn.conferencehunter.com/index.php/jcrinn
_version_ 1755876030046797824