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

Q2 Mathematics
Hans Degroote , José Luis González-Velarde , Patrick De Causmaecker
{"title":"应用算法选择——广义分配问题的案例研究","authors":"Hans Degroote ,&nbsp;José Luis González-Velarde ,&nbsp;Patrick De Causmaecker","doi":"10.1016/j.endm.2018.07.027","DOIUrl":null,"url":null,"abstract":"<div><p>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.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.027","citationCount":"5","resultStr":"{\"title\":\"Applying Algorithm Selection – a Case Study for the Generalised Assignment Problem\",\"authors\":\"Hans Degroote ,&nbsp;José Luis González-Velarde ,&nbsp;Patrick De Causmaecker\",\"doi\":\"10.1016/j.endm.2018.07.027\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>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.</p></div>\",\"PeriodicalId\":35408,\"journal\":{\"name\":\"Electronic Notes in Discrete Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.027\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Notes in Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1571065318301719\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571065318301719","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 5

摘要

许多组合优化问题是np困难的。然而,在实践中,高质量的解决方案往往是通过(元)启发式获得的。这些在某些情况下工作得很好,但在其他情况下则不然,这表明算法选择的潜力。本文讨论了如何将算法选择应用于组合优化问题,以及在此过程中出现的挑战。以广义分配问题为例进行了研究。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Applying Algorithm Selection – a Case Study for the Generalised Assignment Problem

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.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Electronic Notes in Discrete Mathematics
Electronic Notes in Discrete Mathematics Mathematics-Discrete Mathematics and Combinatorics
CiteScore
1.30
自引率
0.00%
发文量
0
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信