Sequence-Based Selection Hyper-Heuristic Model via MAP-Elites
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. Each heuristic usually specializes in specific kinds of problems. Hence, othe...
Main Authors: | Melissa Sanchez, Jorge M. Cruz-Duarte, Jose C. Ortiz-Bayliss, Ivan Amaya |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2021-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9520416/ |
Similar Items
-
A Sequence-Based Hyper-Heuristic for Traveling Thieves
by: Daniel Rodríguez, et al.
Published: (2022-12-01) -
Beyond Hyper-Heuristics: A Squared Hyper-Heuristic Model for Solving Job Shop Scheduling Problems
by: Alonso Vela, et al.
Published: (2022-01-01) -
MatHH: A Matlab-based Hyper-Heuristic framework
by: Jorge M. Cruz-Duarte, et al.
Published: (2022-06-01) -
A Systematic Review of Hyper-Heuristics on Combinatorial Optimization Problems
by: Melissa Sanchez, et al.
Published: (2020-01-01) -
A Feature-Independent Hyper-Heuristic Approach for Solving the Knapsack Problem
by: Xavier Sánchez-Díaz, et al.
Published: (2021-10-01)