Parallel genetic algorithm for multi knapsack problem

被引:0
|
作者
Qi, T [1 ]
Zhou, SJ [1 ]
Chang, GJ [1 ]
机构
[1] Tianjin Univ, Sch Elect & Informat Engn, Tianjin 300072, Peoples R China
来源
CCECE 2003: CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING, VOLS 1-3, PROCEEDINGS: TOWARD A CARING AND HUMANE TECHNOLOGY | 2003年
关键词
parallel genetic algorithm; cluster of workstations; multi-Knapsack-Problem;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper begins by introducing the basic mechanics of genetic algorithm and discussing different ways to parallelize algorithm. A parallel genetic algorithm (PGA) is presented over a cluster of workstations by using the PVM library, which is used to handle communications among processors. Using the presented algorithm, the well-known 0-1 multi-Knapsack-Problem is computed. Simulation results are presented to show how the performance of the PGA is affected by variations on the number of nodes, population size and migration interval. Results indicate that the performance of PGA on multi-knapsack problem is sound and robust.
引用
收藏
页码:1115 / 1118
页数:4
相关论文
共 50 条
  • [21] A parallel genetic algorithm approach to solving the unit commitment problem: Implementation on the transputer networks
    Yang, HT
    Yang, PC
    Huang, CL
    IEEE TRANSACTIONS ON POWER SYSTEMS, 1997, 12 (02) : 661 - 668
  • [22] A Coarse-grained Parallel Genetic Algorithm with Migration for Shortest Path Routing Problem
    Yussof, Salman
    Razali, Rina Azlin
    See, Ong Hang
    Ghapar, Azimah Abdul
    Din, Marina Md
    HPCC: 2009 11TH IEEE INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS, 2009, : 615 - 621
  • [23] An Enhanced MapReduce Framework for Solving Protein Folding Problem Using a Parallel Genetic Algorithm
    Narayanan, A. G. Hari
    Krishnakumar, U.
    Judy, M. V.
    ICT AND CRITICAL INFRASTRUCTURE: PROCEEDINGS OF THE 48TH ANNUAL CONVENTION OF COMPUTER SOCIETY OF INDIA - VOL I, 2014, 248 : 241 - 250
  • [24] A graphical processing unit-based parallel hybrid genetic algorithm for resource-constrained multi-project scheduling problem
    Uysal, Furkan
    Sonmez, Rifat
    Isleyen, Selcuk Kursat
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2021, 33 (16)
  • [25] The Analysis and Research of Parallel Genetic Algorithm
    Xue Shengjun
    Guo Shaoyong
    Bai Dongling
    2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, : 5343 - +
  • [26] A novel parallel quantum genetic algorithm
    Zhang, GX
    Jin, WD
    Hu, LH
    PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES, PDCAT'2003, PROCEEDINGS, 2003, : 693 - 697
  • [27] THE PARALLEL GENETIC ALGORITHM AS FUNCTION OPTIMIZER
    MUHLENBEIN, H
    SCHOMISCH, M
    BORN, J
    PARALLEL COMPUTING, 1991, 17 (6-7) : 619 - 632
  • [28] Parallel genetic algorithm with fading selection
    Akopov, Andranik S.
    INTERNATIONAL JOURNAL OF COMPUTER APPLICATIONS IN TECHNOLOGY, 2014, 49 (3-4) : 325 - 331
  • [29] Parallel genetic algorithm with parameter adaptation
    Tongchim, S
    Chongstitvatana, P
    INFORMATION PROCESSING LETTERS, 2002, 82 (01) : 47 - 54
  • [30] Solving the dynamic energy aware job shop scheduling problem with the heterogeneous parallel genetic algorithm
    Luo, Jia
    El Baz, Didier
    Xue, Rui
    Hu, Jinglu
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2020, 108 : 119 - 134