Chapter 6.

Transportation model for reverse logistics

Ph.D. Nguyen Duc Duy

1
 Typical Problem
• Vehicle Routing Problems with Backhauls (VRPB): where customers can return some commodities
are very common. Therefore all deliveries for each route must be completed before any pickups are
made. Then, it also becomes necessary to take into account that the goods which customers return to
the deliverer must fit into the vehicle.

Saremi, A., ElMekkawy, T. Y., & Wang, G. G. (2007). Tuning the parameters of a memetic algorithm to solve vehicle routing problem with backhauls using design of
experiments. International Journal of Operations Research, 4(4), 206-219.

Duc Duy Nguyen – [email protected] 2

Typical Problem
• Vehicle Routing Problem with Simultaneous Distribution and Collection: is a
generalized version of the VRP that not only includes deliveries but also enables pickup of
products from the customers.

Duc Duy Nguyen – [email protected] 3

 Typical Problem

The traditional Vehicle Routing Problem (VRP) Dynamic Vehicle Routing Problem (DVRP)
Kaiwartya, O., Tiwari, P. K., Kumar, S., & Prasad, M. (2016). Dynamic Vehicle Routing Solution in the Framework of Nature-Inspired Algorithms.
In Designing and Implementing Global Supply Chain Management (pp. 36-50). IGI Global.
Duc Duy Nguyen – [email protected] 4
Vehicle Routing Problem with Simultaneous Distribution
and Collection
Dell’Amico, M., Righini, G., & Salani,
M. (2006). A branch-and-price
approach to the vehicle routing
problem with simultaneous
distribution and collection.
Transportation science, 40(2), 235-
247.

Duc Duy Nguyen – [email protected] 5

Vehicle Routing Problem with Simultaneous Distribution and
Collection
▪ The VRP with simultaneous delivery and collection (VRPSDC) is a basic
problem in reverse logistics and can be described as follows:
• A set of vehicles of limited capacity must visit a set of customers located on a
transportation network;
• each customer requires a delivery of a given amount of goods, a collection of a
given amount of waste, or both;
• all vehicles start from a common depot and must travel back to it;
• all goods are transported from the depot to the customers and all waste must be
transported from the customers to the depot;
• the goal is to minimize the overall length of the vehicle routes.

Duc Duy Nguyen – [email protected] 6

Application

Duc Duy Nguyen – [email protected] 7

Problem Formulation

Notation

▪ A VRPSDC instance is defined by the following

data:
• a set N of customers to be visited, numbered
1..N;
• a depot, numbered 0;
• a directed graph G=(N+, A) with vertex set N+=N
∪ {0} including the customers and the depot and
with a complete arc set A;
• a weight function satisfying the triangular
inequality (cij ≤ cik + ckj for all i,j, k ∈ N+)

Duc Duy Nguyen – [email protected] 8

Problem Formulation

Notation

▪ An integer nonnegative collection demand pi and an integer nonnegative

delivery demand di associated with each customer i ∈ N;
▪ A maximum number K of available vehicles;
▪ A capacity Q of each vehicle.

Duc Duy Nguyen – [email protected] 9

Vehicle Routing Problems with Backhauls (VRPB)

Decision variable

▪ Xij = a binary variable which is equal to 1 if there is an arc from node i to node j
▪ P𝑖𝑗 and Dij indicate respectively the amount of collected load and delivery load
carried along arc (i, j).

Duc Duy Nguyen – [email protected] 10

Vehicle routing problem with backhauls

Objective function
Minimize the transportation cost.

i=N j=N
z =   Cij xij
i =0 j =0

Duc Duy Nguyen – [email protected] 11

Vehicle routing problem with backhauls

Constraints

▪ Constraints (2) force every customer to be visited once;

j=N

x
j =0
ij = 1 i = 1,..., N

Duc Duy Nguyen – [email protected] 12

Vehicle routing problem with backhauls

Constraints

▪ Constraint (3) implies that no more than K vehicles can be used;

j=N

x
j =1
0j K

Duc Duy Nguyen – [email protected] 13

Vehicle routing problem with backhauls

Constraints

▪ Constraints (4), (5), and (6) are flow conservation constraints on the number of
vehicles and on the amounts of pick-up and delivery load
j=N j=N

x =x
j =0
ij
j =0
ji i = 0,..., N

j=N j=N

P −P
j =0
ij
j =0
ji = pi i = 1,..., N

j=N j=N

D −D
j =0
ij
j =0
ji = di i = 1,..., N
Duc Duy Nguyen – [email protected] 14
Vehicle routing problem with backhauls

Constraints

▪ Constraints (7) ensure that the vehicle capacity is not exceeded.

Pij + Dij  Q  xij i = 0,..., N ; j = 0,..., N

xij  {0,1} i = 0,..., N ; j = 0,..., N

Pij , Di j  0 i = 0,..., N ; j = 0,..., N

Duc Duy Nguyen – [email protected] 15

Example 100
40
1 4
100
10
2 200
50

200
0 20
3 0
300 5
30 500
3x

Duc Duy Nguyen – [email protected] 16

Example Distance 0 1 2 3 4 5
0 0 10 10 10 10 10
1 10 0 10 10 10 10
▪ Sum of nodes: 5 2 10 10 0 10 10 10
3 10 10 10 0 10 10
▪ Number of trucks: 3
4 10 10 10 10 0 10
▪ Truck capacity: 500 5 10 10 10 10 10 0

Node 1 2 3 4 5
Delivery 100 200 300 100 200
Collection 40 50 30 10 20

Duc Duy Nguyen – [email protected] 17

Results

▪ Route 1: 0>1>3>0
▪ Route 2: 0>4>2>0
▪ Route 3: 0>5>0

Duc Duy Nguyen – [email protected] 18

 Example
0
3
20

200
0
20 2
0 20
0
5
200
1
0

Route 3: 0>5>0

Duc Duy Nguyen – [email protected] 19

 Do it by yourself
Route 2: 0>2>4>0

200
3 100
0
10
200 4
50

200
2 200
0 0 4
0 0

200
1
0

Duc Duy Nguyen – [email protected] 20

 Do it by yourself
Route 1: 0>1>3>0
200
100 0
40
1 200
0

0
300 0
30
3 200
0
200
0

Duc Duy Nguyen – [email protected] 21

This Page Intentionally Left Blank

22