|
|
optimal adjusting of simulated annealing parameters
|
|
|
|
|
نویسنده
|
hemmak allaoua
|
منبع
|
military technical courier - 2024 - دوره : 72 - شماره : 1 - صفحه:80 -93
|
چکیده
|
Introduction/purpose: simulated annealing is a powerful technique widely used in optimization problems. one critical aspect of using simulated annealing effectively is a proper and optimal adjustment of its parameters. this paper presents a novel approach to efficiently adjust the parameters of simulated annealing to enhance its performance and convergence speed. methods: since the simulated algorithm is inspired by the cooling metropolis process, the basic idea is to simulate and analyze this process using a mathematical model. the proposed work tends to properly imitate the metropolis cooling process in the algorithmic field. by intelligently adjusting the temperature schedule, temperature reduction and cooling rate, the algorithm optimizes the balance between exploration and exploitation, leading to improved convergence and higher-quality solutions. results: to evaluate the effectiveness of this approach, it was applied first on a chosen sample function to be minimized, and then on some usual known optimization functions. the results demonstrate that our approach, called optimal adjusting of simulated annealing parameters (oasa), achieves superior performance compared to traditional static parameter settings and other existing approaches, showing how to well adjust the parameters of the simulated annealing algorithm to improve its efficiency in terms of solution quality and processing time. conclusion: adjusting the algorithm parameters could have a significant contribution in the optimization field even for other metaheuristics.
|
کلیدواژه
|
simulated annealing ,parameter adjustment ,optimization ,metaheuristic
|
آدرس
|
mohamed boudiaf university of m'sila, department of computer science, laboratory of informatics and its applications (liam), algeria
|
پست الکترونیکی
|
allaoua.hemmak@univ-msila.dz
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|