IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v64y2026i2p622-641.html

A hybrid niching memetic algorithm for multi-modal optimization of double row layout problem

Author

Listed:
  • Xing Wan
  • Xingquan Zuo
  • Tianbo Lu
  • Gang Chen

Abstract

Double row layout problem (DRLP) involves identifying the exact locations of machines participating in a production task on two rows. There are typically multiple layouts with approximately optimal material handling cost for a DRLP. These layouts often exhibit significantly different layout configurations. Identifying multiple global or local optimal layouts can provide layout designers with a wide range of options, which is of great significance for enhancing the maintainability, scalability, and customisability of the facility. However, most existing studies on DRLPs typically focus on designing a single optimal layout. In this paper, we study a multi-modal optimization of double row layout problem (MDRLP). A hybrid approach combing a fast niching memetic algorithm and linear programming (FNMA-LP) is proposed for MDRLP to locate multiple global or local optimal layouts with a similar quality. First, a fast niching memetic algorithm is developed to find a set of approximate optimal machine sequences. Then, LP is employed to optimise the exact locations of machines for each machine sequence. To evaluate the performance of the proposed algorithm, FNMA-LP is compared against three popular multi-modal algorithms and a state-of-the-art single-modal algorithm developed for DRLP. Experiments show that our approach outperforms competing approaches on almost all problem instances.

Suggested Citation

  • Xing Wan & Xingquan Zuo & Tianbo Lu & Gang Chen, 2026. "A hybrid niching memetic algorithm for multi-modal optimization of double row layout problem," International Journal of Production Research, Taylor & Francis Journals, vol. 64(2), pages 622-641, January.
  • Handle: RePEc:taf:tprsxx:v:64:y:2026:i:2:p:622-641
    DOI: 10.1080/00207543.2024.2410467
    as

    Download full text from publisher

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

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

    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:64:y:2026:i:2:p:622-641. 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.