Consider the following Vehicle Routing Problem (VRP) with ten customers.

Note that we
assume that distances are symmetric. That is, the distance from i to j and from j to i are
equal for any i and j, which is why only the part of the distance matrix under the diagonal is
given.

The vehicle capacity is 30.

Note that the same graphic follows twice, as it may be useful in deriving your answers.

100 4
10

Depot
9
5
8

7
6
2
1
0
0 100

100 4
10

Depot
9
5
8

7
6
2
1
0
0 100
Distance matrix:
i \ j 1 2 3 4 5 6 7 8 9 10
1
2 1
0
3 8 72
2
4 9 92 5
6 9
5 4 44 7 63
3 7
6 6 53 5 101 8
3 0 6
7 7 61 4 100 9 9
1 4 1
8 5 40 3 74 6 29 3
1 3 0 0
9 5 48 2 59 5 42 4 14
7 4 6 1
10 9 87 4 13 6 91 8 65 5
3 7 5 9 0
Depo 5 43 3 51 3 56 5 27 1 45
t 0 9 8 8 8

Demands:
Custome 1 2 3 4 5 6 7 8 9 10
r
Demand 1
15 2 15 11 5 6 4 4 6 11

(a) Complete the savings matrix below, which you will use in part b of this question. Note
that 12 numbers are missing.
(5% of mark)

1 2 3 4 5 6 7 8 9
1                
2 83                
3 7              
4 5 31            
5 45 37 0 26          
6 43 45 8        
7 37 40 9 5      
8 30 33 4 5 54 55    
 9 11 10 0 32 35 31  
10 2 1 37 18 10. 7

(b) Find a solution (with trip length and load for each route) using the Clarke-Wright savings
method. You need to provide an explanation as well!
(10% of mark)

(c) Find a solution (with trip length and load for each route) using the sweep heuristic,
starting with a route that first visits customer 1 and sweeping anti-clockwise (towards
customer 2). Use the simple variant that visits customers in the order in which they are
swept. You need to provide an explanation as well!
(10% of mark)

Vehicle routing problem (35% of mark)

Consider the following Vehicle Routing Problem (VRP) with ten customers. Note that we
assume that distances are symmetric. That is, the distance from i to j and from j to i are equal for
any i and j, which is why only the part of the distance matrix under the diagonal is given.

Note that same graphic follows twice, as it may be useful in deriving your answers.
Vehicle capacity = 35
Maximum trip length = 30
Index number
1

2 Demand 9

3 11

4 6
14 capacity = 35
Vehicle Depot
5
Maximum trip length = 30
6 Index number
16
1 14
2 Demand 97
8 3 9
3 11
1 4
4 6
10
14 Depot
16 5
6 16
14
7

8 3 9
1 4
10

16
 Distance matrix
1 2 3 4 5 6 7 8 9 10
1
2 7.4
3 9.4 2.3
4 10.9 4.1 2.3
5 10.1 12.9 13.7 15.4
6 10.3 10.7 10.9 12.0 3.7
7 12.1 11.8 11.4 12.3 6.0 2.3
8 14.3 8.2 7.3 6.1 13.8 10.0 8.4
9 16.0 15.5 15.9 16.6 5.5 3.7 3.0 10.4
10 17.1 9.5 9.2 7.5 11.2 7.7 5.7 5.5 7.0
Depot 8.7 6.2 7.4 8.8 7.7 7.0 6.1 6.9 9.7 9.1

a) Complete the savings matrix below, which you will use in part b of this question. Note that
five figures are missing.

1 2 3 4 5 6 7 8 9
1                
2 7.5                
3 6.7 11.3              
4 6.6 10.9 13.9            
5 6.3 1.0 1.1          
6 3.5 3.8 11.0        
7 2.7 0.5 2.1 7.8 10.8      
8 1.3 4.9 7.0 9.6 0.8 3.9 4.6    
9 2.4 0.4 1.2 1.9 11.9 13.0 12.8 6.2  
10 0.7 7.3 10.4 5.6 8.4 9.5 10.5 11.8
b) Find a solution (with trip length and load for each route) using the Clarke-Wright savings
method.
Hint 1: no route should have a load that exceeds the vehicle capacity or violates the maximum
trip length.
Hint 2: (i,j) can only be inserted if (a) i and j are not in the same tour and (b) neither i and j are
interior (not attached to the depot) to an existing route.

c) Find a solution (with trip length and load for each route) using the sweep heuristic, starting
with a route that first visits customer 1 and sweeping anti-clockwise (to the left). Use the simple
variant of the sweep heuristic, where the next swept customer is always the next on the route.
Hint: no route should have a load that exceeds the vehicle capacity or violates the maximum trip
length.

Solution Format

s(i,j) ordered
large to small
Reason (i,j) not allowed i j s(i,j)

4 7 6 105.1
100 10
10 4 83
2 1 82.6
8 6 55.5
Same tour 8 7 55.2

3
Trip length 7 3 52.6
Interior 6 2 46.7

Depot Capacity 5 1 45.8

9
5 Interior 6 3 45.5
Interior 6 1 43.3
8
Trip length & capacity 7 2 40.3
Capacity 5 2 37
7
Trip length 10 3 36.8
6
2 Trip length 7 1 36.7
1 9 7 34.6
0 Trip length 8 3 33.5
0 100
Etc. … … …