Genetic search and the dynamic layout problem

被引：90
作者：
Balakrishnan, J
Cheng, CH
机构：
[1] Univ Calgary, Fac Management, Calgary, AB T2N 1N4, Canada
[2] Chinese Univ Hong Kong, Dept Syst Engn & Engn Management, Shatin, Hong Kong, Peoples R China
来源：
COMPUTERS & OPERATIONS RESEARCH | 2000年 / 27卷 / 06期
基金：
加拿大自然科学与工程研究理事会;
关键词：
genetic search; dynamic layout; optimization;
D O I：
10.1016/S0305-0548(99)00052-0
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
An improved genetic algorithm for the dynamic layout problem is developed and tested in this research. Our genetic algorithm differs from the existing implementation in three ways: first, we adopt a different crossover operator, second, we use mutation, and third, we use a new generational replacement strategy to help increase population diversity. A computational study shows that the proposed GA is quite effective.
引用
收藏
页码：587 / 593
页数：7
相关论文
共 6 条
  • [1] Chambers L., 1995, PRACTICAL HDB GENETI, V1
  • [2] Chambers L.D., 1995, The Practical Handbook of Genetic Algorithms: New Frontiers, V2
  • [3] GENETIC SEARCH AND THE DYNAMIC FACILITY LAYOUT PROBLEM
    CONWAY, DG
    VENKATARAMANAN, MA
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1994, 21 (08) : 955 - 960
  • [4] Davis L., 1985, P INT C GENETIC ALGO, P136
  • [5] CONSTRAINED OPTIMIZATION VIA GENETIC ALGORITHMS
    HOMAIFAR, A
    QI, CX
    LAI, SH
    [J]. SIMULATION, 1994, 62 (04) : 242 - 253
  • [6] A GENETIC APPROACH TO THE QUADRATIC ASSIGNMENT PROBLEM
    TATE, DM
    SMITH, AE
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1995, 22 (01) : 73 - 83
1