Scribd
Upload
37 views4 pages

Savings Algorithm - Clarke - Wright

The document contains four exercises related to savings algorithms for solving traveling salesman problems (TSP) and vehicle routing problems (VRP). The exercises provide distance/cost matrices and customer order information and ask the user to apply the nearest neighbor or Clarke and Wright savings algorithms to find optimal routes. Steps and iterations of the algorithms are to be shown.

Uploaded by

Ha Mizo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
37 views4 pages

Savings Algorithm - Clarke - Wright

The document contains four exercises related to savings algorithms for solving traveling salesman problems (TSP) and vehicle routing problems (VRP). The exercises provide distance/cost matrices and customer order information and ask the user to apply the nearest neighbor or Clarke and Wright savings algorithms to find optimal routes. Steps and iterations of the algorithms are to be shown.

Uploaded by

Ha Mizo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Savings algorithm (Clarke & Wright 1964)

TSP/VRP

Exercise 1: ( TSP: Nearest Neighbor Algorithm)

City1 City2 City3 City4 City5


City1
- 10 3 6 9
City2
5 - 5 4 2
City3
4 9 - 7 8
City4
7 1 3 - 4
City5
3 2 6 5 -

The Algorithm
propose an optimal solution according to the TSP: Nearest-Neighbor algorithm
Initialize i=1
Step 1: Start from city i and link it to the nearest unvisited neighbor, say city k. From city k move
to the next nearest unvisited neighbor. The process continues until a tour is found. (Break ties
arbitrarily)
Step 2: If i=n (the total number of cities) then go to step 3. Otherwise, i= i+1 and go to step 1
Step 3: Pick up the best tour from the n tours obtained from step1 – step 2 loop

Let’s apply!
For i=1
1. Start from city 1
2. City 3 is nearest to city 1
3. City 4 is nearest to city 3
4. City 2 is nearest to city 4
5. City 5 is nearest to city 2
6. The completion tour is: 1-3-4-2-5-1 =====> Z=16
Step1-Step 2 loop
Starting from city i , determining the tour and Z

Step 3
Pick up the optimal solution

Exercise 2: (TSP: Savings Algorithm “Clarke and Wright”)

X/Y 1 2 3 4 5 6
1 ? 6 5 12 14 17
2 ? ? 8 1 10 15
3 ? ? ? 16 4 6
4 ? ? ? ? 9 3
5 ? ? ? ? ? 2
6 ? ? ? ? ? ?

1. fill the table knowing that it is a weighted symmetric graph. values represent
transport costs.
2. Develop the savings matrix by designating “1” as the source.
3. propose an optimal solution according to the Clarke and Wright algorithm
Exercise 3: (VRP: Savings Algorithm “Clarke and Wright”)
six customers are to be visited from a single depot. The capacity of each vehicle is
30 volume units (v.u). Customer orders and savings are given below:
0 1 2 3 4 5 6
0 -
1 - 15 65 10 10 15
2 - 2 15 30 15
3 - 40 55 35
4 - 5 20
5 - 25
6 -

Client 1 2 3 4 5 6
order 13 9 10 4 10 2

Question:
fill in the following table and give a sagittal representation of the proposed solution
Iteration Arc to add result Truck Affected Remaining
route capacity
… … … … … …
Exercise 4: (VRP: Savings Algorithm “Clarke and Wright”)
Client 1 2 3 4 5 6 7 8 9
Order 5 8 12 9 2 5 24 11 8
Nine customers are to be visited from a single depot. The capacity of each vehicle
is 30 volume units (v.u). The classification of savings is given below:
1) S29=66
2) S16=60
3) S13=55
4) S36=52
5) S26=50
6) S12=48
7) S23=45
8) S35=42
9) S17=S39=S37=36
10) S89=S28=S48=S59=25
11) S34=S15=S24=S58=18
12) S69=S38=S49=S56=S19=S78=S27=12
13) S79=S68=S46=S45=S14=7
14) S75=S25=S67=S47=S18=4
Propose an optimal solution

You might also like