Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm

DOI10.1007/S10852-015-9275-2zbMATH Open1335.90078DBLPjournals/jmma/AzadRF15OpenAlexW1996673460WikidataQ57573506 ScholiaQ57573506MaRDI QIDQ894546FDOQ894546

Edite M. G. P. Fernandes, Ana Maria A. C. Rocha, Md. Abul Kalam Azad

Publication date: 1 December 2015

Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-015-9275-2

Recommendations

• Artificial fish-swarm algorithm for the multi-dimensional 0-1 knapsack problem
• A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
• An artificial bee colony algorithm for the 0-1 multidimensional Knapsack problem
• A Modified Binary Particle Swarm Optimization for Knapsack Problems
• Artificial bee colony algorithm merged with pheromone communication mechanism for the 0-1 multidimensional knapsack problem

zbMATH Keywords

heuristic search0-1 knapsack problemartificial fish swarmmultidimensional knapsack

Mathematics Subject Classification ID

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

Cites Work

• A simulated annealing approach to the multiconstraint zero-one knapsack problem
• Title not available (Why is that?)
• A minimal algorithm for the multiple-choice knapsack problem
• Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
• Improved results on the 0--1 multidimensional knapsack problem
• A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
• The multidimensional knapsack problem: structure and algorithms
• Heuristics for the 0-1 multidimensional knapsack problem
• A genetic algorithm for the multidimensional knapsack problem
• The multidimensional 0-1 knapsack problem: an overview.
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem
• A new ant colony optimization algorithm for the multidimensional Knapsack problem
• Greedy algorithm for the general multidimensional knapsack problem
• A heuristic solution procedure for the multiconstraint zero-one knapsack problem
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• A hybrid genetic algorithm for the multidimensional knapsack problem
• A Modified Binary Particle Swarm Optimization for Knapsack Problems
• The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
• An augmented Lagrangian fish swarm based method for global optimization
• An Enumeration Algorithm for Knapsack Problems
• Zero-one programming with many variables and few constraints
• An ant colony optimization approach for the multidimensional knapsack problem
• A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem
• A statistical analysis of the knapsack problem
• The growth of m-constraint random knapsacks
• Genetic algorithms with double strings for 0-1 programming problems
• A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators
• An artificial fish swarm algorithm based hyperbolic augmented Lagrangian method

Cited In (3)

• Solving large-scale 0-1 knapsack problem by the social-spider optimisation algorithm
• A RNN-based hyper-heuristic for combinatorial problems
• Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm

Uses Software

• Genocop
• Knapsack

This page was built for publication: Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm

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