A hybrid grouping genetic algorithm for reviewer group construction problem

被引:24
作者
Chen, Yuan [3 ]
Fan, Zhi-Ping [1 ]
Ma, Jian [2 ]
Zeng, Shuo [4 ]
机构
[1] Northeastern Univ, Sch Business Adm, Dept Management Sci & Engn, Shenyang, Peoples R China
[2] City Univ Hong Kong, Dept Informat Syst, Kowloon, Hong Kong, Peoples R China
[3] Shanghai Univ Finance & Econ, Dept Informat Management & Engn, Shanghai, Peoples R China
[4] Univ Arizona, Dept Management Informat Syst, Tucson, AZ 85721 USA
关键词
OR in government; Reviewer group construction; Hybrid genetic algorithm; Grouping genetic algorithm; Heuristics; GROUP DECISION-MAKING; ASSIGNING STUDENTS;
D O I
10.1016/j.eswa.2010.08.029
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
It is a common task to construct the reviewer group with diverse background between reviewers. This task is complicated considering the multiple criteria and sizable reviewers and groups. However, it has not been clearly addressed in the current studies. This paper investigates this problem and proposes a solution approach. In our study, this problem is firstly formulated as an integrated model that covers the situations of different group number and group size. Then, considering the computational difficulties of solving this model, the grouping genetic algorithm hybridizing the local neighborhood search heuristic is proposed. In the grouping genetic algorithm, the initialization, crossover and mutation are designed according to our problem's characteristics. Extensive numerical experiments show that the proposed algorithm is computationally efficient. Moreover, the application of the proposed algorithm on a case from NSFC also indicates its effectiveness for practical problems. (C) 2010 Elsevier Ltd. All rights reserved.
引用
收藏
页码:2401 / 2411
页数:11
相关论文
共 36 条
[21]  
Holland J.H., 1992, Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence
[22]   ANALYZING AND MODELING THE MAXIMUM DIVERSITY PROBLEM BY ZERO-ONE PROGRAMMING [J].
KUO, CC ;
GLOVER, F ;
DHIR, KS .
DECISION SCIENCES, 1993, 24 (06) :1171-1185
[23]  
LOTFI V, 1991, J OPER RES SOC, V42, P205, DOI 10.2307/2583309
[24]  
Michalewicz Z, 1994, Genetic Algorithm + Data Structure = Evolution Programs
[25]   AN EVALUATION OF LOCAL IMPROVEMENT OPERATORS FOR GENETIC ALGORITHMS [J].
MILLER, JA ;
POTTER, WD ;
GANDHAM, RV ;
LAPENA, CN .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1993, 23 (05) :1340-1351
[26]   COMPUTER-AIDED DELIBERATION - MODEL MANAGEMENT AND GROUP DECISION SUPPORT [J].
NUNAMAKER, JF ;
APPLEGATE, LM ;
KONSYNSKI, BR .
OPERATIONS RESEARCH, 1988, 36 (06) :826-848
[27]  
SILVA GC, 2004, LECT NOTES COMPUTER, V3059
[28]   A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains [J].
Torabi, S. A. ;
Ghomi, S. M. T. Fatemi ;
Karimi, B. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 173 (01) :173-189
[29]   A hybrid genetic algorithm for the resource-constrained project scheduling problem [J].
Valls, Vicente ;
Ballestin, Francisco ;
Quintanilla, Sacramento .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 185 (02) :495-508
[30]   A grouping genetic algorithm for registration area planning [J].
Vroblefski, M ;
Brown, EC .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2006, 34 (03) :220-230