6. Each stop on the route may have volume to be picked
up as well as delivered
Multiple vehicles may be used using different capacity
limits to both weight and Volume
Maximum total driving time allowed before a rest
period must be taken is 8 hours
Stops may permit pickups/deliveries only at certain
times of day (time windows)
Drivers must be allowed to take short rests or lunch
breaks at certain times of the day.
9. The Sweep Method of Routing
Locate all stops including the depot on a map or grid
Extend a straight line from the depot in any direction
Rotate the line (clockwise or counterclockwise) until it
intersects a stop
Will the inserted stop exceed the vehicle’s capacity?
If not, continue rotating the line until the next stop is
intersected
Will the cumulative volume exceed the vehicle’s capacity?
Continue process until vehicle’s capacity would be exceeded
Sequence the stops to minimize distance
10. Case Study
Jai Ganesh Trucking uses vans to deliver packages to
outlaying customers
Packages are collected from a warehouse which
doubles as a depot for the vans
Firm’s vans can carry 10,000 units at a time
11. Sweep Method Example
Pickup Stop Data:
quantities shown in units
E
H
1000
4000
A
F
2000
3000
D
Depot
G
2000
2000
1000
K
2000
3000
3000
I
L
B
C
2000
J
2000
12. Sweep Method Example
“Sweep” method
solution
E
H
1000
4000
A
F
2000
3000
D
Depot
G
2000
2000
3000
I
1000
L
K
2000
3000
B
C
2000
J
2000
13. Sweep Method Example
“Sweep” method
solution
E
H
1000
4000
F
3000
Route 1
10,000 units
2000
D
Depot
G
2000
1000
K
2000
3000
B
3000
I
L
2000
A
C
2000
J
2000
14. Sweep Method Example
“Sweep” method
solution
E
H
1000
4000
F
3000
2000
D
Depot
G
1000
K
2000
3000
B
3000
I
L
2000
A
Route 1
10,000 units
2000
Route 3
8,000 units
Route 2
9,000 units
C
2000
J
2000
15.
16. The Savings Method of
Routing
Begin with a dummy vehicle serving each stop and
returning to the depot.
Gives the maximum distance to be experienced in the
routing problem
Two stops are then combined together on the same
route
Eliminates one vehicle and travel distance is reduced
To determine which stops to combine on a route, the
distance saved is calculated before and after each
combination
This calculation is repeated for all stop pairs
The stop pair with the largest savings value is selected to be
combined
17. The Savings Method of
Routing
Route distance
= d0,A + dA,0 + d0,B + dB,0
d0,A
dA,0
Stop A
Depot (0)
dB,0
d0,B
Stop B
18. The Savings Method of
Routing
Route distance
= d0,A + dA,B + dB,0
d0,A
Stop A
dA,B
Depot (0)
dB,0
Stop B
Savings value of S
= d0,A + dB,0 - dA,B
20. The Savings Method of
Routing
Combining 3 stops on 1 route – Route distance (additional stop added after 1st 2 stops)
= d0,A(100) + dA,B(145) + dB,C(65) + dC,0(25) = 335 miles
d0,A = 100
(A)
dA,B = 145
(0)
(B)
dB,C = 65
dC,0 = 25
(C)
Savings value of S = 45 miles saved
Earlier O to A to B to O route (330 miles) plus 0 to C to 0 route (50 miles) = 380 miles
21. The Savings Method of
Routing
Combining 3 stops on 1 route – Route distance (additional stop added between 1st 2 stops)
= d0,A(100) + dA,C(125) + dC,B(65) + dB,0(85) = 375 miles
d0,A = 100
(A)
dA,C = 125
(0)
(C)
dC,B = 65
dB,0 = 85
(B)
Savings value of S = 5 miles saved
Earlier O to A to B to O route (330 miles) plus 0 to C to 0 route (50 miles) = 380 miles
22. The Savings Method of
Routing
Combining 3 stops on 1 route – Route distance (additional stop added before 1st 2 stops)
= d0,C(25) + dC,A(125) + dA,B(145) + dB,0(85) = 380 miles
d0,C = 25
(C)
dC,A = 125
(0)
(A)
dA,B = 145
dB,0 = 85
(B)
Savings value of S = 0 miles saved
Earlier O to A to B to O route (330 miles) plus 0 to C to 0 route (50 miles) = 380 miles
23.
24. Reduce Fleet Size
Traffic Patters
Order Tracking
Terrain
Vehicle Maintainance Costs
Save Fuel
Scheduling And Prioretisation
Faster Deliveries
Real Time Dynamic Routing
25. Used By All Large Scale
Companies For Transportation
Operations
