Cognitive discrete gravitational search algorithm for solving 0-1 knapsack problem

DOI10.3233/IFS-151700zbMath1361.90053MaRDI QIDQ2987849

Hedieh Sajedi, Seyedeh Fatemeh Razavi

Publication date: 18 May 2017

Published in: Journal of Intelligent & Fuzzy Systems (Search for Journal in Brave)

zbMATH Keywords

knapsack problemcognitive componentdiscrete gravitational search algorithm (DGSA)social component

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Methods of successive quadratic programming type (90C55)

Uses Software

• BGSA

Cites Work

• Why `GSA: a gravitational search algorithm' is not genuinely based on the law of gravity
• Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
• A discrete gravitational search algorithm for solving combinatorial optimization problems
• BGSA: Binary gravitational search algorithm
• A genetic algorithm for the multidimensional knapsack problem
• Solving 0-1 knapsack problems based on amoeboid organism algorithm
• GSA: A gravitational search algorithm
• Selection among ranked projects under segmentation, policy and logical constraints
• A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
• An improved typology of cutting and packing problems
• Resolution of the 0–1 knapsack problem: Comparison of methods
• Unnamed Item

This page was built for publication: Cognitive discrete gravitational search algorithm for solving 0-1 knapsack problem