Dichotomous binary differential evolution for knapsack problems

DOI10.1155/2016/5732489zbMath1400.90225OpenAlexW2566904163WikidataQ59131682 ScholiaQ59131682MaRDI QIDQ1793333

Peng Shao, Hu Peng, Changshou Deng, ZhiJian Wu

Publication date: 12 October 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2016/5732489

Mathematics Subject Classification ID

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

Related Items (1)

Novel binary differential evolution algorithm for knapsack problems

Uses Software

• OR-Library
• Genocop
• JADE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Modified Binary Particle Swarm Optimization for Knapsack Problems
• A trigonometric mutation operation to differential evolution
• The multidimensional 0-1 knapsack problem: an overview.
• The cellular differential evolution based on chaotic local search
• The Multidimensional Knapsack Problem: Structure and Algorithms
• The Design of Approximation Algorithms
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• Differential Evolution for Binary Encoding

This page was built for publication: Dichotomous binary differential evolution for knapsack problems