Facebook Instagram Twitter RSS Feed PodBean Back to top on side

The algorithm of the simulated annealing and its application in one optimization problem

In: Tatra Mountains Mathematical Publications, vol. 7, no. 1
Jozef Kalas
Detaily:
Rok, strany: 1996, 283 - 288
O článku:
In the paper a mild modification of the classical algorithm of the simulated annealing and its application at the following optimization problem are shown. Let real function $f(x1,…, xm)$ be defined on the set $Km=\prodi=1m\langle ai, bi\rangle$. We want to approximate the point $x0\in Km$ in which the function $f$ reaches its minimal value e.g., $f(x0)=\minx\in Kmf(x)$ (evidently under the assumption that the minimum of the function $f$ exists). There is known iterative algorithms which convergence to the set of the optimal points (under various assumptions concerning of the function $f$). The advantage of the algorithm of the simulated annealing is its generality with respect to the form of the function $f(x1,…, xm)$.
Ako citovať:
ISO 690:
Kalas, J. 1996. The algorithm of the simulated annealing and its application in one optimization problem. In Tatra Mountains Mathematical Publications, vol. 7, no.1, pp. 283-288. 1210-3195.

APA:
Kalas, J. (1996). The algorithm of the simulated annealing and its application in one optimization problem. Tatra Mountains Mathematical Publications, 7(1), 283-288. 1210-3195.