Adaptation of the Pareto concept of dominance to the ant colonies technique

In the paper the algorithm for multicriterion problem solution is proposed that uses instrumental means of the ant colonies technique and makes it possible to approximate not the whole Pareto front, but the closest region to the given “preferred” point of the criteria space. This approach is implemented by integrated criterion forming, for instance the sum of the partial criteria with certain coefficients, where “total” objective function is formed from the partial objective functions as the weighted sum. The distinctive features of the ant algorithms contribute to their efficient implementation while solving multicriterion problems as ant algorithms are based on using of the potential solutions set during global search in different directions and make no demands to the form of objective functions and restrictions.