Parallel recombinative simulated annealing: a genetic algorithm
Parallel Computing
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Journal of Global Optimization
A Trigonometric Mutation Operation to Differential Evolution
Journal of Global Optimization
Adaptive temperature control for simulated annealing: a comparative study
Computers and Operations Research
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Derivative-Free Filter Simulated Annealing Method for Constrained Continuous Global Optimization
Journal of Global Optimization
Comparison of Adaptive Approaches for Differential Evolution
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Population size reduction for the differential evolution algorithm
Applied Intelligence
Differential evolution using a neighborhood-based mutation operator
IEEE Transactions on Evolutionary Computation
Enhancing differential evolution frameworks by scale factor local search: part I
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Enhancing differential evolution frameworks by scale factor local search: part II
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Recent advances in differential evolution: a survey and experimental analysis
Artificial Intelligence Review
Firefly algorithms for multimodal optimization
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
Simulated annealing algorithm with adaptive neighborhood
Applied Soft Computing
IEEE Transactions on Evolutionary Computation
Opposition-Based Differential Evolution
IEEE Transactions on Evolutionary Computation
Accelerating Differential Evolution Using an Adaptive Local Search
IEEE Transactions on Evolutionary Computation
Bio-inspired methods for fast and robust arrangement of thermoelectric modulus
International Journal of Bio-Inspired Computation
International Journal of Computing Science and Mathematics
Hi-index | 0.00 |
Simulated annealing (SA) algorithm is extremely slow in convergence, and the implementation and efficiency of parallel SA algorithms are typically problem-dependent. To overcome such intrinsic limitations, this paper presents a multi-agent simulated annealing (MSA) algorithm to address continuous function optimisation problems. In MSA, a population of agents run SA algorithm collaboratively, exploiting the mutation operator formulas of differential evolution (DE) algorithm for candidate solution generation. Our MSA algorithm can achieve significantly better intensification ability by taking advantage of the learning ability from DE algorithm; meanwhile the probability acceptation rule of SA algorithm can keep MSA from premature stagnation. The MSA algorithm is population based, so it can be paralleled problem-independently and easily. Simulation experiments were carried on four typical benchmark functions, and the results show that MSA algorithm has good performance in terms of convergence speed and solution accuracy.