Research Article

Order Picking Optimization in Carousels Storage System

Algorithm 1

Improved nearest items heuristics (INIH).
(1) Initialization: Get ordinal set ; Define ordinal and general set and , respectively; set variable
;
 For to to
 Get the first element of ;
 End
(2) Compute , ;
 Get ;
;
(3) Find the ordinal set of the element ;
 If , Return step (2);
 Otherwise ;
 Get the first element of ;
(4) If , Output the ordinal set ; Otherwise, Return step (2);