Capping methods for the automatic configuration of optimization algorithms

DOI10.1016/j.cor.2021.105615OpenAlexW3208898742MaRDI QIDQ2669790

Yanyan Li

Publication date: 9 March 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2021.105615

zbMATH Keywords

optimization algorithmsparameter tuningautomatic algorithm configurationcapping methods

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (2)

Model-based algorithm configuration with adaptive capping and prior distributions ⋮ Using Automated Algorithm Configuration for Parameter Control

Uses Software

• Paramils
• SCIP
• LKH
• race
• irace
• DIMACS
• Biq Mac
• ACOTSP
• BiqMac
• SATenstein
• TSpack
• FrogCOL
• GitHub
• BPPLIB
• SMAC
• AClib
• emili
• CAPOPT
• ACVIZ
• HHBQP
• gCol

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• The unconstrained binary quadratic programming problem: a survey
• Diversification-driven tabu search for unconstrained binary quadratic problems
• Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
• TSpack: A unified tabu search code for multi-dimensional bin packing problems
• SCIP: solving constraint integer programs
• Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 7th international conference, CPAIOR 2010, Bologna, Italy, June 14--18, 2010. Proceedings
• Tuning metaheuristics. A machine learning Perspective
• General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Revisiting simulated annealing: a component-based analysis
• BPPLIB: a library for bin packing and cutting stock problems
• Hybrid evolutionary algorithms for graph coloring
• Path relinking for unconstrained binary quadratic programming
• Automatically improving the anytime behaviour of optimisation algorithms
• SATenstein: automatically building local search SAT solvers from components
• Exact Solution of the Two-Dimensional Finite Bin Packing Problem
• Combinatorial Auctions: A Survey
• Multiple Comparisons Among Means
• A Guide to Graph Colouring
• ParamILS: An Automatic Algorithm Configuration Framework
• Two-Dimensional Finite Bin-Packing Algorithms
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Capping methods for the automatic configuration of optimization algorithms