In Class Practice - VRP

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 6

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

10

11 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

10

11

12

13

14

15
16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42
Final solution is given by the following two tours:
Weight

Route 1

Route 2

Total

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

6
7

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35
36

37

38

39

40

41

42

weight

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

Total

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

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

You might also like