Results 71 to 80 of about 3,794 (238)
Hyper-heuristics are aimed at providing a generalized solution to optimization problems rather than producing the best result for one or more problem instances.
Nelishia Pillay
doaj
A multi-objective hyper-heuristic based on choice function [PDF]
Hyper-heuristics are emerging methodologies that perform a search over the space of heuristics in an attempt to solve difficult computational optimization problems.
Kendall, Graham +2 more
core +2 more sources
Distributed hyper-heuristics for real parameter optimization [PDF]
Hyper-heuristics (HHs) are heuristics that work with an arbitrary set of search operators or algorithms and combine these algorithms adaptively to achieve a better performance than any of the original heuristics. While HHs lend themselves naturally for distributed deployment, relatively little attention has been paid so far on the design and evaluation
Biazzini, Marco +3 more
openaire +2 more sources
How to Conduct a Multi‐Domain Systematic (Literature) Review? Guidelines Using The Lotus Protocol
ABSTRACT Complex challenges increasingly demand multidisciplinary research across intersecting knowledge domains. However, existing systematic (literature) review protocols offer limited guidance and tend to confine scholars to single‐domain or single‐intersection reviews.
Bart J. A. van Bueren +6 more
wiley +1 more source
Dynamic Evolution and Transformative Trends in the Consumer Market: A Technology Paradox Perspective
ABSTRACT The consumer market is defined by tensions arising from the clash between technological advancement and consumer psychology. Current research lacks a unifying framework to explain these contradictions. Addressing this gap, we introduce a conceptual model based on technology paradox theory, which maps the dynamic process from antecedents ...
Chanaka Jayawardhena +3 more
wiley +1 more source
Heuristic generation via parameter tuning for online bin packing [PDF]
Online bin packing requires immediate decisions to be made for placing an incoming item one at a time into bins of fixed capacity without causing any overflow. The goal is to maximise the average bin fullness after placement of a long stream of items.
Asta, Shahriar +3 more
core +2 more sources
Multi‐Agent Reinforcement Learning for Joint Police Patrol and Dispatch
ABSTRACT Police patrol units need to split their time between performing preventive patrol and being dispatched to serve emergency incidents. In the existing literature, patrol and dispatch decisions are often studied separately. We consider joint optimization of these two decisions to improve police operations efficiency and reduce response time to ...
Matthew Repasky, He Wang, Yao Xie
wiley +1 more source
Application of Heuristic Combinations within a Hyper-Heuristic Framework for Exam Timetabling
Examination Timetabling Problem is one of the optimization and combinatorial problems. It is proved to be a non-deterministic polynomial (NP)-hard problem.
Gabriella Icasia +2 more
doaj +1 more source
Offline Learning for Selection Hyper-heuristics with Elman Networks [PDF]
This is the author accepted manuscript. The final version is available from the publisher via the link in this record.Offline selection hyper-heuristics are machine learning methods that are trained on heuristic selections to create an algorithm that is ...
Keedwell, E, Yates, W
core
Hyper-Heuristic Approach for Improving Marker Efficiency [PDF]
Abstract Marker planning is an optimization arrangement problem, where a set of cutting parts need to be placed on a thin paper without overlapping to create a marker – an exact diagram of cutting parts that will be cut from a single spread. An optimal marker that utilizes the length of textile material has to be obtained.
Rolich, Tomislav +2 more
openaire +2 more sources

