Research Article
A Hybrid Metaheuristic DE/CS Algorithm for UCAV Three-Dimension Path Planning
Algorithm 2
The algorithm of cuckoo search (CS) via Lévy flights.
Begin | Step : Initialization. Set the generation counter ; initialize the population of host | nests randomly and each egg in a nest corresponding to a potential solution to the | given problem; set the discovery rate . | Step : While the termination criteria is not satisfied or < MaxGeneration do | Sort the population/nest from best to worst. | Get a cuckoo randomly (say, ) and replace its solution by performing Lévy flights. | Evaluate its quality/fitness . | Choose a nest among (say, ) randomly. | if () | Replace by the new solution. | end if | A fraction () of the worse nests is abandoned and new ones are built. | Keep the best solutions/nests. | Sort the population/nest from best to worst and find the current best. | Pass the current best to the next generation. | . | Step : end while | Step : Post-processing the results and visualization. | End. |
|