Dichotomous binary differential evolution for knapsack problems

DOI10.1155/2016/5732489MaRDI QIDQ1793333zbMATH OpenOpenAlexWikidataFDO

Authors Hu Peng, Peng Shao, Changshou Deng, Z. Wu

Publication date 12 October 2018

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

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

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

Review text

Summary: Differential evolution (DE) is one of the most popular and powerful evolutionary algorithms for the real-parameter global continuous optimization problems. However, how to adapt into combinatorial optimization problems without sacrificing the original evolution mechanism of DE is harder work to the researchers to design an efficient binary differential evolution (BDE). To tackle this problem, this paper presents a novel BDE based on dichotomous mechanism for knapsack problems, called DBDE, in which two new proposed methods (i.e., dichotomous mutation and dichotomous crossover) are employed. DBDE almost has any difference with original DE and no additional module or computation has been introduced. The experimental studies have been conducted on a suite of 0-1 knapsack problems and multidimensional knapsack problems. Experimental results have verified the quality and effectiveness of DBDE. Comparison with three state-of-the-art BDE variants and other two state-of-the-art binary particle swarm optimization (PSO) algorithms has proved that DBDE is a new competitive algorithm.

Recommendations

• Novel binary differential evolution algorithm for knapsack problems
• A binary differential evolution algorithm based on a parameterless mutation strategy
• Binary differential evolution algorithm with greedy packaging to solve high-dimensional knapsack problem
• A novel differential evolution algorithm for binary optimization
• Evolutionary algorithms for knapsack problems

Cites work

• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• A Modified Binary Particle Swarm Optimization for Knapsack Problems
• A trigonometric mutation operation to differential evolution
• Differential Evolution for Binary Encoding
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 702365 (Why is no real title available?)
• scientific article; zbMATH DE number 867338 (Why is no real title available?)
• The cellular differential evolution based on chaotic local search
• The design of approximation algorithms
• The multidimensional 0-1 knapsack problem: an overview.
• The multidimensional knapsack problem: structure and algorithms

Cited in

(11)

• Working principles of binary differential evolution
• Novel binary differential evolution algorithm for knapsack problems
• A novel differential evolution algorithm for binary optimization
• Binary differential evolution algorithm with greedy packaging to solve high-dimensional knapsack problem
• Relative position indexing approach
• Differential Evolution for Binary Encoding
• A binary differential evolution algorithm based on a parameterless mutation strategy
• A binary algebraic differential evolution for the multidimensional two-way number partitioning problem
• A new spatial branch and bound algorithm for quadratic program with one quadratic constraint and linear constraints
• A novel discrete differential evolution algorithm combining transfer function with modulo operation for solving the multiple knapsack problem
• Analysis and improvement of the binary particle swarm optimization

Describes a project that uses

Uses Software

• Genocop
• JADE
• OR-Library

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

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