计算机工程与应用2017，Vol.53Issue(16)：249-257,9.DOI:10.3778/j.issn.1002-8331.1609-0324
基于矩阵编码的多目标进化求解面试分组问题
Multi-objective evolutionary based on matrix-coding to solve interview grouping problem.
摘要
Abstract
The problem of grouping interview and thesis defense belongs to the complex constraint optimization problem, which is often appeared in the enrollment of student in university. In order to research this problem, the internal constraints and restriction relations of this issue are analyzed firstly. In addition, the mathematical model of grouping interview and thesis defense problem is built, and the optimization objective function is established. Then, based on the established mathematical model, the multi-objective evolution with matrix-coding scheme is used to solve this grouping problem. Meanwhile, the conventional method of solving this problem is proposed for comparison. The experimental comparisons show that the multi-objective evolution provides comprehensive performance and greater adaptability than the conventional method.关键词
多目标/面试分组/矩阵编码/数学模型Key words
multi-objective/grouping interview/matrix encoding/mathematical model分类
信息技术与安全科学引用本文复制引用
许玉龙,孙晓静,曹莉,王晓辉..基于矩阵编码的多目标进化求解面试分组问题[J].计算机工程与应用,2017,53(16):249-257,9.基金项目
河南省高校重点科研项目(No.15A520083,No.16A520060) （No.15A520083,No.16A520060）
河南中医药大学博士基金项目(No.BSJJ2015-19) （No.BSJJ2015-19）
河南省科技攻关科研开放合作项目(No.142106000192) （No.142106000192）
河南省科技攻关研究项目(No:172102210361). （No:172102210361）
