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 条
  • [21] Solving knapsack problems using a binary gaining sharing knowledge-based optimization algorithm
    Agrawal, Prachi
    Ganesh, Talari
    Mohamed, Ali Wagdy
    [J]. COMPLEX & INTELLIGENT SYSTEMS, 2022, 8 (01) : 43 - 63
  • [22] Solving knapsack problems using a binary gaining sharing knowledge-based optimization algorithm
    Prachi Agrawal
    Talari Ganesh
    Ali Wagdy Mohamed
    [J]. Complex & Intelligent Systems, 2022, 8 : 43 - 63
  • [23] A Memetic Algorithm Based on Probability Learning for Solving the Multidimensional Knapsack Problem
    Li, Zuocheng
    Tang, Lixin
    Liu, Jiyin
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2022, 52 (04) : 2284 - 2299
  • [24] Solving Knapsack Problem with Genetic Algorithm
    Uslu, Faruk Sukru
    [J]. 2015 23RD SIGNAL PROCESSING AND COMMUNICATIONS APPLICATIONS CONFERENCE (SIU), 2015, : 1062 - 1065
  • [25] A Binary Firefly Algorithm for Knapsack Problems
    Bhattacharjee, Kaushik Kumar
    Sarmah, S. P.
    [J]. 2015 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2015, : 73 - 77
  • [26] A surface-based DNA algorithm for the solving binary knapsack problem
    Darehmiraki, Majid
    Nehi, Hasan Mishmast
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2007, 188 (02) : 1991 - 1994
  • [27] Guided genetic algorithm for the multidimensional knapsack problem
    Rezoug, Abdellah
    Bader-El-Den, Mohamed
    Boughaci, Dalila
    [J]. MEMETIC COMPUTING, 2018, 10 (01) : 29 - 42
  • [28] Guided genetic algorithm for the multidimensional knapsack problem
    Abdellah Rezoug
    Mohamed Bader-El-Den
    Dalila Boughaci
    [J]. Memetic Computing, 2018, 10 : 29 - 42
  • [29] A Binary Butterfly Optimization Algorithm for the Multidimensional Knapsack Problem
    Shahbandegan, Amirmohammad
    Naderi, Madjid
    [J]. 2020 6TH IRANIAN CONFERENCE ON SIGNAL PROCESSING AND INTELLIGENT SYSTEMS (ICSPIS), 2020,
  • [30] An effective hybrid EDA-based algorithm for solving multidimensional knapsack problem
    Wang, Ling
    Wang, Sheng-yao
    Xu, Ye
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (05) : 5593 - 5599