Results 21 to 30 of about 1,346,527 (187)
MatHH: A Matlab-based Hyper-Heuristic framework
SoftwareX, 2022 Hyper-Heuristics (HHs) have proven to be a valuable tool for solving complex problems, such as Combinatorial Optimization Problems (COPs). These solvers have an assorted set of models arising through extensive research from the scientific community ...
Jorge M. Cruz-Duarte +2 more
doaj +1 more source
A Late Acceptance Hyper-Heuristic Approach for the Optimization Problem of Distributing Pilgrims over Mina Tents [PDF]
Journal of Universal Computer Science, 2022 About three million Muslims are traveling annually to Makkah in Saudi Arabia to perform the rituals of Hajj (i.e. the pilgrimage), the fifth pillar of Islam.
Mohd Khaled Y. Shambour, Esam A. Khan
doaj +3 more sources
A Methodology for Classifying Search Operators as Intensification or Diversification Heuristics
Complexity, 2020 Selection hyper-heuristics are generic search tools that dynamically choose, from a given pool, the most promising operator (low-level heuristic) to apply at each iteration of the search process. The performance of these methods depends on the quality of
Jorge A. Soria-Alcaraz +5 more
doaj +1 more source
A hyper-heuristic methodology to generate adaptive strategies for games [PDF]
, 2017 Hyper-heuristics have been successfully applied in solving a variety of computational search problems. In this study, we investigate a hyper-heuristic methodology to generate adaptive strategies for games.
Kendall, Graham, Kendall, G., Li, Jiawei
core +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
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
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
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
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
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