Binary Moth Search Algorithm for Discounted {0-1} Knapsack Problem

@article{Feng2018BinaryMS,
  title={Binary Moth Search Algorithm for Discounted \{0-1\} Knapsack Problem},
  author={Yan-Hong Feng and Gai-ge Wang},
  journal={IEEE Access},
  year={2018},
  volume={6},
  pages={10708-10719}
}
The discounted {0-1} knapsack problem (DKP) extends the classical 0-1 knapsack problem (0-1 KP) in which a set of item groups is included and each group consists of three items, whereas at most one of the three items can be packed into the knapsack. Therefore, the DKP is more complicated and computationally difficult than 0-1 KP. The DKP has been found many applications in real economic problems and other areas. In this paper, the influence of Lévy flights operator and fly straightly operator… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 29 references

Research on genetic algorithms for the discounted 0-1 knapsack problem

Y. C. He, X. Z. Wang, W. B. Li, X. L. Zhang, Y. Y. Chen
Chin. J. Comput., vol. 39, no. 12, pp. 2614–2630, 2016. • 2016
View 6 Excerpts
Highly Influenced

Global-best harmony search

Applied Mathematics and Computation • 2008
View 7 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…