A Fuzzy Genetic Algorithm Based on Binary Encoding for Solving Multidimensional Knapsack Problems

被引:7
|
作者
Varnamkhasti, M. Jalali [1 ]
Lee, L. S. [2 ,3 ]
机构
[1] Islamic Azad Univ, Dept Basic Sci, Dolatabad Branch, Esfahan 8431811111, Iran
[2] Univ Putra Malaysia, Lab Computat Stat & Operat Res, Inst Math Res, Serdang 43400, Selangor, Malaysia
[3] Univ Putra Malaysia, Dept Math, Fac Sci, Serdang 43400, Selangor, Malaysia
关键词
D O I
10.1155/2012/703601
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The fundamental problem in genetic algorithms is premature convergence, and it is strongly related to the loss of genetic diversity of the population. This study aims at proposing some techniques to tackle the premature convergence by controlling the population diversity. Firstly, a sexual selection mechanism which utilizes the mate chromosome during selection is used. The second technique focuses on controlling the genetic parameters by applying the fuzzy logic controller. Computational experiments are conducted on the proposed techniques and the results are compared with other genetic operators, heuristics, and local search algorithms commonly used for solving multidimensional 0/1 knapsack problems published in the literature.
引用
收藏
页数:23
相关论文
共 50 条
  • [1] Genetic algorithm based on the orthogonal design for multidimensional knapsack problems
    Li, Hong
    Jiao, Yong-Chang
    Zhang, Li
    Gu, Ze-Wei
    [J]. ADVANCES IN NATURAL COMPUTATION, PT 1, 2006, 4221 : 696 - 705
  • [2] Binary artificial algae algorithm for multidimensional knapsack problems
    Zhang, Xuedong
    Wu, Changzhi
    Li, Jing
    Wang, Xiangyu
    Yang, Zhijing
    Lee, Jae-Myung
    Jung, Kwang-Hyo
    [J]. APPLIED SOFT COMPUTING, 2016, 43 : 583 - 595
  • [3] Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm
    Kong, Xiangyong
    Gao, Liqun
    Ouyang, Haibin
    Li, Steven
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2015, 63 : 7 - 22
  • [4] Solving multidimensional knapsack problems by an immune-inspired algorithm
    Gong, Maoguo
    Jiao, Licheng
    Ma, Wenping
    Gou, Shuiping
    [J]. 2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, : 3385 - 3391
  • [5] An Ant Colony Optimization algorithm for solving the Multidimensional Knapsack Problems
    Ji, Junzhoug
    Huang, Zhen
    Liu, Chunnian
    Liu, Xuejing
    Zhong, Ning
    [J]. PROCEEDINGS OF THE IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON INTELLIGENT AGENT TECHNOLOGY (IAT 2007), 2007, : 10 - +
  • [6] An improved firefly algorithm for solving dynamic multidimensional knapsack problems
    Baykasoglu, Adil
    Ozsoydan, Fehmi Burcin
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2014, 41 (08) : 3712 - 3725
  • [7] Multiswarm Binary Butterfly Optimization Algorithm for Solving the Multidimensional Knapsack Problem
    Shahbandegan, Shakiba
    Naderi, Madjid
    [J]. 2021 29TH IRANIAN CONFERENCE ON ELECTRICAL ENGINEERING (ICEE), 2021, : 545 - 550
  • [8] An effective hybrid harmony search-based algorithm for solving multidimensional knapsack problems
    Zhang, Biao
    Pan, Quan-Ke
    Zhang, Xin-Li
    Duan, Pei-Yong
    [J]. APPLIED SOFT COMPUTING, 2015, 29 : 288 - 297
  • [9] A binary moth search algorithm based on self-learning for multidimensional knapsack problems
    Feng, Yanhong
    Wang, Gai-Ge
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2022, 126 : 48 - 64
  • [10] Hybrid Learning Moth Search Algorithm for Solving Multidimensional Knapsack Problems
    Feng, Yanhong
    Wang, Hongmei
    Cai, Zhaoquan
    Li, Mingliang
    Li, Xi
    [J]. MATHEMATICS, 2023, 11 (08)