UNIVERSITAS BINA DARMA, UNIVERSITAS BINA DARMA (2022) MODEL SIMULASI PENYELESAIAN MASALAH PERJALANAN PENJUAL MENGGUNAKAN PENDEKATAN KECERDASAN BUATAN, OPTIMISASI KOLONI SEMUT. MODEL SIMULASI PENYELESAIAN MASALAH PERJALANAN PENJUAL MENGGUNAKAN PENDEKATAN KECERDASAN BUATAN, OPTIMISASI KOLONI SEMUT.
|
Text
penelitian semut.pdf Download (1MB) | Preview |
Abstract
One of the interesting things in the software development area is the discovery of optimization algorithms. A lot of complicated work that needs to be done manually will require enormous time and effort. With the existence of a complicated job, the optimization algorithms previously can be done more comfortably and faster. They are even giving support to get the best solution. In this research, a software simulation model will be created to solve the traveling salesman problem by using an ant colony optimization to provide visuals to users of issues that can be done step by step. The development program was followed the Extreme Programming (XP) software development method on the Windows operating system using the C # programming language in Visual Studio 2019. The results of the study found the program can provide comfort and clear visualizations/simulations that can be used by users. Keywords: Travelling Salesman Problem, TSP, Ant Colony Optimization, ACO, Simulation model
| Item Type: | Article |
|---|---|
| Subjects: | H Social Sciences > H Social Sciences (General) |
| Divisions: | Faculty of Engineering, Science and Mathematics > School of Civil Engineering and the Environment |
| Depositing User: | Mr Edi Surya Negara |
| Date Deposited: | 28 Jun 2022 01:08 |
| Last Modified: | 28 Jun 2022 01:08 |
| URI: | http://eprints.binadarma.ac.id/id/eprint/16328 |
Actions (login required)
 |
View Item |
