Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf ·...
Transcript of Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf ·...
![Page 1: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/1.jpg)
Vehicle Routing and Scheduling
Martin SavelsberghThe Logistics InstituteGeorgia Institute of Technology
![Page 2: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/2.jpg)
Vehicle Routing and Scheduling
Part I:Basic Models and Algorithms
![Page 3: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/3.jpg)
Introduction
Freight routingrouting of shipments
Service routingdispatching of repair technicians
Passenger routingtransportation of elderly
![Page 4: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/4.jpg)
Freight Routing (LTL)
pickup and delivery to and from end-of-line terminalshuttle from end-of-line terminal to regional distribution centertransportation between distribution centers
railsleeper teamssingle driver
![Page 5: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/5.jpg)
LTL Linehaul Network
EOLsDCs
Customers
![Page 6: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/6.jpg)
Origin-Destination Route
OriginEOL
DC
Destination
Linehaul scheduling
Pickup and delivery
Shuttle scheduling
![Page 7: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/7.jpg)
Routing and Scheduling
Routing and scheduling does not follow a single “one-size-fits-all” formula. Routing and scheduling software must usually be customized to reflect the operating environment and the customer needs and characteristics
![Page 8: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/8.jpg)
Models
Traveling Salesman Problem (TSP)Vehicle Routing Problem (VRP)Vehicle Routing Problem with Time Windows (VRPTW)Pickup and Delivery Problem with Time Windows (PDPTW)
![Page 9: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/9.jpg)
Traveling Salesman Problem
In the TSP the objective is to find the shortest tour through a set of cities, visiting each city exactly once and returning to the starting city.Type of decisions:
routing
![Page 10: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/10.jpg)
Traveling Salesman Problem
![Page 11: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/11.jpg)
Vehicle Routing Problem
In the VRP a number of vehicles located at a central depot has to serve a set of geographically dispersed customers. Each vehicle has a given capacity and each customer has a given demand. The objective is to minimize the total distance traveled.Type of decisions:
assigningrouting
![Page 12: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/12.jpg)
Vehicle Routing Problem
![Page 13: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/13.jpg)
Vehicle Routing Problem with Time Windows
In the VRPTW a number of vehicles is located at a central depot and has to serve a set of geographically dispersed customers. Each vehicle has a given capacity. Each customer has a given demand and has to be served within a given time window.Type of decisions:
assigningroutingscheduling
![Page 14: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/14.jpg)
Vehicle Routing Problem with Time Windows
![Page 15: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/15.jpg)
Pickup and Delivery Problem with Time Windows
In the PDPTW a number of vehicles has to serve a number of transportation requests. Each vehicle has a given capacity. Each transportation request specifies the size of the load to be transported, the location where it is to be picked up plus a pickup time window, and the location where it is to be delivered plus a delivery time window.Type of decisions:
assigningroutingscheduling
![Page 16: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/16.jpg)
Pickup and Delivery Problem with Time Windows
Delivery
Pickup
![Page 17: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/17.jpg)
Pickup and Delivery Problem with Time Windows
Delivery
Pickup
![Page 18: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/18.jpg)
Routing and Scheduling
Objectivesminimize vehiclesminimize milesminimize laborsatisfy service requirementsmaximize ordersmaximize volume delivered per mile
![Page 19: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/19.jpg)
Routing and Scheduling
Practical considerationsSingle vs. multiple depotsVehicle capacity
homogenous vs. hetrogenousvolume vs. weight
Driver availabilityFixed vs. variable start timesDoT regulations (10/1, 15/1, 70/8)
![Page 20: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/20.jpg)
Routing and Scheduling
Practical considerations (cont.)Delivery windows
hard vs. softsingle vs. multipleperiodic schedules
Service requirementsMaximum ride timeMaximum wait time
![Page 21: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/21.jpg)
Routing and Scheduling
Practical considerations (cont.)Fixed and variable delivery timesFixed vs. variable regions/route
![Page 22: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/22.jpg)
Recent Variants
Dynamic routing and scheduling problemsMore and more important due to availability of GPS and wireless communicationInformation available to design a set of routes and schedules is revealed dynamically to the decision maker
Order information (e.g., pickups)Vehicle status information (e.g., delays)Exception handling (e.g., vehicle breakdown)
![Page 23: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/23.jpg)
Recent Variants
Stochastic routing and scheduling problems
Size of demandTravel times
![Page 24: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/24.jpg)
Algorithms
Construction algorithmsImprovement algorithms
Set covering based algorithms
![Page 25: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/25.jpg)
Construction Heuristics
Savings heuristicInsertion heuristics
![Page 26: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/26.jpg)
Savings
Initial
i j
Intermediate Final
Savings s(i,j) = c(i,0) + c(0,j) – c(i,j)
![Page 27: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/27.jpg)
Savings Heuristic (Parallel)
Step 1. Compute savings s(i,j) for all pairs of customers. Sort savings. Create out-and-back routes for all customers.Step 2. Starting from the top of the savings list, determine whether there exist two routes, one containing (i,0) and the other containing (0,j). If so, merge the routes if the combined demand is less than the vehicle capacity.
![Page 28: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/28.jpg)
Savings Heuristics (Sequential)
Step 1. Compute savings s(i,j) for all pairs of customers. Sort savings. Create out-and-back routes for all customers.Step 2. Consider route (0,i,…,j,0) and determine the best savings s(k,i) and s(j,l) with routes containing (k,0) and (0,l). Implement the best of the two. If no more savings exist for this route move to the next.
![Page 29: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/29.jpg)
Savings Heuristic -Enhancement
Route shape parameters(i,j) = c(i,0) + c(0,j) - λ c(i,j)
The larger λ, the more emphasis is placed on the distance between customers being connected
![Page 30: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/30.jpg)
Insertion
Initial
i
j
k
Intermediate Final
![Page 31: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/31.jpg)
Insertion HeuristicsStart with a set of
unrouted stops
Select an unrouted stop
Are there any unrouted stops?
Insert selected stop in current set of routes
Yes
DoneNo
![Page 32: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/32.jpg)
Nearest addition
Selection:If partial tour T does not include all cities, find cities k and j, j on the tour and k not, for which c(j,k) is minimized.
Insertion:Let {i,j} be either one of the two edges involving j in T, and replace it by {i,k} and {k,j} to obtain a new tour including k.
![Page 33: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/33.jpg)
Nearest Insertion
Selection:If partial tour T does not include all cities, find cities k and j, j on the tour and k not, for which c(j,k) is minimized.
Insertion:Let {i,j} be the edge of T which minimizes c(i,k) + c(k,j) - c(i,j), and replace it by {i,k} and {k,j} to obtain a new tour including k.
![Page 34: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/34.jpg)
Farthest Insertion
Selection:If partial tour T does not include all cities, find cities k and j, j on the tour and k not, for which c(j,k) is maximized.
Insertion:Let {i,j} be the edge of T which minimizes c(i,k) + c(k,j) - c(i,j), and replace it by {i,k} and {k,j} to obtain a new tour including k.
![Page 35: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/35.jpg)
Cheapest Insertion
Selection:If partial tour T does not include all cities, find for each k not on T the edge {i,j} of T which minimizes c(T,k) = c(i,k) + c(k,j) -c(i,j). Select city k for which c(T,k) is minimized.
Insertion:Let {i,j} be the edge of T for which c(T,k) is minimized, and replace it by {i,k} and {k,j} to obtain a new tour including k.
![Page 36: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/36.jpg)
Worst case results
Nearest addition: 2Nearest insertion: 2Cheapest insertion: 2
Farthest insertion: > 2.43 (Euclidean)> 6.5 (Triangle inequality)
![Page 37: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/37.jpg)
Implementation
Priority Queueinsert(value, key)getTop(value, key)setTop(value, key)
k-d TreedeletePt(point)nearest(point)
![Page 38: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/38.jpg)
ImplementationTree->deletePt(StartPt)NNOut[StartPt] := Tree->nearest(StartPt)PQ->insert(Dist(StartPt, NNOut(StartPt)), StartPt)loop n-1 time
loopPQ->getTop(ThisDist, x)y := NNOut[x]If y not in tour, then breakNNOut[x] = Tree->nearest(x)PQ->setTop(Dist(x, NNOut[x]), x)
Add point y to tour; x is nearest neighbor in tourTree->deletePt(y)NNOut[y] = Tree->nearest(y)PQ->insert(Dist(y, NNOut[y]), y)
Delayed update
Find nearest point
Update
![Page 39: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/39.jpg)
Improvement Algorithms
Start with a feasible solution x
x
y
z
Is there an improving neighbor
y in N(x)?
Define neighborhood N(x).
Replace x by y
Yes
N(x)x is locally optimal
No
![Page 40: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/40.jpg)
2-change
O(n2) possibilities
![Page 41: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/41.jpg)
3-change
O(n3) possibilities
![Page 42: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/42.jpg)
1-Relocate
O(n2) possibilities
![Page 43: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/43.jpg)
2-Relocate
O(n2) possibilities
![Page 44: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/44.jpg)
Swap
O(n2) possibilities
![Page 45: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/45.jpg)
GENI
![Page 46: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/46.jpg)
Vehicle Routing and Scheduling
![Page 47: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/47.jpg)
Vehicle Routing and Scheduling
1-relocate
![Page 48: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/48.jpg)
B-cyclic k-transfer
![Page 49: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/49.jpg)
Set covering based algorithms
Assignment decisions are often the most importantAssignment decisions are often the most difficult
![Page 50: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/50.jpg)
Vehicle routing and scheduling
Possible route
![Page 51: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/51.jpg)
Vehicle routing and scheduling
Possible route
![Page 52: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/52.jpg)
Vehicle routing and scheduling
Possible route
![Page 53: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/53.jpg)
Vehicle routing and scheduling
Possible route
![Page 54: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/54.jpg)
Vehicle routing and scheduling
Possible route
![Page 55: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/55.jpg)
Vehicle routing and scheduling
Possible route
![Page 56: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/56.jpg)
Vehicle routing and scheduling
Possible route
![Page 57: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/57.jpg)
Set partitioning formulation
c1 c2 c3 c4 …Cust 1 1 1 0 1 … = 1Cust 2 1 0 1 0 … = 1Cust 3 0 1 1 0 … = 1…Cust n 0 1 0 0 … = 1
y/n y/n y/n y/n …
![Page 58: Martin Savelsbergh The Logistics Institute Georgia ...ms79/presentations/VRP_part1.pdf · Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology. Vehicle](https://reader031.fdocuments.in/reader031/viewer/2022011913/5faac3693bae5146f3627457/html5/thumbnails/58.jpg)
Set covering based algorithms
Advantagevery flexible
heuristics for route generationcomplicating constraints in route generation
Disadvantagesmall to medium size instances