Storage Assignment Optimization in Robotic Mobile Fulfillment Systems

Algorithm 1

The heuristic algorithm of products assignment.

	Input: Historical order data
	Output: The pod-product relation matrix
(1)	#Calculate products correlation matrix
(2)	for (i = 1; ; i++) do
(3)	for (j = 1; ; j++) do
(4)	r (i, j) Calculate the correlation between products i and j
(5)	end
(6)	end
(7)	#Calculate products information matrix
(8)	for (i = 1; ; i++) do
(9)	(i, P+1) Calculate the required storage layers for product i
(10)	end
(11)	#Calculate which product to put on which pod
(12)	for (m = 1; ; m++) do
(13)
(14)	product i, j find (A = = max(max())), then update
(15)
(16)	while do
(17)	Find the most relevant product u in and update
(18)	update
(19)	if (u, P+1) = = 0 then
(20)	(u, :) 0
(21)	(:,u)
(22)	end
(23)	if sum ( (:, P+1)) = = 0 then
(24)	end calculation
(25)	end
(26)
(27)	end
(28)	end