A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems

DOI10.1016/j.cam.2013.09.052zbMath1314.90067OpenAlexW2066653502WikidataQ57573511 ScholiaQ57573511MaRDI QIDQ2349685

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

Publication date: 17 June 2015

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2013.09.052

zbMATH Keywords

heuristic0-1 knapsack problemartificial fish swarmswap move

Mathematics Subject Classification ID

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

Related Items (8)

A hybrid binary artificial bee colony algorithm for the satellite photograph scheduling problem ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm ⋮ Heuristic-based firefly algorithm for bound constrained nonlinear binary optimization ⋮ An adaptive multiscale approach for identifying multiple flaws based on XFEM and a discrete artificial fish swarm algorithm ⋮ A diverse human learning optimization algorithm ⋮ Optimal chiller loading by improved artificial fish swarm algorithm for energy saving ⋮ A binary differential search algorithm for the 0-1 multidimensional knapsack problem

Uses Software

• Genocop
• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• An augmented Lagrangian fish swarm based method for global optimization
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
• ``Miniaturized linearizations for quadratic 0/1 problems
• The quadratic knapsack problem -- a survey
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
• Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
• A new upper bound for the 0-1 quadratic knapsack problem
• Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem
• Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction
• Quadratic knapsack problems
• Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
• Exact Solution of the Quadratic Knapsack Problem
• 0-1 Quadratic Knapsack Problems: An Exact Approach Based on a $t$-Linearization

This page was built for publication: A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems