A Multiobjective Optimization Model for Packing Proposals in Large-Scale R&D Project Review

Chen Yuan, Fan Zhi-ping
{"title":"A Multiobjective Optimization Model for Packing Proposals in Large-Scale R&D Project Review","authors":"Chen Yuan, Fan Zhi-ping","doi":"10.1109/ICMSE.2006.313841","DOIUrl":null,"url":null,"abstract":"To solve the packing proposals problem in large-scale R&D project review, a-nonlinear 0-1 integer programming model with multiobjective is presented. The first objective is to minimize the quantity difference between the number of proposals for each package and the average number of proposals that peer reviewers would like to review. The second objective is to minimize the probability that proposals belong to the same organization be packed into one package. A weighted sum method is applied to treat multiple objectives. Then, a genetic algorithm with sequence encoding and PMX crossover is developed to solve this model. Finally, a numerical experiment designed to simulate the proposal packing process of NSFC is described to illustrate the use of the proposed method","PeriodicalId":115488,"journal":{"name":"2006 International Conference on Management Science and Engineering","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Conference on Management Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMSE.2006.313841","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

To solve the packing proposals problem in large-scale R&D project review, a-nonlinear 0-1 integer programming model with multiobjective is presented. The first objective is to minimize the quantity difference between the number of proposals for each package and the average number of proposals that peer reviewers would like to review. The second objective is to minimize the probability that proposals belong to the same organization be packed into one package. A weighted sum method is applied to treat multiple objectives. Then, a genetic algorithm with sequence encoding and PMX crossover is developed to solve this model. Finally, a numerical experiment designed to simulate the proposal packing process of NSFC is described to illustrate the use of the proposed method
大型研发项目评审中包装方案的多目标优化模型
为了解决大型研发项目评审中的包装方案问题,提出了一种非线性多目标0-1整数规划模型。第一个目标是最小化每个包的建议数量和同行评审者想要评审的建议的平均数量之间的数量差异。第二个目标是最小化来自同一组织的提案被打包到一个包中的可能性。采用加权和法处理多个目标。然后,提出了一种序列编码和PMX交叉的遗传算法来求解该模型。最后,通过对国家自然科学基金提案打包过程的数值模拟实验,说明了该方法的应用
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信