vehicle routing problem
TRANSCRIPT
![Page 1: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/1.jpg)
Photo by Doha Sam - Creative Commons Attribution-NonCommercial-ShareAlike License https://www.flickr.com/photos/46575101@N00 Created with Haiku Deck
Presenter:
Arian Razmi Farooji
10 February 2015
![Page 2: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/2.jpg)
List of Contents
1. Introduction
2. Vehicle Routing Problem (VRP)
3. VRP Components
4. VRP Characteristics
4-1 Traveling Salesman Problem (TSP)
4-2 Bin-Packing Problem
5. Importance and Application
6. VRP Assumptions
Vehicle Routing Problem – Arian Razmi Farooji 1
![Page 3: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/3.jpg)
List of Contents (Cont.)
7. VRP Mathematical Formulation
8. VRP Variants8-1 CVRP
8-2 VRPTW
8-3 HFVRP
8-4 TDVRP
9. References
Vehicle Routing Problem – Arian Razmi Farooji 2
![Page 4: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/4.jpg)
1. Introduction
• The role and importance of transportation in economic growth
1. Transporting fuel, raw materials and machineries
2. Balancing strong and weak economic regions
3. Guaranteeing manufacturing and production of goods
• Transportation and the end price
Vehicle Routing Problem – Arian Razmi Farooji 3
![Page 5: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/5.jpg)
2. Vehicle Routing Problem (VRP)
• Introduced by Dantzig and Ramser in 1959
• Goal:
“ To plan a set of routes for some vehicles which are located
in one or more depot(s) in order to serve some customers in
less possible Travel Time, Travel Costs or Travel distance ”
Vehicle Routing Problem – Arian Razmi Farooji 4
![Page 6: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/6.jpg)
3. VRP Components
1. Depots
2. Customers
3. Vehicles
4. Routes
Vehicle Routing Problem – Arian Razmi Farooji 5
![Page 7: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/7.jpg)
3-1. Depots
Vehicle Routing Problem – Arian Razmi Farooji 6
• A Depot is the starting point and the finishing point of VRP.
• A VRP can have one or more depots.
![Page 8: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/8.jpg)
3-2. Customers
Vehicle Routing Problem – Arian Razmi Farooji 7
• The goal of VRP is to service the customers.
• Customers are spread around the Depot(s).
• Their demands can be definitive or stochastic.
![Page 9: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/9.jpg)
3-3. Vehicles
Vehicle Routing Problem – Arian Razmi Farooji 8
• Vehicles’ characteristics are:1. Capacity2. Cost3. Departure4. Maximum traveling
time5. Number of Vehicles
![Page 10: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/10.jpg)
3-4. Routes
Vehicle Routing Problem – Arian Razmi Farooji 9
• Routes 1. Connect customers
together.
2. Can have different travel time and cost.
3. Can be one-or two-way.
![Page 11: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/11.jpg)
4. VRP Characteristics
• An NP-Hard Combinatorial Problem
• Based on two well-studied following problems:
1. Bin Packing Problem
2. Travelling Salesman Problem
Vehicle Routing Problem – Arian Razmi Farooji 10
![Page 12: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/12.jpg)
4-1. Bin Packing Problem (BPP)
Vehicle Routing Problem – Arian Razmi Farooji 11
• BPP is about how to put n items in m bins, to thedegree in which volume and weight of the items mustnot exceed the maximum limit of bins.
2
1 6
5
4
3
Bin 1 Bin 2
![Page 13: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/13.jpg)
4-2. Travelling Salesman Problem (TSP)
Vehicle Routing Problem – Arian Razmi Farooji 12
![Page 14: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/14.jpg)
Vehicle Routing Problem in a glance
Vehicle Routing Problem – Arian Razmi Farooji 13
D
![Page 15: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/15.jpg)
Vehicle Routing Problem in a glance
Vehicle Routing Problem – Arian Razmi Farooji 14
D
![Page 16: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/16.jpg)
VRP- an example of everyday life
Vehicle Routing Problem – Arian Razmi Farooji 15
![Page 17: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/17.jpg)
5. Importance and Applications
• Reducing between 5 to 20% of transportation cost
• Reduction of 10 to 20% of products end price
• Avoiding delivery delays and increasing customers satisfaction
• Saving fuel and environmentally related issues
Vehicle Routing Problem – Arian Razmi Farooji 16
![Page 18: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/18.jpg)
6. VRP Assumptions
1. Each customer must be served once and by one of the available vehicles.
2. Each tour starts from and ends to one depot.
3. Sum of customer demands of each tour must not exceed the vehicles’ capacity.
4. Total travelling distance or time must not exceed their maximum limit.
Vehicle Routing Problem – Arian Razmi Farooji 17
![Page 19: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/19.jpg)
7. VRP Mathematical Formulation
• We assume that 𝐺 𝑉, 𝐴 is a complete graph.
• Decision Variable:
𝑥𝑖𝑗
Vehicle Routing Problem – Arian Razmi Farooji 18
{1 if vehicle travels from i to j
0 if vehicle does not travel from i to j
![Page 20: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/20.jpg)
7. VRP Mathematical Formulation
• Objective Function
Subject to
Vehicle Routing Problem – Arian Razmi Farooji 19
min
𝑖∈𝑉
𝑗∈𝑉
𝑐𝑖𝑗 𝑥𝑖𝑗 (1)
𝒊∈𝑽
𝒙𝒊𝒋 = 𝟏∀ 𝒋 ∈ \V{𝟎} (2)
𝑗∈𝑉
𝑥𝑖𝑗 = 𝟏∀ 𝒊 ∈ \V{𝟎} (3)
![Page 21: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/21.jpg)
7. VRP Mathematical Formulation
Vehicle Routing Problem – Arian Razmi Farooji 20
𝒊∈𝑽
𝒙𝒊𝟎 = 𝑲(4)
𝑗∈𝑉
𝑥0𝑗 = 𝑲(5)
𝑖∉𝑆
𝑗∈𝑆
𝑥𝑖𝑗 ≥ 𝑟(𝑆)∀ 𝑆 ⊂ 𝑉{0}, 𝑆 ≠ 𝜃 (6)
𝑥𝑖𝑗 ∈ 0,1 ∀ 𝑖, 𝑗 ∈ 𝑉 (7)
![Page 22: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/22.jpg)
8. VRP Variants
• There are many VRP variants based on problems we face in real world.
1. Capacitated Vehicle Routing Problem (CVRP)
2. Vehicle Routing Problem with Time-windows (VRPTW)
3. Vehicle Routing Problem with Heterogeneous Fleet (HFVRP)
4. Time-dependent Vehicle Routing Problem (TDVRP)
5. Vehicle Routing Problem with Multiple Depots (MDVRP)
6. …
• Most of the time a new variant based on the real-world needs is made.
Vehicle Routing Problem – Arian Razmi Farooji 21
![Page 23: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/23.jpg)
8-1. CVRP
1. The most studied VRP
2. Customers’ demands are definitive and known in advance.
3. Vehicles are identical.
4. Sum of customers’ demands must not exceed the vehicles’ capacity.
• Goal:
“ service all the customers in which the total travel costs will be minimized.”
Vehicle Routing Problem – Arian Razmi Farooji 22
![Page 24: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/24.jpg)
8-2. VRPTW
1. An extension to CVRP
2. Each customer has a time-window and that customer should be served during his or her own time-window.
3. Time windows can be :• Soft delays will be punished
• Hard no allowance for delays
• Goal:
“ servicing all the customers in which the total travel costs, waiting times and delays will be minimized.”
Vehicle Routing Problem – Arian Razmi Farooji 23
![Page 25: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/25.jpg)
8-3. HFVRP
1. Different Vehicles, different capacities
2. Each vehicle type has its own fixed and variable cost.
3. There can be some restrictions for some vehicles
• Goal:
“ servicing all the customers in which the total travel costs ( fixed + variable costs) will be minimized.”
Vehicle Routing Problem – Arian Razmi Farooji 24
![Page 26: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/26.jpg)
8-4. TDVRP
1. Less-studied VRP
2. Relates to urban logistics
3. Considers that the vehicles travel speed is not constant during serving customers.
4. Can be also applied to green logistics
• Goal:
“ serving all the customers in which number of routes and the total travel costs will be minimized.”
Vehicle Routing Problem – Arian Razmi Farooji 25
![Page 27: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/27.jpg)
Assignment
• Write down a short summary about what already was discussedduring this session.
• Research the answer of the following question:
“ What are the relationships of Vehicle Routing Problem with Travelling Salesman Problem and Bin Packing Problem?”
Vehicle Routing Problem – Arian Razmi Farooji 26
![Page 28: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/28.jpg)
9. References
• Dantzig, G.B., Ramser, J.H., 1959, The truck dispatchingproblem, Management Science, 6-80.
• Figliozzi, M.A., 2012, The time dependent vehicle routingproblem with time windows: Benchmark problems, an efficientsolution algorithm, and solution characteristics, TransportationResearch Part E, 48, 616-636
• Malandraki, C., Daskin, M.S., 1992, Time-dependent vehicle-routing problems – formulations, properties and heuristicalgorithms. Transportation Science, 26 (3), 185–200.
• Toth, P., Vigo, D., 2002, The Vehicle Routing Problem, Societyfor Industrial and Applied Mathematics Philadelphia.
Vehicle Routing Problem – Arian Razmi Farooji 27
![Page 29: Vehicle Routing Problem](https://reader033.vdocuments.net/reader033/viewer/2022050808/55aaec811a28ab7d388b464b/html5/thumbnails/29.jpg)
Photo by Doha Sam - Creative Commons Attribution-NonCommercial-ShareAlike License https://www.flickr.com/photos/46575101@N00 Created with Haiku Deck
Presenter:
Arian Razmi Farooji
10 February 2015