An improved ant algorithm for the triple matching problem
Abstract
In this article a new version of the ant colony optimisation algorithm with a desirability function for the triple matching problem is described. The problem is modelled by means of two 2-dimensional arrays. The new version of the ant algorithm was compared with the previous version of the ant algorithm and tested for different values of ant algorithm parameters; the results of these tests are presented and discussed.
DOI: https://doi.org/10.37705/TechTrans/e2020005 | Journal eISSN: 2353-737X | Journal ISSN: 0011-4561
Language: English
Submitted on: Nov 11, 2018
Accepted on: Apr 3, 2020
Published on: Apr 13, 2020
Published by: Cracow University of Technology
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
Related subjects:
© 2020 Krzysztof Schiff, published by Cracow University of Technology
This work is licensed under the Creative Commons Attribution-ShareAlike 4.0 License.