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

标题
A binary moth search algorithm based on self-learning for multidimensional knapsack problems
作者
关键词
Combinatorial optimization, Multidimensional knapsack problem, Moth search algorithm, Self-learning, Quick repair operator
出版商
Elsevier BV
发表日期
2021-08-05
DOI
10.1016/j.future.2021.07.033

向作者/读者发起求助以获取更多资源

Reprint

联系作者

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation