TY - JOUR
TI - An ant colony optimisation algorithm for the triple matching problem
AU - Schiff, Krzysztof
TI - An ant colony optimisation algorithm for the triple matching problem
AB - 
	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.
VL - 2018
IS - Volume 2 Year 2018 (115)
PY - 2018
SN - 0011-4561
C1 - 2353-737X
SP - 179
EP - 186
DO - 10.4467/2353737XCT.18.028.8001
UR - https://ejournals.eu/czasopismo/czasopismo-techniczne/artykul/an-ant-colony-optimisation-algorithm-for-the-triple-matching-problem
KW - triple maximum matching problem
KW - ant colony optimization algorithm
KW - non weighted version