Journal
APPLIED SCIENCES-BASEL
Volume 11, Issue 21, Pages -Publisher
MDPI
DOI: 10.3390/app112110209
Keywords
hyper-heuristics; knapsack problem; optimization
Categories
Funding
- research group with strategic focus in intelligent systems at ITESM [NUA A00834075]
- CONACyT [287479, 2021-000001-01NACF-00604]
Ask authors/readers for more resources
The research investigates the application of hyper-heuristics in automatic learning, proposing a feature-independent hyper-heuristic model for solving knapsack problems. The results show that the model performs well under different learning conditions and problem sets.
Recent years have witnessed a growing interest in automatic learning mechanisms and applications. The concept of hyper-heuristics, algorithms that either select among existing algorithms or generate new ones, holds high relevance in this matter. Current research suggests that, under certain circumstances, hyper-heuristics outperform single heuristics when evaluated in isolation. When hyper-heuristics are selected among existing algorithms, they map problem states into suitable solvers. Unfortunately, identifying the features that accurately describe the problem state-and thus allow for a proper mapping-requires plenty of domain-specific knowledge, which is not always available. This work proposes a simple yet effective hyper-heuristic model that does not rely on problem features to produce such a mapping. The model defines a fixed sequence of heuristics that improves the solving process of knapsack problems. This research comprises an analysis of feature-independent hyper-heuristic performance under different learning conditions and different problem sets.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available