Code broken

[wellinton-capixaba]

I tested the MothFlame algorithm, after hacking it to able to run, and what I figured out? The Moth Flame implementation is broken. It does not work! I t simply does not converge, at least after a certain point.

Brilliant work. Massive amounts of time wasted. And I have a small time budget left. A would like to deeply thank for being hindered by it! Two python implementations on the internet, and BOTH broken!

Hopefully this MFO code will be deleted or fixed after that. Of course, since I have been systematically IGNORED so far, I do not expect it to happen.

[7ossam81]

In many cases, the optimizers do not converge after a certain point. This is natural. What is exactly the problem?

[wellinton-capixaba]

If the code is not broken, then the algorithm is broken

[wellinton-capixaba]

The problem seems to be, that the number of flames does not diminish, as indicated in the paper. (N-1)/Max_iteration) is always zero for any case where MAX_iteration is bigger than N (which might be 100% of the cases). Then you have 0*Iteration, which is also, always 0. Finally, one haves N-0 which is always N, a constant.

The weirdest of all, is that even if that "(N-1)/Max_iteration)" were not equal to 0, the total expression would finish being a negative number, since iteration will soon surpass the value of N!.

Anyway, this is all irrelevant now, at least to me. The lack of support made me to create my own code, that had the same issue, but somehow seemed to converge a little better, even if I nearly always had to resort to much larger number of moths or dimension or iterations when compared to the original code.

I already used it, and do not need it more.