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

The Bidirectional Optimization of Carbon Fiber Production by Neural Network with a GA-IPSO Hybrid Algorithm

Author

Listed:
  • Jiajia Chen
  • Yongsheng Ding
  • Kuangrong Hao

Abstract

A hybrid approach of genetic algorithm (GA) and improved particle swarm optimization (IPSO) is proposed to construct the radial basis function neural network (RNN) for real-time optimizing of the carbon fiber manufacture process. For the three-layer RNN, we adopt the nearest neighbor-clustering algorithm to determine the neurons number of the hidden layer. When the appropriate network structure is fixed, we present the GA-IPSO algorithm to tune the parameters of the network, which means the center and the width of the node in the hidden layer and the weight of output layer. We introduce a penalty factor to adjust the velocity and position of the particles to expedite convergence of the PSO. The GA is used to mutate the particles to escape local optimum. Then we employ this network to develop the bidirectional optimization model: in one direction, we take production parameters as input and properties indices as output; in this case, the model is a carbon fiber product performance prediction system; in the other direction, we take properties indices as input and production parameters as output, and at this situation, the model is a production scheme design tool for novel style carbon fiber. Based on the experimental data, the proposed model is compared to the conventional RBF network and basic PSO method; the research results show its validity and the advantages in dealing with optimization problems.

Suggested Citation

  • Jiajia Chen & Yongsheng Ding & Kuangrong Hao, 2013. "The Bidirectional Optimization of Carbon Fiber Production by Neural Network with a GA-IPSO Hybrid Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2013, pages 1-16, March.
  • Handle: RePEc:hin:jnlmpe:768756
    DOI: 10.1155/2013/768756
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2013/768756.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2013/768756.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/768756?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:768756. 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.