A common problem when using (meta)-heuristic techniques to solve complex combinatorial optimization problems is related to parameters tuning. Finding “the right” parameter values can lead to significant improvements in terms of best solution objective value found by the heuristic, heuristic reliability and heuristic convergence, among others. Unfortunately, this is usually a tedious and complicated task if done manually. In this paper, we propose a framework that is based on Genetic Programming to fine-tune a key parameter of the well-known Simulated Annealing (SA) algorithm. Experiments on a set of small instances of the Facility Location Problem with capacity constraints are performed. Results show that automatically adjusting a key parameter in SA by means of Genetic Programming leads to an average value of the obtained solution that is closer to the optimal solution than the average value obtained by the simple SA algorithm with a priori selected values. More important, standard deviation of the algorithm is greatly improved by our approach which makes it much more reliable if time limitations are imposed.
Genetic Programming, Simulated Annealing, Combinatorial Optimization, Automatic Parameter Tuning
Pablo CABRERA-GUERRERO, Guillermo GUERRERO, Jorge VEGA, Franklin JOHNSON, "Improving Simulated Annealing Performance by means of Automatic Parameter Tuning", Studies in Informatics and Control, ISSN 1220-1766, vol. 24(4), pp. 419-426, 2015. https://doi.org/10.24846/v24i4y201506
All articles published by Studies in Informatics and Control (SIC) are published in accordance with the terms and conditions of the Creative Commons Attribution License (CC BY-NC-SA 4.0).