2020
DOI: 10.1016/j.tre.2020.102003
|View full text |Cite
|
Sign up to set email alerts
|

Integrating storage location and order picking problems in warehouse planning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
16
0
2

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 50 publications
(23 citation statements)
references
References 51 publications
(109 reference statements)
0
16
0
2
Order By: Relevance
“…The simulation results show that this discrete modeling method can effectively evaluate the system throughput and other indicators [1]. Silva takes the storage location of goods as a constraint condition when modeling, and proposes a variable neighborhood search algorithm, which further improves the operation efficiency [2], Kaiwen Liu et al considered the problem of time cut-off when establishing the model, established a model with the minimum energy consumption as the goal, and used the gray wolf optimization algorithm to obtain the minimum energy consumption order sequence [3]. Xiangnan Zhan adopts improved particle swarm optimization algorithm to effectively reduce the delivery time of goods [4].…”
Section: Related Workmentioning
confidence: 99%
“…The simulation results show that this discrete modeling method can effectively evaluate the system throughput and other indicators [1]. Silva takes the storage location of goods as a constraint condition when modeling, and proposes a variable neighborhood search algorithm, which further improves the operation efficiency [2], Kaiwen Liu et al considered the problem of time cut-off when establishing the model, established a model with the minimum energy consumption as the goal, and used the gray wolf optimization algorithm to obtain the minimum energy consumption order sequence [3]. Xiangnan Zhan adopts improved particle swarm optimization algorithm to effectively reduce the delivery time of goods [4].…”
Section: Related Workmentioning
confidence: 99%
“…Kofler, et al studied the SLAP in a logistics center of an Austrian company in the automotive e-sector; where they employed simulated annealing to decrease picking effort [15]. Silva, et al presented a General Variable Neighborhood Search metaheuristic, which is observed to be efficient for both small and large instances in WMS [7]. Syafrudin proposed a model that utilizes IoT-based sensors, big data processing, and a hybrid prediction using Random Forest classification.…”
Section: Storage Location Assignmentmentioning
confidence: 99%
“…The objective function is a weighted average of two generic grouping scores. The storage location assignment problem has been shown to be NP-Hard [7]. Thus the objective function is formulated to solve this combinatorial optimization problem.…”
Section: Iiiiiv Data Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…The picking time of stacker takes up most of the time of goods entering and leaving the warehouse. The picking path problem of order is generally abstracted into traveling salesman problem (TSP) [29,22,10], or the capacitated vehicle routing problem (CVRP) [30,14,11,31], with capacity constraints, needs to be handled in batches. Compared with TSP, we regard it as CVRP, which is more in line with the actual picking characteristics of the warehouse.…”
mentioning
confidence: 99%