ROUTINGBy

Shriket Trivedi

WHY EMPLOY ROUTING

A B

Shortest Path

Is That All ??

TIME=DISTANCE_________SPEED

SAVINGS AND EARNINGS

C O N S T RA I N S

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.

ROUTINGMETHODS

DISTANCE BASED

SWEEP METHODOF ROUTING

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

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

Sweep Method Example

A

2000

B

3000

C

2000

D

3000

E

1000

F

3000

G

2000

H

4000

I

1000

J

2000

K

2000

L

2000

Depot

Pickup Stop Data: quantities shown in units

Sweep Method Example

A

2000

B

3000

C

2000

D

3000

E

1000

F

3000

G

2000

H

4000

I

1000

J

2000

K

2000

L

2000

Depot

“Sweep” method solution

Sweep Method Example

A

2000

B

3000

C

2000

D

3000

E

1000

F

3000

G

2000

H

4000

I

1000

J

2000

K

2000

L

2000

Depot

“Sweep” method solution

Route 110,000 units

Sweep Method Example

A

2000

B

3000

C

2000

D

3000

E

1000

F

3000

G

2000

H

4000

I

1000

J

2000

K

2000

L

2000

Depot

“Sweep” method solution

Route 110,000 units

Route 29,000 units

Route 38,000 units

SAVINGS METHOD OFROUTING

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

The Savings Method of Routing

Depot (0)

Stop A

Stop B

d0,A

d0,B

dA,0

dB,0

Route distance= d0,A + dA,0 + d0,B + dB,0

The Savings Method of Routing

Depot (0)

Stop A

Stop B

d0,A

dA,B

dB,0

Route distance= d0,A + dA,B + dB,0

Savings value of S= d0,A + dB,0 - dA,B

The Savings Method of Routing

(0)

(A)

(B)

d0,A = 100

d0,B = 85

dA,0 = 100

dB,0 = 85

Route distance = d0,A(100) + dA,0 (100) + d0,B(85) + dB,0 (85) + d0,C (25) + dC,0 (25) = 420 total miles

(C)

d0,C = 25

dC,0 = 25

The Savings Method of Routing

(0)

(A)

(B)

d0,A = 100

dA,B = 145

dC,0 = 25

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

Savings value of S = 45 miles savedEarlier O to A to B to O route (330 miles) plus 0 to C to 0 route (50 miles) = 380 miles

(C)

dB,C = 65

The Savings Method of Routing

(0)

(A)

(C)

d0,A = 100

dA,C = 125

dB,0 = 85

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

Savings value of S = 5 miles savedEarlier O to A to B to O route (330 miles) plus 0 to C to 0 route (50 miles) = 380 miles

(B)

dC,B = 65

The Savings Method of Routing

(0)

(C)

(A)

d0,C = 25

dC,A = 125

dB,0 = 85

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

Savings value of S = 0 miles savedEarlier O to A to B to O route (330 miles) plus 0 to C to 0 route (50 miles) = 380 miles

(B)

dA,B = 145

SOFTWARE BASED ROUTING

Traffic Patters

TerrainVehicle Maintainance Costs

Real Time Dynamic Routing

Scheduling And Prioretisation

Reduce Fleet Size

Order Tracking

Save Fuel

Faster Deliveries

Used By All Large Scale Companies For Transportation Operations

REDUCE TARGET INPUTSLike

Fuel, Number of Vehicles & Man Power

Your Text Here

While Maintaining

And IncreasingProfits

Some Routing Software Providers

THANK YOU