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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
