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...
Saved in:
主要作者: | |
---|---|
格式: | Student Project |
語言: | English |
出版: |
2021
|
主題: | |
在線閱讀: | https://ir.uitm.edu.my/id/eprint/44375/1/44375.pdf https://ir.uitm.edu.my/id/eprint/44375/ |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|