IDEAS home Printed from https://ideas.repec.org/a/igg/jaec00/v2y2011i1p34-48.html
   My bibliography  Save this article

Application of Genetic Algorithm to Minimize the Number of Objects Processed and Setup in a One-Dimensional Cutting Stock Problem

Author

Listed:
  • Julliany Sales Brandão

    (Centro Federal de Educação Tecnológica Celso S. da Fonseca – CEFET/RJ, Brasil)

  • Alessandra Martins Coelho

    (Instituto Politécnico do Rio de Janeiro – UERJ, Brasil)

  • João Flávio V. Vasconcellos

    (Instituto Politécnico do Rio de Janeiro – UERJ, Brasil)

  • Luiz Leduíno de Salles Neto

    (Universidade Federal de São Paulo – UNIFESP, Brasil)

  • André Vieira Pinto

    (Universidade Federal do Estado do Rio de Janeiro – UNIRIO, Brasil)

Abstract

This paper presents the application of the one new approach using Genetic Algorithm in solving One-Dimensional Cutting Stock Problems in order to minimize two objectives, usually conflicting, i.e., the number of processed objects and setup while simultaneously treating them as a single goal. The model problem, the objective function, the method denominated SingleGA10 and the steps used to solve the problem are also presented. The obtained results of the SingleGA10 are compared to the following methods: SHP, Kombi234, ANLCP300 and Symbio10, found in literature, verifying its capacity to find feasible and competitive solutions. The computational results show that the proposed method, which only uses a genetic algorithm to solve these two objectives inversely related, provides good results.

Suggested Citation

  • Julliany Sales Brandão & Alessandra Martins Coelho & João Flávio V. Vasconcellos & Luiz Leduíno de Salles Neto & André Vieira Pinto, 2011. "Application of Genetic Algorithm to Minimize the Number of Objects Processed and Setup in a One-Dimensional Cutting Stock Problem," International Journal of Applied Evolutionary Computation (IJAEC), IGI Global, vol. 2(1), pages 34-48, January.
    • Handle: RePEc:igg:jaec00:v:2:y:2011:i:1:p:34-48
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jaec.2011010103
    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:jaec00:v:2:y:2011:i:1:p:34-48. 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.