Advances, Systems and Applications
Table 2 The principal mathematical symbols associated with the AVRO algorithm
From: Dynamic routing optimization in software-defined networking based on a metaheuristic algorithm
symbol | definition | formula |
|---|---|---|
\({\alpha }_{1}\), \({\alpha }_{2}\),\({\alpha }_{3}\) | Adjustable parameters with no intrinsic significance | (11) |
rn | Random real numbers that follows a uniform distribution from 0 to 1, n is a positive integer from 1 to 8 | - |
i | The i-th iteration | - |
T | Maximum Number Of Iterations | - |
\(b\) | The proportion of shortest paths passing through a given edge in the network | (13) |
δ1 | Adjustable parameters to adjust the range of \(b\) | (13) |
R(i) | Leader vulture (the two vultures with the highest fitness) in iteration i | (14) |
Best1 | The best solution | (14) |
Best2 | The second-best solution | (14) |
F | The satiety rate of vultures | (17) |
P(i) | The vector position of the vulture in the i-th iteration | - |
D(i) | Exploration distance of vultures in the i-th iteration | (20) |
d(i) | The distance between vultures and leader vultures | (24) |
ub | The upper bound of algorithm search interval | - |
lb | The lower bound of algorithm search interval | - |
δ2 | Adjustable parameters to adjust the range of \(F\) in the optimization stage | (36) |