APPLICATION OF BIONIC ALGORITHMS FOR THE DECISION OF A PROBLEM ON APPOINTMENT
The article consider the problem about transition from the problem about setting to the problem about the extreme path in a graph. The technique of data of a considered problem to a problem about the shortest way is led. The basic resource of productivity and labor input of bionic search is parallelizing, in work the modified scheme of parallel bionic search on the basis of model of "islands" is presented. The offered algorithm, gives the chance updating of population in the course of its work. Results of modeling of the developed algorithm of the decision of a problem about the shortest way and a comparative estimation of computing complexity of the offered algorithm with existing are presented.