Wave order picking under the mixed-shelves storage strategy: A solution method and advantages

Rasmi, Seyyed Amir Babak; Wang, Yuan; Charkhgard, Hadi

doi:10.1016/j.cor.2021.105556

Cited by 25 publications

(4 citation statements)

References 57 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Non-traditional layouts provide new ideas and methods for the rational design of warehouse layouts. At present, the common storage strategies are random storage, dedicated storage, volume-based storage, class-based storage and mixed-shelves storage 9 , 36 – 44 . Among them, the class-based storage strategy is the most widely used, and many scholars have performed extensive research on it 19 .…”

Section: Related Literaturementioning

confidence: 99%

“…Moreover, these two layouts are easier to apply and practice due to the complex and varied angles of shelves in the chevron layout and the leaf layout. Existing storage strategies mainly include random storage, dedicated storage, volume-based storage, class-based storage and mixed-shelves storage 9 , 36 – 44 . In the actual production practice of manual warehouses, the class-based storage strategy and random storage strategy are widely used, and are mostly for traditional layouts.…”

Section: Related Literaturementioning

confidence: 99%

See 1 more Smart Citation

Stochastic models of routing strategies under the class-based storage policy in fishbone layout warehouses

Zhou

Zhao

Liu

et al. 2022

Sci Rep

View full text Add to dashboard Cite

In order to improve the picking efficiency of warehouses, shorten the time cost and promote the development of the logistics industry, this study analyzes the routing strategies in fishbone layout warehouses under the class-based storage strategy. The fishbone layout was divided into three storage areas for class A, class B, and class C items according to the proportion using the straight line, to meet the classification requirements of items. Under the class-based storage strategy, to evaluate the performance of the return routing strategy and the S-shape routing strategy, the stochastic models of the expected walking distance of the two routing strategies in the fishbone layout warehouse are established by calculating the sum of the expected walking distances in diagonal cross-aisles and picking aisles. Finally, the stochastic models of the two routing strategies are simulated and verified, and the impacts of the two routing strategies on walking distances are analyzed by comparing the expected distances under different ordering frequencies and space allocation strategies. The numerical results show that the return routing strategy has an advantage over the S-shape routing strategy when determining the relevant parameters of the fishbone layout and picking orders. Meanwhile, it also provides a theoretical basis for research on stochastic models of routing strategies in fishbone layout warehouses under the class-based storage strategy.

show abstract

Section: Related Literaturementioning

confidence: 99%

Section: Related Literaturementioning

confidence: 99%

Stochastic models of routing strategies under the class-based storage policy in fishbone layout warehouses

Zhou

Zhao

Liu

et al. 2022

Sci Rep

View full text Add to dashboard Cite

show abstract

“…For this reason, considerable research is currently being conducted to improve the efficiency of picking operations. The main approaches to reduce walking time in picking operations include the optimization of commodity placement [3]∼ [5], order slip assignment methods [6]∼ [8], and traveling routes [9]∼ [11]. In addition, owing to the high demand and tight deadlines in the logistics industry, an increasing number of warehouses are adopting autonomous mobile robots (AMRs).…”

Section: Introductionmentioning

confidence: 99%

Traveling Route Derivation Method Allowing an Arbitrary Layout of Warehouses Using A* and Genetic Algorithms

Sugihara

Ito

Kageyama

et al. 2023

JIIAE

View full text Add to dashboard Cite

The modern distribution industry demands improved efficiency in logistics to lower prices while maintaining product quality. However, the efficiency of picking (collecting commodities in a warehouse), which accounts for a large percentage of the total logistics cost, has not improved significantly. In this study, we propose a traveling route derivation method that allows the warehouse layout to be set arbitrarily. Specifically, we combined the A* and genetic algorithms to reduce the walking distance of picking workers and improve picking efficiency in a warehouse. Furthermore, we simulated the route derivation for picking based on practical work, the walking distances were compared using a comparison method (brute-force method and without A* algorithm method), and the usefulness of the proposed method was evaluated.

show abstract

“…In scattered storage systems, products with the same stock keeping unit (SKU) are spread throughout the warehouse aiming to reduce the average distance from any place in the warehouse to the closest item of each SKU. Scattered storage systems are becoming more popular (see, for instance, [14,34,36]) as e-commerce retailer companies operating large warehouses aim to speed up operations inside their warehouses. Boysen et al [14] and Weidinger et al [44] refer to the lack of literature on solving the order picking problem under a scattered storage policy and point out some differences to other policies, such as the need to consider multiple depots (access points) and multiple storage positions for each SKU.…”

Section: Introductionmentioning

confidence: 99%

The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods

et al. 2022

View full text Add to dashboard Cite

In this article, we study the multi‐depot family traveling salesman problem (MDFTSP) and two clustered variants, the soft‐clustered MDFTSP (SC‐MDFTSP) and the hard‐clustered MDFTSP. We emphasize the relevance of this study by relating the problems with warehouse activities supported by scattered storage systems and by pointing out that clustered variants of routing problems have been scarcely addressed in the literature. For these three problems, we present several mixed integer linear programming formulations and develop appropriate branch‐&‐cut based algorithms which are tested with a newly generated data set including instances with up to 200 nodes and 40 depots. The results from the computational experiments allow us to identify the main differences between the three problems concerning modeling approaches as well as solution methods and put in evidence that these problems are challenging problems, in particular the SC‐MDFTSP.

show abstract

Wave order picking under the mixed-shelves storage strategy: A solution method and advantages

Cited by 25 publications

References 57 publications

Stochastic models of routing strategies under the class-based storage policy in fishbone layout warehouses

Stochastic models of routing strategies under the class-based storage policy in fishbone layout warehouses

Traveling Route Derivation Method Allowing an Arbitrary Layout of Warehouses Using A* and Genetic Algorithms

The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods

Contact Info

Product

Resources

About