IDEAS home Printed from https://ideas.repec.org/a/bps/jspath/v1y2024i8id5111.html
   My bibliography  Save this article

The Genetic Edge: Revolutionizing Multi-Constraint Fractional Knapsack Solutions

Author

Listed:
  • Apurva Tiwari
  • Mahesh Kumar Tiwari

Abstract

Under linear constraints, a greedy algorithm effectively solves the fractional knapsack problem. However, when additional constraints, such as weight and risk, are added, the complexity of the approach rises. Previous studies have shown that the greedy strategy is optimal under single linear constraints and have provided comprehensive documentation of its efficacy in solving the fractional knapsack problem in straightforward, unconstrained circumstances. Nevertheless, there hasn't been much research done on using greedy algorithms to solve issues with many constraints. This study examines how well genetic algorithms (GAs) perform in comparison to the greedy technique for solving the fractional knapsack problem under conditions with various restrictions. Our results show that, although the greedy method is still efficient in linear or unconstrained circumstances, GAs perform better when dealing with various constraints and provide better solutions in spite of their increased complexity of calculation. This study demonstrates the benefits of using evolutionary algorithms to solve difficult restricted optimization issues when more conventional approaches fall short.

Suggested Citation

  • Apurva Tiwari & Mahesh Kumar Tiwari, 2024. "The Genetic Edge: Revolutionizing Multi-Constraint Fractional Knapsack Solutions," SPAST Reports, SPAST Foundation, vol. 1(8).
    • Handle: RePEc:bps:jspath:v:1:y:2024:i:8:id:5111
    as

    Download full text from publisher

    File URL: https://spast.org/article/view/5111/455
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bps:jspath:v:1:y:2024:i:8:id:5111. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Srinesh Singh Thakur (email available below). General contact details of provider: https://spast.org/ojspath/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.