Abstract
In this paper we consider a simulated annealing algorithm for multiobjective optimization problems. With a suitable choice of the acceptance probabilities, the algorithm is shown to converge asymptotically, that is, the Markov chain that describes the algorithm converges with probability one to the Pareto optimal set.
Similar content being viewed by others
References
Aarts EH, Korst JH (1989) Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing.Wiley, Chichester
Černy V (1985) A thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. J Optim Theory Appl 45(1):41–51
Coello Coello CA, Van Veldhuizen DA, Lamont GB (2002) Evolutionary algorithms for solving multi-objective problems. Kluwer, New York
Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, Chichester
Dowsland KA (1993) Simulated annealing. In: Reeves CR (ed) Modern heuristic techniques for combinatorial problems, chapter 2. Wiley, pp 20–69
Kirkpatrick S, Gellatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598): 671–680
Laarhoven P, Aarts EH (1987) Simulated annealing: theory and applications. D. Reidel, Boston
Lawler GF (1995) Introduction to stochastic processes. Chapman & Hall/CRC, Boca Raton
Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller A, Teller E (1953) Equation of state calculations by fast computing machines. J Chem Phys 21(6):1087–1092
Rudolph G (1998) On a multi-objective evolutionary algorithm and its convergence to the pareto set. In: Proceedings of the 5th IEEE Conference on Evolutionary Computation. IEEE Press, Piscataway, pp 511–516
Rudolph G, Agapie A (2000) Convergence properties of some multi-objective evolutionary algorithms. In: Proceedings of the 2000 conference on evolutionary computation, vol 2. IEEE Press, Piscataway, pp 1010–1016
Sait SM, Youssef H (1999) Iterative computer algorithms with applications in engineering. Solving combinatorial optimization problems. IEEE Computer Society, Los Alamitos
Serafini P (1994) Simulated annealing for multiple objective optimization problems. In: Tzeng GH, Wang HF, Wen UP, Yu PL (eds) Proceedings of the 10th international conference on multiple criteria decision making: expand and enrich the domains of thinking and application, vol 1. Springer, Berlin Heidelberg New York, pp 283–292
Ulungu EL (1993) Optimisation combinatoire multicritere: determination de l’ensemble des solutions efficaces et methodes interactives. PhD Thesis, Faculté des Sciences, Université de Mons-Hainaut, Mons, Belgium
Ulungu EL, Teghem J, Fortemps Ph (1995) Heuristics for multi-objective combinatorial optimization by simulated annealing. In: Gu J, Chen G, Wei Q, Wang S (eds) Multiple criteria decision making: theory and applications. Proceedings of the 6th national conference on multiple criteria decision making. Sci-Tech, Windsor, pp 228–238
Ulungu EL, Teghem J, Ost Ch (1998) Efficiency of interactive multi-objective simulated annealing through a case study. J Oper Res Soc 49:1044–1050
Ulungu EL, Teghem J, Fortemps Ph, Tuyttens D (1999) MOSA method: a tool for solving multiobjective combinatorial optimization problems. J Multi criteria Decis Anal 8(4): 221–236
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Villalobos-Arias, M., Coello, C.A.C. & Hernández-Lerma, O. Asymptotic convergence of a simulated annealing algorithm for multiobjective optimization problems. Math Meth Oper Res 64, 353–362 (2006). https://doi.org/10.1007/s00186-006-0082-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-006-0082-4
Keywords
- Simulated annealing
- Multiple objective programming
- Multiobjective optimization
- Vector optimization
- Convergence