Improved artificial fish school algorithm to solve knapsack problem
Zhao Yamin · Computer Engineering and Applications Journal · 2011
After analyzing the disadvantages of artificial fish school algorithm solving combinational optimization problems,an improved artificial fish school algorithm is put forward.Facing the characteristic of KP,this algorithm directly simulates artificial fishs behaviors in the coding space,encoding by the rand key and decoding by the heuristic information,such as the value of unit quality goods(value-quality ratio).The globe searching capability of artificial fish school algorithm is improved by three updating operators,which include good solutions swimming in the coding space at random to search better solutions than themselves,preserving good solutions and substituting good solutions for bad solutions,bad solutions swimming in the coding space at random to search better solutions than themselves.Comparison and analysis are carried out with examples.Algorithm tests show that this algorithm can improve the speed of convergence efficiently and is good at global searching in solution space.