A common problem when performing (meta)heuristic techniques over complex combinatorial optimization problems is parameter tuning. Finding the right parameter values can lead to significant improvements in terms of the 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. Furthermore, parameter values usually depend on the problem that is going to be solved. In this paper, we propose a framework that is based on the genetic programming (GP) technique to fine tune a key parameter of the well-known tabu search (TS) algorithm. Several experiments are performed over a set of small instances of the well-known capacitated facility location problem. The results have shown that adjusting the probability of acceptance of the best neighbor ρ in the TS algorithm using GP leads to an average value of the obtained solution that is closer to the optimal solution than the average value obtained by the simple TS algorithm with an a priori selected value for ρ. More importantly, standard deviation of the algorithm is greatly improved by our approach, which makes it much more reliable if time limitations are present. Finally, we confirm that the value of the parameter ρ largely depends on the problem that is attempted to solve.
|Number of pages||8|
|Journal||Canadian Journal of Electrical and Computer Engineering|
|State||Published - 1 Dec 2016|
- Automatic parameter tuning
- combinatorial optimization
- genetic programming (GP)
- tabu search (TS).