Results 211 to 220 of about 305,569 (242)
Some of the next articles are maybe not open access.
Enhancing Stochastic Search Performance by Value-Biased Randomization of Heuristics
Journal of Heuristics, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stephen F Smith +2 more
exaly +2 more sources
Analyzing Randomized Search Heuristics: Tools from Probability Theory
Theoretical Computer Science, 2011Benjamin Doerr
exaly +2 more sources
Annual Conference on Genetic and Evolutionary Computation, 2020
Several important optimization problems in the area of vehicle routing can be seen as variants of the classical Traveling Salesperson Problem (TSP). In the area of evolutionary computation, the Traveling Thief Problem (TTP) has gained increasing interest
Jakob Bossek +3 more
semanticscholar +1 more source
Several important optimization problems in the area of vehicle routing can be seen as variants of the classical Traveling Salesperson Problem (TSP). In the area of evolutionary computation, the Traveling Thief Problem (TTP) has gained increasing interest
Jakob Bossek +3 more
semanticscholar +1 more source
Potency-Based Heuristic Search with Randomness for Explicit Model Checking
2023Efficient state-space exploration has a significant impact on reachability analysis in explicit model checking and existing tools use several variants of search heuristics and random walks in order to overcome the state-space explosion problem. We contribute with a novel approach based on a random search strategy, where actions are assigned dynamically
Emil G. Henriksen +6 more
openaire +2 more sources
Logarithmic Convergence of Random Heuristic Search
Evolutionary Computation, 1996This paper speaks to the inherent emergent behavior of genetic search. For completeness and generality, a class of stochastic search algorithms, random heuristic search, is reviewed. A general convergence theorem for this class is then proved. Since the simple genetic algorithm (GA) is an instance of random heuristic search, a corollary is a result ...
openaire +1 more source
Amplification of Search Performance through Randomization of Heuristics
2002Randomization as a means for improving search performance in combinatorial domains has received increasing interest in recent years. In optimization contexts, it can provide a means for overcoming the deficiencies of available search heuristics and broadening search in productive directions.
Vincent A. Cicirello, Stephen F. Smith
openaire +1 more source
A random search heuristic for a multi-objective production planning
Computers & Industrial Engineering, 2012Real world production planning is involved in optimizing different objectives while considering a spectrum of parameters, decision variables, and constraints of the corresponding cases. This comes from the fact that production managers desire to utilize from an ideal production plan by considering a number of objectives over a set of technological ...
Mehdi Karimi-Nasab, Ioannis Konstantaras
openaire +1 more source
Random heuristic search: applications to GAs and functions of unitation
Computer Methods in Applied Mechanics and Engineering, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vose, Michael D., Rowe, Jonathan E.
openaire +1 more source
Stable Resolving - A Randomized Local Search Heuristic for MaxSAT
2020Many problems from industrial applications and AI can be encoded as Maximum Satisfiability (MaxSAT). Often, it is more desirable to produce practicable results in very short time compared to optimal solutions after an arbitrary long computation time. In this paper, we propose Stable Resolving (SR), a novel randomized local search heuristic for MaxSAT ...
Julian Reisch +2 more
openaire +1 more source