Asked 16th May, 2016
Deleted profile

What's the Classification of BFOA complexity ?

Can the Bacterial Foraging Otimisation Algorithm be classified as Np-Hard problem ? and do it belongs to Evolutionary Algorithms (EAs)? 

All Answers (2)

Seyed Hamed Hashemi Mehne
Aerospace Research Institute of Iran
"NP-hard" is used for Problems not for Algorithms. The literature review shows that BFOA is applied to solve NP-hard problems like job-shop(see [1] for example). But, "The algorithm is structurally complex due to its nested loop architecture and includes several parameters whose selection deeply influences the result.[2]"
1- International Journal of Programming Languages and Applications ( IJPLA ) Vol.2, No.4, October 2012
A Hybrid Bacterial Foraging Algorithm For Solving Job Shop Scheduling Problems
Narendhar. S and Amudha. T
2- Mario A. Muñoz ;; Saman K. Halgamuge ; Wilfredo Alfonso ; Eduardo F. Caicedo, Simplifying the Bacteria Foraging Optimization Algorithm 
2 Recommendations
Nikolaos Bismpikos
Leiden University
Well it belongs to natural computing/swarm-based computation, it's not an EA in the strict sense of the term although it is not that different
2 Recommendations

Similar questions and discussions

Related Publications

Full-text available
This study proposes two modified frameworks of Bacterial Foraging Optimization Algorithm (BFOA) for data classification. The aim is to optimize and improve the k-nearest neighbor classifier performance by manipulating the global search capability of BFOA. To the best of our knowledge, no work has been done to fully utilize BFOA as a single classifi...
This paper proposes a new object classification method based on an improved bacterial foraging optimisation algorithm. Firstly, a dynamic step size is used instead of the fixed step size of the chemotaxis. Secondly, the fixed elimination-dispersal probability is replaced by the dynamic probability. Features are extracted to distinguish the objects,...
Got a technical question?
Get high-quality answers from experts.