Colony location algorithm for assignment problems

被引:0
作者
Dingwei WANG(InFormation School
机构
基金
中国国家自然科学基金;
关键词
Evolutionary computation; Artificial life; Bionic computation; Optimization; Assignment problem;
D O I
暂无
中图分类号
TP11 [自动化系统理论];
学科分类号
0711 ; 071102 ; 0811 ; 081101 ; 081103 ;
摘要
A novel algorithm called Colony Location Algorithm (CLA) is proposed. It mimics the phenomena in biotic community that colonies of species could be located in the places most suitable to their growth. The factors working on the species location such as the nutrient of soil, resource competition between species, growth and decline process, and effect on environment were considered in CLA via the nutrient function, growth and decline rates,environment evaluation and fertilization strategy. CLA was applied to solve the classical assignment problems. The computation results show that CLA can achieve the optimal solution with higher possibility and shorter running time.
引用
收藏
页码:111 / 116
页数:6
相关论文
共 5 条
  • [1] A novel chaotic search for quadratic assignment problems
    Hasegawa, M
    Ikeguchi, T
    Aihara, K
    Itoh, K
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 139 (03) : 543 - 556
  • [2] Selected topics on assignment problems[J] . Rainer E. Burkard.Discrete Applied Mathematics . 2002 (1)
  • [3] A greedy genetic algorithm for the quadratic assignment problem
    Ahuja, RK
    Orlin, JB
    Tiwari, A
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2000, 27 (10) : 917 - 934
  • [4] NEURAL COMPUTATION OF DECISIONS IN OPTIMIZATION PROBLEMS
    HOPFIELD, JJ
    TANK, DW
    [J]. BIOLOGICAL CYBERNETICS, 1985, 52 (03) : 141 - 152
  • [5] Assignment problems and the location of economic activities .2 T Koopmans,M Beckmann. Econometrica . 1957