ON BIOLOGY-INSPIRED STOCHASTIC ALGORITHMS FOR SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS
The paper presents solving the travelling salesman problem and the degree-constrained minimal spanning tree problem with the help of bionic algorithms of optimization. Default, self-configuring versions and modifications of bionic algorithms are considered. Comparison of the optimization methods effectiveness is presented. Testing was carried out on problems with different complexity and different dimensions.