Abstract
The Multidimensional Knapsack Problem (MKP) is one kind of classical mathematical model that has been extensively studied by researchers. Due to its NP-hard nature, finding an exact solution for MKP in polynomial time is not feasible, and the methods based on evolutionary algorithms have been widely explored and proven successful in solving the MKP. To effectively tackle MKP, we propose a novel method called the ant-antlion optimizer with similarity information. It incorporates the similarity concept throughout the evolution process. A new evaluation measure that combines individual’s fitness and the similarity degree between the elite individual and other solutions is developed. This measure is utilized to enhance its searching capability. In addition, it employs both fitness values and similarity information of the population to implement a self-adaptive mutation strategy to improve its diversity performance. To evaluate our method, a comprehensive experiment consisting of forty-eight testing instances and six well-known algorithms is carried out. The results demonstrate that our proposed approach effectively solves MKP, and the inclusion of similarity information significantly enhances its performance.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cacchiani, V., Iori, M., Locatelli, A., Martello, S.: Knapsack problems — an overview of recent advances. Part I: single knapsack problems. Comput. Oper. Res. 143, 105692 (2022)
Liu, Y., Zheng, Q., Li, G., Zhang, J., Ren, X., Qin, W.: Discrete baby search algorithm for combinatorial optimization problems. In: 2022 3rd International Conference on Big Data, Artificial Intelligence and Internet of Things Engineering (ICBAIE), pp. 595–599. IEEE (2022)
Liu, Y., Li, M., Zheng, Q., Qin, W., Wang, J.: Baby search algorithm. In: 2021 4th International Conference on Advanced Electronic Materials, Computers and Software Engineering (AEMCSE), pp. 502–508. IEEE (2021)
Mirjalili, S.: The ant lion optimizer. Adv. Eng. Softw. 83, 80–98 (2015)
Li, M., Ren, X., Wang, Y., Qin, W., Liu, Y.: Advanced antlion optimizer with discrete ant behavior for feature selection. IEICE Trans. Inf. Syst. E103-D, 2717–2720 (2020)
Luo, K., Zhao, Q.: A binary grey wolf optimizer for the multidimensional knapsack problem. Appl. Soft Comput. 83, 105645 (2019)
Shahbandegan, A., Naderi, M.: A binary butterfly optimization algorithm for the multidimensional knapsack problem. In: 2020 6th Iranian Conference on Signal Processing and Intelligent Systems (ICSPIS), pp. 1–5. IEEE (2020)
Feng, Y., Wang, G.: A binary moth search algorithm based on self-learning for multidimensional knapsack problems. Future Gener. Comput. Syst. 126, 48–64 (2022)
He, Y., Zhang, X., Li, W., Wang, J., Li, N.: An efficient binary differential evolution algorithm for the multidimensional knapsack problem. Eng. Comput. 37, 745–761 (2021). https://doi.org/10.1007/s00366-019-00853-7
Ben Mansour, I., Alaya, I., Tagina, M.: A gradual weight-based ant colony approach for solving the multiobjective multidimensional knapsack problem. Evol. Intell. 12, 253–272 (2019). https://doi.org/10.1007/s12065-019-00222-9
GarcÃa, J., Maureira, C.: A KNN quantum cuckoo search algorithm applied to the multidimensional knapsack problem. Appl. Soft Comput. 102, 107077 (2021)
Li, Z., Tang, L., Liu, J.: A memetic algorithm based on probability learning for solving the multidimensional knapsack problem. IEEE Trans. Cybern. 52(4), 2284–2299 (2020)
Gupta, S., Su, R., Singh, S.: Diversified sine-cosine algorithm based on differential evolution for multidimensional knapsack problem. Appl. Soft Comput. 130, 109682 (2022)
Lai, X., Hao, J., Fu, Z., Yue, D.: Diversity-preserving quantum particle swarm optimization for the multidimensional knapsack problem. Expert Syst. Appl. 149, 113310 (2020)
Liu, Y., Qin, W., Zheng, Q., Li, G., Li, M.: An interpretable feature selection based on particle swarm optimization. IEICE Trans. Inf. Syst. E105-D(8), 1495–1500 (2022)
Beasley, J.E.: Orlib operations research library, (2005). http://people.brunel.ac.uk/∼mastjjb/jeb/orlib/mknapinfo.html
Nand, R., Sharma, P.: Iteration split with firefly algorithm and genetic algorithm to solve multidimensional knapsack problems. In: 2019 IEEE Asia-Pacific Conference on Computer Science and Data Engineering (CSDE), pp. 1–7. IEEE (2019)
Baroni, M.D.V., Varejão, F.M.: A shuffled complex evolution algorithm for the multidimensional knapsack problem using core concept. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 2718–2723. IEEE (2016)
Berberler, M.E., Guler, A., Nuriyev, U.G.: A genetic algorithm to solve the multidimensional knapsack problem. Math. Comput. Appl. 18(3), 486–494 (2013)
Bansal, J.C., Deep, K.: A modified binary particle swarm optimization for knapsack problems. Appl. Math. Comput. 218, 11042–11061 (2012)
Fidanova, S., Atanassov, K.T.: ACO with intuitionistic fuzzy pheromone updating applied on multiple-constraint knapsack problem. Mathematics 9(14), 1456 (2021)
Acknowledgements
This work was partially supported by National Science Foundation for Young Scientists of China (72201275), Young Elite Scientists Sponsorship Program by CAST (2022QNRC001).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Liu, Y. et al. (2024). Ant-Antlion Optimizer with Similarity Information for Multidimensional Knapsack Problem. In: Tan, Y., Shi, Y. (eds) Data Mining and Big Data. DMBD 2023. Communications in Computer and Information Science, vol 2017. Springer, Singapore. https://doi.org/10.1007/978-981-97-0837-6_17
Download citation
DOI: https://doi.org/10.1007/978-981-97-0837-6_17
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-97-0836-9
Online ISBN: 978-981-97-0837-6
eBook Packages: Computer ScienceComputer Science (R0)