Clustered Genetic Algorithm to solve Multidimensional Knapsack Problem

被引：0
|
作者：
Gupta, Indresh Kumar [1 ]
Choubey, Abha [1 ]
Choubey, Siddhartha [1 ]
机构：
[1] Shri Shanakaracharya Tech Campus, Dept Comp Sci & Engn, Bhilai 490020, India
来源：
2017 8TH INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATION AND NETWORKING TECHNOLOGIES (ICCCNT) | 2017年
关键词：
Multidimensional knapsack problem; Genetic algorithm; Fitness function; Crossover; Mutation;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Genetic Algorithm (GA) has emerged as a powerful tool to discover optimal for multidimensional knapsack problem (MDKP). Multidimensional knapsack problem has recognized as NP-hard problem whose applications in many areas like project selection, capital budgeting, loading problems, cutting stock etc. Attempts has made to develop cluster genetic algorithm (CGA) via modified selection and modified crossover operators of GA. Clustered genetic algorithm consist of (1) fuzzy roulette wheel selection for individual selection to form the mating pool (2) A different kind of crossover operator which uses hierarchical clustering method to form two clusters from individuals of mating pool. CGA performance has examined against GA with respect to 30 benchmark problems for multidimensional knapsack. Experimental results show that CGA has significant improvement over GA in relation to discover optimal and CPU running time. The data set for MDKP is available at http://people.brunel.ac.uk/mastjjb/jeb/orlib/files/mknap2.txt
引用
收藏
页数：6
相关论文
共 50 条
  • [1] A Genetic Algorithm for the Multidimensional Knapsack Problem
    P.C. Chu
    J.E. Beasley
    [J]. Journal of Heuristics, 1998, 4 : 63 - 86
  • [2] A genetic algorithm for the multidimensional knapsack problem
    Chu, PC
    Beasley, JE
    [J]. JOURNAL OF HEURISTICS, 1998, 4 (01) : 63 - 86
  • [3] Guided genetic algorithm for the multidimensional knapsack problem
    Rezoug, Abdellah
    Bader-El-Den, Mohamed
    Boughaci, Dalila
    [J]. MEMETIC COMPUTING, 2018, 10 (01) : 29 - 42
  • [4] Guided genetic algorithm for the multidimensional knapsack problem
    Abdellah Rezoug
    Mohamed Bader-El-Den
    Dalila Boughaci
    [J]. Memetic Computing, 2018, 10 : 29 - 42
  • [5] An partheno-genetic algorithm for multidimensional knapsack problem
    Bai, JC
    Chang, HY
    Yi, Y
    [J]. PROCEEDINGS OF 2005 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-9, 2005, : 2962 - 2965
  • [6] A Hybrid Genetic Algorithm to Solve Zero-One Knapsack Problem
    Chen, Qing
    Shao, Yuxiang
    [J]. APPLIED INFORMATICS AND COMMUNICATION, PT I, 2011, 224 : 315 - +
  • [7] AN EVOLUTIONARY MULTIOBJECTIVE GENETIC ALGORITHM TO SOLVE 0/1 KNAPSACK PROBLEM
    Mohanty, Sachi Nandan
    Satapathy, Rabinarayan
    [J]. 2009 2ND IEEE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY, VOL 3, 2009, : 392 - +
  • [8] A Faster Genetic Algorithm to Solve Knapsack Problem employing Fuzzy Technique
    Mahato, Shalini
    Biswas, Sanjay
    [J]. 2013 FOURTH INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATIONS AND NETWORKING TECHNOLOGIES (ICCCNT), 2013,
  • [9] A EVOLUTIONARY MULTIOBJECTIVE GENETIC ALGORITHM TO SOLVE 0/1 KNAPSACK PROBLEM
    Swetanisha, Subhra
    Mishra, Bhabani Sankar Prasad
    [J]. PROCEEDINGS OF 2009 INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING AND APPLICATIONS, 2009, : 232 - 236
  • [10] A Hybrid Genetic Algorithm to Solve Zero-One Knapsack Problem
    Chen, Qing
    Shao, Yuxiang
    [J]. 2010 THE 3RD INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND INDUSTRIAL APPLICATION (PACIIA2010), VOL I, 2010, : 185 - 188
12345