Enhancing Hyperheuristics for the Knapsack Problem through Fuzzy Logic. [PDF]
Hyperheuristics rise as powerful techniques that get good results in less computational time than exact methods like dynamic programming or branch and bound. These exact methods promise the global best solution, but with a high computational time. In this matter, hyperheuristics do not promise the global best solution, but they promise a good solution ...
Olivas F +4 more
europepmc +4 more sources
Nested Markov chain hyper-heuristic (NMHH): a hybrid hyper-heuristic framework for single-objective continuous problems [PDF]
This article introduces a new hybrid hyper-heuristic framework that deals with single-objective continuous optimization problems. This approach employs a nested Markov chain on the base level in the search for the best-performing operators and their ...
Nándor Bándi, Noémi Gaskó
doaj +3 more sources
An adaptive neuroevolution-based hyperheuristic [PDF]
TIN2016-78365R BERC 2014-2017 Research Groups 2013-2018 (IT-609-13).
Etor Arza +3 more
openaire +4 more sources
Evolutionary Hyperheuristics for Location-Routing Problem with Simultaneous Pickup and Delivery
This paper presents an evolution-based hyperheuristic (EHH) for addressing the capacitated location-routing problem (CLRP) and one of its more practicable variants, namely, CLRP with simultaneous pickup and delivery (CLRPSPD), which are significant and ...
Yanwei Zhao +4 more
doaj +2 more sources
Optimizing Shared-memory Hyperheuristics on Top of Parameterized Metaheuristics
AbstractThis paper studies the auto-tuning of shared-memory hyperheuristics developed on top of a unified shared-memory metaheuristic scheme. A theoretical model of the execution time of the unified scheme is empirically adapted for particular metaheuristics and hyperheuristics through experimentation.
José-Matías Cutillas-Lozano +1 more
exaly +2 more sources
Search Trajectory Networks Applied to the Cyclic Bandwidth Sum Problem
Search trajectory networks (STNs) were proposed as a tool to analyze the behavior of metaheuristics in relation to their exploration ability and the search space regions they traverse.
Valentina Narvaez-Teran +2 more
doaj +1 more source
Global Optimisation through Hyper-Heuristics: Unfolding Population-Based Metaheuristics
Optimisation has been with us since before the first humans opened their eyes to natural phenomena that inspire technological progress. Nowadays, it is quite hard to find a solver from the overpopulation of metaheuristics that properly deals with a given
Jorge M. Cruz-Duarte +3 more
doaj +1 more source
Evolution of group-theoretic cryptology attacks using hyper-heuristics
In previous work, we developed a single evolutionary algorithm (EA) to solve random instances of the Anshel–Anshel–Goldfeld (AAG) key exchange protocol over polycyclic groups. The EA consisted of six simple heuristics which manipulated strings.
Craven Matthew J., Woodward John R.
doaj +1 more source
As exact algorithms are unfeasible to solve real optimization problems, due to their computational complexity, meta-heuristics are usually used to solve them.
Vinicius Renan de Carvalho +2 more
doaj +1 more source
Beyond Hyper-Heuristics: A Squared Hyper-Heuristic Model for Solving Job Shop Scheduling Problems
Hyper-heuristics (HHs) stand as a relatively recent approach to solving optimization problems. There are different kinds of HHs. One of them deals with how low-level heuristics must be combined to deliver an improved solution to a set of problem ...
Alonso Vela +3 more
doaj +1 more source

