2006•Jisuanji gongchengRequires access

Modified Particle Swarm Optimization for 0-1 Knapsack Problems

Yuanxiang Li

Abstract

The algorithm and the search strategies of particle swarm optimization are introduced, on base of which concepts such as equivalent transformation, the difference value transformation and the transform serial sequence are defined according to characteristics of 0-1 knapsack problem, then a kind of special particle swarm optimization that is applicable to solve 0-1 knapsack problem is designed. The experimental results show the possibility and the efficiency of the modified particle swarm optimization on solving 0-1 knapsack problem.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 6 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, Continuous knapsack problem, Multi-swarm optimization, Mathematical optimization, Metaheuristic, Computer science, Transformation (genetics)