Solving large-scale 0-1 knapsack problem by the social-spider optimisation algorithm

DOI10.1504/IJCSM.2018.095497MaRDI QIDQ2224310zbMATH OpenWikidataFDO

Authors Guo Zhou, Ruixin Zhao, Yongquan Zhou

Publication date 3 February 2021

Published in International Journal of Computing Science and Mathematics (Search for Journal in Brave)

zbMATH Keywords

cooperative behaviourlarge-scale 0-1 knapsack problemssocial-spider optimisation algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• A kind of hybrid particle swarm optimization algorithm for solving 0-1 knapsack problems
• Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm
• Study of an improved hybrid particle swarm optimization algorithm for solving 0-1 knapsack problems
• Solving efficiently the 0-1 multi-objective knapsack problem
• Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm
• A learned harmony search algorithm and its application to 0-1 knapsack problems

Cited in

(1)

• Discrete sine cosine algorithm for solving large-scale 0-1 knapsack problems

This page was built for publication: Solving large-scale 0-1 knapsack problem by the social-spider optimisation algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2224310)