The Multidimensional Knapsack Problem (MKP) is a classical NP-hard combinatorial optimization problem used in wide variety of applications such as in logistics, cloud computing, manufacturing, telecommunications, scheduling and resource allocation. Metaheuristic algorithms are widely used because as the size of the problem and complexity of the optimization problem grows, the traditional exact methods are not able to compute them. In this regard, the Genetic Algorithm (GA) and Salp Swarm Algorithm (SSA) have received high interest due to their complementary search capabilities. The global exploration via the adaptive leader–follower mechanism in SSA, and the strong local exploitation by evolutionary operators in GA, complement each other well. In recent years, these algorithms are being incorporated into hybrid frameworks to accelerate the convergence process, preserve the diversity of the population and increase the quality of the solutions in large-scale optimization problems. But most of the current research is implementation oriented, and there are very few conceptual syntheses of concepts for the theoretical foundations, evolution, hybridization strategies and emerging developments of SSA–GA optimization for MKP. This paper discusses the complete overview of the conceptual review of Hybrid Salp Swarm–Genetic Algorithm optimization in Multidimensional Knapsack Problem. It outlines the development of the MKP, metaheuristic optimization, evolutionary computation, swarm intelligence and hybrid optimization and discusses the complementary nature of exploring/exploiting, constraint-handling and adaptive optimization mechanisms. The review also outlines the recent research trends, conceptual gaps, and suggests a common framework to inform the design of the scalable, adaptive, and computationally efficient hybrid optimization models. By consolidating current knowledge and outlining future research directions, this review provides a valuable reference for researchers and practitioners working in combinatorial optimization and intelligent resource allocation.

Keywords: Multidimensional Knapsack Problem, Genetic Algorithm, Salp Swarm Algorithm, Resource Allocation.

Abdel-Basset, M., Mohamed, R., Chakrabortty, R.K., Ryan, M.J., & Mirjalili, S. (2023). A comprehensive review of hybrid metaheuristic optimization algorithms: Recent advances, applications, and future directions. Archives of Computational Methods in Engineering, 30(2): 1065–1105. https://doi.org/10.1007/s11831-022-09828-4.

Blum, C., & Roli, A. (2003). Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys, 35(3): 268–308. https://doi.org/10.1145/937503.937505.

Boussaïd, I., Lepagnot, J., & Siarry, P. (2013). A survey on optimization metaheuristics. Information Sciences, 237: 82–117. https://doi.org/10.1016/j.ins.2013.02.041.

Bushaj, V., & Büyüktahtakın, İ.E. (2024). Advances in multidimensional knapsack problem optimization: Models, algorithms, and emerging applications. European Journal of Operational Research, 322(2): 385–406. https://doi. org/10.1016/j.ejor.2024.01.018.

Cacchiani, V., Caprara, A., & Toth, P. (2022). Knapsack problems: Recent developments and future perspectives. 4OR, 20(1): 1–38. https://doi.org/10.1007/s10288-021-00488-9.

Castelli, M., Silva, S., & Vanneschi, L. (2022). Hybrid metaheuristics for combinatorial optimization: Current trends and future challenges. Swarm and Evolutionary Computation, 71: Article 101067. 

Coello Coello, C.A. (2002). Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state of the art. Computer Methods in Applied Mechanics and Engineering, 191(11–12): 1245–1287. https://doi.org/10.1016/s0045-7825(01)00323-1.

Dellinger, J., Mavridou, T., & Zachariadis, E.E. (2022). Exact and heuristic algorithms for multidimensional knapsack problems: A computational review. Computers & Operations Research, 145: Article 105850. 

Eiben, A.E., & Smith, J.E. (2015). Introduction to evolutionary computing (2nd Ed.). Springer. 

Goldberg, D.E. (1989). Genetic algorithms in search, optimization, and machine learning. Addison-Wesley.

Holland, J.H. (1975). Adaptation in natural and artificial systems. University of Michigan Press.

Kellerer, H., Pferschy, U., & Pisinger, D. (2004). Knapsack problems. Springer. https://doi.org/10.1007/978-3-5 40-24777-7.

Li, X., Wang, Y., Zhang, H., & Chen, Z. (2024). Adaptive hybrid metaheuristic optimization for large-scale combinatorial problems: A review. Applied Soft Computing, 156: Article 111401. 

Lu, Y., Zhao, J., Xu, L., & Wang, P. (2024). Intelligent hybrid optimization algorithms integrating machine learning and swarm intelligence: A comprehensive review. Expert Systems with Applications, 251: Article 123918. https://doi.org/10.1016/j.eswa.2024.123918.

Martello, S., & Toth, P. (1990). Knapsack problems: Algorithms and computer implementations. John Wiley & Sons.

Mirjalili, S., Gandomi, A.H., Mirjalili, S.Z., Saremi, S., Faris, H., & Mirjalili, S.M. (2017). Salp swarm algorithm: A bio-inspired optimizer for engineering design problems. Advances in Engineering Software, 114: 163–191. https://doi.org/10.1016/j.advengsoft.2017.07.002.

Poli, R., Kennedy, J., & Blackwell, T. (2007). Particle swarm optimization: An overview. Swarm Intelligence, 1(1): 33–57. https://doi.org/10.1007/s11721-007-0002-0.

Scherer, M., Klamroth, K., & Stiglmayr, M. (2024). Recent advances in combinatorial optimization under uncertainty: A review. European Journal of Operational Research, 323(1): 1–22. https://doi.org/10.1016/j.ejor. 2024.02.011.

Snyder, H. (2019). Literature review as a research methodology: An overview and guidelines. Journal of Business Research, 104: 333–339. https://doi.org/10.1016/j.jbusres.2019.07.039.

Talbi, E.G. (2009). Metaheuristics: From design to implementation. John Wiley & Sons.

Wolpert, D.H., & Macready, W.G. (1997). No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1): 67–82. https://doi.org/10.1109/4235.585893.

Yang, X.S. (2020). Nature-inspired optimization algorithms (2nd Ed.). Elsevier.

Source of Funding:

This research did not benefit from grant from any non-profit, public or commercial funding agency.

Competing Interests Statement:

The authors have declared that no competing financial, professional or personal interests exist.

Consent for publication:

The authors wrote and edited the manuscript and consented to the publication of this research work.

Availability of data and material:

Not applicable for this study.