Tuning metaheuristics by sequential optimization of regression models
Tuning parameters is an important step for the application of metaheuristics to problem classes of interest. In this work we present a tuning framework based on the sequential optimization of perturbed regression models. Besides providing algorithm configurations with good expected performance, the proposed methodology can also provide insights on the relevance of each parameter and their interactions, as well as models of expected algorithm performance for a given problem class, conditional on the parameter values. A test case is presented for the tuning of six parameters of a decomposition-based multiobjective optimization algorithm, in which an instantiation of the proposed framework is compared against the results obtained by the most recent version the Iterated Racing (Irace) procedure. The results suggest that the proposed approach returns solutions that are as good as those of Irace in terms of mean performance, with the advantage of providing more information on the relevance and effect of each parameter on the expected performance of the algorithm.
Code (0)
등록된 구현이 없습니다.
Tasks
Multiobjective OptimizationregressionSimilar Papers 제목 키워드 기반
Estimation of the yield curve for Costa Rica using combinatorial optimization metaheuristics applied to nonlinear regression
The term structure of interest rates or yield curve is a function relating the interest rate with its own term. Nonlinear regression models of Nelson-Siegel and Svensson were used to estimate the yield curve using a samp…
Combinatorial OptimizationregressionSequential, Parallel and Consecutive Hybrid Evolutionary-Swarm Optimization Metaheuristics
The goal of this paper is twofold. First, it explores hybrid evolutionary-swarm metaheuristics that combine the features of PSO and GA in a sequential, parallel and consecutive manner in comparison with their standard ba…
High-level hybridization of heuristics and metaheuristics to solve symmetric TSP: a comparative study
The Travelling Salesman Problem - TSP is one of the most explored problems in the scientific literature to solve real problems regarding the economy, transportation, and logistics, to cite a few cases. Adapting TSP to so…
Benchmark of Bayesian Optimization and Metaheuristics for Control Engineering Tuning Problems with Crash Constraints
Controller tuning based on black-box optimization allows to automatically tune performance-critical parameters w.r.t. mostly arbitrary high-level closed-loop control objectives. However, a comprehensive benchmark of diff…
Bayesian OptimizationAn Efficient Learning-based Solver Comparable to Metaheuristics for the Capacitated Arc Routing Problem
Recently, neural networks (NN) have made great strides in combinatorial optimization. However, they face challenges when solving the capacitated arc routing problem (CARP) which is to find the minimum-cost tour covering …
ARCCombinatorial OptimizationDecision Making