Bran collective dynamic routing optimal routes evaluation algorithm

The purpose of the work is to design the algorithm that will allow to reduce the size of the collective dynamic routing optimal routes sets. The article contains the analysis of recurrent metaheuristics-based algorithm that was designed earlier. It is shown that it defines the routes sets that transmit more information than it is needed. That fact leads to the routes sets size and information delivery time increasing. The modified recurrent algorithm was designed. Its main feature is constraints of information to be transmitted. This feature allows to reduce the size of the optimal routes set and also the computational complexity of its definition procedure. In the MATLAB software environment, optimal routes sets size and computational complexity of the exact branch and bound method and recurrent metaheuristics-based algorithm are compared, as well as a modified recurrent algorithm. Obtained results showed that the introduction of the constraints in the modified algorithm makes it possible to approximate the size of the optimal routes sets to the solutions obtained by exact method and further reduce the computational complexity. Therefore designed algorithm is useful for decreasing the information delivery time and computational complexity.