IDEAS home Printed from https://ideas.repec.org/a/igg/jcini0/v13y2019i4p91-111.html
   My bibliography  Save this article

A Controlled Stability Genetic Algorithm With the New BLF2G Guillotine Placement Heuristic for the Orthogonal Cutting-Stock Problem

Author

Listed:
  • Slimane Abou-Msabah

    (University of Science and Technology Houari Boumedienne, Bab Ezzouar, Algeria)

  • Ahmed-Riadh Baba-Ali

    (University of Science and Technology Houari Boumedienne, Bab Ezzouar, Algeria)

  • Basma Sager

    (University of Sciences and Technologies Houari Boumediene, Bab Ezzouar, Algeria)

Abstract

The orthogonal cutting-stock problem tries to place a given set of items in a minimum number of identically sized bins. Combining the new BLF2G heuristic with an advanced genetic algorithm can help solve this problem with the guillotine constraint. According to the item order, the BLF2G heuristic creates a direct placement of items in bins to give a cutting format. The genetic algorithm exploits the search space to find the supposed optimal item order. Other methods try to guide the evolutionary process. A new enhancement guides the evolutionary process, enriching the population via qualified individuals, without disturbing the genetic phase. The evolution of the GA process is controlled, and when no improvements after some number of iterations are observed, a qualified individual is injected to the population to avoid premature convergence to a local optimum. A generated set of order-based individuals enriches the evolutionary process with qualified chromosomes. The proposed method is compared with other heuristics and metaheuristics found in the literature on existing data sets.

Suggested Citation

  • Slimane Abou-Msabah & Ahmed-Riadh Baba-Ali & Basma Sager, 2019. "A Controlled Stability Genetic Algorithm With the New BLF2G Guillotine Placement Heuristic for the Orthogonal Cutting-Stock Problem," International Journal of Cognitive Informatics and Natural Intelligence (IJCINI), IGI Global, vol. 13(4), pages 91-111, October.
    • Handle: RePEc:igg:jcini0:v:13:y:2019:i:4:p:91-111
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJCINI.2019100105
    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:jcini0:v:13:y:2019:i:4:p:91-111. 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.