Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
A simulated annealing version of the EM algorithm for non-Gaussian deconvolution
Statistics and Computing
A methodological approach to parallel simulated annealing on an SMP System
Journal of Parallel and Distributed Computing
Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
Computers and Operations Research
An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
Computers and Operations Research
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
Evolutionary programming made faster
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
On combining support vector machines and simulated annealing in stereovision matching
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Very fast simulated re-annealing
Mathematical and Computer Modelling: An International Journal
Simulated annealing: Practice versus theory
Mathematical and Computer Modelling: An International Journal
Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Solving the constrained p-center problem using heuristic algorithms
Applied Soft Computing
Robot base disturbance optimization with compact differential evolution light
EvoApplications'12 Proceedings of the 2012t European conference on Applications of Evolutionary Computation
An intelligent augmentation of particle swarm optimization with multiple adaptive methods
Information Sciences: an International Journal
Multi-agent simulated annealing algorithm based on differential evolution algorithm
International Journal of Bio-Inspired Computation
Solving the team orienteering problem using effective multi-start simulated annealing
Applied Soft Computing
Memory-saving memetic computing for path-following mobile robots
Applied Soft Computing
Exploration and exploitation in evolutionary algorithms: A survey
ACM Computing Surveys (CSUR)
A new hybrid differential evolution with simulated annealing and self-adaptive immune operation
Computers & Mathematics with Applications
International Journal of Computing Science and Mathematics
Hi-index | 0.00 |
As we know, simulated annealing algorithm with large neighborhoods has greater probability of arriving at a global optimum than a small one has, if the other conditions, i.e., the initial configuration, initial temperature and temperature decreasing rate, are the same. However, the large neighborhood is not always beneficial, such as when the distance between the global optimum and the current solution is smaller than the step size. Therefore a simulated annealing algorithm with adaptive neighborhood is proposed in this paper. The adaptive non-uniform mutation operation borrowed from evolutionary algorithm is incorporated into simulated annealing for new solution generation. The neighborhood size reduces in probability with the progress of algorithm. It nearly covers the whole search space in the initial stage of algorithm in the sense of probability. The search engine only searches a very local neighborhood at the later stage of algorithm. Why to hybridize non-uniform mutation with simulated annealing is also analyzed and demonstrated. The numerical experiments show that the hybridization can greatly enhance the performance and the reliability of simulated annealing algorithm. Further experiments are made for benchmarks with expanding search domains. Satisfiable results are obtained again even if the variable bounds are enlarged to 1000 times. Theoretical analysis and simulation experiments illustrate the consistent excellent performance and the possible application of nonu-SA algorithm.