Professional Documents
Culture Documents
Vehicle Routing -I
• Setup and Model.
• Problem Variety.
– Pure Pickup or Delivery Problems.
– Mixed Pickups and Deliveries.
– Pickup-Delivery Problems.
– Backhauls.
– Complications.
Vehicle Routing
• Find best vehicle route(s) to serve a set of orders
from customers.
• Orders may be
– Delivery from depot to customer.
– Pickup at customer and return to depot.
– Pickup at one place and deliver to another place.
General Setup
• Examples:
– UPS, FedEx, etc.
– Manufacturers & carriers.
– Carpools, school buses, etc.
depot
Pure Pickup or Delivery
depot
depot
Which route is best????
depot
TSP & VRP
VRP
TSP
depot
depot
Mixed Pickup & Delivery
Pickup
Delivery
depot
One Route
Not Interspersed
depot
Interspersed
depot
depot
Interspersed Routes Pickup
Delivery
F
• For clockwise trip: I
E H
D K
• Load at depot ACDFIJK A G
J
• Stop 1: Deliver A CDFIJK C
depot L
B
• Stop 2: Pickup B BCDFIJK
• etc.
Pickup-Delivery Problems
C
Pickup
Delivery B
A B
depot A
C
Intersperse Pickups and Deliveries?
Interspersed B
A B
depot A
C
Pickup
Delivery
C
Not Interspersed B
A B
depot A
C
Backhauls
C
Pickup
B
Delivery A B
depot A
C
D D
Backhauls
Pickup
Delivery
C
B
A B
depot A
C
Empty Return
D D
Backhaul
Complications
• Multiple vehicle types.
• Many Costs:
– Fixed charge.
– Variable costs per loaded mile & per empty mile.
– Waiting time; Layover time.
– Cost per stop (handling).
– Loading and unloading cost.
• Compatibility
– Vehicles and customers.
– Vehicles and orders.
– Order types.
– Drivers and vehicles.
• Homogeneous vehicles.
• Minimize distance.
• No compatibility constraints.
• No DOT rules.
Simplest Model: TSP
• One vehicle.
• No capacities.
• Minimize distance.
• No time windows.
• No compatibility constraints.
• No DOT rules.
Symmetric and Asymmetric
• Multiple Routes
• Construction Heuristics
– Sweep
– Nearest Neighbor, Nearest Insertion, Savings
– Cluster Methods
• Improvement Heuristics
• Time Windows
Multiple Routes
• Time windows
– Pickup.
– Delivery.
– Hard or Soft.
Multiple Route Solution Strategies
depot
depot
Nearest Neighbor, Nearest Insertion
& Savings Algorithms
depot
First route
depot
Nearest Neighbor Algorithm
Second route
depot
depot
Third route
Cluster Algorithms
depot depot
depot
depot
depot depot
3,[2-4]
3,[2-4]
1, [9-12] 2,[1-3]
4,[10-2]
5,[8-10]
Customer
depot number
6,[9-12]
Start and end of
time window
(2 pm - 4 pm)
Routing Example with Time Windows
3,[2-4]
1, [9-12] 2,[1-3]
4,[10-2]
5,[8-11]
depot
6,[9-12]
Nearest Insertion - No Time Windows
3 3
1 2 1 2
4 4
5 5
depot depot
6 6
Nearest Insertion - No Time Windows
3 3
1 2 1 2
4 4
5 5
depot depot
6 6
Nearest Insertion - No Time Windows
3 3
1 2 1 2
4 4
5 5
depot depot
6 6
Nearest Insertion with Time
Windows
One hour travel time between any two customers.
Half hour delivery time at each customer.
5,[8-11]
depot
6,[9-12]
depot-1
Nearest Insertion with Time
Windows
One hour travel time between any two customers.
Half hour delivery time at each customer.
5,[8-11]
depot
6,[9-12]
depot-1-2
Nearest Insertion with Time
Windows
One hour travel time between any two customers.
Half hour delivery time at each customer.
depot
6,[9-12]
depot-1-4-2
Nearest Insertion with Time
Windows - one option
One hour travel time between any two customers.
Half hour delivery time at each customer.
depot-5-4-1-2-3
Nearest Insertion with Time
Windows
One hour travel time between any two customers.
Half hour delivery time at each customer.
depot-5-6-1-4-2-3
Routing with Time Windows
Route must be
built with both
time windows &
geography in
3,[2-4]
mind!
1, [9-12] 2,[1-3]
4,[10-2]
5,[8-11]
depot
6,[9-12]
Clustering and Time Windows
3,[2-4]
1, [9-12] 2,[1-3]
4,[3-5]
5,[8-11]
depot
6,[9-12]
Clustering and Time Windows
3,[2-4]
1, [9-12] 2,[1-3]
4,[3-5]
5,[8-11]
depot
6,[9-12]
ArcLogistics Route Solution Technique
• Improve routes.
– Within route improvements.
– Between route improvements.
ArcLogistics Route Insertions
r
1tr + 2vr + 3wr
Intra-route
improvement
Inter-route
improvement
depot depot
• Road network.
– How detailed is the road network?
– Affects distance and cost calculations.
• Geocoding.
– Where are addresses located?
• What is purpose?
– Operational: To provide detailed driving directions?
– Strategic: To estimate costs, times, and routes?
Road Network Detail
• Zip codes.
– Geocode to a point at center of zip code.
– Zip codes are defined with boundaries and centroids.
• Cities.
– Geocode to a point representing city location.
Geocoding - Street Addresses
• Street addresses
– Each road segment has associated address ranges on
each side.
– Address is interpolated between start and end of
address range.
– Assumes even spacing of addresses.
• Example:
– Main Street, left side: 300-498, right side 301-499
– 420 E. Main Street is about 60% of the way down the
road segment on the left side.
Address Matching
ArcLogistics Route
assumes locations is here
Linking Locations to Road Network