Author:
Nguyen Phuong Hoai,Wang Dong,Truong Tung Khac
Abstract
This paper proposes a new binary particle swarm optimization with a greedy strategy to solve 0-1 knapsack problem. Two constraint handling techniques are consider to cooperation with binary particle swarm optimization that are penalty function and greedy. The sigmoid transfer function is used to convert real code to binary code. The experimental results have proven the superior performance of the proposed algorithm.
Publisher
Institute of Advanced Engineering and Science
Subject
Electrical and Electronic Engineering,Control and Optimization,Computer Networks and Communications,Hardware and Architecture,Information Systems,Signal Processing
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献