2007•Journal of Nanchang Hangkong UniversityRequires access

Modified particle swarm optimization algorithm for knapsack problem

Fan Zhang

Abstract

In this paper,a modified particle swarm optimization algorithm is presented to solve knapsack problem,and the detailed realization of the algorithm is illustrated.By comparing the calculating results with some examples in other references,it can be found that this modified particle swarm optimization algorithm is available and efficient in solving knapsack problem.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

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, Algorithm, Realization (probability)