Results 271 to 280 of about 122,614 (295)

Design and Simulation of Simulated Annealing Algorithm with Harmony Search

2010
Harmony search is a new heuristic optimization algorithm. Comparing with other algorithms, this algorithm has very strong robustness and can be easily operated. Combining with the features of harmony search, an improved simulated annealing algorithm is proposed in this paper. It can improve the speed of annealing.
Hua Jiang, Yanxiu Liu, Liping Zheng
openaire   +1 more source

Simulated Annealing Genetic Algorithm for Surface Intersection

2005
The paper integrated genetic algorithm and marching method into a novel algorithm to solve the surface intersection problem. By combining genetic algorithm with local searching method the efficiency of evolution is greatly improved. By fully utilizing the global searching ability and instinct attribute for parallel computation of genetic algorithm and ...
Min Tang 0001, Jinxiang Dong
openaire   +1 more source

Genetic algorithms and simulated annealing

2009
Many applications require either the maximisation or minimisation of a function. For example, in many fields of theoretical physics, a sum of least squares must be minimised, or the energy of a system must be minimised. Many of the standard numerical techniques which exist for the optimisation of functions apply to functions which can be specified in a
openaire   +1 more source

Prospects for Simulated Annealing Algorithms in Automatic Differentiation

2001
We present new ideas on how to make simulated annealing applicable to the combinatorial optimization problem of accumulating a Jacobian matrix of a given vector function using the minimal number of arithmetic operations. Building on vertex elimination in computational graphs we describe how simulated annealing can be used to find good approximations to
Uwe Naumann, Peter Gottschling
openaire   +1 more source

Genetic algorithms and simulated annealing: a marriage proposal

IEEE International Conference on Neural Networks, 2002
Genetic algorithms (GAs) and simulated annealing (SA) have emerged as the leading methodologies for search and optimization problems in high dimensional spaces. A simple scheme of using simulated-annealing mutation (SAM) and recombination (SAR) as operators use the SA stochastic acceptance function internally to limit adverse moves.
openaire   +1 more source

Simulated Annealing Algorithm

2023
openaire   +1 more source

A Comparison of Simulated Annealing with a Simple Evolutionary Algorithm

2005
Evolutionary algorithms belong to the class of general randomized search heuristics. Theoretical investigations often concentrate on simple instances like the well-known (1+1) EA. This EA is very similar to simulated annealing, another general randomized search heuristic.
openaire   +1 more source

Parallel Simulated Annealing with a Greedy Algorithm for Bayesian Network Structure Learning

IEEE Transactions on Knowledge and Data Engineering, 2020
Sangmin Lee, Seoung Bum Kim
exaly  

A simple simulated annealing algorithm for the maximum clique problem

Information Sciences, 2007
Linqiang Pan
exaly  

Hybrid Whale Optimization Algorithm with simulated annealing for feature selection

Neurocomputing, 2017
Majdi Mafarja, Seyedali Mirjalili
exaly