21 research outputs found
Solving Pallet loading Problem with Real-World Constraints
Efficient cargo packing and transport unit stacking play a vital role in
enhancing logistics efficiency and reducing costs in the field of logistics.
This article focuses on the challenging problem of loading transport units onto
pallets, which belongs to the class of NP-hard problems. We propose a novel
method for solving the pallet loading problem using a branch and bound
algorithm, where there is a loading order of transport units. The derived
algorithm considers only a heuristically favourable subset of possible
positions of the transport units, which has a positive effect on computability.
Furthermore, it is ensured that the pallet configuration meets real-world
constraints, such as the stability of the position of transport units under the
influence of transport inertial forces and gravity.Comment: 8 pages, 1 figure, project report pape
Real-polarized genetic algorithm for the three-dimensional bin packing problem
This article presents a non-deterministic approach to the Three-Dimensional Bin Packing Problem, using a genetic algorithm. To perform the packing, an algorithm was developed considering rotations, size constraints of objects and better utilization of previous free spaces (flexible width). Genetic operators have been implemented based on existing operators, but the highlight is the Real-Polarized crossover operator that produces new solutions with a certain disturbance near the best parent. The proposal presented here has been tested on instances already known in the literature and real instances. A visual comparison using boxplot was done and, in some situations, it was possible to say that the obtained results are statistically superior than the ones presented in the literature. In a given instance class, the presented Genetic Algorithm found solutions reaching up to 70% less bins
An online packing heuristic for the three-dimensional container loading problem in dynamic environments and the Physical Internet
In this paper, we consider the online three-dimensional container loading problem. We develop a novel online packing algorithm to solve the three-dimensional bin packing problem in the online case where items are not know well in advance and they have to be packed in real-time when they ar-rive. This is relevant in many real-world scenarios such as automated cargo loading in warehouses. This is also relevant in the new logistics model of Physical Internet. The effectiveness of the online packing heuristic is evalu-ated on a set of generated data. The experimental results show that the algo-rithm could solve the 3D container loading problems in online fashion and is competitive against other algorithms both in the terms of running time, space utilization and number of bins
Container Loading Problems: A State-of-the-Art Review
Container loading is a pivotal function for operating supply chains efficiently. Underperformance results in unnecessary costs (e.g. cost of additional containers to be shipped) and in an unsatisfactory customer service (e.g. violation of deadlines agreed to or set by clients). Thus, it is not surprising that container loading problems have been dealt with frequently in the operations research literature. It has been claimed though that the proposed approaches are of limited practical value since they do not pay enough attention to constraints encountered in practice.In this paper, a review of the state-of-the-art in the field of container loading will be given. We will identify factors which - from a practical point of view - need to be considered when dealing with container loading problems and we will analyze whether and how these factors are represented in methods for the solution of such problems. Modeling approaches, as well as exact and heuristic algorithms will be reviewed. This will allow for assessing the practical relevance of the research which has been carried out in the field. We will also mention several issues which have not been dealt with satisfactorily so far and give an outlook on future research opportunities