Evolution of new algorithms for the binary knapsack problem

DOI10.1007/S11047-015-9483-8MaRDI QIDQ2003461zbMATH OpenOpenAlexFDO

Authors Lucas Parada, Carlos Herrera, Mauricio Sepúlveda, Víctor Parada

Publication date 8 July 2019

Published in Natural Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11047-015-9483-8

zbMATH Keywords

combinatorial optimizationknapsack problemevolutionary computationgenetic programminghyper-heuristicautomatic generation of algorithms

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• Novel binary differential evolution algorithm for knapsack problems
• An improved direct descent algorithm for binary knapsack problems
• Solving knapsack problems by human evolutionary algorithms
• Where are the hard knapsack problems?
• A new class of hard problem instances for the 0-1 knapsack problem

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2165679 (Why is no real title available?)
• scientific article; zbMATH DE number 795587 (Why is no real title available?)
• An Algorithm for Large Zero-One Knapsack Problems
• Approximate formulations for 0-1 knapsack sets
• Genetic Algorithms and Genetic Programming
• Hyper-Heuristics: An Emerging Direction in Modern Search Technology
• Kernel search: a general heuristic for the multi-dimensional knapsack problem
• Molecular solution to the 0-1 knapsack problem based on DNA computing
• Where are the hard knapsack problems?

Cited in

(1)

• Solving knapsack problems by human evolutionary algorithms

Describes a project that uses

Uses Software

• GPC++
• Hyperheuristics

This page was built for publication: Evolution of new algorithms for the binary knapsack problem

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