TEJAS Journal of Technologies and Humanitarian Science

Practical Approach Of Genetic Edge

Apurva Tiwari
Computer Science Department, National PG College, Lucknow, India

Author

Khushi Maurya
Computer Science Department, National PG College, Lucknow, India

Author

Mahesh Kumar Tiwari
Assistance Professor, Computer Science Department, National PG College, Lucknow, India

Author

📜 License:

This work is licensed under a Creative Commons Attribution 4.0 International License

• Share — Copy and Redistribute the material
• Adapt — Remix, Transform, and build upon the material
• The licensor cannot revoke these freedoms as long as you follow the license terms.

Abstract:

The greedy algorithm effectively solves the Fractional Knapsack Problem (FKP) in linear scenarios. However, the problem's complexity increases, and the greedy approach fails to yield optimal solutions when additional constraints, such as weight and risk, are introduced. Our previous theoretical study highlighted the limitations of the greedy method in such multi-constraint environments. This paper presents the real-world application of a Genetic algorithm for these challenges. The FKP is not like 0-1 Knapsack problem, it allows fractional item selection offering greater flexibility in practical applications. The proposed GA optimizes item selection based on value while ensuring that both capacity and risk constraints are met. Experimental results validate the GA's effectiveness, producing optimal solutions with maximum value and controlled risk thresholds.

References

[1]. Apurva Tiwari, Mahesh K. Tiwari. (2024) “The Genetic Edge: Revolutionizing Multi-Constraint Fractional Knapsack Solutions”.
[2]. Shah, Shalin. "Genetic algorithm for a class of knapsack problems." arXiv preprint arXiv:1903.03494 (2019).
[3]. W. Shen, B. Xu and J. -p. Huang, "An Improved Genetic Algorithm for 0-1 Knapsack Problems," 2011 Second International Conference on Networking and Distributed Computing, Beijing, China, 2011, pp. 32 35, doi: 10.1109/ICNDC.2011.14.
[4]. Rezoug, A., Bader-El-Den, M. & Boughaci, D. Guided genetic algorithm for the multidimensional knapsack problem. Memetic Comp. 10, 29–42 (2018). https://doi.org/10.1007/s12293-017-0232-7
[5]. Patel, P.S., Singh, A. A diversity preserving genetic algorithm with tailor-made variation operators for the quadratic bottleneck knapsack problem. Evol. Intel. 17, 1953–1965 (2024). https://doi.org/10.1007/s12065 023-00875-7
[6]. Ünal, Ali Nadi. “A Genetic Algorithm for the Multiple Knapsack Problem in Dynamic Environment.” (2013).
[7]. Kilincli, Taskiran, Gamze, "An Improved Genetic Algorithm for Knapsack Problems" (2010). [8]. SB Verma, Brijesh P., and BK Gupta, Containerization and its Architectures: A Study, ADCAIJ: Advances in Distributed Computing and Artificial Intelligence Journal, Vol. 11 N. 4 (2022), 395-409, eISSN: 2255 2863, DOI: https://doi.org/10.14201/adcaij.28351
[9]. Anamika Agarwal, S. B. V., B. K. Gupta, A Review of Cloud Security Issues and Challenges, ADCAIJ: Advances in Distributed Computing and Artificial Intelligence Journal, Issue, Vol. 12 N. 1 (2023), pp 1-22, eISSN: 2255-2863, 2023 https://doi.org/10.14201/adcaij.31459
[10]. Ms Gaurvi Shukla, E-Commerce As a Tool for Economic Empowerment and Poverty Reduction,TEJAS Journal of Technologies and Humanitarian Science, ISSN-2583-5599, Vol.02, I.02(2023)