IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v50y1999i8d10.1057_palgrave.jors.2600778.html
   My bibliography  Save this article

Evolutionary algorithms for production planning problems with setup decisions

Author

Listed:
  • Y-F Hung

    (National Tsing Hua University)

  • C-C Shih

    (National Tsing Hua University)

  • C-P Chen

    (National Tsing Hua University)

Abstract

Production planning problems with setup decisions, which were formulated as mixed integer programmes (MIP), are solved in this study. The integer component of the MIP solution is determined by three evolution algorithms used in this study. Firstly, a traditional genetic algorithm (GA) uses conventional crossover and mutation operators for generating new chromosomes (solutions). Secondly, a modified GA uses not only the conventional operators but also a sibling operator, which stochastically produces new chromosomes from old ones using the sensitivity information of an associated linear programme. Thirdly, a sibling evolution algorithm uses only the sibling operator to reproduce. Based on the experiments done in this study, the sibling evolution algorithm performs the best among all the algorithms used in this study.

Suggested Citation

  • Y-F Hung & C-C Shih & C-P Chen, 1999. "Evolutionary algorithms for production planning problems with setup decisions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(8), pages 857-866, August.
    • Handle: RePEc:pal:jorsoc:v:50:y:1999:i:8:d:10.1057_palgrave.jors.2600778
    DOI: 10.1057/palgrave.jors.2600778
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2600778
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2600778?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:pal:jorsoc:v:50:y:1999:i:8:d:10.1057_palgrave.jors.2600778. 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.palgrave-journals.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.