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...
محفوظ في:
المؤلف الرئيسي: | |
---|---|
التنسيق: | Student Project |
اللغة: | English |
منشور في: |
2021
|
الموضوعات: | |
الوصول للمادة أونلاين: | https://ir.uitm.edu.my/id/eprint/44375/1/44375.pdf https://ir.uitm.edu.my/id/eprint/44375/ |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|