论文信息 - Hybrid Artificial Glowworm Swarm Optimization Algorithm for Solving Multi-dimensional Knapsack Problem

Hybrid Artificial Glowworm Swarm Optimization Algorithm for Solving Multi-dimensional Knapsack Problem

Abstract In this paper, a hybrid artificially glowworm swarm optimization algorithm to solve multidimensional 0-1 knapsack problem is proposed. The algorithm utilizes two important strategies, how to select the item based on its unit volume value and the binary glowworm swarm optimization algorithm, 37 multidimensional 0-1 knapsack test instances are tested by the produced algorithm, The integrated performance of the produced algorithm is rather satisfied, and the hybrid glowworm swarm optimization algorithm is rather efficient for solving multidimensional 0-1 knapsack problem.

Yongquan Zhou | Qifang Luo | Qiaoqiao Gong

[1] Didier El Baz,et al. Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem , 2005, J. Parallel Distributed Comput..

[2] Michel Vasquez,et al. Improved results on the 0-1 multidimensional knapsack problem , 2005, Eur. J. Oper. Res..

[3] Debasish Ghose,et al. Glowworm swarm optimisation: a new method for optimising multi-modal functions , 2009, Int. J. Comput. Intell. Stud..

[4] Liu Ruo-chen,et al. Artificial immune antibody adjusting clonal algorithm for the 0-1 knapsack problem , 2005 .