Improved Simulated Annealing With Cobweb Spreading In Continuous Space
Mahdi Imani, Seyede Fatemeh Ghoreishi, Masoud Shariat-Panahi
Keywords : Simulated Annealing, continuous space, Cobweb Simulated Annealing (CSA), swarm search, adaptive step length and temperature
ABSTRACT: An innovative approach based on Simulated Annealing method to optimize the problems in continuous space is introduced in this paper. The Simulated Annealing is a popular method which finds the optimum value of functions based on temperature changes during its search. Specifying the trend of temperature change and step length is the most critical issue in the original SA method. The SA algorithm with large or small initial step length cannot reach the optimum value of the function efficiently. The initial temperature and its trend of decrease affect the results of the search in the space. In addition, swarm algorithms like PSO and GA are the powerful methods in optimization. In this paper, a new method called Cobweb Simulated Annealing (CSA) with swarm search in the continuous space is presented. The number of population, temperature and step length are adaptive during the search in this algorithm. The searching points spread to explore the entire search space especially in the first stages. This method is applied to several benchmark functions and the results have shown its reliability and efficiency to find the optimum value of functions in comparison with some powerful modifications of SA. CSA is able to search more extensive area of the whole space with less computational cost. The other significant capability of CSA algorithm is finding more local minimums than other modified algorithms.
 Kirkpatrick, S., Vecchi, M.: Optimization by simmulated annealing. science 220(4598), 671-680 (1983).
 Ishibuchi, H., Misaki, S., Tanaka, H.: Modified simu-lated annealing algorithms for the flow shop sequenc-ing problem. European Journal of Operational Research 81(2), 388-398 (1995).
 Misevicius, A.: A modified simulated annealing algo-rithm for the quadratic assignment problem. Informatica 14(4), 497-514 (2003).
 Rodriguez-Tello, E., Hao, J.K., Torres-Jimenez, J.: An improved simulated annealing algorithm for bandwidth minimization. European Journal of Operational Research 185(3), 1319-1335 (2008).
 Locatelli, M.: Convergence of a simulated annealing algorithm for continuous global optimization. Journal of Global Optimization 18(3), 219-233 (2000).
 Carnevali, P., Coletti, L., Patarnello, S.: Image processing by simulated annealing. IBM Journal of Research and Development 29(6), 569-579 (1985).
 Salcedo-Sanz, S., Santiago-Mozos, R., Bousoņo-Calzón, C.: A hybrid Hopfield network-simulated an-nealing approach for frequency assignment in satellite communications systems. Systems, Man, and Cyber-netics, Part B: Cybernetics, IEEE Transactions on 34(2), 1108-1116 (2004).
 Xinchao, Z.: Simulated annealing algorithm with adap-tive neighborhood. Applied Soft Computing 11(2), 1827-1836 (2011).
 Zhao, X., Gao, X.S., Hu, Z.C.: Evolutionary program-ming based on non-uniform mutation. Applied Mathe-matics and Computation 192(1), 1-11 (2007).
 Paik, C., Soni, S.: A simulated annealing based solution approach for the two-layered location registration and paging areas partitioning problem in cellular mobile networks. European journal of operational research 178(2), 579-594 (2007).
 Černý, V.: Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of optimization theory and applications 45(1), 41-51 (1985).
 Lin, S., Kernighan, B.W.: An effective heuristic algo-rithm for the traveling-salesman problem. Operations research 21(2), 498-516 (1973).
 Low, C.: Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines. Computers & Operations Research 32(8), 2013-2025 (2005).
 Tajeddini, M. A., Kebriaei. H, Imani, M.: Bidding Strate-gy in pay as bid markets by Multi-Agent Reinforcement Learning. The 28th International Power System Conference (PSC2013)