An Introduction to Simulated Annealing Algorithms for the Computation of Economic Equilibrium
Economic equilibrium computation has raised the issue of global optimization algorithms since economic equilibrium problems can be cast as a global optimization problem. However, nearly all conventional algorithms stop when they find a local optimum. Over the last decade a number of new optimization algorithms have appeared, simulated annealing is one of them. It is a powerful stochastic search algorithm applicable to a wide range of problems for which little prior knowledge is available, and it asymptotically probabilistically converges to a global optimum. In this paper, we will give a brief introduction to simulated annealing and apply it to the computation of economic equilibrium. We also reported our computational experience in the paper. This early result shows that the application of simulated annealing to computation of economic equilibrium is encouraging and it deserves further research. Citation Copyright 1998 by Kluwer Academic Publishers.
Volume (Year): 12 (1998)
Issue (Month): 2 (October)
|Contact details of provider:|| Web page: http://www.springerlink.com/link.asp?id=100248|
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:kap:compec:v:12:y:1998:i:2:p:151-69. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.