A New Hybrid Particle Swarm Optimization and Greedy for 0-1 Knapsack Problem

Phuong Hoai Nguyen, Dong Wang, Tung Khac Truong


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.

Full Text:


DOI: http://doi.org/10.11591/ijeecs.v1.i3.pp411-418


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

The Indonesian Journal of Electrical Engineering and Computer Science (IJEECS)
p-ISSN: 2502-4752, e-ISSN: 2502-4760
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).

shopify stats IJEECS visitor statistics