Scribd
Upload
242 views

Vehicle Routing Algorithm SCM

The document discusses vehicle routing problems and algorithms. It defines the vehicle routing problem (VRP) as finding the optimal set of routes for a fleet of vehicles to deliver to customers. The VRP generalizes the travelling salesman problem (TSP). Common objectives are to minimize costs, number of vehicles, or time variations. Routing problems are classified and various algorithms are described, including the nearest neighbour procedure and scheduling service vehicles to address time windows. The document also discusses capacitated vehicle routing, time windows, and pickup and delivery problems.

Uploaded by

aashay sheware
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
242 views

Vehicle Routing Algorithm SCM

The document discusses vehicle routing problems and algorithms. It defines the vehicle routing problem (VRP) as finding the optimal set of routes for a fleet of vehicles to deliver to customers. The VRP generalizes the travelling salesman problem (TSP). Common objectives are to minimize costs, number of vehicles, or time variations. Routing problems are classified and various algorithms are described, including the nearest neighbour procedure and scheduling service vehicles to address time windows. The document also discusses capacitated vehicle routing, time windows, and pickup and delivery problems.

Uploaded by

aashay sheware
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 19

Vehicle Routing

Algorithm
Vehicle Routing Problem

 The vehicle routing problem (VRP) is a combinatorial optimization and 


integer programming problem:
 which asks "What is the optimal set of routes for a fleet of vehicles to traverse in order
to deliver to a given set of customers?”

  It generalises the well-known travelling salesman problem (TSP)

 EXAMPLE
Consider a milk van delivering milk to four distribution centers (DC) every day
morning.
A figure illustrating the vehicle routing
problem
WHY VRP?

 The objective function of a VRP can be very different depending on the particular
application of the result but a few of the more common objectives are: [2]
 Minimize the global transportation cost based on the global distance travelled as well
as the fixed costs associated with the used vehicles and drivers
 Minimize the number of vehicles needed to serve all customers
 Least variation in travel time and vehicle load
 Minimize penalties for low quality service
Classification of Routing Problems

1. Traveling Salesman Problem (TSP)


2. Multiple Traveling Salesman Problem (MTSP)
3. The Clarke and Wright savings algorithm 
TSP,MTSP,C-W Savings Algorithm

 The first classic VRP is known as the traveling salesman problem (TSP).


1. travel costs between two nodes are the same regardless of the direction traveled.
2. no delivery time restrictions.

 With time, VRP was categorized into much more sophisticated tasks involving large
chunks of data.
 Similarly MTSP(Multiple Traveling Salesman Problem ) is an extension of the TSP used
when a fleet of vehicles have to be routed from a single depot.
 The Clarke and Wright savings algorithm is one of the most known heuristic for VRP. It
applies to problems for which the number of vehicles is not fixed (it is a decision
variable), and it works equally well for both directed and undirected problems. 
The example of a solved traveler salesman problem – the
optimal route for Pokémon Go players created by
developer Andrew Briz
Solution Approach to Routing
Problems

1. Nearest Neighbour Procedure (NNP)


2. Scheduling Service Vehicles.
Nearest Neighbour Procedure
(NNP)

 Builds a tour based on the cost or distance of traveling from the last-visited node to
the closest node in the network.
 STEPS Involved are:
1. Start with a node at the beginning of the tour (say depot node)
2. Find the node closest to the last node and add to the tour.
3. Find the node closest to the last node and add to the tour.
4. Connect the first and the last node to form a complete tour .
Example of NNP
Scheduling Service Vehicles

 Scheduling problems have delivery-time restrictions with specified starting and ending
times for a service in advance.
 Subway schedules fall into this category. These problems consists of a ,
i. set of tasks, each with starting time and ending times
ii. set of directed arcs with starting and ending locations.
The set of vehicles may be housed at one or more depots.

 Consider the network shown below with a depot serving to five locations (nodes) with
specified starting time,S and Ending time, E in AM.
Example of Scheduling Service
Vehicles
CONTINUE…..
 The procedure is as follows:
i. Order all tasks by starting times
ii. Assign first task to vehicle 1
iii. For the remaining number of tasks, assign the next task to vehicle that has the
minimum deadhead time to that task. Otherwise create a new vehicle and assign the
task to it.
iv. By doing so, the schedule obtained for the example given above is as follows:
Capacitated Vehicle Routing Problem (CVRP)

 Since each vehicle has a maximum load capacity, you must always consider the
weight and volume of what’s being transported. The challenge is to save costs by
transporting more goods in one trip without exceeding the vehicle’s capacity.
 There might be additional complications like:
 multiple depots
 limited subset of vehicles that have a specific facility in demand (e.g. a freezer
compartment)
 different dimensions of cargo to deliver/pick up
 different capacity of each vehicle
 multi-compartment vehicles
Vehicle Routing Problem with Time Windows
(VRPTW)

 Often customers are available during a specific period of time only.


  Now a vehicle has to reach a customer within a prioritized timeframe.
  When a time window opens, a vehicle should serve the customer. It may arrive
beforehand, but, by no means, outside the set time window.
 Falling behind schedule can significantly drop customer satisfaction level leading to
profit loss in the long run. 
 We have to do it in the most cost-efficient way. 
Time windows can be:

 multiple time windows: a set of non-overlapping time windows with different lengths
 disjoint time windows: arriving between two time windows, a vehicle must wait until
the next time window opens
 soft time windows: serving outside the time window is allowed, but it entails penalties
 hard time windows: no time violations are permitted. If a vehicle arrives too early, it
must wait until the time window opens; and it is not allowed to arrive late.
Pickup and Delivery Vehicle Routing
Problem (PDVRP)

 Each vehicle picks up items/passengers at location A and drops them off at location B.
 No depot is involved.
 A common case is on-demand transportation – supplying services in direct response to
customer requests (e.g. taxi, shuttle service, buses, etc.).
 Associated with origin and destination, routing results in paired pickup and delivery
points.
 Real-life scenario: This problem concerns transportation requests. Take Uber as an
example. The system has to efficiently assign drivers to locations so that it takes them
the least time to get there and pick up a customer.
ADVANTAGES

 Accuracy. In manual route planning, one minor mistake in calculations may lead to
huge losses
 Cost-efficiency
 Speed
 Increase in profits
 Enhanced satisfaction
THANK YOU…..

You might also like