A method for the automated configuration of anytime portfolios of algorithms

Optimization algorithms contain parameters that greatly influence their behavior, such that finding good parameters with automated algorithm configuration tools has become a critical component in the algorithm design process. Many optimization algorithms possess the anytime property, meaning they ca...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 329; číslo 2; s. 577 - 590
Hlavní autoři: Schede, Elias, Tierney, Kevin
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.03.2026
Témata:
Combinatorial optimization
Evolutionary computations
Integer programming
Machine learning
Integer programming
Evolutionary computations
Combinatorial optimization
Machine learning
ISSN:0377-2217
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Optimization algorithms contain parameters that greatly influence their behavior, such that finding good parameters with automated algorithm configuration tools has become a critical component in the algorithm design process. Many optimization algorithms possess the anytime property, meaning they can be stopped at any time during their execution and provide a feasible solution. Setting the parameters of anytime algorithms is difficult, as the parameters ought to provide robust performance across varying execution times. Traditional algorithm configuration methods address this challenge by finding a one-size-fits-all parameter configuration, however finding a portfolio of configurations, each targeted to a different runtime, can lead to better overall performance. We introduce a novel algorithm configuration method for configuring anytime algorithms that produces viable configuration portfolios that assign different configurations to different runtimes. Our proposed method harnesses an early termination mechanism for unpromising configurations using a cost-sensitive machine learning approach. Furthermore, it uses two novel MIP formulations to discard configurations and to create the configuration portfolio, respectively. •Introduces a new configurator to improve anytime performance of algorithms.•Creates configuration portfolios, assigning configurations to algorithm cutoffs.•Capping poor performing configurations early using a cost sensitive learned model.
ISSN:0377-2217
DOI:10.1016/j.ejor.2025.07.024