A binary differential evolution algorithm based on a parameterless mutation strategy

DOI10.3969/J.ISSN.1005-3026.2014.04.007MaRDI QIDQ5499301zbMATH OpenFDO

Authors Liqun Gao, Haibin Ouyang, Yanfeng Ge, Xiangyong Kong

Publication date 11 February 2015

Full work available at URL https://doi.org/10.3969/J.ISSN.1005-3026.2014.04.007

zbMATH Keywords

0-1 knapsack problembinary codedifferential evolutionparameterless mutationquadratic greedy transform

Mathematics Subject Classification ID

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

Recommendations

• Dichotomous binary differential evolution for knapsack problems
• Novel binary differential evolution algorithm for knapsack problems
• A novel differential evolution algorithm for binary optimization
• Improved differential evolution algorithm for solving 0-1 programming problems
• Differential Evolution for Binary Encoding

Cited in

(7)

• Dichotomous binary differential evolution for knapsack problems
• Working principles of binary differential evolution
• Novel binary differential evolution algorithm for knapsack problems
• A novel differential evolution algorithm for binary optimization
• Improved differential evolution algorithm for solving 0-1 programming problems
• Differential Evolution for Binary Encoding
• A binary algebraic differential evolution for the multidimensional two-way number partitioning problem

This page was built for publication: A binary differential evolution algorithm based on a parameterless mutation strategy

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