In class practice

The Aracruz company has 10 points of sale that it supplies regularly. It currently has its own private
fleet to ensure these supplies. However, it wishes to consider the option of outsourcing distribution
management to an external carrier.

Aracruz's private fleet consists of trucks, each with a loading capacity equivalent to 100 pallets.
After a market study, Aracruz selected Globox as a potential external carrier. This carrier uses
trucks each with a loading capacity equivalent to 200 pallets.

Aracruz must make a supply at each of its points of sale at the beginning of each week. The year
consists of 52 working weeks. Table 1 gives the distances (in km) between Aracruz (the depot is
designated by the number 1) and each point of sale and the distance between each pair of points of
sale as well as the weekly quantities (in number of pallets) to be shipped. Note that the distance
matrix is symmetric.
Table 1. distances and demands
X \ Y 1 2 3 4 5 6 7 8 9 10 11 Demand
1 0 200 40 140 140 160 210 110 100 200 80
2 200 0 160 70 120 40 20 130 180 80 170 16
3 40 160 0 100 110 120 170 80 90 162 60 9
4 140 70 100 0 50 30 70 110 110 120 130 34
5 140 120 110 50 0 90 110 160 70 140 170 24
6 160 40 120 30 90 0 40 110 150 70 140 25
7 210 20 170 70 110 40 0 150 180 60 180 45
8 110 130 80 110 160 110 150 0 170 180 40 8
9 100 180 90 110 70 150 180 170 0 140 160 15
10 200 80 162 120 140 70 60 180 140 0 208 10
11 80 170 60 130 170 140 180 40 160 208 0 6

1) Calculate the saving matrix

X \ Y 2 3 4 5 6 7 8 9 10 11

2 0

3 80 0

4 270 80 0

5 220 70 230 0

6 320 80 270 210 0

7 390 80 280 240 330 0

8 180 70 140 90 160 170 0

9 120 50 130 170 110 130 40 0

10 320 78 220 200 290 350 130 160 0

11 110 60 90 50 100 110 150 20 72 0

2. Applying the Savings heuristic (Similar to the “C&W” heuristic for the TSP problem), find the solution
considering Aracruz's private fleet (capacity of 100).

Iteration Saving (Sij) Value of saving Feasible? Justification if the Modified tours
saving is not feasible

1 - - 1-2-1

1-3-1

1-4-1

1-5-1

1-6-1

1-7-1

1-8-1

1-9-1

1-10-1

1-11-1

2 𝑆 390 1-2-7-1

3 𝑆 350 1-2-7-10-1

4 𝑆 330 No 7 is not an end of road

5 𝑆 320 No 2 and 10 on the same

road

6 𝑆 320 Yes 1-6-2-7-10-1

7 𝑆 290 No 6 and 10 on the same

road

8 𝑆 280 No 7 is not an end of road

9 𝑆 270 No Load overflow

10 𝑆 270 No 2 is not an end of road

11 𝑆 240 No 7 is not an end of road

12 𝑆 230 Yes 1-6-2-7-10-1

1-4-5-1
13 𝑆 220 No Load overflow

14 𝑆 220 No Load overflow

15 𝑆 210 No Load overflow

16 𝑆 200 No Load overflow

17 𝑆 180 No Load overflow

18 𝑆 170 Yes 1-6-2-7-10-1

1-4-5-9-1

19 𝑆 170 No 7 is not an end of road

20 𝑆 160 No Load overflow

21 𝑆 160 No Load overflow

22 𝑆 150 Yes 1-8-11-1

1-6-2-7-10-1

1-4-5-9-1

23 𝑆 140 Yes 1-11-8-4-5-9-1

1-6-2-7-10-1

24 𝑆 130 No Load overflow

25 𝑆 130 No 4 and 9 on the same

road

26 𝑆 130 No Load overflow

27 𝑆 120 No 2 is not an end of road

28 𝑆 110 No 2 is not an end of road

29 𝑆 110 No Load overflow

30 𝑆 110 No Load overflow

31 𝑆 100 No Load overflow

32 𝑆 90 No 5 and 8 on the same

road

33 𝑆 90 No 8 and 9 on the same

road

34 𝑆 80 No 2 is not an end of road

 35 𝑆 80 No Load overflow

36 𝑆 80 No Load overflow

37 𝑆 80 No Load overflow

38 𝑆 78 No Load overflow

39 𝑆 72 No Load overflow

40 𝑆 No 5 is not the end of

70 road

41 𝑆 No 5 is not the end of

70 road

42 𝑆 60 Yes 1-3-11-8-4-5-9-
1

1-6-2-7-10-1

The algorithm stops

here since you can't
merge the two routes
because of the
capacity limit.

Final solution is given by the following two tours:

Weight

Route 1 96,00 1 3 8 11 4 5 9 1

Route 2 96,00 1 6 2 7 10 1

Total 192,00

Since the capacity of a Globox truck allows deliveries to be made on the same route, use Clarke
and Wright's algorithm to solve the problem of the travelling salesman and define the route to
ensure the weekly supply of all points of sale if Aracruz chooses to outsource to Globox the
management of its deliveries during the next year. Be sure to complete a table similar to the one
presented in question 1.

Iteration Saving (Sij) Value of saving Feasible? Justification if the Modified tours
saving is not feasible
1 - - - 1-2-1

1-3-1

1-4-1

1-5-1

1-6-1

1-7-1

1-8-1

1-9-1

1-10-1

1-11-1

2 𝑆 390 Yes 1-2-7-1

3 𝑆 350 Yes 1-2-7-10-1

4 𝑆 330 No 7 is not the end of road

5 𝑆 320 No 2 and 10 on the same

road

6 𝑆 320 Yes 1-6-2-7-10-1

7 𝑆 290 No 6 and 10 on the same

road

8 𝑆 280 No 7 is not the end of road

9 𝑆 270 Yes 1-4-6-2-7-10-1

10 𝑆 270 No 2 is not an end of road

11 𝑆 240 No 7 is not an end of road

12 𝑆 230 Yes 1-5-4-6-2-7-10-

1

13 𝑆 220 No 4 and 10 on the same

road

14 𝑆 220 No 2 and 5 on the same

road

15 𝑆 210 No 2 and 6 on the same

road

16 𝑆 200 No 5 and 10 on the same

road

17 𝑆 180 No 2 is not an end of road

18 𝑆 170 Yes 1-9-5-4-6-2-7-
10-1

19 𝑆 170 No 7 is not an end of road

20 𝑆 160 No 6 is not an end of road

21 𝑆 160 No 9 and 10 on the same

road

22 𝑆 150 Yes 1-9-5-4-6-2-7-

10-1

1-8-11-1

23 𝑆 140 No 4 is not an end of road

24 𝑆 130 Yes 1-9-5-4-6-2-7-

10-8-11-1

25 𝑆 130 No 4 and 9 on the same

road

26 𝑆 130 No 7 and 9 on the same

road

27 𝑆 120 No 2 and 9 on the same

road

28 𝑆 110 No 2 and 11 on the same

road

29 𝑆 110 No 7 and 11 on the same

road

30 𝑆 110 No 6 and 9 on the same

road

31 𝑆 100 No 6 and 11 on the same

road

32 𝑆 90 No 5 and 8 on the same

road

33 𝑆 90 No 8 and 9 on the same

road

34 𝑆 80 No 2 is not an end of road

35 𝑆 80 No 4 is not an end of road

36 𝑆 80 No 6 is not an end of road

37 𝑆 80 No 7 is not an end of road

38 𝑆 78 No 10 is not an end of road

 39 𝑆 72 No 10 is not an end of road

40 𝑆 70 No 5 is not an end of road

41 𝑆 70 No 5 is not an end of road

42 𝑆 60 Yes 1-9-5-4-6-2-7-
10-8-11-3-1

The algorithm stops

here since we found
the complete tour

weight

Route 1 192,00 1 9 5 4 6 2 7 10 8 11 3 1

Total 192,00

Give the total distance travelled during the year if Aracruz uses its private fleet.

The two weekly rounds of the Aracruz fleet are given by:
1-3-11-8-4-5-9-1 : 40+ 60 + 40 + 110 + 50 + 70 + 100 =470 km
1-6-2-7-10-1 : 160 + 40 + 20 + 60 + 200 = 480 km
For an annual distance equal to

=(470+480)*52=48400 km/year

Give the total distance travelled during the year if Aracruz chooses to use Globox.

Globox's weekly tour is: 1-9-5-4-6-2-7-10-8-11-3-1 : 100+ 70+ 50+ 30 + 40 + 20 + 60

+ 180 + 40 +60+ 80 =730 km
for an annual distance equal to

=670*52=37,960km/year