A population-based simulated annealing algorithm for global optimization
- 9 February 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 004626-004633
Abstract
Simulated annealing (SA) is a solo-search algorithm, trying to simulate the cooling process of molten metals through annealing to find the optimum solution in an optimization problem. SA selects a feasible starting solution, produces a new solution at the vicinity of it, and makes a decision by some rules to move to the new solution or not. However, the results found by SA depend on the selection of the starting point and the decisions SA makes. In this paper, in order to ameliorate the drawbacks of the algorithm, a population-based simulated annealing (PSA) algorithm is proposed. PSA uses the population's ability to seek different parts of the search space, thus hedging against bad luck in the initial solution or the decisions. A set of benchmark functions was used in order to evaluate the performance of PSA algorithm. Simulation results accentuate the superior capability of PSA in comparison with the other optimization algorithms.Keywords
This publication has 16 references indexed in Scilit:
- Designing benchmark problems for large-scale continuous optimizationInformation Sciences, 2015
- Metaheuristics in large-scale global continues optimization: A surveyInformation Sciences, 2015
- Group Search Optimizer: An Optimization Algorithm Inspired by Animal Searching BehaviorIEEE Transactions on Evolutionary Computation, 2009
- A simulated annealing based solution approach for the two-layered location registration and paging areas partitioning problem in cellular mobile networksEuropean Journal of Operational Research, 2007
- Stochastic optimization using simulated annealing with hypothesis testApplied Mathematics and Computation, 2006
- Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machinesComputers & Operations Research, 2005
- On Combining Support Vector Machines and Simulated Annealing in Stereovision MatchingIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2004
- A Hybrid Hopfield Network-Simulated Annealing Approach for Frequency Assignment in Satellite Communications SystemsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2004
- A new evolutionary algorithm combining simulated annealing and genetic programming for relevance feedback in fuzzy information retrieval systemsSoft Computing, 2002
- No free lunch theorems for optimizationIEEE Transactions on Evolutionary Computation, 1997