An improved ant algorithm for the triple matching problem

Schiff, Krzysztof

doi:10.37705/TechTrans/e2020005

.blurhash-client-img { display: none !important; }

An improved ant algorithm for the triple matching problem

Technical Transactions

Volume 117 (2020): Issue 1 (January 2020)

By: Krzysztof Schiff

Open Access

|Apr 2020

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.

References

Biro, P., McDermid, E. (2010). Three-sided stable matching with cyclic preferences. Algorithmica, 58(1), 5–18.10.1007/s00453-009-9315-2
Search in Google Scholar Back to article
Chen, J. (2012). Iterative Expansion and Color Coding: an Improved Algorithm for 3D-Matching. ACM Transactions on Algorithms, 6.1–6.22.10.1145/2071379.2071385
Search in Google Scholar Back to article
Dorigo, M., Stützle, T. (2002). Ant colony optimization. In Proceedings of EvoWorkshops 2002 (pp. 61–71). Berlin: Heidelberg: Springer-Verlag.
Search in Google Scholar Back to article
Eriksson, K., Sjostrand, J., Strimling, P. (2006). Three-dimensional stable matching with cyclic preferences. Math. Soc. Sci., 52(1), 77–87.10.1016/j.mathsocsci.2006.03.005
Search in Google Scholar Back to article
Karp, R. M. (1972). Reducibility among combinatorial problems. In R. Miller, J. Thatcher (Eds.), Complexity of Computer Computations (pp. 85–103). New York: Plenum.
Search in Google Scholar Back to article
Knuth, D. (1997). Stable marriage and its relation to other combinatorial problems: An introduction to the mathematical analysis of algorithms. Rhode Island: American Mathematical Society.
Search in Google Scholar Back to article
Schiff, K. (2018). An ant algorithm for the triple matching problem. Technical Transaction, 2(115), 179–186.
Search in Google Scholar Back to article

DOI: https://doi.org/10.37705/TechTrans/e2020005 | Journal eISSN: 2353-737X | Journal ISSN: 0011-4561

Journal RSS Feed

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

Keywords:

triple maximum matching problem,

ant colony optimisation

Related subjects:

Architecture and design,

Architecture,

Architects, buildings,

Engineering,

Mechanical engineering,

Mechanics,

Industrial chemistry,

Chemical engineering,

Materials sciences,

Materials sciences, other

© 2020 Krzysztof Schiff, published by Cracow University of Technology
This work is licensed under the Creative Commons Attribution-ShareAlike 4.0 License.

Previous article Volume 117 (2020): Issue 1 (January 2020)Next article