Research Article
An Enriched Prediction Intervals Construction Method with Hybrid Intelligent Optimization
Algorithm 1
Bacterial Foraging Searching Mechanism.
(a) Initialize parameters: s=1, d=1. | (b) Tumble: Generate a random vector ∆, with each element belongs to a random number on . | (c) Move: Update according to (19) and calculate its new fitness . | (d) Swim: Let m=0 (counter for swimming length), while m is smaller than the maximum swimming length , let m=m+1. | If F is smaller than , then update . Else, set m to be the maximum swimming length. | (e) Loop: If , d=d+1, go to step (b). In this case, continue the foraging operation for next dimension variable. | (f) Loop: If , s=s+1, update the chemotactic step size according to (21) and go to step (b). Else, terminate the life of | bacterial foraging operation. |
|