Publisher
Springer Nature Switzerland
Reference33 articles.
1. Li, J.P., Balazs, M.E., Parks, G.T., Clarkson, P.J.: A species conserving genetic algorithm for multimodal function optimization. Evol. Comput. 10(3), 207–234 (2002)
2. Soukaina, L., Mohamed, N., Hassan, E., Boujemâa, A.: A hybrid genetic algorithm for solving 0/1 knapsack problem. In: Proceedings of the International Conference on Learning and Optimization Algorithms: Theory and Applications, pp. 1–6 (2018)
3. Lim, T.Y., Al-Betar, M.A., Khader, A.T.: Taming the 0/1 knapsack problem with monogamous pairs genetic algorithm. Exp. Syst. Appl. 54, 241–50 (2016)
4. Zhang, S., Liu, S.: A discrete improved artificial bee colony algorithm for 0–1 knapsack problem. IEEE Access 7, 104982–104991 (2019)
5. Alzaqebah, A., Abu-Shareha, A.A.: Ant colony system algorithm with dynamic pheromone updating for 0/1 knapsack problem. Int. J. Intell. Syst. Appl. 10(2), 9–17 (2019)