{"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