A binary moth search algorithm based on self-learning for multidimensional knapsack problems

Title
A binary moth search algorithm based on self-learning for multidimensional knapsack problems
Authors
Keywords
Combinatorial optimization, Multidimensional knapsack problem, Moth search algorithm, Self-learning, Quick repair operator
Publisher
Elsevier BV
Online
2021-08-05
DOI
10.1016/j.future.2021.07.033

Ask authors/readers for more resources

Reprint

Contact the author

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started