期刊
INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION
卷 10, 期 4, 页码 219-238出版社
INDERSCIENCE ENTERPRISES LTD
DOI: 10.1504/IJBIC.2017.087924
关键词
discounted {0-1} knapsack problem; differential evolution; encoding conversion method; repairing and optimisation
资金
- Macao Science and Technology Development Funds [100/2013/A3, 081/2015/A3]
- Basic Research Project of Knowledge Innovation Program in Shenzhen [JCYJ20150324140036825]
- National Natural Science Foundations of China [61503252, 71371063]
- Scientific Research Project Program of Colleges and Universities in Hebei Province [ZD2016005]
- Natural Science Foundation of Hebei Province [F2016403055]
This paper first proposes a discrete differential evolution algorithm for discounted {0-1} knapsack problems (D{0-1} KP) based on feasible solutions represented by the 0-1 vector. Subsequently, based on two encoding mechanisms of transforming a real vector into an integer vector, two new algorithms for solving D{0-1} KP are given through using integer vectors defined on {0, 1, 2, 3} n to represent feasible solutions of the problem. Finally, the paper conducts a comparative study on the performance between our proposed three discrete differential evolution algorithms and those developed by common genetic algorithms for solving several types of large scale D{0-1} KP problems. The paper confirms the feasibility and effectiveness of designing discrete differential evolution algorithms for D{0-1} KP by encoding conversion approaches.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据