Subheuristic search and scalability in a hyperheuristic
暂无分享,去创建一个
Our previous work has introduced a {hyperheuristic} (HH) approach based on Genetic Programming (GP). There, GP employs user-given languages where domain-specific local heuristics are used as primitives for producing specialised metaheuristics (MH). Here, we show that the GP-HH works well with simple generic languages over subheuristic primitives, dealing with increases of problem size and reduction of resources. The system produces effective and efficient MHs that deliver best results known in a chosen test domain. We also demonstrate that user-given, modest domain information allows the HH to produce an improvement over a previous best result from the literature.
[1] Riccardo Poli,et al. Linear genetic programming of parsimonious metaheuristics , 2007, 2007 IEEE Congress on Evolutionary Computation.
[2] Shi Yu-wen. An Hybrid Genetic Algorithm for Solving L(2,1)-Label of Graph , 2010 .
[3] G. Andal Jayalakshmi,et al. A Hybrid Genetic Algorithm - A New Approach to Solve Traveling Salesman Problem , 2001, Int. J. Comput. Eng. Sci..