scholarly journals A Simple Case of Pallet Setup Features Based Order Picking Routing Optimization

2016 ◽  
Vol 9 (3) ◽  
pp. 204 ◽  
Author(s):  
T Bódis ◽  
J Botzheim ◽  
P Földesi
Keyword(s):  
Influencing Factors ◽  
Order Picking ◽  
Physical Parameters ◽  
Decision Matrix ◽  
Process Improvements ◽  
Policy Routing ◽  
Routing Optimization ◽  
Matrix Modeling ◽  
Storage Assignment ◽  
Loading Problem

Order picking is the most labour-intensive and costly activities in many warehouses by consuming ca. 55 % of the total operating expenses. Order picking development strategies mostly concentrate on warehouse layout, storage assignment policy, routing, zoning and on batching methods. The main challenges of order picking process improvements are the synchronization of these fields and fit the system with the further influencing factors, like unique demands and product parameters. Researchers of the pallet-loading problem could provide a wider horizon on considerable parameters, but their results are rarely implemented into order picking processes. The physical parameters of the products also have a significant impact on the processes which could strongly influence the picking sequence. \\The aim of this paper is to describe our own developed methodology for modeling the pallet setup rules. We introduce our product classifying and PSF based decision matrix modeling solutions. These will be the basis of our further research on PSF based harmonized routing and SLA optimization. We examine the complexity of a simple pallet setup features based order picking routing case, where the products of the defined pallet setup classes stored in separated zones.

scholarly journals Necessity and complexity of order picking routing optimisation based on pallet loading features

2017 ◽  
Vol 9 (2) ◽  
pp. 162-194 ◽  
Author(s):  
Tamás Bódis ◽  
János Botzheim ◽  
Péter Földesi
Keyword(s):  
Best Practices ◽  
Lead Time ◽  
Bin Packing ◽  
Packing Problem ◽  
Order Picking ◽  
Policy Routing ◽  
Pallet Loading ◽  
Storage Assignment ◽  
Unique Customer ◽  
Loading Problem

AbstractOrder picking is the most labour-intensive and costly activity of warehouses. The main challenges of its improvement are the synchronisation of warehouse layout, storage assignment policy, routing, zoning, and batching. Furthermore, the competitiveness of the warehouse depends on how it adapts to the unique customer demands and product parameters and the changes. The operators usually have to manage the picking sequence based on best practices taking into consideration the product stacking factors and minimising the lead time. It is usually necessary to support the operators by making e ective decisions. Researchers of the pallet loading problem, bin packing problem, and order picking optimisation provide a wide horizon of solutions but their results are rarely synchronised.

scholarly journals Comparison of Lowest-Slot and Nearest-Stack Heuristics for Storage Assignment of Steel Bar Sets

2018 ◽  
Vol 9 (2) ◽  
pp. 37-45
Author(s):  
Jakob Marolt ◽  
Tone Lerher
Keyword(s):  
Information Infrastructure ◽  
Order Picking ◽  
Steel Plant ◽  
Steel Plates ◽  
Stored Products ◽  
Overhead Crane ◽  
Long Run ◽  
Steel Bar ◽  
Storage Assignment ◽  
Steel Coils

Abstract Our research objective is to lower intralogistics costs by minimizing the number of shuffling operations in a steel plant company commercial warehouse. The process of dispatching products consists of retrieving set of steel bar (SSB) from a floor stored stack or a special stacking frame by an overhead crane. To retrieve a targeted merchandise all SSB above targeted must be reshuffled. Proper assignment of storage locations is a key logistics problem for efficient order picking. We are comparing two heuristics, that do not require information of dispatching sequence of any stored products. We simulated the problem at hand with both methods. Our objective is to count the number of reshuffles using each heuristic on randomly generated examples and decide which is better in the long run. Our problem has similarities with storage assignment of steel plates or steel coils for minimization of reshuffling operations. The problem is also comparable to storage assignment of containers in a container yard. In our case we are dealing with a special stacking configuration of products, that demands different approach. We want to demonstrate which heuristic should be used in companies that lack necessary storage information infrastructure.

Routing Optimization of High-Level Order Picking Truck Based on Swarm Intelligent Algorithm

2011 ◽  
Vol 101-102 ◽  
pp. 414-417
Author(s):  
Yi Qiang Wang ◽  
Chao Fu ◽  
Ming Yang Ma ◽  
Lin Bin Wang
Keyword(s):  
Optimization Problem ◽  
Order Picking ◽  
Intelligent Algorithm ◽  
Swarm Optimization ◽  
Intelligent Algorithms ◽  
Operation Efficiency ◽  
Routing Optimization ◽  
High Level ◽  
The Mathematical Model ◽  
Level Order

In order to improve the operation efficiency of order picking trucks in the warehouse, the mathematical model of the routing optimization problem is established. Then PSO (Particle Swarm Optimization) and ACO (Ant Colony Optimization) are used to solve the model. Experimental results show that both of them have good overall search ability and astringency. The operation efficiency is improved to a great extent by using swarm intelligent algorithms.

Optimising the storage assignment and order-picking for the compact drive-in storage system

2019 ◽  
Vol 58 (22) ◽  
pp. 6949-6969
Author(s):  
David Revillot-Narváez ◽  
Francisco Pérez-Galarce ◽  
Eduardo Álvarez-Miranda
Keyword(s):  
Storage System ◽  
Order Picking ◽  
Storage Assignment

A RFID-based storage assignment system for enhancing the efficiency of order picking

2014 ◽  
Vol 28 (1) ◽  
pp. 111-129 ◽  
Author(s):  
K. L. Choy ◽  
G. T. S. Ho ◽  
C. K. H. Lee
Keyword(s):  
Order Picking ◽  
Storage Assignment

scholarly journals Defining a storage-assignment strategy for precedence-constrained order picking

2021 ◽  
Vol 31 (2) ◽  
Author(s):  
Maria A. M. Trindade ◽  
Paulo S. A. Sousa ◽  
Maria R. A. Moreira
Keyword(s):  
Assignment Problem ◽  
Real Life ◽  
Order Picking ◽  
Quadratic Assignment ◽  
Assignment Model ◽  
Storage Assignment ◽  
Storage Location ◽  
Assignment Strategy ◽  
Location Assignment ◽  
The Creation

This paper proposes a zero-one quadratic assignment model for dealing with the storage location assignment problem when there are weight constraints. Our analysis shows that operations can be improved using our model. When comparing the strategy currently used in a real-life company with the designed model, we found that the new placement of products allowed a reduction of up to 22% on the picking distance. This saving is higher than that achieved with the creation of density zones, a procedure commonly used to deal with weight constraints, according to the literature.

Sign in / Sign up

Export Citation Format

Share Document