2015•Wireless Internet TechnologyRequires access

The Application Of Modified Particle Swarm Optimization Algorithm In Knapsack Problem

Cheng Zheyua

Abstract

Based on the analysis of the knapsack problem,the aim of this article is to use the particle swarm algorithm with inertia weight and with a shrinkage factor improved particle swarm optimization to solve the knapsack problem, and discuss the influence of changed parameters, through a multi-trials, and ultimately obtained the optimal solution to the knapsack problem with known optimal solution consistent.

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, Mathematical optimization, Inertia, Multi-swarm optimization, Algorithm, Cutting stock problem