A Novel Self-Adaptive Cauchy Evolutionary Programming for Combinatorial Optimization
Yan Xiong · Dianzi xuebao · 2011
Based on fast evolutionary programming,a novel self-adaptive Cauchy evolutionary programming ACEP to solve the combinatorial optimization problem is proposed.It adopts advantages of Cauchy mutation and alters the search steps in time by adjusting the parameter.Compared with classic evolutionary programming and fast evolutionary programming,it only needs a half population size can be achieved the optimal solutions.The empirical experiments on 0/1 knapsack problem are carried out,the results have supported the superiority of Self-adaptive Cauchy evolutionary programming.