IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v37y1999i4p749-768.html
   My bibliography  Save this article

Development and validation of genetic algorithm-based facility layout a case study in the pharmaceutical industry

Author

Listed:
  • S. Hamamoto
  • Y. Yih
  • G. Salvendy

Abstract

In the layout design of pharmaceutical factories, several important objectives often need to be considered, such as operation cost, maintenance cost, material handing cost, throughput rate, etc. Most of the existing algorithms for facility layout design were developed based on pre-determined single objectives; namely, the distance-based objectives or the adjacency-based objectives. In this paper, we propose a genetic algorithm approach with an embedded simulation model which allows the user to select the objectives that are important in each particular layout design in the pharmaceutical industry. To verify the feasibility of the proposed method, the layout designs of two pharmaceutical plants for solid dosage forms were used as a test bed. One represents a typical small-size pharmaceutical plant and the other represents a medium-size plant. The objectives are to maximize throughput rate and to minimize travelling time per trip. A simulation model was developed, and the efficiency of the layouts generated by human designers CORELAP, CRAFT, and BLOCPLAN, is compared. The comparison indicates that the proposed genetic algorithm method significantly outperforms human designers and other computer algorithms in minimizing travelling time per trip under the same throughput rate.

Suggested Citation

  • S. Hamamoto & Y. Yih & G. Salvendy, 1999. "Development and validation of genetic algorithm-based facility layout a case study in the pharmaceutical industry," International Journal of Production Research, Taylor & Francis Journals, vol. 37(4), pages 749-768, March.
  • Handle: RePEc:taf:tprsxx:v:37:y:1999:i:4:p:749-768
    DOI: 10.1080/002075499191508
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/002075499191508
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/002075499191508?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.

    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:taf:tprsxx:v:37:y:1999:i:4:p:749-768. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.