# Convergence in Bucket Brigades in a Tree-Shaped Picking System

Authors: Xiangbin Xu; Caige Xu; Feng Shi
Journal: Discrete Dynamics in Nature and Society
 (2014)

---

## Abstract

Previous works on the dynamics of bucket brigades have mainly focused on linear production systems or tree-shaped assembly systems with insignificant walk-back time, but this assumption is invalid for most city picking systems. We propose a two-truck bucket brigade tree-shaped picking system when truck walk-back time is significant and analyze the dynamics of the system in each region of the parameter space, showing that relatively complex picking systems can enjoy the benefit of self-balance with minimal managerial intervention and provide insights and operating principles for the implementation and management of the bucket brigade picking system.


---

## Body

## 1. Introduction

The term “bucket brigade” was coined by Bartholdi III and Eisenstein [1] for the TSS line [2]. They provided the first comprehensive analysis of the dynamics of such systems and pointed out that if workers can be sequenced from the slowest to the fastest along the production line, then there is a stable fixed point at which the system will converge, independent of the initial positions of the workers. Furthermore, bucket brigade systems yield optimal throughput. Since then, the bucket brigade has been intensively studied with the consideration of stochastic processing time [3], high labor turnover [4], significant walk-back time [5], undominated workers’ speeds [6], workers’ learning ability [7], and so forth. As a highly effective and self-balanced system, the bucket brigade has also been widely used in many real-life systems such as production lines and order picking systems in distribution centers [1, 4, 8–10].So far, researches on bucket brigade systems have mainly focused on continuously linear or U-shaped [11] production or picking lines. Only Lim [12] and Bartholdi III et al. [13] introduced the bucket brigade to complex assembly lines, describing the assembly of products with two subcomponents as a tree-shaped assembly line, but their models did not take the worker’s walk-back time into consideration because it can be neglected since workers assemble products in just one location, which may make sense when they assemble products on the same factory floor. There are, however, several real-life systems in which worker’s walk-back time should not be neglected, and the city picking system is a typical example. Therefore, walk-back time might be significant when we introduce the bucket brigade into the city picking system because of the long distance of the picking route.In this paper, we propose a bucket brigade tree-shaped city picking system in which only two trucks pick items in tree-shaped picking routes; trucks walk back, not instantaneously but at a constant velocity. We analyze the dynamics of such a system and find that self-organization can be realized in different situations. To the best of our knowledge, this represents the first analysis of bucket brigades in such an environment. Although the model we present in this paper is simple, our results offer a basis for studying complex systems with more trucks and complicated picking routes, even networks. Given the widespread presence of assembly and logistics networks, our work offers a very constructive guide for implementing tree-shaped, even network-based, bucket brigade systems. The paper is organized as follows. In Section2, we propose a two-truck bucket brigade tree-shaped picking system. In Section 3, we analyze the convergence of the system. In Section 4, we present the system’s convergence and stability simulations. Section 5 concludes.


## 2. Model

Because of the complexity of the analysis, we consider a simple two-truck bucket brigade tree-shaped picking system, and the tree is a simple “Y” shape as shown in Figure1(a). The tree consists of only three arcs, each of which corresponds to a subpicking route. Subpicking routes L
→
D and R
→
D are initiated at nodes L and R, respectively, and are joined at node D to the depot E by the subpicking route D
→
E. The items to be picked are uniformly distributed over subpicking routes L
→
D, R
→
D, and D
→
E, respectively; all items must be picked and sent to depot E by two trucks. Each new picking task starts at the initial node (L or R) and is completed at node E. Under the operation of a two-truck bucket brigade, both trucks are sequenced from slower to faster at the same initial node (L or R) and start their picking task at their own working velocity along the subpicking route according to the bucket brigade rules. For simplicity, we denote the subpicking route by the start node; that is, L, R, and D represent subpicking routes L
→
D, R
→
D, and D
→
E, respectively.A two-truck bucket brigade tree-shaped picking system.
(a)
Structure of picking system
(b)
Picking system embedded in an equilateral triangle


### 2.1. Assumption

Assumption 1.
The picking task at each subpicking route is deterministic and is spread continuously and uniformly over the corresponding subpicking route.
Thus, the picking task on subpicking routesL, R, and D can be represented by their length l, r, and d, respectively. To simplify our analysis, we assume that the entire structure of the picking routes is embedded in an equilateral triangle ABC as described in Figure 1(b). Subpicking routes L, R, and D are perpendicular to the edges AB, AC, and BC, respectively. It can be shown easily that the sum of the lengths l, r, and d is a constant for the position of node D arbitrarily located within the triangle. For simplicity, we normalize the total picking task on the system to one, so that l
+
r
+
d
=
1.Assumption 2.
Each trucki
=
1,2 is characterized by a work velocity v
i and both trucks walk back with the same velocity v
r; v
1, v
2, and v
r are fixed and constant over all subpicking routes and satisfy v
1
<
v
2
<
v
r.Assumption 3.
Trucks must travel along the picking routes and they are not allowed to pass each other.Assumption 4.
The trucks’ unproductive walk-back time cannot be neglected.Assumption 5.
The handover time is negligible compared with the picking time.


### 2.2. Rules

Let both trucks be numbered from slower to faster 1 and 2. Truck 1 is the predecessor of truck 2, and truck 2 is the successor of truck 1. Since the picking routes in our model are tree-shaped, the events in our model are a little different from previous linear bucket brigade models. In order to adapt the tree-shaped picking system to a linear bucket brigade system, we need to serialize the tree-shaped picking routes into a sequence of subpicking routes. According to Lim [12], the tree-shaped picking routes in our model are serialized in two ways: L
→
R
→
D or R
→
L
→
D. After serialization, both trucks work in bucket brigade way according to the following rules.Forward. Pick your item moving from one subpicking route to the next according to the serialized ordering. If you are the last truck and complete a picking task or if your picked items are taken over by your successor, then goBack.Back. If you are the first truck, then return to the first subpicking route according to the serialized ordering and start a new picking task and goForward; otherwise, walk back to your predecessor, take over its picked items, and goForward.


## 2.1. Assumption

Assumption 1.
The picking task at each subpicking route is deterministic and is spread continuously and uniformly over the corresponding subpicking route.
Thus, the picking task on subpicking routesL, R, and D can be represented by their length l, r, and d, respectively. To simplify our analysis, we assume that the entire structure of the picking routes is embedded in an equilateral triangle ABC as described in Figure 1(b). Subpicking routes L, R, and D are perpendicular to the edges AB, AC, and BC, respectively. It can be shown easily that the sum of the lengths l, r, and d is a constant for the position of node D arbitrarily located within the triangle. For simplicity, we normalize the total picking task on the system to one, so that l
+
r
+
d
=
1.Assumption 2.
Each trucki
=
1,2 is characterized by a work velocity v
i and both trucks walk back with the same velocity v
r; v
1, v
2, and v
r are fixed and constant over all subpicking routes and satisfy v
1
<
v
2
<
v
r.Assumption 3.
Trucks must travel along the picking routes and they are not allowed to pass each other.Assumption 4.
The trucks’ unproductive walk-back time cannot be neglected.Assumption 5.
The handover time is negligible compared with the picking time.


## 2.2. Rules

Let both trucks be numbered from slower to faster 1 and 2. Truck 1 is the predecessor of truck 2, and truck 2 is the successor of truck 1. Since the picking routes in our model are tree-shaped, the events in our model are a little different from previous linear bucket brigade models. In order to adapt the tree-shaped picking system to a linear bucket brigade system, we need to serialize the tree-shaped picking routes into a sequence of subpicking routes. According to Lim [12], the tree-shaped picking routes in our model are serialized in two ways: L
→
R
→
D or R
→
L
→
D. After serialization, both trucks work in bucket brigade way according to the following rules.Forward. Pick your item moving from one subpicking route to the next according to the serialized ordering. If you are the last truck and complete a picking task or if your picked items are taken over by your successor, then goBack.Back. If you are the first truck, then return to the first subpicking route according to the serialized ordering and start a new picking task and goForward; otherwise, walk back to your predecessor, take over its picked items, and goForward.


## 3. Convergence Analysis

Just like Lim [12], here, we also consider the case in which node D is in the left part of the triangle shown in Figure 1(b); that is, l
≤
r. The analysis for the case l
>
r is similar. We define the parameter:
(1)
s
≡
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
2
+
2
/
v
r
to present the relative working time of the trucks, 0
<
s
<
1
/
2. The tree-shaped picking system can be serialized into different sequences depending on the values of s, l, and r. Define the following four disjoint regions.Region 1.
s
<
l.Region 2.
l
<
s
<
r.Region 3.
r
<
s
<
l
+
r.Region 4.
s
>
l
+
r.According to Lim [12], each region has different ways of serializing the picking routes to make the two-truck bucket brigade tree-shaped picking system balance.Letx
k represent the position of the kth hand-off on the tree-shaped picking system in Figure 1(b); when x
k
∈
[
0
,
l
], x
k
∈
[
l
,
l
+
r
], and x
k
∈
[
l
+
r
,
1
], the hand-off position is located on routes L, R, and D, respectively. At each iteration k, truck 1 hands items collected in k period to truck 2 at position x
k; then truck 1 returns to the first subpicking route (according to the sequenced picking route) with velocity v
r to begin its k
+
1 period picking task, while truck 2 continues collecting items on its k period picking task. When truck 2 completes its k period picking task, it goes back with velocity v
r to receive items collected in k
+
1 period from truck 1 at x
k
+
1. Different from Lim [12], the trucks’ walk-back time is not insignificant and the synchronization between truck 1 and truck 2 in subpicking routes is not a must here.


### 3.1. Region1 (s
<
l)

In Region1, there are two different ways to serialize the tree-shaped picking system to make the two-truck bucket brigade picking system balance. Lemma 6 shows the existence and uniqueness of a fixed point on the tree-shaped picking system under sequence L
→
R
→
D.Lemma 6.
If the tree-shaped picking system is sequenced asL
→
R
→
D in Region 1, then there exists a unique fixed point on route L and it is given by
(2)
x
L
*
=
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
2
+
2
/
v
r
.Proof.
If the order of picking routes is sequenced asL
→
R
→
D, the fixed point x
L
* can be found by solving
(3)
x
L
*
v
r
+
x
L
*
v
1
=
1
-
x
L
*
v
2
+
1
-
x
L
*
v
r
,
x
L
*
=
s
<
l, so the fixed point is located on route L.Lemma 7.
If the tree-shaped picking system is sequenced asL
→
R
→
D in Region 1 and
(4)
x
0
∈
[
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
)
,
l
]
,
then
(5)
x
k
∈
[
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
)
,
l
]
,
hhhhhhhhhhhhhh
f
o
r
k
=
1,2
,
3
…
.Proof.
We first prove that if(6)
x
k
-
1
∈
[
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
)
,
l
]
,
then
(7)
x
k
∈
[
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
)
,
l
]
.
If the order of picking routes is sequenced as L
→
R
→
D, we have
(8)
x
k
-
1
v
r
+
x
k
v
1
=
1
-
x
k
-
1
v
2
+
1
-
x
k
v
r
,
(9)
x
k
=
(
1
-
x
k
-
1
)
(
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
r
)
.
Case  1. If
(10)
1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
≥
0
,
x
k
-
1
∈
[
1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
,
l
]
means
(11)
x
k
≤
[
1
-
(
1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
)
]
(
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
r
)
=
l
,
x
k
≥
(
1
-
l
)
(
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
r
)
>
1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
.
The last inequality is because s
<
l. Thus,
(12)
x
k
∈
[
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
)
,
l
]
.
Case  2. If
(13)
1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
<
0
⟹
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
r
<
l
,
x
k
-
1
∈
[
0
,
l
]
means
(14)
x
k
≤
(
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
r
)
<
l
,
x
k
≥
(
1
-
l
)
(
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
r
)
>
0
.
Thus, x
k
∈
[
0
,
l
]. Since k is arbitrary, we conclude that if
(15)
x
0
∈
[
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
)
,
l
]
,
then
(16)
x
k
∈
[
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
)
,
l
]
,
hhhhhhhhhhhhhh
for
k
=
1,2
,
3
,
…
.Lemma7 means that if
(17)
x
0
∈
[
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
)
,
l
]
,
the two trucks’ hand-off locations x
k are always on route L.Lemma 8.
If the tree-shaped picking system is sequenced asL
→
R
→
D in Region 1 and
(18)
x
0
∈
[
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
)
,
l
]
,
then the two-truck bucket brigade picking system converges to the fixed point x
L
*.Proof.
According to Lemma7, if
(19)
x
0
∈
[
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
)
,
l
]
,
then the hand-off location x
k is always on route L. Let x
k
=
x
L
*
+
δ
k. Since
(20)
x
k
-
1
v
r
+
x
k
v
1
=
1
-
x
k
-
1
v
2
+
1
-
x
k
v
r
,
x
L
*
+
δ
k
-
1
v
r
+
x
L
*
+
δ
k
v
1
=
1
-
(
x
L
*
+
δ
k
-
1
)
v
2
+
1
-
(
x
L
*
+
δ
k
)
v
r
,
δ
k
=
-
δ
k
-
1
(
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
r
)
,
δ
k
=
(
-
1
)
k
(
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
r
)
k
δ
0
.
Since v
1
<
v
2, as k
→
∞, |
δ
k
|
→
0 and x
k
→
x
L
*.Lemma 9.
If the tree-shaped picking system is sequenced asR
→
L
→
D in Region 1, then there exists a unique fixed point on route R and it is given by
(21)
x
R
*
=
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
2
+
2
/
v
r
+
l
.Proof.
If the order of picking routes is sequenced asR
→
L
→
D, the fixed point x
R
* can be found by solving
(22)
x
R
*
-
l
v
1
+
x
R
*
-
l
v
r
=
1
-
(
x
R
*
-
l
)
v
2
+
1
-
(
x
R
*
-
l
)
v
r
,
x
R
*
=
s
+
l, l
<
x
R
*
<
l
+
r, so the fixed point is located on route R.Lemma 10.
If the tree-shaped picking system is sequenced asR
→
L
→
D in Region 1 and
(23)
x
0
∈
[
l
+
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
r
)
,
l
+
r
]
,
then
(24)
x
k
∈
[
l
+
max
⁡
⁡
(
0,1
-
1
v
1
+
1
v
r
1
v
2
+
1
v
r
r
)
,
l
+
r
]
,
hhhhhhhhhhhhhhhhhhh
f
o
r
k
=
1,2
,
3
,
…
.Proof.
The proof is the same as that in Lemma7 except for the initial position
(25)
x
0
∈
[
l
+
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
r
)
,
l
+
r
]
.Lemma10 shows that if
(26)
x
0
∈
[
l
+
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
r
)
,
l
+
r
]
,
the two trucks’ hand-off locations x
k are always on route R.Lemma 11.
If the tree-shaped picking system is sequenced asR
→
L
→
D in Region 1 and
(27)
x
0
∈
[
l
+
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
r
)
,
l
+
r
]
,
then the two-truck bucket brigade picking system converges to the fixed point x
R
*.Proof.
The proof is the same as that in Lemma8 except for the initial position
(28)
x
0
∈
[
l
+
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
r
)
,
l
+
r
]
.


### 3.2. Region2 (l
<
s
<
r)

Ifl
<
s
<
r, the fixed point x
L
* on route L no longer exists; there is only one way to order the picking routes to achieve balance: R
→
L
→
D.Lemma 12.
If the tree-shaped picking system is sequenced asR
→
L
→
D in Region 2, then the bucket brigade converges to a unique fixed point given by
(29)
x
R
*
=
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
2
+
2
/
v
r
+
l
.Proof.
The proof is the same as that in Lemmas9 and 11.


### 3.3. Region3 (r
<
s
<
l
+
r)

In regions, there is no ordering of picking routes in which the two-truck bucket brigade converges to a fixed point. But a period-2 orbit can be found if the orderL
→
R
→
D (R
→
L
→
D) is assigned to a period begun from node L(R); then we can get a period-2 orbit on the tree-shaped picking system.When the picking system runs on period-2 orbit, the hand-offs occur periodically at two fixed positionsp
L and p
R on route L and route R, respectively. Figure 2 shows these hand-off positions. In Figure 2, the solid line represents the picking route of truck 1, the dashed line represents the picking route of truck 2, and the number beside the line represents both trucks’ walking sequence when they work as a bucket brigade. In Figure 2(a), the kth picking task is begun from node L and the picking system is sequenced as L
→
R
→
D, truck 2 first completes the picking task on route L and continues on route R for k period picking task. The kth hand-off occurs when truck 2 receives items collected in k period from truck 1 at node p
R. After finishing k period picking task, truck 1 goes back to node R to begin its k
+
1 period picking, while truck 2 continues its k period picking task. When truck 2 finishes the picking task on route R for k period, it goes to route D. Meanwhile, truck 1 is on k
+
1 period picking task on route R. Following the new order R
→
L
→
D shown in Figure 2(b), truck 1 finishes the picking task on route R and then goes to route L to work on its k
+
1 period picking task before truck 2 completes k period picking task.Period-2 orbit of the tree-shaped picking system.
(a)
Picking task is begun from nodeL
(b)
Picking task is begun from nodeRThe (k
+
1)th hand-off occurs when truck 2 receives items collected in k
+
1 period from truck 1 at p
L. After the hand-off, truck 1 goes back to node L to initiate k
+
2 period picking task, while truck 2 continues its k
+
1 period picking task. Following the order L
→
R
→
D again, truck 1 will finish the picking task on route L and go to route R for k
+
2 period picking task before truck 2 finishes its k
+
1 period picking task. The (k
+
2)th hand-off will be at p
R again. So, the hand-offs of the two-truck picking system are repeatedly at two alternate locations p
L and p
R.Lemma 13.
If the order of the tree-shaped picking system (L
→
R
→
D or R
→
L
→
D) is assigned to a period picking task begun from node L(R) in Region 3, then there exists a unique period-2 orbit p
L and p
R, where p
L and p
R are on route L and route R, respectively, and they are given by
(30)
p
R
*
=
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
2
+
2
/
v
r
,
p
L
*
=
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
2
+
2
/
v
r
-
r
.Proof.
If the hand-offs occur periodically atp
L and p
R as shown in Figure 2, p
L and p
R can be found by solving
(31)
p
R
*
-
l
v
r
+
r
v
1
+
l
v
r
+
p
L
*
v
1
=
1
-
p
R
*
v
2
+
1
-
(
p
L
*
+
r
)
v
r
,
p
R
*
v
1
+
r
v
r
+
p
L
*
v
r
=
1
-
p
R
*
v
r
+
1
-
(
p
L
*
+
r
)
v
2
.
Furthermore, p
L
*
=
s
-
r, p
R
*
=
s, and r
<
s
<
l
+
r means that 0
<
p
L
*
<
l and r
<
p
R
*
<
l
+
r. Thus, p
L
* is on route L and p
R
* is on route R.


### 3.4. Region4 (s
>
l
+
r)

Whens
>
l
+
r in Region 4, there are two ways to order the picking routes: L
→
R
→
D and R
→
L
→
D; both sequences of tree-shaped picking system can lead to a fixed point on route D.Lemma 14.
If the tree-shaped picking system is sequenced asL
→
R
→
D or R
→
L
→
D in Region 4, then there exists a unique fixed point on route D and it is given by
(32)
x
D
*
=
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
2
+
2
/
v
r
.Proof.
If the tree-shaped picking system is sequenced asL
→
R
→
D or R
→
L
→
D, the fixed point x
D
* can be found by solving
(33)
x
D
*
v
1
+
x
D
*
v
r
=
1
-
x
D
*
v
2
+
1
-
x
D
*
v
r
,
x
D
*
=
s
>
l
+
r, so the fixed point is located on route D.Lemma 15.
If the tree-shaped picking system is sequenced asL
→
R
→
D or R
→
L
→
D in Region 4 and
(34)
x
0
∈
[
l
+
r
,
1
-
(
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
)
(
l
+
r
)
]
,
then
(35)
x
k
∈
[
l
+
r
,
1
-
(
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
)
(
l
+
r
)
]
,
f
o
r
k
=
1,2
,
3
,
…
.Proof.
The proof is the same as that in Lemma7, except for the initial position
(36)
x
0
∈
[
l
+
r
,
1
-
(
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
)
(
l
+
r
)
]
.Lemma15 shows that if
(37)
x
0
∈
[
l
+
r
,
1
-
(
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
)
(
l
+
r
)
]
,
then the hand-off locations x
k are always on route D.Lemma 16.
If the tree-shaped picking system is sequenced asL
→
R
→
D or R
→
L
→
D in Region 4 and
(38)
x
0
∈
[
l
+
r
,
1
-
(
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
)
(
l
+
r
)
]
,
then the two-truck bucket brigade picking system converges to the fixed point x
D
*.Proof.
The proof is the same as that in Lemma8 except for the initial position
(39)
x
0
∈
[
l
+
r
,
1
-
(
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
)
(
l
+
r
)
]
.


### 3.5. Summary

If the working and walk-back velocities of two trucks are given, the convergence analysis described in Sections3.1 to 3.4 tells us when the two-truck bucket brigade tree-shaped picking system balances: Region 1 has two fixed points: one is on route L and the other is on route R. Region 2 has two separate areas; the area on the left has a fixed point on route R when l
≤
r and the right area has a fixed point on route L when l
>
r. Region 3 has a period-2 orbit and the hand-offs occur on route L and route R alternately and periodically; Region 4 only has one fixed point on route D. Because of the symmetry of the Y-shaped picking system, the case l
>
r can also be found in Figure 1(b).


## 3.1. Region1 (s
<
l)

In Region1, there are two different ways to serialize the tree-shaped picking system to make the two-truck bucket brigade picking system balance. Lemma 6 shows the existence and uniqueness of a fixed point on the tree-shaped picking system under sequence L
→
R
→
D.Lemma 6.
If the tree-shaped picking system is sequenced asL
→
R
→
D in Region 1, then there exists a unique fixed point on route L and it is given by
(2)
x
L
*
=
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
2
+
2
/
v
r
.Proof.
If the order of picking routes is sequenced asL
→
R
→
D, the fixed point x
L
* can be found by solving
(3)
x
L
*
v
r
+
x
L
*
v
1
=
1
-
x
L
*
v
2
+
1
-
x
L
*
v
r
,
x
L
*
=
s
<
l, so the fixed point is located on route L.Lemma 7.
If the tree-shaped picking system is sequenced asL
→
R
→
D in Region 1 and
(4)
x
0
∈
[
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
)
,
l
]
,
then
(5)
x
k
∈
[
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
)
,
l
]
,
hhhhhhhhhhhhhh
f
o
r
k
=
1,2
,
3
…
.Proof.
We first prove that if(6)
x
k
-
1
∈
[
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
)
,
l
]
,
then
(7)
x
k
∈
[
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
)
,
l
]
.
If the order of picking routes is sequenced as L
→
R
→
D, we have
(8)
x
k
-
1
v
r
+
x
k
v
1
=
1
-
x
k
-
1
v
2
+
1
-
x
k
v
r
,
(9)
x
k
=
(
1
-
x
k
-
1
)
(
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
r
)
.
Case  1. If
(10)
1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
≥
0
,
x
k
-
1
∈
[
1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
,
l
]
means
(11)
x
k
≤
[
1
-
(
1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
)
]
(
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
r
)
=
l
,
x
k
≥
(
1
-
l
)
(
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
r
)
>
1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
.
The last inequality is because s
<
l. Thus,
(12)
x
k
∈
[
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
)
,
l
]
.
Case  2. If
(13)
1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
<
0
⟹
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
r
<
l
,
x
k
-
1
∈
[
0
,
l
]
means
(14)
x
k
≤
(
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
r
)
<
l
,
x
k
≥
(
1
-
l
)
(
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
r
)
>
0
.
Thus, x
k
∈
[
0
,
l
]. Since k is arbitrary, we conclude that if
(15)
x
0
∈
[
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
)
,
l
]
,
then
(16)
x
k
∈
[
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
)
,
l
]
,
hhhhhhhhhhhhhh
for
k
=
1,2
,
3
,
…
.Lemma7 means that if
(17)
x
0
∈
[
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
)
,
l
]
,
the two trucks’ hand-off locations x
k are always on route L.Lemma 8.
If the tree-shaped picking system is sequenced asL
→
R
→
D in Region 1 and
(18)
x
0
∈
[
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
)
,
l
]
,
then the two-truck bucket brigade picking system converges to the fixed point x
L
*.Proof.
According to Lemma7, if
(19)
x
0
∈
[
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
l
)
,
l
]
,
then the hand-off location x
k is always on route L. Let x
k
=
x
L
*
+
δ
k. Since
(20)
x
k
-
1
v
r
+
x
k
v
1
=
1
-
x
k
-
1
v
2
+
1
-
x
k
v
r
,
x
L
*
+
δ
k
-
1
v
r
+
x
L
*
+
δ
k
v
1
=
1
-
(
x
L
*
+
δ
k
-
1
)
v
2
+
1
-
(
x
L
*
+
δ
k
)
v
r
,
δ
k
=
-
δ
k
-
1
(
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
r
)
,
δ
k
=
(
-
1
)
k
(
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
r
)
k
δ
0
.
Since v
1
<
v
2, as k
→
∞, |
δ
k
|
→
0 and x
k
→
x
L
*.Lemma 9.
If the tree-shaped picking system is sequenced asR
→
L
→
D in Region 1, then there exists a unique fixed point on route R and it is given by
(21)
x
R
*
=
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
2
+
2
/
v
r
+
l
.Proof.
If the order of picking routes is sequenced asR
→
L
→
D, the fixed point x
R
* can be found by solving
(22)
x
R
*
-
l
v
1
+
x
R
*
-
l
v
r
=
1
-
(
x
R
*
-
l
)
v
2
+
1
-
(
x
R
*
-
l
)
v
r
,
x
R
*
=
s
+
l, l
<
x
R
*
<
l
+
r, so the fixed point is located on route R.Lemma 10.
If the tree-shaped picking system is sequenced asR
→
L
→
D in Region 1 and
(23)
x
0
∈
[
l
+
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
r
)
,
l
+
r
]
,
then
(24)
x
k
∈
[
l
+
max
⁡
⁡
(
0,1
-
1
v
1
+
1
v
r
1
v
2
+
1
v
r
r
)
,
l
+
r
]
,
hhhhhhhhhhhhhhhhhhh
f
o
r
k
=
1,2
,
3
,
…
.Proof.
The proof is the same as that in Lemma7 except for the initial position
(25)
x
0
∈
[
l
+
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
r
)
,
l
+
r
]
.Lemma10 shows that if
(26)
x
0
∈
[
l
+
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
r
)
,
l
+
r
]
,
the two trucks’ hand-off locations x
k are always on route R.Lemma 11.
If the tree-shaped picking system is sequenced asR
→
L
→
D in Region 1 and
(27)
x
0
∈
[
l
+
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
r
)
,
l
+
r
]
,
then the two-truck bucket brigade picking system converges to the fixed point x
R
*.Proof.
The proof is the same as that in Lemma8 except for the initial position
(28)
x
0
∈
[
l
+
max
⁡
⁡
(
0,1
-
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
r
)
,
l
+
r
]
.


## 3.2. Region2 (l
<
s
<
r)

Ifl
<
s
<
r, the fixed point x
L
* on route L no longer exists; there is only one way to order the picking routes to achieve balance: R
→
L
→
D.Lemma 12.
If the tree-shaped picking system is sequenced asR
→
L
→
D in Region 2, then the bucket brigade converges to a unique fixed point given by
(29)
x
R
*
=
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
2
+
2
/
v
r
+
l
.Proof.
The proof is the same as that in Lemmas9 and 11.


## 3.3. Region3 (r
<
s
<
l
+
r)

In regions, there is no ordering of picking routes in which the two-truck bucket brigade converges to a fixed point. But a period-2 orbit can be found if the orderL
→
R
→
D (R
→
L
→
D) is assigned to a period begun from node L(R); then we can get a period-2 orbit on the tree-shaped picking system.When the picking system runs on period-2 orbit, the hand-offs occur periodically at two fixed positionsp
L and p
R on route L and route R, respectively. Figure 2 shows these hand-off positions. In Figure 2, the solid line represents the picking route of truck 1, the dashed line represents the picking route of truck 2, and the number beside the line represents both trucks’ walking sequence when they work as a bucket brigade. In Figure 2(a), the kth picking task is begun from node L and the picking system is sequenced as L
→
R
→
D, truck 2 first completes the picking task on route L and continues on route R for k period picking task. The kth hand-off occurs when truck 2 receives items collected in k period from truck 1 at node p
R. After finishing k period picking task, truck 1 goes back to node R to begin its k
+
1 period picking, while truck 2 continues its k period picking task. When truck 2 finishes the picking task on route R for k period, it goes to route D. Meanwhile, truck 1 is on k
+
1 period picking task on route R. Following the new order R
→
L
→
D shown in Figure 2(b), truck 1 finishes the picking task on route R and then goes to route L to work on its k
+
1 period picking task before truck 2 completes k period picking task.Period-2 orbit of the tree-shaped picking system.
(a)
Picking task is begun from nodeL
(b)
Picking task is begun from nodeRThe (k
+
1)th hand-off occurs when truck 2 receives items collected in k
+
1 period from truck 1 at p
L. After the hand-off, truck 1 goes back to node L to initiate k
+
2 period picking task, while truck 2 continues its k
+
1 period picking task. Following the order L
→
R
→
D again, truck 1 will finish the picking task on route L and go to route R for k
+
2 period picking task before truck 2 finishes its k
+
1 period picking task. The (k
+
2)th hand-off will be at p
R again. So, the hand-offs of the two-truck picking system are repeatedly at two alternate locations p
L and p
R.Lemma 13.
If the order of the tree-shaped picking system (L
→
R
→
D or R
→
L
→
D) is assigned to a period picking task begun from node L(R) in Region 3, then there exists a unique period-2 orbit p
L and p
R, where p
L and p
R are on route L and route R, respectively, and they are given by
(30)
p
R
*
=
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
2
+
2
/
v
r
,
p
L
*
=
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
2
+
2
/
v
r
-
r
.Proof.
If the hand-offs occur periodically atp
L and p
R as shown in Figure 2, p
L and p
R can be found by solving
(31)
p
R
*
-
l
v
r
+
r
v
1
+
l
v
r
+
p
L
*
v
1
=
1
-
p
R
*
v
2
+
1
-
(
p
L
*
+
r
)
v
r
,
p
R
*
v
1
+
r
v
r
+
p
L
*
v
r
=
1
-
p
R
*
v
r
+
1
-
(
p
L
*
+
r
)
v
2
.
Furthermore, p
L
*
=
s
-
r, p
R
*
=
s, and r
<
s
<
l
+
r means that 0
<
p
L
*
<
l and r
<
p
R
*
<
l
+
r. Thus, p
L
* is on route L and p
R
* is on route R.


## 3.4. Region4 (s
>
l
+
r)

Whens
>
l
+
r in Region 4, there are two ways to order the picking routes: L
→
R
→
D and R
→
L
→
D; both sequences of tree-shaped picking system can lead to a fixed point on route D.Lemma 14.
If the tree-shaped picking system is sequenced asL
→
R
→
D or R
→
L
→
D in Region 4, then there exists a unique fixed point on route D and it is given by
(32)
x
D
*
=
1
/
v
2
+
1
/
v
r
1
/
v
1
+
1
/
v
2
+
2
/
v
r
.Proof.
If the tree-shaped picking system is sequenced asL
→
R
→
D or R
→
L
→
D, the fixed point x
D
* can be found by solving
(33)
x
D
*
v
1
+
x
D
*
v
r
=
1
-
x
D
*
v
2
+
1
-
x
D
*
v
r
,
x
D
*
=
s
>
l
+
r, so the fixed point is located on route D.Lemma 15.
If the tree-shaped picking system is sequenced asL
→
R
→
D or R
→
L
→
D in Region 4 and
(34)
x
0
∈
[
l
+
r
,
1
-
(
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
)
(
l
+
r
)
]
,
then
(35)
x
k
∈
[
l
+
r
,
1
-
(
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
)
(
l
+
r
)
]
,
f
o
r
k
=
1,2
,
3
,
…
.Proof.
The proof is the same as that in Lemma7, except for the initial position
(36)
x
0
∈
[
l
+
r
,
1
-
(
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
)
(
l
+
r
)
]
.Lemma15 shows that if
(37)
x
0
∈
[
l
+
r
,
1
-
(
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
)
(
l
+
r
)
]
,
then the hand-off locations x
k are always on route D.Lemma 16.
If the tree-shaped picking system is sequenced asL
→
R
→
D or R
→
L
→
D in Region 4 and
(38)
x
0
∈
[
l
+
r
,
1
-
(
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
)
(
l
+
r
)
]
,
then the two-truck bucket brigade picking system converges to the fixed point x
D
*.Proof.
The proof is the same as that in Lemma8 except for the initial position
(39)
x
0
∈
[
l
+
r
,
1
-
(
1
/
v
1
+
1
/
v
r
1
/
v
2
+
1
/
v
r
)
(
l
+
r
)
]
.


## 3.5. Summary

If the working and walk-back velocities of two trucks are given, the convergence analysis described in Sections3.1 to 3.4 tells us when the two-truck bucket brigade tree-shaped picking system balances: Region 1 has two fixed points: one is on route L and the other is on route R. Region 2 has two separate areas; the area on the left has a fixed point on route R when l
≤
r and the right area has a fixed point on route L when l
>
r. Region 3 has a period-2 orbit and the hand-offs occur on route L and route R alternately and periodically; Region 4 only has one fixed point on route D. Because of the symmetry of the Y-shaped picking system, the case l
>
r can also be found in Figure 1(b).


## 4. Simulation

### 4.1. Convergence Process Evolution

In all the simulations below, we setv
1
=
1, v
2
=
1.5, and v
3
=
3, respectively, and the convergence process of a two-truck bucket brigade tree-shaped system is observed in two ways: hand-off time evolution and hand-off position evolution. To show the hand-off time evolution, we map hand-off location as a function of hand-off time, in which the horizontal axis and vertical axis represent the hand-off time and hand-off location at iteration k
+
1 of truck i for i
=
1,2, respectively. And the Poincaré map is used to map the hand-off position evolution; the vertical axis in the map is the hand-off position at iteration k
+
1 of truck i for i
=
1,2 and the horizontal axis is their hand-off position at iteration k; the red dashed line in the Poincaré map shows the diagonal, and the solid line with arrows traces the hand-off position evolution.


#### 4.1.1. Region1 (s
<
l
<
r
,
l
=
0.45)

In Region1, if the picking routes are sequenced as L
→
R
→
D, simulation results of the convergence process are shown in Figure 3.Convergence process in Region1 when the picking routes are sequenced as L
→
R
→
D.
(a)
Hand-off time evolution
(b)
Hand-off position evolutionFigure3(a) shows that the hand-off locations x
k converge quickly to a single point x
L
*
=
0.4286 on the left subpicking route L
→
D. The hand-off position evolution in the Poincaré map is shown in Figure 3(b) when the initial iterate x
1
=
0.9; the intersection of the diagonal with the Poincaré map at a point x
L
*
=
0.4286 indicates a fixed point on subpicking route L
→
D, which implies that truck 1 always works from point 0 to x
L
* and truck 2 from x
L
* to 1. Hence, trucks always perform the same amount of picking task in each picking period.In Region1, if the picking routes are sequenced as R
→
L
→
D, simulation results of the convergence process are shown in Figure 4.Convergence process in Region1 when the picking routes are sequenced as R
→
L
→
D.
(a)
Hand-off time evolution
(b)
Hand-off position evolutionFigure4(a) shows that the hand-off locations x
k converge quickly to a single point x
R
*
=
0.8786 on the right subpicking route R
→
D. The hand-off position evolution in the Poincaré map is shown in Figure 4(b) when the initial iterate x
1
=
0.8; the intersection of the diagonal with the Poincaré map at a point x
R
*
=
0.8786 indicates a fixed point on subpicking route R
→
D, which implies that truck 1 always works from point 0 to x
R
* and truck 2 from x
R
* to 1. Hence, trucks always perform the same amount of tasks in each picking period.


#### 4.1.2. Region2 (l
<
s
<
r
,
l
=
0.4)

In Region2, the picking routes can only be sequenced as R
→
L
→
D. Simulation results of the convergence process in Region 2 when the picking routes are sequenced as R
→
L
→
D are the same as those in Figure 4.


#### 4.1.3. Region3 (r
<
s
<
l
+
r
,
l
=
0.2
;
r
=
0.3)

In Region3, if the picking routes are sequenced as (L
→
R
→
D or R
→
L
→
D) and assigned to a period picking task begun from node L (R) accordingly, simulation results of the convergence process are shown in Figure 5.Convergence process in Region3.
(a)
Hand-off time evolution
(b)
Hand-off position evolutionAs shown in Figure5(a), the hand-off locations x
k eventually alternately converge to a period-2 orbit: P
L
*
=
0.1286 and P
R
*
=
0.4286. The Poincaré map in Figure 5(b) converges to period-2 orbit when the initial iterate x
1
=
0.3. Once the two-truck bucket brigade tree-shaped system converges to the period-2 orbit, truck 2 takes over the picking task from truck 1 at points P
L
*
=
0.1286 and P
R
*
=
0.4286 alternately.


#### 4.1.4. Region4 (s
>
l
+
r)

In Region4, there is no difference between the convergence process whether the picking routes are sequenced as L
→
R
→
D or R
→
L
→
D. Simulation results of the convergence process are shown in Figure 6.Convergence process in Region4.
(a)
Hand-off time evolution
(b)
Hand-off position evolutionAs shown in Figure6(a), the hand-off locations x
k converge quickly to a single point x
D
*
=
0.4286 on subpicking route D
→
E. The hand-off position evolution in the Poincaré map is shown in Figure 6(b) when the initial iterate x
1
=
0.9. The intersection of the diagonal with the Poincaré map at a point x
D
*
=
0.4286 indicates a fixed point on subpicking route D
→
E. The fixed point for the two-truck bucket brigade tree-shaped picking system implies that truck 1 always works from point 0 to x
D
* and truck 2 from x
D
* to 1. Hence, trucks always perform the same amount of tasks in each picking period.


### 4.2. Factors Affecting Convergence

According to the lemmas in Section3, the range of x
k is determined when initial conditions (v
1, v
2, v
r, l, r, and d) are given. The question that naturally comes to mind is whether the system’s initial condition affects the behavior of the two-truck bucket brigade tree-shaped picking system, so, in this section, we, therefore, want to know how initial conditions affect the stable behavior of the bucket brigade. We focus on two factors of initial conditions: initial location x
1 and the working velocity difference of two trucks. In order to observe the effect of initial location on the system’s behavior, we simulate the system’s behavior under different initial locations x
1 and different v
1 and v
2, respectively. Simulation results are shown in Figures 7 and 8, respectively.Effect of initial location on system’s stable behavior.
(a)
Region1  (
L
→
R
→
D
)
(b)
Region1  (
R
→
L
→
D
)
(c)
Region2  (
R
→
L
→
D
)
(d)
Region4  (
L
→
R
→
D
/
R
→
L
→
D
)Effect of working velocity difference on system’s stable behavior.
(a)
Region1  (
L
→
R
→
D
)
(b)
Region1  (
R
→
L
→
D
)
(c)
Region2  (
R
→
L
→
D
)
(d)
Region4  (
L
→
R
→
D
/
R
→
L
→
D
)Figure7 tells us that the two-truck bucket brigade tree-shaped picking system converges quickly to a single point no matter where the initial node x
1 is located. This implies that the initial location of the trucks is irrelevant. More precisely, the two-truck bucket brigade picking system always converges to a fixed point no matter which node the trucks start to work at.Figure8 tells us that although the two-truck bucket brigade tree-shaped picking system can converge to a single point when the conditions in each region hold, the working velocity difference plays a major role in the speed of the system’s convergence process. The bigger the difference between the two trucks’ working velocities is, the faster the two-truck bucket brigade tree-shaped picking system converges.


### 4.3. Managerial Implication

Lemmas6 to 16 in Section 3 and simulation in Section 4 tell us that if two trucks follow the bucket brigade rule in a tree-shaped picking system, the tree-shaped picking system will always be self-organizing, which means that significant managerial intervention regarding the initial location is not necessary for effective operation of the two-truck bucket brigade. But simulations in Section 4.2 tell us clearly that a picking system with large differences in trucks’ working velocities can easily reach self-balance status, which means that some managerial intervention is necessary regarding the difference in the trucks’ velocity in order to enhance the self-organization of the bucket brigade picking system.


## 4.1. Convergence Process Evolution

In all the simulations below, we setv
1
=
1, v
2
=
1.5, and v
3
=
3, respectively, and the convergence process of a two-truck bucket brigade tree-shaped system is observed in two ways: hand-off time evolution and hand-off position evolution. To show the hand-off time evolution, we map hand-off location as a function of hand-off time, in which the horizontal axis and vertical axis represent the hand-off time and hand-off location at iteration k
+
1 of truck i for i
=
1,2, respectively. And the Poincaré map is used to map the hand-off position evolution; the vertical axis in the map is the hand-off position at iteration k
+
1 of truck i for i
=
1,2 and the horizontal axis is their hand-off position at iteration k; the red dashed line in the Poincaré map shows the diagonal, and the solid line with arrows traces the hand-off position evolution.


### 4.1.1. Region1 (s
<
l
<
r
,
l
=
0.45)

In Region1, if the picking routes are sequenced as L
→
R
→
D, simulation results of the convergence process are shown in Figure 3.Convergence process in Region1 when the picking routes are sequenced as L
→
R
→
D.
(a)
Hand-off time evolution
(b)
Hand-off position evolutionFigure3(a) shows that the hand-off locations x
k converge quickly to a single point x
L
*
=
0.4286 on the left subpicking route L
→
D. The hand-off position evolution in the Poincaré map is shown in Figure 3(b) when the initial iterate x
1
=
0.9; the intersection of the diagonal with the Poincaré map at a point x
L
*
=
0.4286 indicates a fixed point on subpicking route L
→
D, which implies that truck 1 always works from point 0 to x
L
* and truck 2 from x
L
* to 1. Hence, trucks always perform the same amount of picking task in each picking period.In Region1, if the picking routes are sequenced as R
→
L
→
D, simulation results of the convergence process are shown in Figure 4.Convergence process in Region1 when the picking routes are sequenced as R
→
L
→
D.
(a)
Hand-off time evolution
(b)
Hand-off position evolutionFigure4(a) shows that the hand-off locations x
k converge quickly to a single point x
R
*
=
0.8786 on the right subpicking route R
→
D. The hand-off position evolution in the Poincaré map is shown in Figure 4(b) when the initial iterate x
1
=
0.8; the intersection of the diagonal with the Poincaré map at a point x
R
*
=
0.8786 indicates a fixed point on subpicking route R
→
D, which implies that truck 1 always works from point 0 to x
R
* and truck 2 from x
R
* to 1. Hence, trucks always perform the same amount of tasks in each picking period.


### 4.1.2. Region2 (l
<
s
<
r
,
l
=
0.4)

In Region2, the picking routes can only be sequenced as R
→
L
→
D. Simulation results of the convergence process in Region 2 when the picking routes are sequenced as R
→
L
→
D are the same as those in Figure 4.


### 4.1.3. Region3 (r
<
s
<
l
+
r
,
l
=
0.2
;
r
=
0.3)

In Region3, if the picking routes are sequenced as (L
→
R
→
D or R
→
L
→
D) and assigned to a period picking task begun from node L (R) accordingly, simulation results of the convergence process are shown in Figure 5.Convergence process in Region3.
(a)
Hand-off time evolution
(b)
Hand-off position evolutionAs shown in Figure5(a), the hand-off locations x
k eventually alternately converge to a period-2 orbit: P
L
*
=
0.1286 and P
R
*
=
0.4286. The Poincaré map in Figure 5(b) converges to period-2 orbit when the initial iterate x
1
=
0.3. Once the two-truck bucket brigade tree-shaped system converges to the period-2 orbit, truck 2 takes over the picking task from truck 1 at points P
L
*
=
0.1286 and P
R
*
=
0.4286 alternately.


### 4.1.4. Region4 (s
>
l
+
r)

In Region4, there is no difference between the convergence process whether the picking routes are sequenced as L
→
R
→
D or R
→
L
→
D. Simulation results of the convergence process are shown in Figure 6.Convergence process in Region4.
(a)
Hand-off time evolution
(b)
Hand-off position evolutionAs shown in Figure6(a), the hand-off locations x
k converge quickly to a single point x
D
*
=
0.4286 on subpicking route D
→
E. The hand-off position evolution in the Poincaré map is shown in Figure 6(b) when the initial iterate x
1
=
0.9. The intersection of the diagonal with the Poincaré map at a point x
D
*
=
0.4286 indicates a fixed point on subpicking route D
→
E. The fixed point for the two-truck bucket brigade tree-shaped picking system implies that truck 1 always works from point 0 to x
D
* and truck 2 from x
D
* to 1. Hence, trucks always perform the same amount of tasks in each picking period.


## 4.1.1. Region1 (s
<
l
<
r
,
l
=
0.45)

In Region1, if the picking routes are sequenced as L
→
R
→
D, simulation results of the convergence process are shown in Figure 3.Convergence process in Region1 when the picking routes are sequenced as L
→
R
→
D.
(a)
Hand-off time evolution
(b)
Hand-off position evolutionFigure3(a) shows that the hand-off locations x
k converge quickly to a single point x
L
*
=
0.4286 on the left subpicking route L
→
D. The hand-off position evolution in the Poincaré map is shown in Figure 3(b) when the initial iterate x
1
=
0.9; the intersection of the diagonal with the Poincaré map at a point x
L
*
=
0.4286 indicates a fixed point on subpicking route L
→
D, which implies that truck 1 always works from point 0 to x
L
* and truck 2 from x
L
* to 1. Hence, trucks always perform the same amount of picking task in each picking period.In Region1, if the picking routes are sequenced as R
→
L
→
D, simulation results of the convergence process are shown in Figure 4.Convergence process in Region1 when the picking routes are sequenced as R
→
L
→
D.
(a)
Hand-off time evolution
(b)
Hand-off position evolutionFigure4(a) shows that the hand-off locations x
k converge quickly to a single point x
R
*
=
0.8786 on the right subpicking route R
→
D. The hand-off position evolution in the Poincaré map is shown in Figure 4(b) when the initial iterate x
1
=
0.8; the intersection of the diagonal with the Poincaré map at a point x
R
*
=
0.8786 indicates a fixed point on subpicking route R
→
D, which implies that truck 1 always works from point 0 to x
R
* and truck 2 from x
R
* to 1. Hence, trucks always perform the same amount of tasks in each picking period.


## 4.1.2. Region2 (l
<
s
<
r
,
l
=
0.4)

In Region2, the picking routes can only be sequenced as R
→
L
→
D. Simulation results of the convergence process in Region 2 when the picking routes are sequenced as R
→
L
→
D are the same as those in Figure 4.


## 4.1.3. Region3 (r
<
s
<
l
+
r
,
l
=
0.2
;
r
=
0.3)

In Region3, if the picking routes are sequenced as (L
→
R
→
D or R
→
L
→
D) and assigned to a period picking task begun from node L (R) accordingly, simulation results of the convergence process are shown in Figure 5.Convergence process in Region3.
(a)
Hand-off time evolution
(b)
Hand-off position evolutionAs shown in Figure5(a), the hand-off locations x
k eventually alternately converge to a period-2 orbit: P
L
*
=
0.1286 and P
R
*
=
0.4286. The Poincaré map in Figure 5(b) converges to period-2 orbit when the initial iterate x
1
=
0.3. Once the two-truck bucket brigade tree-shaped system converges to the period-2 orbit, truck 2 takes over the picking task from truck 1 at points P
L
*
=
0.1286 and P
R
*
=
0.4286 alternately.


## 4.1.4. Region4 (s
>
l
+
r)

In Region4, there is no difference between the convergence process whether the picking routes are sequenced as L
→
R
→
D or R
→
L
→
D. Simulation results of the convergence process are shown in Figure 6.Convergence process in Region4.
(a)
Hand-off time evolution
(b)
Hand-off position evolutionAs shown in Figure6(a), the hand-off locations x
k converge quickly to a single point x
D
*
=
0.4286 on subpicking route D
→
E. The hand-off position evolution in the Poincaré map is shown in Figure 6(b) when the initial iterate x
1
=
0.9. The intersection of the diagonal with the Poincaré map at a point x
D
*
=
0.4286 indicates a fixed point on subpicking route D
→
E. The fixed point for the two-truck bucket brigade tree-shaped picking system implies that truck 1 always works from point 0 to x
D
* and truck 2 from x
D
* to 1. Hence, trucks always perform the same amount of tasks in each picking period.


## 4.2. Factors Affecting Convergence

According to the lemmas in Section3, the range of x
k is determined when initial conditions (v
1, v
2, v
r, l, r, and d) are given. The question that naturally comes to mind is whether the system’s initial condition affects the behavior of the two-truck bucket brigade tree-shaped picking system, so, in this section, we, therefore, want to know how initial conditions affect the stable behavior of the bucket brigade. We focus on two factors of initial conditions: initial location x
1 and the working velocity difference of two trucks. In order to observe the effect of initial location on the system’s behavior, we simulate the system’s behavior under different initial locations x
1 and different v
1 and v
2, respectively. Simulation results are shown in Figures 7 and 8, respectively.Effect of initial location on system’s stable behavior.
(a)
Region1  (
L
→
R
→
D
)
(b)
Region1  (
R
→
L
→
D
)
(c)
Region2  (
R
→
L
→
D
)
(d)
Region4  (
L
→
R
→
D
/
R
→
L
→
D
)Effect of working velocity difference on system’s stable behavior.
(a)
Region1  (
L
→
R
→
D
)
(b)
Region1  (
R
→
L
→
D
)
(c)
Region2  (
R
→
L
→
D
)
(d)
Region4  (
L
→
R
→
D
/
R
→
L
→
D
)Figure7 tells us that the two-truck bucket brigade tree-shaped picking system converges quickly to a single point no matter where the initial node x
1 is located. This implies that the initial location of the trucks is irrelevant. More precisely, the two-truck bucket brigade picking system always converges to a fixed point no matter which node the trucks start to work at.Figure8 tells us that although the two-truck bucket brigade tree-shaped picking system can converge to a single point when the conditions in each region hold, the working velocity difference plays a major role in the speed of the system’s convergence process. The bigger the difference between the two trucks’ working velocities is, the faster the two-truck bucket brigade tree-shaped picking system converges.


## 4.3. Managerial Implication

Lemmas6 to 16 in Section 3 and simulation in Section 4 tell us that if two trucks follow the bucket brigade rule in a tree-shaped picking system, the tree-shaped picking system will always be self-organizing, which means that significant managerial intervention regarding the initial location is not necessary for effective operation of the two-truck bucket brigade. But simulations in Section 4.2 tell us clearly that a picking system with large differences in trucks’ working velocities can easily reach self-balance status, which means that some managerial intervention is necessary regarding the difference in the trucks’ velocity in order to enhance the self-organization of the bucket brigade picking system.


## 5. Conclusions and Further Work

The main contribution of this paper is to show how the idea of the bucket brigade can be applied to tree-shaped picking systems. We achieve this by conceptually converting the work content of a tree-shaped picking system to a linear sequence of work to which the adapted bucket brigade protocol can be applied. We find that if two trucks follow the bucket brigade rule in a tree-shaped picking system, the tree-shaped picking system will always be self-organizing; that is, trucks hand over picking items at a fixed point or at two fixed locations that they visit periodically. Our work complements that of Bartholdi III et al. [13] by introducing significant walk-back time into a tree-shaped bucket brigade system and, moreover, our analysis provides a way to model and understand bucket brigade picking systems.In this paper, the picking routes are assumed to be Y-shaped. In actual situations, however, the picking route is more complex than a Y-shaped tree; it can even be a network. Thus, picking networks andn-trucks (n
>
2) bucket brigade picking systems could be considered in future research.



---

*Source: 242958-2014-06-22.xml*