Skip to main content

Research Repository

Advanced Search

All Outputs (6)

An analysis of the Taguchi method for tuning a memetic algorithm with reduced computational time budget (2016)
Conference Proceeding

Determining the best initial parameter values for an algorithm, called parameter tuning, is crucial to obtaining better algorithm performance; however, it is often a time-consuming task and needs to be performed under a restricted computational budge... Read More about An analysis of the Taguchi method for tuning a memetic algorithm with reduced computational time budget.

Automatically designing more general mutation operators of Evolutionary Programming for groups of function classes using a hyper-heuristic (2016)
Conference Proceeding

In this study we use Genetic Programming (GP) as an offline hyper-heuristic to evolve a mutation operator for Evolutionary Programming. This is done using the Gaussian and uniform distributions as the terminal set, and arithmetic operators as the fun... Read More about Automatically designing more general mutation operators of Evolutionary Programming for groups of function classes using a hyper-heuristic.