Gavidia-Calderon, C;
Beltrán Castañon, C;
(2020)
Isula: A java framework for ant colony algorithms.
SoftwareX
, 11
, Article 100400. 10.1016/j.softx.2020.100400.
Preview |
Text
Gavidia Calderon_1-s2.0-S2352711019300639-main.pdf - Published Version Download (1MB) | Preview |
Abstract
Ant Colony Optimisation (ACO) algorithms emulate the foraging behaviour of ants to solve optimisation problems. They have proven effective in both academic and industrial settings. ACO algorithms share many features among them. Isula encapsulates these commonalities and exposes them for reuse in the form of a Java library. In this paper, we use the travelling salesman problem and image segmentation to showcase the framework capabilities using three top-performing ACO algorithms implemented in Isula. This framework is an open-source project available at GitHub, where is currently the most popular ACO java repository.
| Type: | Article |
|---|---|
| Title: | Isula: A java framework for ant colony algorithms |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1016/j.softx.2020.100400 |
| Publisher version: | http://dx.doi.org/10.1016/j.softx.2020.100400 |
| Language: | English |
| Additional information: | This article is under a Creative Commons license (https://creativecommons.org/licenses/by/4.0/) |
| Keywords: | Ant colony optimisation, Java, Travelling salesman problem, Image segmentation |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10106596 |
Archive Staff Only
 |
View Item |
