Solving expert assignment problem using improved genetic algorithm

被引:0
|
作者
Li, Na-Na [1 ,2 ]
Zhang, Jian-Nan [2 ]
Gu, Jun-Hua [2 ]
Liu, Bo-Ying [2 ]
机构
[1] Tianjin Univ, Sch Comp Sci & Technol, Tianjin 300072, Peoples R China
[2] Hebei Ubi Technol, Tianjin 300130, Peoples R China
基金
美国国家科学基金会;
关键词
expert assignment problem; genetic algorithm; ant algorithm; adaptive mutation;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Expert assignment is chief and basic work of project review in project management. So it is significant to research how to solve expert assignment problem (EAP). In previous papers, we established the mathematical model of expert assignment problem, and proposed genetic algorithm (GA) and GA using heuristic mutation guide by pheromone (HMP) to solve EAP. Though it has been proven GA and HMP are effective ways for EAP, they have disadvantages of massive redundancy iteration in later period and inferior local search ability. In this paper a modification of GA which introduces adaptive mutation to HMP is proposed to solve EAP. The simulation results show that the new algorithm improves the ability of local search and generates solutions of better quality.
引用
收藏
页码:934 / +
页数:2
相关论文
共 50 条
  • [1] Solving the assignment problem using genetic algorithm and simulated annealing
    Sahu, Anshuman
    Tapadar, Rudrajit
    IMECS 2006: INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, 2006, : 762 - +
  • [2] Solving the Terminal Assignment Problem Using a Local Search Genetic Algorithm
    Bernardino, Eugenia M.
    Bernardino, Anabela M.
    Sanchez-Perez, Juan M.
    Gomez-Pulido, Juan A.
    Vega-Rodriguez, Miguel A.
    INTERNATIONAL SYMPOSIUM ON DISTRIBUTED COMPUTING AND ARTIFICIAL INTELLIGENCE 2008, 2009, 50 : 225 - +
  • [3] Adaptive Parallel Genetic Algorithm for Expert Assignment Problem
    Li, Junqing
    Peng, Juping
    Wei, Yingbin
    2013 SIXTH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN (ISCID), VOL 1, 2013, : 23 - 26
  • [4] Solving facility layout problem using an improved genetic algorithm
    Wang, RL
    Okazaki, K
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2005, E88A (02) : 606 - 610
  • [5] Solving the graph planarization problem using an improved genetic algorithm
    Wang, Rong-Long
    Okazaki, Kozo
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2006, E89A (05) : 1507 - 1512
  • [6] Solving traffic equilibrium assignment problem with genetic algorithm
    Chen, Yanru
    Pu, Yun
    2000, Sci Publ House (35):
  • [7] Use of the genetic algorithm for solving the wavelength assignment problem
    Wuttisittikulkij, L
    O'Mahony, MJ
    PROGRESS IN CONNECTIONIST-BASED INFORMATION SYSTEMS, VOLS 1 AND 2, 1998, : 506 - 509
  • [8] Solving TSP Problem with Improved Genetic Algorithm
    Fu, Chunhua
    Zhang, Lijun
    Wang, Xiaojing
    Qiao, Liying
    6TH INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN, MANUFACTURING, MODELING AND SIMULATION (CDMMS 2018), 2018, 1967
  • [9] An improved genetic algorithm for solving packing problem
    Li Zhi-yan
    PROCEEDINGS OF THE 2016 4TH INTERNATIONAL CONFERENCE ON MACHINERY, MATERIALS AND COMPUTING TECHNOLOGY, 2016, 60 : 1816 - 1821
  • [10] Parallel Improved Genetic Algorithm for the Quadratic Assignment Problem
    Alfaifi, Huda
    Daadaa, Yassine
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2022, 13 (05) : 577 - 583