An analysis of the Taguchi method for tuning a memetic algorithm with reduced computational time budget

QR Code

An analysis of the Taguchi method for tuning a memetic algorithm with reduced computational time budget

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 budget. In this study, the results from our previous wo...

Full description

Bibliographic Details
Main Authors:	Gümüş, Düriye Betül, Özcan, Ender, Atkin, Jason
Format:	Book Section
Published:	Springer 2016
Subjects:	Evolutionary algorithm; Parameter tuning; Design of experiments; Hyper-heuristic; Optimisation
Online Access:	https://eprints.nottingham.ac.uk/37338/

Similar Items

An investigation of tuning a memetic algorithm for cross-domain search
by: Gumus, Duriye Betul, et al.
Published: (2016)

A self-adaptive multimeme memetic algorithm co-evolving utility scores to control genetic operators and their parameter settings
by: Özcan, Ender, et al.
Published: (2016)

A learning automata based multiobjective hyper-heuristic
by: Li, Wenwen, et al.
Published: (2017)

An adaptive multi meme memetic algorithm embedding choice function, reinforcement learning and simple random hyper-heuristics
by: Ozcagdavul, Mazlum
Published: (2015)

Multi-objective evolutionary algorithms and hyper-heuristics for wind farm layout optimisation
by: Li, Wenwen, et al.
Published: (2017)

A multi-objective hyper-heuristic based on choice function
by: Maashi, Mashael, et al.
Published: (2014)

An iterated multi-stage selection hyper-heuristic
by: Kheiri, Ahmed, et al.
Published: (2016)

An adaptive multi meme memetic algorithm embedding choice function hyper-heuristic
by: Qarout, Rehab
Published: (2015)

Hyper-heuristics: a survey of the state of the art
by: Burke, Edmund, et al.
Published: (2013)

Hyper-heuristic approaches to automatically designing heuristics as mutation operators for evolutionary programming on function classes
by: Hong, Libin
Published: (2018)

Hyper-heuristics for grouping problems
by: Elhag, Anas
Published: (2015)

Automated generation of constructive ordering heuristics for educational timetabling
by: Pillay, Nelishia, et al.
Published: (2017)

Parameter tuning for cross-domain search
by: Gumus, Duriye Betul
Published: (2020)

Multi-stage hyper-heuristics for optimisation problems
by: Kheiri, Ahmed
Published: (2014)

A case study of controlling crossover in a selection hyper-heuristic framework using the multidimensional knapsack problem
by: Drake, John H., et al.
Published: (2015)

A hyper-heuristic approach to automated generation of mutation operators for evolutionary programming
by: Hong, Libin, et al.
Published: (2017)

Automating the packing heuristic design process with genetic programming
by: Burke, Edmund K., et al.
Published: (2012)

Sparse, continuous policy representations for uniform online bin packing via regression of interpolants
by: Swan, Jerry, et al.
Published: (2017)

Crossover control in selection hyper-heuristics: case studies using MKP and HyFlex
by: Drake, John H.
Published: (2014)

Multiobjective selection hyper-heuristics using reinforcement learning
by: Li, Wenwen
Published: (2018)

A tensor-based selection hyper-heuristic for cross-domain heuristic search
by: Asta, Shahriar, et al.
Published: (2015)

Performance comparison of selection hyper-heuristics on new HyFlex domains
by: Almutairi, Alhanof Khalid S
Published: (2015)

Choice function based hyper-heuristics for multi-objective optimization
by: Özcan, Ender
Published: (2015)

Modified choice function heuristic selection for the multidimensional knapsack problem
by: Drake, John H., et al.
Published: (2014)

A genetic programming hyper-heuristic for the multidimensional knapsack problem
by: Drake, John H., et al.
Published: (2014)

'Enhanced Direct and Indirect Genetic Algorithm Approaches for a Mall Layout and Tenant Selection Problem'
by: Aickelin, Uwe, et al.
Published: (2002)

Enhanced Direct and Indirect Genetic Algorithm Approaches for a Mall Layout and Tenant Selection Problem
by: Aickelin, Uwe, et al.
Published: (2002)

'Enhanced Direct and Indirect Genetic Algorithm Approaches for a Mall Layout and Tenant Selection Problem'
by: Aickelin, Uwe, et al.
Published: (2002)

A heuristic approach to optimal design of an underground mine stope layout
by: Sandanayake, D., et al.
Published: (2015)

A stochastic local search algorithm with adaptive acceptance for high-school timetabling
by: Kheiri, Ahmed, et al.
Published: (2014)

Improving performance of a hyper-heuristic using a multilayer perceptron for vehicle routing
by: Tyasnurita, Raras, et al.
Published: (2015)

Ant algorithm hyperheuristic approaches for scheduling problems
by: O'Brien, Ross
Published: (2008)

A hybrid evolutionary approach to the nurse rostering problem
by: Bai, Ruibin, et al.
Published: (2010)

A graph-based hyper heuristic for timetabling problems
by: Burke, Edmund, et al.
Published: (2007)

A graph-based hyper heuristic for timetabling problems
by: Burke, Edmund, et al.
Published: (2007)

Constructing constrained-version of magic squares using selection hyper-heuristics
by: Kheiri, Ahmed, et al.
Published: (2014)

High school timetabling using selection hyperheuristics
by: Nasir Ahmed, Leena Hassan
Published: (2014)

A tensor based hyper-heuristic for nurse rostering
by: Asta, Shahriar, et al.
Published: (2016)

Tuning a Simulated Annealing metaheuristic for cross-domain search
by: Jackson, Warren G., et al.
Published: (2017)

'An Indirect Genetic Algorithm for Set Covering Problems'
by: Aickelin, Uwe
Published: (2002)