IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v5y2009i2p211-228.html
   My bibliography  Save this article

Optimal allocation problem using Genetic Algorithm

Author

Listed:
  • T. Vasanthi
  • G. Arulmozhi

Abstract

This paper proposes a genetic model to study the reliability optimisation in a Linear Consecutively Connected System (LCCS) by allocating M statistically independent Multi-state Elements with different characteristics to the first N positions. The system is reliable if the first position is connected with the (N + 1)th position. The reliability of LCCS is obtained using Universal Generating Function technique. The optimal allocation is obtained by means of Genetic Algorithm. In our work, for the one-to-one allocation, the Permutation Crossover is used, which reduces the complexity of the problem, and also yield better result.

Suggested Citation

  • T. Vasanthi & G. Arulmozhi, 2009. "Optimal allocation problem using Genetic Algorithm," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 5(2), pages 211-228.
    • Handle: RePEc:ids:ijores:v:5:y:2009:i:2:p:211-228
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=25008
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Levitin, Gregory & Xing, Liudong & Dai, Yuanshun, 2018. "Connectivity evaluation and optimal service centers allocation in repairable linear consecutively connected systems," Reliability Engineering and System Safety, Elsevier, vol. 176(C), pages 187-193.
    2. Levitin, Gregory & Xing, Liudong & Dai, Yuanshun, 2024. "Consecutively connected systems with unreliable resource generators and storages," Reliability Engineering and System Safety, Elsevier, vol. 241(C).

    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:ids:ijores:v:5:y:2009:i:2:p:211-228. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.