Parameter tuning is a challenging and time-consuming task, crucial to obtaining improved metaheuristic performance. There is growing interest in cross-domain search methods, which consider a range of optimisation problems rather than being specialised for a single domain. Metaheuristics and hyper-heuristics are typically used as high-level cross-domain search methods, utilising problem-specific low-level heuristics for each problem domain to modify a solution. Such methods have a number of parameters to control their behaviour, whose initial settings can influence their search behaviour significantly. Previous methods in the literature either fix these parameters based on previous experience, or set them specifically for particular problem ...
Abstract Automating the design of heuristic search methods is an active research field within comput...
International audienceMetaheuristic methods have been demonstrated to be efficient tools to solve ha...
Selection hyper-heuristics perform search over the space of heuristics by mixing and controlling a p...
Parameter tuning is a challenging and time-consuming task, crucial to obtaining improved metaheurist...
Metaheuristics usually have algorithmic parameters whose initial settings can influence their search...
Memetic algorithms, which hybridise evolutionary algorithms with local search, are well-known metahe...
Simulated Annealing is a well known local search metaheuristic used for solving computationally hard...
Determining the best initial parameter values for an algorithm, called parameter tuning, is crucial ...
Metaheuristics provide high-level instructions for designing heuristic optimisation algorithms and h...
A metaheuristic is a generic algorithmic template that, once properly instantiated, can be used for ...
Heuristic search methods have been applied to a wide variety of optimisation problems. A central ele...
© 1997-2012 IEEE. Metaheuristics, being tailored to each particular domain by experts, have been suc...
Metaheuristics are approximation methods used to solve combinatorial optimization problems. Their pe...
Hyper-heuristics are general-purpose heuristic search methodologies for solving combinatorial optim...
There is a growing number of studies on general purpose metaheuristics that are directly...
Abstract Automating the design of heuristic search methods is an active research field within comput...
International audienceMetaheuristic methods have been demonstrated to be efficient tools to solve ha...
Selection hyper-heuristics perform search over the space of heuristics by mixing and controlling a p...
Parameter tuning is a challenging and time-consuming task, crucial to obtaining improved metaheurist...
Metaheuristics usually have algorithmic parameters whose initial settings can influence their search...
Memetic algorithms, which hybridise evolutionary algorithms with local search, are well-known metahe...
Simulated Annealing is a well known local search metaheuristic used for solving computationally hard...
Determining the best initial parameter values for an algorithm, called parameter tuning, is crucial ...
Metaheuristics provide high-level instructions for designing heuristic optimisation algorithms and h...
A metaheuristic is a generic algorithmic template that, once properly instantiated, can be used for ...
Heuristic search methods have been applied to a wide variety of optimisation problems. A central ele...
© 1997-2012 IEEE. Metaheuristics, being tailored to each particular domain by experts, have been suc...
Metaheuristics are approximation methods used to solve combinatorial optimization problems. Their pe...
Hyper-heuristics are general-purpose heuristic search methodologies for solving combinatorial optim...
There is a growing number of studies on general purpose metaheuristics that are directly...
Abstract Automating the design of heuristic search methods is an active research field within comput...
International audienceMetaheuristic methods have been demonstrated to be efficient tools to solve ha...
Selection hyper-heuristics perform search over the space of heuristics by mixing and controlling a p...