A novel discrete differential evolution algorithm combining transfer function with modulo operation for solving the multiple knapsack problem

DOI10.1016/J.INS.2024.121170MaRDI QIDQ6595340zbMATH OpenFDO

Authors Lina Wang, Yichao He, Xi-Zhao Wang, Zihang Zhou, Haibin Ouyang, SeyedAli Mirjalili

Publication date 30 August 2024

Published in Information Sciences (Search for Journal in Brave)

zbMATH Keywords

differential evolutiontransfer functionsmultiple knapsack problemmodulo operationrepair and optimization

Mathematics Subject Classification ID

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

Recommendations

• Novel binary differential evolution algorithm for knapsack problems
• Dichotomous binary differential evolution for knapsack problems
• A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the Knapsack problem
• Evolutionary algorithms for knapsack problems
• Design and applications of discrete evolutionary algorithm based on encoding transformation

Cites work

• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• A bound and bound algorithm for the zero-one multiple knapsack problem
• A differential evolution based feature combination selection algorithm for high-dimensional data
• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• An exact algorithm for large multiple knapsack problems
• Bin completion algorithms for multicontainer packing, Knapsack, and covering problems
• Cluster analysis for data mining and system identification.
• Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand
• Design and applications of discrete evolutionary algorithm based on encoding transformation
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Mathematical models and decomposition methods for the multiple knapsack problem
• Multiple criteria dynamic programming and multiple knapsack problem
• Upper bounds and algorithms for the maximum cardinality bin packing problem.

This page was built for publication: A novel discrete differential evolution algorithm combining transfer function with modulo operation for solving the multiple knapsack problem

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