Belt-conveyor based efficient parallel storage system design and travel time model analysis

Kou, Xiaofei; Xu, Gangyan; Yi, Chuanyun

doi:10.1080/00207543.2018.1436784

Cited by 7 publications

(4 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More recently, the literature on order picking considers the picker routing problem along with other tactical or operational-level problems in the warehouse. These involve incorporation of multiple order pickers with congestion (Chen et al 2013), involvement of human factors in the picking process (Grosse et al 2015), consideration of weight, fragility, and category constraints into pick sequencing (Chabot et al 2017), integration of all four basic warehouse functions (Altarazi and Ammouri 2018), joint decisions of picker routing and order batching (Matusiak et al 2014;Cheng et al 2015;Öncan 2015;Lin et al 2016;Chen, Wei, and Wang 2017;Li, Huang, and Dai 2017;Giannikas et al 2017;Valle, Beasley, and da Cunha 2017), consideration of the assignment of stock keeping units to storage locations (storage assignment) and picker routing simultaneously (Shqair, Altarazi, and Al-Shihabi 2014;Roodbergen, Vis, and Taylor 2015;Dijkstra and Roodbergen 2017;Wu et al 2017), zone assignment to multiple pickers along with their routing (Matthews and Visagie 2013;Chen et al 2016;Wu et al 2017;Kou, Xu, and Yi 2018), simultaneous batching, storage assignment, and picker routing (Chackelson et al 2013;Scholz and Wäscher 2017), and simultaneous modeling of zoning, batching, and picker routing (Henn and Schmid 2013;. For an extensive survey of order picking systems where planning problems are combined, the interested reader is referred to Gils et al (2018).…”

Section: Problem Definition and Related Literaturementioning

confidence: 99%

Order picking in parallel-aisle warehouses with multiple blocks: complexity and a graph theory-based heuristic

Çelik

Süral

2018

International Journal of Production Research

View full text Add to dashboard Cite

In this paper, we consider the order picking problem (OPP), which constitutes one of the special cases of the Steiner traveling salesperson problem and addresses the costliest operation in a warehouse. Given a list of items to be picked and their locations in the warehouse layout, the OPP aims to find the shortest route that starts from a depot point, picks all the items in the list, and returns to the depot. This paper fills two important gaps regarding the OPP. First, to the best of our knowledge, we present the first complexity results on the problem. Second, we propose a heuristic approach that makes use of its graph theoretic properties. Computational experiments on randomly generated instances show that the heuristic not only outperforms its state-of-the-art counterparts in the literature, but it is also robust in terms of changing problem parameters.

show abstract

Section: Problem Definition and Related Literaturementioning

confidence: 99%

Order picking in parallel-aisle warehouses with multiple blocks: complexity and a graph theory-based heuristic

Çelik

Süral

2018

International Journal of Production Research

View full text Add to dashboard Cite

show abstract

“…All these factors prompt enterprises to seek more compact and efficient warehousing systems. 2 The emergence of the compact warehousing system effectively solves these limitations. The system still uses a traditional automatic stacker to complete the cargo storage/retrieval task, which is used to realize the horizontal and vertical movement of the goods.…”

Section: Introductionmentioning

confidence: 99%

A scheduling optimization method for stacker path in double-ended compact storage system

Yan

Shao

et al. 2023

Advances in Mechanical Engineering

View full text Add to dashboard Cite

Given the low space usage rate of the traditional automated storage/retrieval system and the long aisle, it is easy for a stacker to take a long time to enter/leave the warehouse. Thus, a new type of double-ended compact storage system is proposed. This paper addresses the scheduling problem for the stacker to execute the single and dual commands mixed tasks in the system where the I/O ports are located at both ends of the aisle, and the power conveyor devices on the rack can meet the requirement of multi-depth storage and generate displacement. An improved shuffled frog leaping algorithm (ISFLA) is developed for the scheduling problem. In order to eliminate the disadvantages of local optimum and slow convergence in the standard shuffled frog leaping algorithm, a set of hybrid perturbation update methods are designed based on a role model learning strategy, and the feasibility of the improved algorithm is verified by a numerical simulation. The experimental results show that the solution quality and the convergence ability of the ISFLA are significantly improved, and it can effectively solve the stacker-scheduling problem in the double-ended compact storage system.

show abstract

“…Their experimental results showed that there is a sufficiently accurate practical use in the model. Kou et al [18] used a random storage strategy in a parallel storage system based on belt conveyor to construct a travel time model for automatic retrieval and automatic storage systems, and used Matlab to verify the model and optimize the automatic storage system.…”

Section: Introductionmentioning

confidence: 99%

Storage Optimization of Low-Level Manual Picking Warehouse Considering Vertical Travel

et al. 2020

IE&EM 2019

View full text Add to dashboard Cite

Order picking is considered the most critical operation in warehousing. In the low-level manual picking warehouse, in order to increase the warehouse capacity and make full use of the rack space, the overall height of the rack is increased by increasing the number of layer and reducing the height of each layer of the rack, or directly increasing the number of layers. These all lead to take more time to pick up the goods at the bottom or top of the rack. If the picking time of the vertical travel is not taken into account and the best-selling goods are placed on the bottom or top layer, the order picking efficiency will be greatly affected. Therefore, based on class-based storage strategy, we propose a picking time estimation model that considers the vertical travel. A heuristic algorithm is constructed to optimize the warehousing location and determine the optimal warehousing boundary of goods of different types on each shelf. The results show that the proposed algorithm can better optimize the storage location and reduce the picking time.

show abstract

Belt-conveyor based efficient parallel storage system design and travel time model analysis

Cited by 7 publications

References 27 publications

Order picking in parallel-aisle warehouses with multiple blocks: complexity and a graph theory-based heuristic

Order picking in parallel-aisle warehouses with multiple blocks: complexity and a graph theory-based heuristic

A scheduling optimization method for stacker path in double-ended compact storage system

Storage Optimization of Low-Level Manual Picking Warehouse Considering Vertical Travel

Contact Info

Product

Resources

About