5 Discussions and Conclusion
In this research, we propose two individual optimization problems (i.e., the last mile
problem-3D bin packing and the vehicle dispatching problem) in the context of
Physical Internet. The last mile problem is a downstream problem which takes the
dimensions of the modularized boxes into account for their final distribution to
clients. By contrast, the vehicle dispatching problem is a middle stream network
problem. Its main objective is to identify the optimal transportation demand split and
the best vehicle dispatching plan (i.e., walks for vehicles in the given graph) thus that
the cost associated to empty vehicle movements is minimized. Based on these two
Fig. 3.11 The vehicle dispatching problem for operator O 1
Fig. 3.12 The vehicle dispatching problem for operator O 2
3 The Impact of Collaborative Scheduling and Routing for Interconnected. . .
55
In this research, we propose two individual optimization problems (i.e., the last mile
problem-3D bin packing and the vehicle dispatching problem) in the context of
Physical Internet. The last mile problem is a downstream problem which takes the
dimensions of the modularized boxes into account for their final distribution to
clients. By contrast, the vehicle dispatching problem is a middle stream network
problem. Its main objective is to identify the optimal transportation demand split and
the best vehicle dispatching plan (i.e., walks for vehicles in the given graph) thus that
the cost associated to empty vehicle movements is minimized. Based on these two
Fig. 3.11 The vehicle dispatching problem for operator O 1
Fig. 3.12 The vehicle dispatching problem for operator O 2
3 The Impact of Collaborative Scheduling and Routing for Interconnected. . .
55