参与者选择问题:五个优化解的相对性能

C. Y. Lin, J. W. Liu, K. Yeh, E. Chu
{"title":"参与者选择问题:五个优化解的相对性能","authors":"C. Y. Lin, J. W. Liu, K. Yeh, E. Chu","doi":"10.1145/3036331.3036334","DOIUrl":null,"url":null,"abstract":"This paper presents integer linear programming formulations of four variants of the participant selection problem (PSP) that we may encounter in likely disaster scenarios. An evaluation study was carried out to get data on the relative performance of popular optimization solvers and a greedy heuristic algorithm when used to solve the PSP. The paper presents the parameters used by the study to characterize PSP problem instances and figures of merits used for comparing the performances of evaluated methods, as well as performance data obtained from the study.","PeriodicalId":22356,"journal":{"name":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","volume":"12 1","pages":"24-31"},"PeriodicalIF":0.0000,"publicationDate":"2017-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Participant Selection Problem: Relative Performance of Five Optimization Solvers\",\"authors\":\"C. Y. Lin, J. W. Liu, K. Yeh, E. Chu\",\"doi\":\"10.1145/3036331.3036334\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents integer linear programming formulations of four variants of the participant selection problem (PSP) that we may encounter in likely disaster scenarios. An evaluation study was carried out to get data on the relative performance of popular optimization solvers and a greedy heuristic algorithm when used to solve the PSP. The paper presents the parameters used by the study to characterize PSP problem instances and figures of merits used for comparing the performances of evaluated methods, as well as performance data obtained from the study.\",\"PeriodicalId\":22356,\"journal\":{\"name\":\"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)\",\"volume\":\"12 1\",\"pages\":\"24-31\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-01-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3036331.3036334\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tenth International Conference on Computer Modeling and Simulation (uksim 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3036331.3036334","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文给出了在可能的灾难情景中可能遇到的参与者选择问题(PSP)的四个变量的整数线性规划公式。对常用优化算法和贪心启发式算法在求解PSP问题时的相对性能进行了评价研究。本文给出了研究中用于表征PSP问题实例的参数,以及用于比较所评估方法性能的优劣值,以及研究中获得的性能数据。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Participant Selection Problem: Relative Performance of Five Optimization Solvers
This paper presents integer linear programming formulations of four variants of the participant selection problem (PSP) that we may encounter in likely disaster scenarios. An evaluation study was carried out to get data on the relative performance of popular optimization solvers and a greedy heuristic algorithm when used to solve the PSP. The paper presents the parameters used by the study to characterize PSP problem instances and figures of merits used for comparing the performances of evaluated methods, as well as performance data obtained from the study.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信