Published Online: May 21, 2020
Page range: 179 - 186
Received: Jan 22, 2018
DOI: https://doi.org/10.4467/2353737XCT.18.028.8001
Keywords
© 2020 Krzysztof Schiff, published by Sciendo
This work is licensed under the Creative Commons Attribution-ShareAlike 4.0 Public License.
In this article, ant colony optimisation algorithms for the triple matching problem are described. This is the first elaborated ant algorithm for this problem. The problem is modeled by means of a 3-dimensional array. The ant algorithm was compared with the Apx3Dmatchnig-F algorithm and tested for different values of ant algorithm parameters. The results of these tests were presented and discussed.