Bus Dispatching Interval Optimization Based on Adaptive Bacteria Foraging Algorithm

Table 1

Pseudocode for dynamic self-adaptive strategy [17, 18].

(1) FOR (each bacterium i) IN PARALLEL
(2) IF (Criterion-1) then
(3) 𝐶^𝑖(𝑡+1)=𝐶^𝑖(𝑡)/𝛼;   // exploitation
(4) 𝜀^𝑖(𝑡+1)=𝜀^𝑖/𝛽;
(5) ELSE IF (Criterion-2) then
(6) 𝐶^𝑖(𝑡+1)=𝐶initial;    // exploration
(7) 𝜀^𝑖(𝑡+1)=𝜀initial;
(8) ELSE
(9) 𝐶^𝑖(𝑡+1)=𝐶^𝑖(𝑡);
(10) 𝜀^𝑖(𝑡+1)=𝜀^𝑖;
(11) END IF
(12) END FOR IN PARALLEL

Where Criterion-2: exploration state; Criterion-1: exploitation state; 𝑡: the current iterations; 𝛼,𝛽: default constants; 𝐶^𝑖(𝑡): current run-length unit of the ith bacteria; 𝜀^𝑖(𝑡): the desired precision in the current iteration of the ith bacteria; 𝐶_initial: the original run length unit; 𝜀_initial: the original precision.