Results 31 to 40 of about 4,754 (207)

Hyper-heuristics for personnel scheduling domains

open access: yesArtificial Intelligence, 2022
In real-life applications problems can frequently change or require small adaptations. Manually creating and tuning algorithms for different problem domains or different versions of a problem can be cumbersome and time-consuming. In this paper we consider several important problems with high practical relevance, which are Bus Driver Scheduling ...
Lucas Kletzander, Nysret Musliu
openaire   +1 more source

Agent State Flipping Based Hybridization of Heuristic Optimization Algorithms: A Case of Bat Algorithm and Krill Herd Hybrid Algorithm

open access: yesAlgorithms, 2021
This paper describes a unique meta-heuristic technique for hybridizing bio-inspired heuristic algorithms. The technique is based on altering the state of agents using a logistic probability function that is dependent on an agent’s fitness rank.
Robertas Damaševičius   +1 more
doaj   +1 more source

Searching the Hyper-heuristic Design Space [PDF]

open access: yesCognitive Computation, 2013
We extend a previous mathematical formulation of hyper-heuristics to reflect the emerging generalization of the concept. We show that this leads naturally to a recursive definition of hyper-heuristics and to a division of responsibility that is suggestive of a blackboard architecture, in which individual heuristics annotate a shared workspace with ...
Swan, Jerry   +4 more
openaire   +3 more sources

Selection hyper-heuristics in dynamic environments [PDF]

open access: yesJournal of the Operational Research Society, 2013
Current state-of-the-art methodologies are mostly developed for stationary optimization problems. However, many real-world problems are dynamic in nature, where different types of changes may occur over time. Population-based approaches, such as evolutionary algorithms, are frequently used for solving dynamic environment problems.
Kiraz, B., Etaner-Uyar, A. S., Ozcan, E.
openaire   +2 more sources

A Hyper-Heuristic for the Preemptive Single Machine Scheduling Problem to Minimize the Total Weighted Tardiness

open access: yesApplied Computer Systems, 2022
A problem of minimizing the total weighted tardiness in the preemptive single machine scheduling for discrete manufacturing is considered. A hyper-heuristic is presented, which is composed of 24 various heuristics, to find an approximately optimal ...
Romanuke Vadim
doaj   +1 more source

A Late Acceptance Hyper-Heuristic Approach for the Optimization Problem of Distributing Pilgrims over Mina Tents [PDF]

open access: yesJournal 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

open access: yesComplexity, 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

Hyper-Heuristic Based on ACO and Local Search for Dynamic Optimization Problems

open access: yesAlgorithms, 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

An Ant Colony based Hyper-Heuristic Approach for the Set Covering Problem

open access: yesAdvances 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

Sequence-Based Selection Hyper-Heuristic Model via MAP-Elites

open access: yesIEEE 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

Home - About - Disclaimer - Privacy