The Heuristic Algorithm Based on Learning-Competing Model and Its Application to Task Assignment Problem

被引:0
作者
Wang, Zhe [1 ]
Wang, Hongwei [1 ]
Chen, Xi [1 ]
Jiang, Yi [1 ]
机构
[1] Huazhong Univ Sci & Technol, Inst Syst Engn, Wuhan 430074, Peoples R China
来源
ADVANCES IN NEURAL NETWORKS - ISNN 2009, PT 1, PROCEEDINGS | 2009年 / 5551卷
关键词
Heuristic algorithm; Combinatorial optimization; Learning-competing mode; Task assignment;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A universal model-learning-competing one is established for solving task assignment problem in National Economy Mobilization(NEM), in which local search was focused in learning model and global search in competing Thereafter the strong points of the two models were amalgamated in the algorithm. A team of parameters was used to coordinating the correlation of the two models. Applying learning-competing model 10 an actual case, using greed algorithm in learning model, genetic algorithm competing model, the results obtained were in coincidence with the analysis.
引用
收藏
页码:819 / 826
页数:8
相关论文
共 8 条
  • [1] [Anonymous], 1975, Ann Arbor
  • [2] Chen Tieying, 2007, Journal of Huazhong University of Science and Technology, V35, P38
  • [3] Cormen T.H., 2002, INTRO ALGORITHMS, V2nd
  • [4] Gutin G., 2002, The traveling salesman problem and its variations, V2002nd
  • [5] Michalewicz Z, 1994, Genetic Algorithm + Data Structure = Evolution Programs
  • [6] RONALD GA, 2006, EUR J OPER RES, V168, P853
  • [7] TAL S, 2006, COMPLITERS OPERATION, V33, P3252
  • [8] XIONG J, 2006, THESIS HUAZHONG U SC