IDEAS home Printed from https://ideas.repec.org/a/igg/jeoe00/v7y2018i1p86-103.html
   My bibliography  Save this article

Using Chemotherapy Science Algorithm (CSA) to Solve the Knapsack Problem

Author

Listed:
  • Mohammad Hassan Salmani

    (Sharif University of Technology, Tehran, Islamic Republic of Iran)

  • Kourosh Eshghi

    (Sharif University of Technology, Tehran, Islamic Republic of Iran)

Abstract

Optimization, which, by definition, can help one find the best solution from all feasible solutions, has sometimes been an interesting and important area for research in science. Solving real and hard optimization problems calls for developing approximate, heuristic, and meta-heuristic algorithms. In this article, a new meta-heuristic algorithm is proposed on the basis of the chemotherapy method to cure cancers – this algorithm mainly searches the infeasible region. As in chemotherapy, this algorithm tries to kill unsatisfactory (especially infeasible) solutions (cancers cells); however, collateral damage is sometimes inevitable – some healthy, innocuous, and good cells might be targeted as well. Also, different conceptual terms including Cell Size, Cell Position, Cell Area, and Random Cells are presented and defined in this article. Furthermore, Chemotherapy Science Algorithm (CSA) and its structure are tested based on benchmark Knapsack Problem. Reported results show the efficiency of the proposed algorithm.

Suggested Citation

  • Mohammad Hassan Salmani & Kourosh Eshghi, 2018. "Using Chemotherapy Science Algorithm (CSA) to Solve the Knapsack Problem," International Journal of Energy Optimization and Engineering (IJEOE), IGI Global, vol. 7(1), pages 86-103, January.
    • Handle: RePEc:igg:jeoe00:v:7:y:2018:i:1:p:86-103
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJEOE.2018010105
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jeoe00:v:7:y:2018:i:1:p:86-103. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.