ABSTRACT
We suggest a flavour of linear Genetic Programming indomain-specific languages that acts as a hyperheuristic (HH).
- G. Jayalakshmi, S. Sathiamoorthy, and R. Rajaram. An hybrid genetic algorithm. International Journal of Computational Engineering Science, 2(2):339--355, 2001.Google ScholarCross Ref
- R. E. Keller and R. Poli. Linear Genetic Programming of Metaheuristics. Technical Report CSM-468, Department of Computer Science, University of Essex, 2007.Google ScholarDigital Library
- Linear genetic programming of metaheuristics
Recommendations
Metaheuristics for large-scale instances of the linear ordering problem
ILS and GDA metaheuristics for the linear ordering problem are introduced.They are able to tackle large instances in line with real applications.Introduced methods are the first of their kind ever applied to large-sized instances.All best known ...
A Time-Efficient Method for Metaheuristics: Using Tabu Search and Tabu GA as a Case
HIS '09: Proceedings of the 2009 Ninth International Conference on Hybrid Intelligent Systems - Volume 02This paper presents an efficient algorithm for reducing the computation time of metaheuristics. The proposed algorithm is motivated by the observation that some of the subsolutions of metaheuristics will eventually end up being part of the final ...
A genetic programming approach for solving the linear ordering problem
HAIS'12: Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part IIThe linear ordering problem (LOP) consists in rearranging the rows and columns of a given square matrix such that the sum of the super-diagonal entries is as large as possible. The LOP has a significant number of important practical applications. In ...
Comments