Home delivery service is one of the most important cost drivers in e-commerce industry. We consider the three-dimensional container packing problem under home delivery service, where each rectangular item with its spe...
详细信息
Home delivery service is one of the most important cost drivers in e-commerce industry. We consider the three-dimensional container packing problem under home delivery service, where each rectangular item with its specific destination is loaded orthogonally onto a rectangular container so that the utilization rate of the container space is maximized. In our framework, we assume the routing of a consignment to be given, which turns out that there is an order of unloading items with respect to the consignment. If we load items without considering the order of unloading items, we may unload and reload other unconcerned items drastically while unloading the required item. Therefore, in this paper, the unloading costs for a consignment are precisely defined according to the invisible and untouchable rule, and a subvolume scheme based algorithm is proposed. Our experimental results suggest our approach to be promising.
This paper considers the three-dimensional container packing problem (3DCPP) under home delivery service, which predetermines an ordering of delivering ordered cargo boxes to customers, and aims to load a subset of th...
详细信息
This paper considers the three-dimensional container packing problem (3DCPP) under home delivery service, which predetermines an ordering of delivering ordered cargo boxes to customers, and aims to load a subset of those boxes according to the delivery ordering into a 3D car container with maximal utilization ratio of the container space while prohibiting the process of delivering cargos to each customer from unloading and subsequent reloading of boxes. In practice, cargos can be taken out from not only the rear door of the delivery container but also the side door. Nonetheless, the previous research only considered the case with only a single door. Therefore, this paper establishes the model for the two-door 3DCPP under home delivery service. Furthermore, the rule of invisible and untouchable items and the subvolume-based approach for the one-door problem are extended to resolve the two-door problem. Last, simulation analysis verifies performance of our approach.
In this paper, we address the practical problem of packing multiple items into containers for further transport. Dense packing of containers can significantly decrease supply chain costs, since transport fees are rela...
详细信息
ISBN:
(纸本)9781538664452
In this paper, we address the practical problem of packing multiple items into containers for further transport. Dense packing of containers can significantly decrease supply chain costs, since transport fees are related to the the number of used containers and not the content. This practical problem is generally modeled using the vector bin packingproblem (VBPP) and its variations. In the recent years, the heterogeneous VBPP with two sets of constraints has proven to be a good representation of containerpacking related problems. In this work we extend this model to a more realistic setting, by allowing multiple containers of the same type. To solve this problem, an integer program is designed. To be able to find feasible solutions for large scale problem instances, a greedy constructive algorithm is developed. With the intention of improving the solutions generated in this way, a local search is developed and used to extend the greedy algorithm to the Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic. To evaluate the potential of using GRASP on this problem, several variations are designed and implemented. In our computational experiments, we have generated test instances based on real-world data. Experimental results show that the designed metaheuristic approaches provide high quality solutions compared to solutions obtained by the CPLEX solver. Further, one of the proposed GRASP variants has been adapted for the homogeneous VBPP and tested on standard benchmark instances in order to evaluate its performance against existing metaheuristic. The final conclusion is that the GRASP presents a promising approach for more challenging instances for which CPLEX cannot find feasible solution within a reasonable time limit.
One of the key aspects of the Physical Internet (PI) is the use of standardized, modular containers that enable the coordination of shipments across the supply chain. However, a key open question is how will limiting ...
详细信息
One of the key aspects of the Physical Internet (PI) is the use of standardized, modular containers that enable the coordination of shipments across the supply chain. However, a key open question is how will limiting the choice of containers impact the amount of volume that is shipped? We present a mathematical model to determine that impact and report our results for data sets that are based on data from a consumer packaged goods company.
暂无评论