Scholarlink

<p>In order to solve the 0-1 knapsack problem (0-1KP) by using Fick’s law algorithm, first of all, the discretization method of evolutionary algorithm using transfer functions is introduced. Then, a new type of transfer functions, L-shaped transfer functions, are proposed, and the binary Fick’s law algorithm (named LBFLA) is proposed by L-shaped transfer functions. Subsequently, a new method for solving 0-1KP is proposed based on LBFLA. The comparison results with the existing transfer functions show that using the L-shaped transfer functions to discretize FLA is not only efficient but also has better performance for solving 0-1KP. Finally, the comparison between LBFLA and seven state-of-the-art evolutionary algorithms for solving 0-1 KP shows that LBFLA is the most competitive evolutionary algorithm in solving 0-1 KP.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Binary Fick’s Law Algorithm Based on L-Shaped Transfer Function for Solving the 0-1 Knapsack Problem

  • 期刊论文

  • 发表日期：

    2025年12月17日

查看全文
  • Yichao He,
  • Manman Meng,
  • Guoxin Chen,
  • Ju Chen,
  • Seyedali Mirjalili

摘要

In order to solve the 0-1 knapsack problem (0-1KP) by using Fick’s law algorithm, first of all, the discretization method of evolutionary algorithm using transfer functions is introduced. Then, a new type of transfer functions, L-shaped transfer functions, are proposed, and the binary Fick’s law algorithm (named LBFLA) is proposed by L-shaped transfer functions. Subsequently, a new method for solving 0-1KP is proposed based on LBFLA. The comparison results with the existing transfer functions show that using the L-shaped transfer functions to discretize FLA is not only efficient but also has better performance for solving 0-1KP. Finally, the comparison between LBFLA and seven state-of-the-art evolutionary algorithms for solving 0-1 KP shows that LBFLA is the most competitive evolutionary algorithm in solving 0-1 KP.