<abstract xmlns="http://www.w3.org/1999/xhtml"><p>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.</p></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.

An improved ant algorithm for the triple matching problem

Department of Automatic Control and Technology Information, Faculty of Electrical and Computer Engineering

Technical Transactions

This work is licensed under the Creative Commons Attribution-ShareAlike 4.0 International License.

{"article-title":"An improved ant algorithm for the triple matching problem"}

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...

An improved ant algorithm for the triple matching problem

Pubblicato online: 13 apr 2020

Pagine: -

Ricevuto: 11 nov 2018

Accettato: 03 apr 2020

DOI: https://doi.org/10.37705/TechTrans/e2020005

Parole chiave
triple maximum matching problem, ant colony optimisation

© 2020 Krzysztof Schiff, published by Sciendo

This work is licensed under the Creative Commons Attribution-ShareAlike 4.0 International License.

An improved ant algorithm for the triple matching problem

Pubblicato online: 13 apr 2020

Pagine: -

Ricevuto: 11 nov 2018

Accettato: 03 apr 2020

DOI: https://doi.org/10.37705/TechTrans/e2020005

Parole chiavetriple maximum matching problem, ant colony optimisation

© 2020 Krzysztof Schiff, published by Sciendo

This work is licensed under the Creative Commons Attribution-ShareAlike 4.0 International License.

Parole chiave
triple maximum matching problem, ant colony optimisation