Bioinspirated algorithm for solving problem of parametric optimization

The main design problem - the parametric optimization problem is considered in the article. This problem is NP-hard, and therefore does not have a deterministic solution. A statement of the problem is made. A new bioinspired approach to solving the parametric optimization problem based on the parallelization of the search process is suggested by authors. The approach parallelizes the search space, which greatly reduces the running time of the algorithm. A bee algorithm that obtains sets of suboptimal solutions in polynomial time is developed. A software environment and a computational experiment are made. Series of tests and experiments specifies the theoretical estimation of the time complexity of parametric optimization algorithms. The running time of the suggested algorithm does not extend beyond the O (log n).