IDEAS home Printed from https://ideas.repec.org/a/spr/joinma/v29y2018i1d10.1007_s10845-015-1099-4.html
   My bibliography  Save this article

An improved league championship algorithm with free search and its application on production scheduling

Author

Listed:
  • Wei Xu

    (Central Academe)

  • Raofen Wang

    (Shanghai University of Engineering Science)

  • Jiarong Yang

    (Central Academe)

Abstract

An improved league championship algorithm with free search (LCAFS) is proposed to avoid the drawbacks of basic LCA, such as premature convergence, slow convergence speed. The parameters of the algorithm vary linearly along with iteration. A novel match schedule is designed to improve the competition capability for the sport teams. Furthermore, the free search operation is introduced to promote the diversity of the league. Inspired by the real league degradation, degradation mechanism is used to preserve the team elites. It is convinced by using benchmark functions that LCAFS is superior to other compared algorithms in the global searching performance and convergence speed. The proposed algorithm is finally employed as learning method of parameters in neural network to establish the shop floor production scheduling model and achieves good results.

Suggested Citation

  • Wei Xu & Raofen Wang & Jiarong Yang, 2018. "An improved league championship algorithm with free search and its application on production scheduling," Journal of Intelligent Manufacturing, Springer, vol. 29(1), pages 165-174, January.
    • Handle: RePEc:spr:joinma:v:29:y:2018:i:1:d:10.1007_s10845-015-1099-4
    DOI: 10.1007/s10845-015-1099-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10845-015-1099-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10845-015-1099-4?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:joinma:v:29:y:2018:i:1:d:10.1007_s10845-015-1099-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.