Applying Algorithm Selection – a Case Study for the Generalised Assignment Problem

Q2 Mathematics

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI:10.1016/j.endm.2018.07.027

Hans Degroote , José Luis González-Velarde , Patrick De Causmaecker

引用次数: 5

Abstract

Many combinatorial optimisation problems are NP-Hard. Yet in practice high quality solutions are often obtained by (meta)heuristics. These work well in some cases, but not in others, indicating a potential for algorithm selection. In this extended abstract is discussed how to apply algorithm selection to a combinatorial optimisation problem and which challenges arise when doing so. The generalised assignment problem is used as case study.

查看原文本刊更多论文

应用算法选择——广义分配问题的案例研究

许多组合优化问题是np困难的。然而，在实践中，高质量的解决方案往往是通过(元)启发式获得的。这些在某些情况下工作得很好，但在其他情况下则不然，这表明算法选择的潜力。本文讨论了如何将算法选择应用于组合优化问题，以及在此过程中出现的挑战。以广义分配问题为例进行了研究。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Electronic Notes in Discrete Mathematics Mathematics-Discrete Mathematics and Combinatorics

CiteScore

1.30

自引率

0.00%

发文量

期刊介绍： Electronic Notes in Discrete Mathematics is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication is appropriate. Organizers of conferences whose proceedings appear in Electronic Notes in Discrete Mathematics, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.