摘要
A novel framework of hyper-heuristic algorithm was proposed to improve the adaption of evolutionary algorithms( EAs)in optimization. The algorithm could be changed during the evolutionary progress according to their performances. In addition,a large number of elite individuals were employed in the algorithm and the elite individuals helped algorithm achieve a better performance,while such number of elite individuals stagnated the global convergence in conventional single algorithm. The time complexity was analyzed to demonstrate the novel framework did not increase the time complexity. The simulation results indicate that the proposed framework outperforms any single algorithm that composes the framework.
A novel framework of hyper-heuristic algorithm was proposed to improve the adaption of evolutionary algorithms （EAs） in optimization. The algorithm could be changed during the evolutionary progress according to their performances. In addition. a large number of elite individuals were employed in the algorithm and the elite individuals helped algorithm achieve a better performance. while such number of elite individuals stagnated the global convergence in conventional single algorithm. The time complexity was analyzed to demonstrate the novel framework did not increase the time complexity. The simulation results indicate that the proposed framework outperforms any single algorithm that composes the framework.
基金
National Natural Science Foundations of China(Nos.70871091,61075064,61034004,61005090)
Program for New Century Excellent Talents in University of Ministry of Education of China
Ph.D.Programs Foundation of Ministry of Education of China(No.20100072110038)
