IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/595484.html
   My bibliography  Save this article

Improved Genetic Algorithm with Two-Level Approximation Method for Laminate Stacking Sequence Optimization by Considering Engineering Requirements

Author

Listed:
  • Haichao An
  • Shenyan Chen
  • Hai Huang

Abstract

Laminated composites have been widely applied in aerospace structures; thus optimization of the corresponding stacking sequences is indispensable. Genetic algorithms have been popularly adopted to cope with the design of stacking sequences which is a combinatorial optimization problem with complicated manufacturing constraints, but they often exhibit high computational costs with many structural analyses. A genetic algorithm using a two-level approximation (GATLA) method was proposed previously by the authors to obtain the optimal stacking sequences, which requires significantly low computational costs. By considering practical engineering requirements, this method possesses low applicability in complicated structures with multiple laminates. What is more, it has relatively high dependence on some genetic algorithm control parameters. To address these problems, now we propose an improved GA with two-level approximation (IGATLA) method which includes improved random initial design, adaptive penalty fitness function, adaptive crossover probability, and variable mutation probability, as well as enhanced validity check criterion for multiple laminates. The efficiency and feasibility of these improvements are verified with numerical applications, including typical numerical examples and industrial applications. It is shown that this method is also able to handle large, real world, industrial analysis models with high efficiency.

Suggested Citation

  • Haichao An & Shenyan Chen & Hai Huang, 2015. "Improved Genetic Algorithm with Two-Level Approximation Method for Laminate Stacking Sequence Optimization by Considering Engineering Requirements," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-13, September.
  • Handle: RePEc:hin:jnlmpe:595484
    DOI: 10.1155/2015/595484
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2015/595484.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2015/595484.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2015/595484?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:hin:jnlmpe:595484. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.