1) An order has just come in for 1 unit each of SKU1, SKU2, SKU3, SKU4 and SKU5.
ID: 455399 • Letter: 1
Question
1) An order has just come in for 1 unit each of SKU1, SKU2, SKU3, SKU4 and SKU5. The picker will start in location O and needs to pick each item before returning to his starting point. The table below represents the distances between locations. If the goal is to minimize distance traveled, in what sequence should he pick the SKU’s, and what is the total distance traveled for the pick? You may use any method discussed to solve this problem. You can do this problem by hand.
Distance Between SKU Locations
Origin
SKU1
SKU2
SKU3
SKU4
SKU5
Origin
10
30
21
24
16
SKU1
10
6
18
12
6
SKU2
30
6
6
7
23
SKU3
21
18
6
13
28
SKU4
24
12
7
13
16
SKU5
16
6
23
28
16
Distance Between SKU Locations
Origin
SKU1
SKU2
SKU3
SKU4
SKU5
Origin
10
30
21
24
16
SKU1
10
6
18
12
6
SKU2
30
6
6
7
23
SKU3
21
18
6
13
28
SKU4
24
12
7
13
16
SKU5
16
6
23
28
16
Explanation / Answer
This problem is solved using nearest neighbour procedure. It builds the route based only on the distance of traveling from the last-visited node to the closest node in the network.
From the origin the nearest point is SKU1
From SKU1 the nearest point is SKU2 or SKU5
Option 1: Origin -> SKU1 -> SKU2
Option 2: Origin -> SKU1 -> SKU5
From SKU2, nearest point is SKU3. From SKU5 nearest point is SKU4
Option 1: Origin -> SKU1 -> SKU2 ->SKU3
Option 2: Origin -> SKU1 -> SKU5 ->SKU4
From SKU3, nearest point is SKU4; from SKU4 nearest point is SKU2
Option 1: Origin -> SKU1 -> SKU2 ->SKU3 -> SKU4
Option 2: Origin -> SKU1 -> SKU5 ->SKU4 -> SKU2
Developing the route to the origin,
Option 1: Origin -> SKU1 -> SKU2 ->SKU3 -> SKU4 -> SKU5 -> Origin
Option 2: Origin -> SKU1 -> SKU5 ->SKU4 -> SKU2 -> SKU3 -> Origin
Distance Calculation
Option 1: 10+6+6+13+16+16 = 67
Option 2: 10+6+16+7+6+21 = 66
Origin -> SKU1 -> SKU5 ->SKU4 -> SKU2 -> SKU3 -> Origin
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.