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

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-doc...

Full description

Saved in:
Bibliographic Details
Published in:Flexible services and manufacturing journal Vol. 36; no. 1; pp. 315 - 342
Main Authors: Shoaee, Maryam, Samouei, Parvaneh
Format: Journal Article
Language:English
Published: New York Springer US 01.03.2024
Springer Nature B.V
Subjects:
ISSN:1936-6582, 1936-6590
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1936-6582
1936-6590
DOI:10.1007/s10696-023-09489-8