Results 21 to 30 of about 3,794 (238)
Hyper-heuristics for personnel scheduling domains
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
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
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.
Melissa Sanchez +3 more
doaj +1 more source
Searching the Hyper-heuristic Design Space [PDF]
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
Optimizing agents with genetic programming : an evaluation of hyper-heuristics in dynamic real-time logistics [PDF]
Dynamic pickup and delivery problems (PDPs) require online algorithms for managing a fleet of vehicles. Generally, vehicles can be managed either centrally or decentrally. A common way to coordinate agents decentrally is to use the contract-net protocol (
Branke, Jürgen +2 more
core +1 more source
Selection hyper-heuristics in dynamic environments [PDF]
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 Novel Cooperative Multi-Stage Hyper-Heuristic for Combination Optimization Problems
A hyper-heuristic algorithm is a general solution framework that adaptively selects the optimizer to address complex problems. A classical hyper-heuristic framework consists of two levels, including the high-level heuristic and a set of low-level ...
Fuqing Zhao +4 more
doaj +1 more source
A comparison of crossover control mechanisms within single-point selection hyper-heuristics using HyFlex [PDF]
Hyper-heuristics are search methodologies which operate at a higher level of abstraction than traditional search and optimisation techniques. Rather than operating on a search space of solutions directly, a hyper-heuristic searches a space of low-level ...
Burke, Edmund K. +2 more
core +1 more source
State-of-the-art dari metode yang digunakan untuk menyelesaikan permasalahan optimasi kombinatorik, yang diketahui sebagai permasalahan NP-hard, adalah meta-heuristics.
Arif Djunaidy +2 more
doaj +1 more source
HyperDE: An Adaptive Hyper-Heuristic for Global Optimization
In this paper, a novel global optimization approach in the form of an adaptive hyper-heuristic, namely HyperDE, is proposed. As the naming suggests, the method is based on the Differential Evolution (DE) heuristic, which is a well-established ...
Alexandru-Razvan Manescu +1 more
doaj +1 more source

