sequence is π ! B ! E ! π. Therefore, the modularized boxes ordered by customer
B should be packed in a way that when the vehicle arrives at B, all the boxes cannot
be hindered by other boxes to the downstream customers when discharging. We
refer the proposed problem for the Physical Internet as the vehicle routing problem
coupling with 3D bin packing.
2.1 Problem Description
In this subsection, we provide the detailed problem description of the problem by
introducing the input information as well as the general objective and constraints.
Input Parameters
• The geographical information of all the customers for the last mile delivery
• The modularized boxes ordered by all the customers (i.e., numbers, dimensions,
and weights)
Fig. 3.5 The necessity to
consider the dimensions of
the modularized boxes in
packing
42
Sh. Sharif Azadeh et al.
B should be packed in a way that when the vehicle arrives at B, all the boxes cannot
be hindered by other boxes to the downstream customers when discharging. We
refer the proposed problem for the Physical Internet as the vehicle routing problem
coupling with 3D bin packing.
2.1 Problem Description
In this subsection, we provide the detailed problem description of the problem by
introducing the input information as well as the general objective and constraints.
Input Parameters
• The geographical information of all the customers for the last mile delivery
• The modularized boxes ordered by all the customers (i.e., numbers, dimensions,
and weights)
Fig. 3.5 The necessity to
consider the dimensions of
the modularized boxes in
packing
42
Sh. Sharif Azadeh et al.