IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v204y2025ics1366554525004946.html

Multi-objective double-floor corridor allocation problem with floor loads and separated passages

Author

Listed:
  • Ji, Dan
  • Zhang, Zeqiang
  • Liang, Wei
  • Guo, Zihan
  • He, Zongxing

Abstract

Current research on multi-floor stereoscopic workshop layouts disregards the effects of floor load constraints and interference with the workers and logistics, which lead to low productivity and escalating transportation risks. This study examines a double-floor corridor allocation problem considering floor loads and separated worker-logistics transportation passages (DFCAP_FLSP). To this end, a mixed-integer programming model involving constraints on facility allocation, multi-type transportation distance computation, and floor loading is constructed to minimize material handling costs, employee walking distances, and floor loading gaps. Subsequently, a multi-objective self-learning memetic algorithm (MOSLMA) is developed to solve the DFCAP_FLSP efficiently. The algorithm employs linear programming to achieve two-stage decoding and utilizes Q-learning to improve local search performance. Comparison experiments conducted with the genetic algorithm, multi-objective particle swarm optimization, and non-dominated sorting genetic algorithm II for the four benchmark instances reveal that MOSLMA achieved the highest percentages of non-inferior solutions close to the Pareto solution (68.75%, 93.18%, 100%, and 87.5%), highlighting its advantages. Finally, the proposed layout and algorithm are applied to the reducer manufacturing workshop, and the scheme comparison indicates the superiority of the proposed layout structure in safety and cost-effectiveness.

Suggested Citation

  • Ji, Dan & Zhang, Zeqiang & Liang, Wei & Guo, Zihan & He, Zongxing, 2025. "Multi-objective double-floor corridor allocation problem with floor loads and separated passages," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 204(C).
  • Handle: RePEc:eee:transe:v:204:y:2025:i:c:s1366554525004946
    DOI: 10.1016/j.tre.2025.104453
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554525004946
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tre.2025.104453?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

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:eee:transe:v:204:y:2025:i:c:s1366554525004946. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    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.