학술논문
A Hybrid Swarm Optimization-Based Algorithm for the Set-Union Knapsack Problem
Document Type
Conference
Author
Source
2020 7th International Conference on Control, Decision and Information Technologies (CoDIT) Control, Decision and Information Technologies (CoDIT), 2020 7th International Conference on. 1:1162-1167 Jun, 2020
Subject
Language
ISSN
2576-3555
Abstract
In this paper, we propose a hybrid particle swarm optimization-based algorithm for approximately solving the set-union knapsack problem. Knapsack problem arises in several applications such as manufacturing systems, transportation and supply chain management. This study reinforce the basic swarm optimization method with a local search procedure for the set-union knapsack problem. The proposed approach is evaluated on a benchmark instances available in the literature. The bounds achieved by the proposed approach are compared to those provided by the best methods available in the literature. Encouraging results have been provided.