Application of chaos in simulated annealing. (English) Zbl 1045.37054

Summary: Simulated annealing (SA) has been applied with success to many numerical and combinatorial optimization problems in recent years. SA has a rather slow convergence rate, however, on some function optimization problems. By introducing chaotic systems to simulated annealing, we propose a optimization algorithm named chaos simulated annealing (CSA). The distinctions between CSA and SA are chaotic initialization and chaotic sequences replacing the Gaussian distribution. Simulation results of typical complex function optimization show that CSA improves the convergence and is efficient, applicable and easy to implement. In addition, we discuss the advantages of CSA, and show the reasons why CSA performs better than SA.


37N20 Dynamical systems in other branches of physics (quantum mechanics, general relativity, laser physics)
Full Text: DOI


[1] Lorenz, E.N., Deterministic non-periodic flows, J. atmos. sci., 20, 130-141, (1963) · Zbl 1417.37129
[2] Chen, G.; Dong, X., From chaos to order: methodologies, perspectives and applications, (1998), World Scientific Singapore
[3] Antoniou, I.; Akishina, E.P.; Ivanov, V.V.; Kostenko, B.F.; Stalios, A.D., Cellular automata study of high burn-up structures, Chaos, solitons & fractals, 28, 1111-1128, (2003) · Zbl 1061.37064
[4] Harb, A.M.; Abdel-Jabbar, N., Controlling Hopf bifurcation and chaos in a small power system, Chaos, solitons & fractals, 18, 1055-1063, (2003) · Zbl 1074.93522
[5] Yuan, X.H.; Yuan, Y.B.; Zhang, Y.C., A hybird chaotic genetic algorithm for short-term hydro system scheduling, Math. comput. simulat., 59, 319-327, (2002) · Zbl 1030.90040
[6] Luo, C.Z.; Shao, H.H., Evolutionary algorithms with chaotic mutations, Control decision, 15, 557-560, (2000)
[7] Yang, L.; Chen, T., Application of chaos in genetic algorithms, Commun. theor. phys., 38, 168-172, (2002)
[8] Kirkpatrick, S.; Gelat, C.D.; Vecchi, M.P., Optimization by simulated annealing, Science, 220, 671-680, (1983) · Zbl 1225.90162
[9] Metropolis, N.; Rosenbluth, A.; Rosenbluth, M., Equation of state calculations by fast computing machines, J. chem. phys., 21, 1087-1092, (1953)
[10] Francis, R.L.; McGinnis, L.F.; White, J.A., Facility layout and location: an analytical approach, (1992), Prentice-Hall Englewood Cliffs, NJ
[11] Pardalos, P.M.; Pitsoulis, L.S.; Mavridou, T.D.; Resende, M.G.C., ()
[12] Mavridou, T.D.; Pardalos, P.M., Simulated annealing and genetic algorithms for the facility layout problem: a survey, Comput. optim. appl., 7, 111-126, (1997) · Zbl 0883.90078
[13] Anderssen, R.S.; Jennings, L.S.; Ryan, D.M., Optimization, (1972), University of Queensland Press St. Luncia, Australia · Zbl 0305.00007
[14] Dekkers, A.; Aarts, E., Global optimizations and simulated annealing, Math. program., 50, 367-393, (1991) · Zbl 0753.90060
[15] Cvijović, D.; Klinowski, J., Taboo search: an approach to the multiple minima problem, Science, 267, 664-666, (1995) · Zbl 1226.90101
[16] Chen, L.N.; Aihara, K., Chaotic simulated annealing by a neural network model with transient chaos, Neural networks, 8, 915-930, (1995)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.