arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.4516cs.DLmath.OC
收藏

基于偏好矩阵和非对称TSP模型的软件同行评审中评审员分配问题的求解

Solving reviewer assignment problem in software peer review: An approach based on preference matrix and asymmetric TSP model

Yanqing Wang, Yu Jiang, Xiaolei Wang, Siyu Zhang, Yaowen Liang

摘要:

优化的审稿人分配可以有效地利用有限的智力资源,并在各种情况下,如会议或期刊论文的选择,基金机构的提案选择等,显着保证评审质量。摘要提出了一种基于学生偏好矩阵和非对称旅行商问题模型的优化方法。由于规则矩阵在该方法中起着至关重要的作用,我们通过问卷调查获得学生的偏好矩阵,并将其转换为规则矩阵。该方法借助软件包CPLEX,通过控制ATSP模型的退出准则来实现。对比研究表明,同时考虑审稿人偏好矩阵和作者偏好矩阵的分配策略比随机分配策略具有更好的性能。特别是,当审稿人和作者的偏好矩阵合并时,其性能仅略优于随机分配。也就是说,大部分学生都有和谐发展的强烈愿望,尽管高水平学生不愿意这样做。

英文摘要:

Optimized reviewer assignment can effectively utilize limited intellectual resources and significantly assure review quality in various scenarios such as paper selection in conference or journal, proposal selection in funding agencies and so on. However, little research on reviewer assignment of software peer review has been found. In this study, an optimization approach is proposed based on students' preference matrix and the model of asymmetric traveling salesman problem (ATSP). Due to the most critical role of rule matrix in this approach, we conduct a questionnaire to obtain students' preference matrices and convert them to rule matrices. With the help of software ILOG CPLEX, the approach is accomplished by controlling the exit criterion of ATSP model. The comparative study shows that the assignment strategies with both reviewers' preference matrix and authors' preference matrix get better performance than the random assignment. Especially, it is found that the performance is just a little better than that of random assignment when the reviewers' and authors' preference matrices are merged. In other words, the majority of students have a strong wish of harmonious development even though high-level students are not willing to do that.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑