Publication:
Different Transfer Functions for Binary Particle Swarm Optimization with a New Encoding Scheme for Discounted {0-1} Knapsack Problem
Different Transfer Functions for Binary Particle Swarm Optimization with a New Encoding Scheme for Discounted {0-1} Knapsack Problem
| datacite.subject.fos | oecd::Natural sciences | |
| dc.contributor.author | Tung Khac Truong | |
| dc.contributor.editor | Luigi Rodino | |
| dc.date.accessioned | 2022-11-02T01:23:05Z | |
| dc.date.available | 2022-11-02T01:23:05Z | |
| dc.date.issued | 2021 | |
| dc.description.abstract | The discounted {0-1} knapsack problem (DKP01) is a kind of knapsack problem with group structure and discount relationships among items. It is more challenging than the classical 0-1 knapsack problem. In this paper, we study binary particle swarm optimization (PSO) algorithms with different transfer functions and a new encoding scheme for DKP01. An effective binary vector with shorter length is used to represent a solution for new binary PSO algorithms. Eight transfer functions are used to design binary PSO algorithms for DKP01. A new repair operator is developed to handle isolation solution while improving its quality. Finally, we conducted extensive experiments on four groups of 40 instances using our proposed approaches. The experience results show that the proposed algorithms outperform the previous algorithms named FirEGA and SecEGA . Overall, the proposed algorithms with a new encoding scheme represent a potential approach for solving the DKP01. | |
| dc.identifier.doi | 10.1155/2021/2864607 | |
| dc.identifier.uri | http://repository.vlu.edu.vn:443/handle/123456789/575 | |
| dc.language.iso | en_US | |
| dc.relation.ispartof | Mathematical Problems in Engineering | |
| dc.relation.issn | 1563-5147 | |
| dc.relation.issn | 1024-123X | |
| dc.title | Different Transfer Functions for Binary Particle Swarm Optimization with a New Encoding Scheme for Discounted {0-1} Knapsack Problem | |
| dc.type | journal-article | |
| dspace.entity.type | Publication | |
| oaire.citation.volume | 2021 |