Vol. 9, No. 1, pp. 49–59
Keywords: logistic staff management, three dimensional matching problem, ant colony
Paper type: Research Paper
Published online: 31 January 2019
Full text PDF
Abstract: During daily logistic management managers often met difficult decision optimization problem concerning company staff. Such problems often rely on matching workers between them and team leader or matching worker to a place and a time slot and often they, menagers want to optimise their resources in order to receive such matches as maximum as possible as regars a cardinality number of a such set. These optimisation problem are often NP-difficults and to solve them menagers need special software tools. To aid managers in such situation artificial methods are used. Between artificials methods is a one called the ant colony optimisation algorithm and why in this article an ant colony optimization algorithm for the maximum cardinality 3-dimensional matching problem is described. The problem is modeled by means of 2-dimensional arrays. The elaborated ant algorithm was compared with another existing ant algorithm and tested for different values of ant algorithm parameters. Results of these tests were presented and discussed. The elaborated algorithm shows its superiority.