The article describes the random search method in the problem of constructing suboptimal separations of parallel logic control algorithms within homogeneous multi-module multisystems design (logic control systems based on logical multicontrollers). Using developed program system PAE a number of computational experiments are organized. The analysis of the convergence rate and results of a comparison with the known quality optimization heuristic methods are given. Showed that a sufficient number of iterations (1000-10 000) provide acceptable quality of solutions but computing time costs increased by 10-100 times. The obtained results allow us to conclude that in a number of combinations of the problem dimension and power of technological limitations proposed method has the advantage in a number of private quality indicators, losing by a integral indicator. The random search method is well parallelized that allows using a wide range of modern parallel computing resources.
The article describes an ant colony optimization algorithm applied to the solution of combinatorial optimization problems by the example of the problem of finding the shortest path in the graph. A number of modifications compared to the classical mathematical model M. Dorigo, which reduce the computational cost in finding solutions and improve its quality during parametric optimization (metaoptimization), are described. Proposed a method for comparing the quality of decisions based on the calculation of a number of indicators (average quality of decisions mark, deviation from optimal decision quality, probability of find decision, probability of find optimal decision) using in the process of comparison of different known heuristic methods. The results of comparing the quality of solutions with known methods for graphs with different numbers of nodes (different size of a problem) and different densities are given.
A device is described which allows for implementation of procedure of subtree insertion into a tree when hardware-level processing of R-expression is carried out. The procedure is reported to appear in execution of equivalent transformation of parallel algorithms.