IDEAS home Printed from https://ideas.repec.org/a/spr/flsman/v36y2024i1d10.1007_s10696-023-09489-8.html
   My bibliography  Save this article

Clusters of floor locations-allocation of stores to cross-docking warehouse considering satisfaction and space using MOGWO and NSGA-II algorithms

Author

Listed:
  • Maryam Shoaee

    (Bu-Ali Sina University)

  • Parvaneh Samouei

    (Bu-Ali Sina University)

Abstract

Optimal warehouse design is the most substantial issue for many companies, because of increasing their efficiency and productivity. Nowadays, a warehouse is just undefined as a site for goods storage and delivery but is taken into account as a unit interacting with other sectors. Recently, cross-docking warehouses have been widely used since they differ from traditional warehouses in terms of good deposition volume, storage and delivery times, mitigating procurement, exploitation of resources, and accelerating service pace. This study proposes a mathematical model for transit warehouse layout and design to minimize travel distances, downsize the free space of the warehouse and make retailers satisfied. Small-sized problems are solved by the augmented epsilon-constraint and the weighted sum methods, while NSGA-II and MOGWO algorithms are proposed for large-sized problems. Comparison between algorithms indicates higher efficiency of NSGA-II rather than MOGWO algorithm to solve cross-docking warehouse design for allocating stores to floor locations.

Suggested Citation

  • Maryam Shoaee & Parvaneh Samouei, 2024. "Clusters of floor locations-allocation of stores to cross-docking warehouse considering satisfaction and space using MOGWO and NSGA-II algorithms," Flexible Services and Manufacturing Journal, Springer, vol. 36(1), pages 315-342, March.
    • Handle: RePEc:spr:flsman:v:36:y:2024:i:1:d:10.1007_s10696-023-09489-8
    DOI: 10.1007/s10696-023-09489-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10696-023-09489-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10696-023-09489-8?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.

    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:spr:flsman:v:36:y:2024:i:1:d:10.1007_s10696-023-09489-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.