jayenliao/optimization-cs-ba-fpa

This project aimed to implement three well-known meta-heuristic algorithms: cuckoo search (CS), bat algorithm (BA), and flower pollination algorithm (FPA). We found that three algorithms could have a promising performance generally. It might need more runs to be converged when training BA. The time cost of BA was the highest while the differences of time cost among three algorithms were not so large, which might not matter when the number of training runs was not large. We also tuned λ in CS and FPA with the findings of the weakness of larger λ values. A demo video of training process is available on YouTube: https://youtu.be/hlKvODBUyeI.

廖傑恩 Jay Chiehen Liao