Automatic MILP solver configuration by learning problem similarities
نویسندگان
چکیده
A large number of real-world optimization problems can be formulated as Mixed Integer Linear Programs (MILP). MILP solvers expose numerous configuration parameters to control their internal algorithms. Solutions, and associated costs or runtimes, are significantly affected by the choice parameters, even when problem instances have same decision variables constraints. On one hand, using default solver leads suboptimal solutions. other searching evaluating a configurations for every instance is time-consuming and, in some cases, infeasible. In this study, we aim predict unseen that yield lower-cost solutions without time overhead searching-and-evaluating at solving time. Toward goal, first investigate cost correlation come from distribution solved different configurations. We show similar also another runtime environment. After that, present methodology based on Deep Metric Learning learn similarities correlate with final solutions’ costs. At inference time, given new instance, it projected into learned metric space trained model, instantly predicted previously-explored nearest neighbor embedding space. Empirical results benchmarks our method predicts improve up 38% compared existing approaches.
منابع مشابه
Learning Arithmetic Problem Solver
In this paper we describe a problem solving system with a learning mechanism (Learning Arithmetic Problem Solver, LAPS), which can solve arithmetic problems written in natural languages. Since LAPS has knowledge about arithmetic problems in the form of rules, it can solve many different problems without alteration of the program. When LAPS cannot solve a given problem because of a shortage of k...
متن کاملA fully automatic problem solver with human-style output
This paper describes a program that solves elementary mathematical problems, mostly in metric space theory, and presents solutions that are hard to distinguish from solutions that might be written by human mathematicians. The program is part of a more general project, which we also discuss.
متن کاملAutomatic Learning of Textual Entailments with Cross-Pair Similarities
In this paper we define a novel similarity measure between examples of textual entailments and we use it as a kernel function in Support Vector Machines (SVMs). This allows us to automatically learn the rewrite rules that describe a non trivial set of entailment cases. The experiments with the data sets of the RTE 2005 challenge show an improvement of 4.4% over the state-of-the-art methods.
متن کاملProblem Solver
The contract net protocol has been developed to specify problem-solving communication and control for nodes in a distributed problem solver. Task distribution is'affected by a negotiation process, a discussion carried on between nodes with tasks to be executed and nodes that may be able to execute those tasks. We present the specification of the protocol and demonstrate its use in the solution ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2023
ISSN: ['1572-9338', '0254-5330']
DOI: https://doi.org/10.1007/s10479-023-05508-x