The effect of dynamic penalty function on solution of quadratic knapsack problem with simulated annealing algorithm

MaRDI QIDQ5048844zbMATH OpenFDO

Authors Aydin Sipahioglu, Islam Altin

Publication date 16 November 2022

Full work available at URL http://yokohamapublishers.jp/online2/opaao/vol4/p257.html

zbMATH Keywords

quadratic knapsack problemsimulated annealing algorithmdynamic penalty function

Mathematics Subject Classification ID

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

Recommendations

• Simulated annealing for the 0/1 multidimensional knapsack problem
• An effective GRASP and tabu search for the 0-1 quadratic knapsack problem
• A dynamic programming heuristic for the quadratic knapsack problem
• A kind of renewed simulated annealing algorithm solves 0-1 knapsack problem
• A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem

This page was built for publication: The effect of dynamic penalty function on solution of quadratic knapsack problem with simulated annealing algorithm

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