Pareto optimization using the method of ant colony

Abstract

The article deals with the development of an effective mathematical and algorithmic apparatus for solving multicriteria problems of optimizing scheduling in engineering using the Pareto principle. The proposed algorithm uses the instrumental capabilities of the ant colony method, which makes it possible to obtain the solution closest to the “preferred” point of the criteria space that is given by the user. The variant of forming the objective function as a weighted sum of separate criteria is considered.