Solving large-scale 0-1 knapsack problem by the social-spider optimisation algorithm
by Guo Zhou; Ruixin Zhao; Yongquan Zhou
International Journal of Computing Science and Mathematics (IJCSM), Vol. 9, No. 5, 2018

Abstract: This paper uses the social-spider optimisation (SSO) algorithm to solve large-scale 0-1 knapsack problems. The SSO algorithm is based on the simulation of cooperative behaviour of social-spiders. In SSO algorithm, individuals emulate a group of spiders which interact to each other based on the biological laws of the cooperative colony. The algorithm considers two different search agents (spiders): males and females. Depending on gender, each individual is conducted by a set of different evolutionary operators which mimic different cooperative behaviour which are typically found in the colony. The experiment results show that the social-spider optimisation algorithm can be an efficient alternative for large-scale 0-1 knapsack problems.

Online publication date: Mon, 08-Oct-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com