2011•Jisuanji yingyong yanjiuRequires access

Solving 0-1 knapsack problem by fuzzy particle swarm optimization

Ma Liang

Abstract

For the weakpoint of fuzzy particle swarm on knapsack problem,this paper gave a new algorithm.Fuzzy particle swarm optimization was a method for solving real problems by using both the fuzzy rules and the characteristics of particle swarm optimization.It successfully solved some 0-1 knapsack problems by fuzzy particle swarm optimization.The computational results show the effectiveness and robustness of the algorithm in numerical simulation.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Knapsack problem, Particle swarm optimization, Multi-swarm optimization, Mathematical optimization, Computer science, Continuous knapsack problem, Robustness (evolution), Fuzzy logic