Results 281 to 290 of about 34,283 (310)

Simulated annealing algorithm in problems of multiprocessor scheduling

Automation and Remote Control, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniil A. Zorin, Valery A. Kostenko
openaire   +2 more sources

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

Scale Invariance Properties in the Simulated Annealing Algorithm

Methodology And Computing In Applied Probability, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fleischer, M. A., Jacobson, S. H.
openaire   +1 more source

Performance of the simulated annealing algorithm

1987
The performance analysis of an approximation algorithm concentrates on the following two quantities: the quality of the final solution obtained by the algorithm, i.e. the difference in cost value between the final solution and a globally minimal configuration; the running time required by the algorithm.
Peter J. M. van Laarhoven, Emile H. L. Aarts   +1 more
openaire   +1 more source

Genetic Algorithms and Simulated Annealing

2001
This chapter introduces the basic concepts and notation of genetic algorithms and simulated annealing, which are two basic search methodologies that can be used for modelling and simulation of complex non-linear dynamical systems. Since both techniques can be considered as general purpose optimization methodologies, we can use them to find the ...
Oscar Castillo, Patricia Melin
openaire   +1 more source

Three Parallel Algorithms for Simulated Annealing

2002
A vehicle routing problem which reduces to an NP-complete set-partitioning problem is considered. Three parallel algorithms for simulated annealing, i.e. the independent, semi-independent and co-operating searches are investigated. The objective is to improve the accuracy of solutions to the problem by applying parallelism.
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