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

An improved fireworks algorithm for the constrained single-row facility layout problem

Author

Listed:
  • Silu Liu
  • Zeqiang Zhang
  • Chao Guan
  • Lixia Zhu
  • Min Zhang
  • Peng Guo

Abstract

The single-row facility layout problem (SRFLP) decides upon the arrangement of facilities in a straight row so as to minimise the material handling cost. Generally, this problem allows the placement of the facilities in any location in any order without any restriction, but some practical SRFLP cases are required to meet various types of constraints imposed on the placement of its facilities in the engineering of the placement of factory machinery and equipment. According to this new perspective, we studied the constrained SRFLP (cSRFLP) in this paper. In this problem, a few facilities need to be placed in certain positions or specified orders with or without the requirement to be located next to each other. To address this novel layout problem, related constraints are defined and classified, and novel mixed-integer programming models for the problem are formulated. Subsequently, the CPLEX software is employed to solve this problem. Then a constrained improved fireworks algorithm is presented, which is discretised to solve the considered cSRFLP. Our computational experiments demonstrate that the proposed algorithm performs better than the existing algorithms in solving the problem.

Suggested Citation

  • Silu Liu & Zeqiang Zhang & Chao Guan & Lixia Zhu & Min Zhang & Peng Guo, 2021. "An improved fireworks algorithm for the constrained single-row facility layout problem," International Journal of Production Research, Taylor & Francis Journals, vol. 59(8), pages 2309-2327, April.
    • Handle: RePEc:taf:tprsxx:v:59:y:2021:i:8:p:2309-2327
    DOI: 10.1080/00207543.2020.1730465
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2020.1730465
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2020.1730465?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.

    Citations

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


    Cited by:

    1. Gintaras Palubeckis & Armantas Ostreika & Jūratė Platužienė, 2022. "A Variable Neighborhood Search Approach for the Dynamic Single Row Facility Layout Problem," Mathematics, MDPI, vol. 10(13), pages 1-27, June.
    2. Daria Leiber & David Eickholt & Anh-Tu Vuong & Gunther Reinhart, 2022. "Simulation-based layout optimization for multi-station assembly lines," Journal of Intelligent Manufacturing, Springer, vol. 33(2), pages 537-554, February.

    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:59:y:2021:i:8:p:2309-2327. 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.