Combining weak learning heuristics in general problem solvers [PDF]
, 1987 This paper is concerned with state space problem solvers that achieve generality by learning strong heuristics through experience in a particular domain.
McCluskey, T.L.
core +4 more sources
New variants of variable neighbourhood search for 0-1 mixed integer programming and clustering [PDF]
, 2010 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Many real-world optimisation problems are discrete in nature.
Lazić, Jasmina
core +7 more sources
Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem [PDF]
, 2009 This paper studies heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree using edges that are as similar as possible.
Darby-Dowman, K +3 more
core +1 more source
On the size of weights in randomized search heuristics [PDF]
, 2008 Runtime analyses of randomized search heuristics for combinatorial optimization problems often depend on the size of the largest weight. We consider replacing the given set of weights with smaller weights such that the behavior of the randomized search ...
Skutella, Martin, Reichel, Joachim
core +1 more source
Nonparametric Comparison of Two Dynamic Parameter Setting Methods in a Meta-Heuristic Approach [PDF]
Journal of Systemics, Cybernetics and Informatics, 2007 Meta-heuristics are commonly used to solve combinatorial problems in practice. Many approaches provide very good quality solutions in a short amount of computational time; however most meta-heuristics use parameters to tune the performance of the meta ...
Seyhun HEPDOGAN +3 more
doaj
IEEE AccessDriven by an unprecedented surge in freight transportation and city logistics, this paper tackles a practical variant of the famous Vehicle Routing Problem that jointly accounts for the existence of a heterogeneous fleet of vehicles, customers’ ...
Moayad Tanash, Rami As'Ad
doaj +1 more source
Comparative Study of Intelligent Scheduling Algorithms for Heterogeneous Systems [PDF]
IJCI International Journal of Computers and InformationScheduling tasks in a heterogeneous computing environment can be a challenging problem due to the diverse range of hardware and software resources available. In this comparative study different approaches are investigated for solving multitask scheduling
Abla Elsayed +3 more
doaj +1 more source
Acoustical and behavioral heuristics for fast interactive sound design.
PLoS ONEDuring their creative process, designers routinely seek the feedback of end users. Yet, the collection of perceptual judgments is costly and time-consuming, since it involves repeated exposure to the designed object under elementary variations.
Ava Souaille +4 more
doaj +1 more source
Insertion Heuristics for Central Cycle Problems [PDF]
, 2006 A central cycle problem requires a cycle that is reasonably short and keeps a the maximum distance from any node not on the cycle to its nearest node on the cycle reasonably low.
Lamb, John Douglas
core +2 more sources
Joint Interference and Power Minimization for Fault-Tolerant Topology in Sensor Networks
IEEE AccessEnergy conservation is crucial in wireless ad hoc sensor network design to increase network lifetime. Since communication consumes a major part of the energy used by a sensor node, efficient communication is important.
Renato E. N. de Moraes +4 more
doaj +1 more source