I'm want to ask about Cuckoo Search implementation in Discrete Optimization Problem...
I'm now trying to implement it in a TSP (Traveling Salesman Problem)
Right now, i'm representing edge in TSP using a fuzzy matrices...
I'm using levy flights as random step for the probability change (but it's too big), first i try to normalize it, but it makes the probability value has a chance to become zero, it's caused by large difference from one value to other in the matrices produced, but if i'm not normalizing it then the it'll stack in local optima and of course the value will bigger than 1...
In converting from fuzzy matrices to a path, i'm using Max Number Method in fuzzy matrices...
Beside that i'm a little afraid of wrong implementation in cuckoo search itself...
Can you give me suggestion/idea about this ? i'm really confused about this...
