Results 41 to 50 of about 7,821 (233)
Hyper-Heuristic Based on ACO and Local Search for Dynamic Optimization Problems
Algorithms, 2021 Hyper-heuristics comprise a set of approaches that are motivated (at least in part) by the objective of intelligently combining heuristic methods to solve hard optimization problems.
Felipe Martins Müller +1 more
doaj +1 more source
A learning automata based multiobjective hyper-heuristic [PDF]
, 2017 Metaheuristics, being tailored to each particular domain by experts, have been successfully applied to many computationally hard optimisation problems. However, once implemented, their application to a new problem domain or a slight change in the problem
John, Robert, Li, Wenwen, Özcan, Ender
core +2 more sources
An Ant Colony based Hyper-Heuristic Approach for the Set Covering Problem
Advances in Distributed Computing and Artificial Intelligence Journal, 2015 The Set Covering Problem (SCP) is a NP-hard combinatorial optimization problem that is challenging for meta-heuristic algorithms. In the optimization literature, several approaches using meta-heuristics have been developed to tackle the SCP and the ...
Alexandre Silvestre FERREIRA +2 more
doaj +1 more source
Sequence-Based Selection Hyper-Heuristic Model via MAP-Elites
IEEE Access, 2021 Although the number of solutions in combinatorial optimization problems (COPs) is finite, some problems grow exponentially and render exact approaches unfeasible. So, approximate methods, such as heuristics, are customary.
Melissa Sanchez +3 more
doaj +1 more source
How Much Is Too Much? Facing Practical Limitations in Hyper-Heuristic Design for Packing Problems
AlgorithmsHyper-heuristics, or simply heuristics to choose heuristics, represent a powerful approach to tackling complex optimization problems. These methods decide which heuristic to apply throughout the solving process, aiming to improve the solving process ...
José Carlos Ortiz-Bayliss +2 more
doaj +1 more source
Intelligent System Design Using Hyper-Heuristics
South African Computer Journal, 2015 Determining the most appropriate search method or artificial intelligence technique to solve a problem is not always evident and usually requires implementation of the different approaches to ascertain this. In some instances a single approach may not be
Nelishia Pillay
doaj +1 more source
IEEE AccessRobotic Mobile Fulfillment Systems (RMFS) are an example of warehouse automation. Nonetheless, the complexity of RMFS is such that tackling the entire problem at once is unfeasible. So, this work focuses on a component known as the Pod Allocation Problem
Maria Torcoroma Benavides-Robles +3 more
doaj +1 more source
HyperDE: An Adaptive Hyper-Heuristic for Global Optimization
Algorithms, 2023 In this paper, a novel global optimization approach in the form of an adaptive hyper-heuristic, namely HyperDE, is proposed. As the naming suggests, the method is based on the Differential Evolution (DE) heuristic, which is a well-established ...
Alexandru-Razvan Manescu +1 more
doaj +1 more source
A genetic programming hyper-heuristic for the multidimensional knapsack problem [PDF]
, 2014 Purpose: Hyper-heuristics are a class of high-level search techniques which operate on a search space of heuristics rather than directly on a search space of solutions.
David Griffiths +6 more
core +2 more sources
Batched Mode Hyper-heuristics [PDF]
, 2013 A primary role for hyper-heuristics is to control search processes based on moves generated by neighbourhood operators. Studies have shown that such hyper-heuristics can be effectively used, without modification, for solving unseen problem instances not only from a particular domain, but also on different problem domains.
Shahriar Asta +2 more
openaire +1 more source