Lecture 05 - Order Picking Methods
Lecture 05 - Order Picking Methods
International University
Vietnam National University HCMC
Content
• What is Picking?
• Objectives of Order Picking
• Picking methods
• Improve order picking efficiency
International University
Vietnam National University HCMC
What is Picking?
Quá trình chuyển đổi sản phẩm từ dạng được lưu giữ tại DCs - Distribution Center, sang dạng mà khách hàng
yêu cầu được gọi là lựa chọn đơn hàng.
International University
Vietnam National University HCMC
What is Picking?
Danh sách chọn hàng hiển thị các đơn đặt hàng của khách hàng và có thể ở dạng danh sách kiểm tra trên giấy,
nhãn dán trên thùng carton, màn hình máy tính hoặc hệ thống lấy hàng được kích hoạt bằng giọng nói.
International University
Vietnam National University HCMC
What is Picking?
International University
Vietnam National University HCMC
What is Picking?
International University
Vietnam National University HCMC
What is Picking?
Picking area
International University
Vietnam National University HCMC
Objectives of Order Picking
International University
Vietnam National University HCMC
Objectives of Order Picking
International University
Vietnam National University HCMC
Picking methods
International University
Vietnam National University HCMC
Paper pick lists
International University
Vietnam National University HCMC
Pick by labels
International University
Vietnam National University HCMC
Pick by voice
International University
Vietnam National University HCMC
Pick by voice
– The list of benefits of pick by voice
● increased accuracy;
● increased productivity;
● reduction in paper usage;
● reduction in errors through elimination of re-keying data;
● improved safety through hands- and eyes-free operation;
● reduction in damage;
● real-time stock updates leading to fast and accurate
replenishment;
● real-time updates regarding potential shortages;
● increased operator time on the warehouse floor;
● reduced training times;
● multilingual, accommodating a diverse workforce;
● easy to integrate with other systems;
● potential reduction in employee turnover; and
● normally a quick ROI.
International University
Vietnam National University HCMC
Pick by barcode scanning
– The list of benefits of pick by voice
● increased accuracy;
● increased productivity;
● reduction in paper usage;
● reduction in errors through elimination of re-keying data;
● improved safety through hands- and eyes-free operation;
● reduction in damage;
● real-time stock updates leading to fast and accurate
replenishment;
● real-time updates regarding potential shortages;
● increased operator time on the warehouse floor;
● reduced training times;
● multilingual, accommodating a diverse workforce;
● easy to integrate with other systems;
● potential reduction in employee turnover; and
● normally a quick ROI.
International University
Vietnam National University HCMC
Pick by radio frequency
identification
– RFID is a means of uniquely identifying an item using
radio waves.
– Data is exchanged between tags and readers and
depending on the frequency, may or may not require line
of sight.
– Common uses in today’s world include library books, toll
passes and access ID cards.
International University
Vietnam National University HCMC
Pick by light/pick to light
International University
Vietnam National University HCMC
Automated picking
• Automated storage and retrieval systems
(ASRS) bringexceptional uptime, improved
safety and multiplied productivity to
warehouses. This technology improves
material handling, order preparation and
dispatch, and can be fully tailored to unique
specifications.
International University
Vietnam National University HCMC
Improve order picking efficiency
International University
Vietnam National University HCMC
Improve order picking efficiency
International University
Vietnam National University HCMC
Improve order picking efficiency
International University
Vietnam National University HCMC
Order Picking Principles
International University
Vietnam National University HCMC
Picking Paths
• Travel time is a waste
• Reduce total travel time
• Sequence of the picks
• It matters!
• Identify the shortest
route
• Help picker visualize
International University
Vietnam National University HCMC
The basic problem: Find the shortest
path
International University
Vietnam National University HCMC
The General Problem
Lối đi chính chúng ta ám chỉ lối đi giữa mặt trước và mặt sau của kho, đi qua tất cả các dãy nhà
• main aisle we refer to an aisle between the
front and rear end of the warehouse, going
through all blocks
Lối đi phía trước và lối đi phía sau không chứa đồ nhưng có thể dùng để chuyển lối đi.
• front aisle and the rear aisle do not contain
items, but can be used for changing aisles.
Lối đi chéo có thể được sử dụng để đi từ lối đi này sang lối đi khác hoặc từ khối nhà này sang khối nhà tiếp theo.
• cross aisle can be used to go from one aisle
to the next or from one block to the next.
Người lấy hàng được giả định là có thể đi qua các lối đi theo cả hai hướng và thay đổi hướng trong các lối đi
• Order pickers are assumed to be able to
traverse the aisles in both directions and to
change direction within the aisles
• Given that the order picker has to collect a
number of products in specified quantities
at known locations, in what sequence
should the order picker visit these locations
in order to minimize the distance traveled?
International University
Vietnam National University HCMC
Bất kỳ lối đi nào chứa ít nhất một mặt hàng đều được đi qua
S-Shape Heuristic toàn bộ chiều dài. Những lối đi không cần phải nhặt gì sẽ bị bỏ
qua.
International University
Vietnam National University HCMC
Example
• Find the shortest route of the following warehouse using
the S-shape heuristic
International University
Vietnam National University HCMC
Largest Gap Heuristic
• Similar to the S-shape heuristic, the order picking route starts at the depot;
it goes to the front of the main aisle closest to the depot, that contains at
least one item; traverses this main aisle up to and including the block
farthest from the depot that contains at least one item (1).
• On traversing the cross aisle (which is actually the rear aisle in this), each
aisle is entered as far as the ‘largest gap’ and left from the same side that it
was entered (2). A gap represents the distance between any two adjacent
items, or between a cross aisle and the nearest item. Thus, the largest gap is
the part of the aisle that is not traversed.
• The last aisle of the block is traversed entirely, by which we arrive in the
next cross aisle (3). This cross aisle is traversed, while visiting the aisles of
the blocks on both sides of the cross aisle up to the largest gap. First the
aisles on one side of the cross aisle are visited (4) and thereafter the aisles
on the other side (5). One aisle is again traversed entirely to reach the next
cross aisle (6). This may be either the left or the right most aisle containing
items, depending on which of the two gives the shortest travel distance
within the cross aisle.
• This process is repeated for all blocks containing items. If a block does not
contain items, then the aisle of this block, that is closest to the current
position is traversed entirely. After considering the last block, return to the
depot (7).
Tương tự như phương pháp phỏng đoán hình chữ S, lộ trình lấy hàng bắt đầu từ kho hàng; nó đi đến phía trước lối đi chính gần kho
nhất, trong đó có ít nhất một món đồ; đi qua lối đi chính này đến và bao gồm khối xa nhất từ kho chứa ít nhất một mặt hàng (1)
International University
Vietnam National University HCMC
Example
International University
Vietnam National University HCMC
Combined Heuristic
Phương pháp phỏng đoán này tạo ra các tuyến chọn hàng ghé thăm mọi lối đi có chứa vật phẩm, đúng một lần.
Các lối đi của mỗi khối được truy cập tuần tự, từ trái sang phải hoặc từ phải sang trái.
• This heuristic creates order picking
routes that visit every aisle, that
contains items, exactly once. The
aisles of each block are visited
sequentially, either from left to right
or from right to left.
• Similar to the S-shape and largest
gap heuristics, the order picking
route starts at the depot; it goes to
the front of the main aisle closest to
the depot, that contains at least one
item; traverses this main aisle up to
and including the block farthest from
the depot that contains at least one
item.Tương tự như hình chữ S và phương pháp phỏng
đoán khoảng cách lớn nhất, tuyến lấy hàng bắt đầu
từ kho; nó đi đến phía trước lối đi chính gần kho
nhất, trong đó có ít nhất một món đồ; đi qua lối đi
chính này đến và bao gồm cả dãy nhà xa kho hàng
nhất có chứa ít nhất một mặt hàng.
Combined Heuristic
• For each block we perform a small dynamic programming
algorithm.
• Two states:
✓ the orderpicker is at the front of the block
✓ the orderpicker is at the rear of the block.
• 6 transitions:
1. go from the current aisle to the next aisle along the front of the
block and traverse this aisle entirely, ending up at the rear of
the block,
2. go from the current aisle to the next aisle along the rear of the
block and traverse this aisle entirely, ending up at the front of
the block,
3. go from the current aisle to the next along the front of the
block and do not enter this aisle at all,
4. go from the current aisle to the next along the rear of the block
and do not enter this aisle at all,
5. go from the current aisle to the next aisle along the front of the
block and traverse this aisle up to the item farthest from the
front and return to the front,
6. go from the current aisle to the next aisle along the rear of the
block and traverse this aisle up to the item farthest from the
rear and return to the rear.
International University
Vietnam National University HCMC
Combined Heuristic
• Clearly, transitions (3) and (4) are only allowed if the aisle does not
contain any items. The cost of each transition is equal to the travel
time needed for the distance in the transition.
• The following figure depicts the 6 transitions. The current aisle is
aisle j, the next aisle is aisle j+1. The rear end of aisle j is denoted
by aj and the front end by bj.
International University
Vietnam National University HCMC
Example
• Find the shortest route of the following warehouse using
the combined heuristic
International University
Vietnam National University HCMC
Aisle-by-Aisle Heuristic
• every main aisle is visited once. The
order pickers starts at the depot
and goes to the left most aisle
containing items. All items in this
main aisle are picked and a cross
aisle is chosen to proceed to the
next main aisle. Again all items in
this main aisle are picked and the
order pickers proceeds to the next
main aisle. The aisle-by-aisle
heuristic determines which cross
aisles to use to go from one aisle to
the next in such a way that the
distances traveled are minimized
mỗi lối đi chính được ghé thăm một lần. Người nhận đơn hàng bắt
đầu tại kho hàng và đi đến lối đi bên trái nhất có chứa các mặt hàng.
Tất cả các mặt hàng ở lối đi chính này đều được chọn và một lối đi
chéo được chọn để chuyển sang lối đi chính tiếp theo. Một lần nữa,
tất cả các mặt hàng ở lối đi chính này đều được chọn và người lấy
hàng sẽ tiến tới lối đi chính tiếp theo. Phương pháp phỏng đoán từng
lối đi xác định lối đi ngang nào sẽ được sử dụng để đi từ lối đi này
sang lối đi khác sao cho khoảng cách di chuyển được giảm thiểu
Optimal Algorithm
Thuật toán này được mô tả để tìm ra các tuyến lấy hàng ngắn nhất trong một nhà kho với ba khả năng thay
đổi lối đi: ở phía trước, ở phía sau và đâu đó ở giữa. Thuật toán này sử dụng quy hoạch động để giải quyết
bài toán
International University
Vietnam National University HCMC
Reference
http://www.roodbergen.com/warehouse/
https://www.erim.eur.nl/material-handling-forum/research-
education/tools/calc-order-picking-time/what-to-do/routing-
strategies/
International University
Vietnam National University HCMC