Optimal order picker routing in the chevron warehouse DOI
Makusee Masae, C. H. Glock, Panupong Vichitkunakorn

et al.

IISE Transactions, Journal Year: 2019, Volume and Issue: 52(6), P. 665 - 687

Published: Aug. 29, 2019

Order picking has often been considered as one of the most labor- and time-intensive tasks in warehouse operations. Among various planning problems that have to be solved manual picker-to-parts systems, routing order picker usually accounts for highest share total operating cost. To minimize cost picking, researchers developed procedures guide through complete given customer orders. For some layouts such chevron warehouse, an optimal algorithm not yet proposed. This article, therefore, contributes filling this research gap by developing policy warehouse. The proposed article is based on concept graph theory utilizes a dynamic programming procedure. In addition, we propose simple heuristics computational experiments, average tour lengths resulting from are compared. Moreover, compare performance conventional two-block under conditions using obtained algorithms.

Language: Английский

Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses DOI Creative Commons
Lin Xie,

Hanyi Li,

Laurin Luttmann

et al.

European Journal of Operational Research, Journal Year: 2022, Volume and Issue: 307(2), P. 713 - 730

Published: Sept. 6, 2022

Different retail and e-commerce companies are facing the challenge of assembling large numbers time-critical picking orders that include both small-line multi-line orders. To reduce unproductive picker working time as in traditional picker-to-parts warehousing systems, different solutions proposed literature practice. For example, a mixed-shelves storage policy, items same stock keeping unit spread over several shelves warehouse; or automated guided vehicles (AGVs) used to transport picked from area packing stations instead human pickers. This is first paper combine solutions, creating what we call AGV-assisted systems. We model new integrated order batching routing problem such systems an extended multi-depot vehicle with three-index two-commodity network flow formulations. Due complexity problem, develop novel variable neighborhood search algorithm solve more efficiently. test our methods sizes instances, conclude policy suitable than usual for lines (saving up 62% on driving distances AGVs). Our provides optimal within acceptable computational time.

Language: Английский

Citations

18
Improved discrete imperialist competition algorithm for order scheduling of automated warehouses DOI

Bo Yan,

Yan Liu, Yanhong Huang

et al.

Computers & Industrial Engineering, Journal Year: 2022, Volume and Issue: 168, P. 108075 - 108075

Published: March 10, 2022

Language: Английский

Citations

18
A bi-objective multi-warehouse multi-period order picking system under uncertainty: a benders decomposition approach DOI

Fatemeh Nikkhoo,

Ali Husseinzadeh Kashan, Ehsan Nikbakhsh

et al.

Soft Computing, Journal Year: 2025, Volume and Issue: unknown

Published: Feb. 28, 2025

Language: Английский

Citations

0
A two-stage batching and clustering strategy for cloud logistics orders oriented towards mass customisation DOI
Guanxiong Wang, Ting Wang, Xiaojian Hu

et al.

International Journal of Systems Science Operations & Logistics, Journal Year: 2025, Volume and Issue: 12(1)

Published: April 23, 2025

Language: Английский

Citations

0
Optimal order picker routing in the chevron warehouse DOI
Makusee Masae, C. H. Glock, Panupong Vichitkunakorn

et al.

IISE Transactions, Journal Year: 2019, Volume and Issue: 52(6), P. 665 - 687

Published: Aug. 29, 2019

Order picking has often been considered as one of the most labor- and time-intensive tasks in warehouse operations. Among various planning problems that have to be solved manual picker-to-parts systems, routing order picker usually accounts for highest share total operating cost. To minimize cost picking, researchers developed procedures guide through complete given customer orders. For some layouts such chevron warehouse, an optimal algorithm not yet proposed. This article, therefore, contributes filling this research gap by developing policy warehouse. The proposed article is based on concept graph theory utilizes a dynamic programming procedure. In addition, we propose simple heuristics computational experiments, average tour lengths resulting from are compared. Moreover, compare performance conventional two-block under conditions using obtained algorithms.

Language: Английский

Citations

27