Solving the 0/1 knapsack problem with improved pseudo-parallel genetic algorithm

被引：0
|
作者：
Chen, Yiming [1 ]
Li, Guangjun [1 ]
Zeng, Xiaoqing [1 ]
机构：
[1] Changsha Univ Sci & Technol, Coll Econ & Management, Changsha 410076, Hunan, Peoples R China
来源：
ADVANCES IN BUSINESS INTELLIGENCE AND FINANCIAL ENGINEERING | 2008年 / 5卷
关键词：
Pseudo-parallel Genetic Algorithm; Greedy Algorithm; Knapsack Problem;
D O I：
暂无
中图分类号：
F [经济];
学科分类号：
02 ;
摘要：
An improved pseudo-parallel genetic algorithm which comprehensively adopts three different greedy algorithms is proposed to solve the 0/1 Knapsack problem. The initial population is divided into three subgroups, which is respectively pretreated by three greedy algorithms. Information exchange between subgroups adopts the island model to maintain the diversity of population. Simulation study demonstrates that the improved pseudo-parallel genetic algorithm has stronger global search capability and higher immunity against premature convergence than the traditional hybrid genetic algorithm.
引用
收藏
页码：329 / 333
页数：5
相关论文
共 50 条
  • [1] PARALLEL GENETIC ALGORITHM SOLVING 0/1 KNAPSACK PROBLEM RUNNING ON THE GPU
    Pospichal, Petr
    Schwarz, Josef
    Jaros, Jiri
    16TH INTERNATIONAL CONFERENCE ON SOFT COMPUTING MENDEL 2010, 2010, : 64 - 70
  • [2] An improved sexual genetic algorithm for solving 0/1 multidimensional knapsack problem
    Laabadi, Soukaina
    Naimi, Mohamed
    El Amri, Hassan
    Achchab, Boujemaa
    ENGINEERING COMPUTATIONS, 2019, 36 (07) : 2260 - 2292
  • [3] AN IMPROVED PARALLEL ALGORITHM FOR 0/1 KNAPSACK-PROBLEM
    CHEN, GH
    JANG, JH
    PARALLEL COMPUTING, 1992, 18 (07) : 811 - 821
  • [4] Improved simulated annealing algorithm solving for 0/1 knapsack problem
    Liu, Aizhen
    Wang, Jiazhen
    Han, Guodong
    Wang, Suzhen
    Wen, Jiafu
    ISDA 2006: SIXTH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS, VOL 2, 2006, : 1159 - +
  • [5] Improved simulated annealing algorithm solving for 0/1 knapsack problem
    Liu, Aizhen
    Gao, Xiufeng
    Wang, Jiazhen
    Wang, Feng
    Chen, Liyun
    Proceedings of 2006 International Conference on Artificial Intelligence: 50 YEARS' ACHIEVEMENTS, FUTURE DIRECTIONS AND SOCIAL IMPACTS, 2006, : 628 - 631
  • [6] Solving traveling salesman problem (TSP) with pseudo-parallel genetic algorithms
    Liu, Jun
    Wang, Jie-Sheng
    Kongzhi Lilun Yu Yingyong/Control Theory and Applications, 2007, 24 (02): : 279 - 282
  • [7] Solving the 0/1 knapsack problem using an adaptive genetic algorithm
    Ezziane, Z
    AI EDAM-ARTIFICIAL INTELLIGENCE FOR ENGINEERING DESIGN ANALYSIS AND MANUFACTURING, 2002, 16 (01): : 23 - 30
  • [8] An improved genetic algorithm for the multiconstrained 0-1 Knapsack Problem
    Raidl, GR
    1998 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION - PROCEEDINGS, 1998, : 207 - 211
  • [9] An improved particle swarm optimization algorithm for solving 0-1 knapsack problem
    Zhang, Guo-Li
    Wei, Yi
    PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2008, : 915 - +
  • [10] Pseudo-parallel genetic algorithm for reactive power optimization
    Wang, ZH
    Yin, XG
    Zhang, Z
    Yang, JC
    2003 IEEE POWER ENGINEERING SOCIETY GENERAL MEETING, VOLS 1-4, CONFERENCE PROCEEDINGS, 2003, : 903 - 907
12345