{'fraction_non_alphanumeric': 0.02021772939346812, 'fraction_numerical': 0.0, 'mean_word_length': 4.9308755760368665, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
The Application of Ant Algorithm in the Assignment Problem of Aircrafts to Stops Points on the Apron

Abstract The article refers to the problem of assigning the aircrafts to stops points on the apron. The aim of this paper is to develop the algorithm, which will be used to this assignment. The assignment problem of aircrafts to stops points is the complex decision problems, which refer to the problems of designating the minimal path in the graph. The assignment model was described, i.e. decision variables, constraints and the criterion function. Decision variables take the binary form and determine the connections between the elements of infrastructure of the apron, i.e. touchdown points, intermediate points and stop points. Constraints take into account the number of aircrafts in the given period, the number of unoccupied stop points. The criterion function determines the minimum driving time of the aircraft on the apron. In order to designate the routes in international transport the heuristic algorithm, i.e. ant algorithm was developed. The steps of building this algorithm were presented. This algorithm was verified in the C# programming language. The results generating by the presented algorithm were compared with the results generating by the random algorithm.