IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v12y2018i2p252-275.html
   My bibliography  Save this article

Solution for bi-objective single row facility layout problem using artificial bee colony algorithm

Author

Listed:
  • Lenin Nagarajan
  • Siva Kumar Mahalingam
  • Selvakumar Gurusamy
  • Vignesh Kumar Dharmaraj

Abstract

The single row facility layout problem (SRFLP) is concerned with the arrangements of machineries in a single line for processing multiple products. This arrangement is termed as linear machine sequence (lms). The aim of the proposed work is to design a best lms that simultaneously minimises the objectives: the total flow distance of the products (D); and the total length of the flow line (L) needed for accommodating the machineries in the shop floor. Consideration of more than one objective in a multi-product environment in bi-objective single row facility layout problem (BOSRFLP) is an NP-hard problem. Hence, artificial bee colony (ABC) algorithm is applied to identify the best lms. The effectiveness of the proposed algorithm is verified by solving the problems discussed in the literature. Maximum of 37.54% reduction in total flow distance and 9.31% reduction in total length of the flow line are achieved by the proposed method. [Revise 21 September 2017; Received 27 November 2016; Accepted on 29 December 2017]

Suggested Citation

  • Lenin Nagarajan & Siva Kumar Mahalingam & Selvakumar Gurusamy & Vignesh Kumar Dharmaraj, 2018. "Solution for bi-objective single row facility layout problem using artificial bee colony algorithm," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 12(2), pages 252-275.
    • Handle: RePEc:ids:eujine:v:12:y:2018:i:2:p:252-275
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=90619
    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.

    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:eujine:v:12:y:2018:i:2:p:252-275. 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=210 .

    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.