One-dimensional packaging with method of modified ant colony

\nThe study explores the use of the ant algorithm for solving one-dimensional packing problems. It discusses the structure of the decision search graph, the search process on the graph, methods of pheromone deposition and evaporation. The study employs a cyclic method of ant systems. A new strategy for finding effective solutions is proposed based on modification and hybridization of the canonical representations of the particle swarm algorithm. The paradigm of a swarm of transforming chromosomes is described, which provides the ability to represent solutions in the affine space of chromosomes with integer parameter values. The mechanisms of chromosome transformation in the affine space to increase the weight of affine bonds are considered. Experimental research was conducted on an IBM PC, showing improved results compared to existing algorithms. The proposed approach can be useful for solving packaging problems and optimizing the distribution of one-dimensional objects.\n