Μελέτη προβλήματος βέλτιστης φόρτωσης εμπορευματοκιβωτίων
View/ Open
Subject
Εμπορεύματα -- Μεταφορές ; Logistics ; Φορτία -- ΔιακίνησηAbstract
Loading boxes inside a container is a procedure of great importance for the proper and economic function of the entire supply chain. Improving the efficiency and utilization of the available space has become a very important field of research as the global economy and transportation are becoming increasingly competitive. Finding effective methods of solving three-dimensional loading problems, is not only economically important in logistics and transport processes, but also has a significant impact on the environment, since it affects fuel consumption and therefore air pollution. Errors in this process can lead to additional costs and non-compliance schedules. Not surprisingly, therefore, the problem of optimal loading of containers has been extensively studied and various approaches have been proposed in the relevant literature. Since the optimal placement and stacking of boxes inside the containers is an extremely difficult problem to solve with conventional methods of calculation, due to the amount of possible solutions, several heuristic algorithms, which make solving of these problems clearly faster and more reliable, have been proposed. Genetic algorithms, which are a class of heuristic algorithmsfollow an evolutionary process in order to find the optimal solution. In the present study, the efficiency of the relatively new algorithm I-DBLF, as developed in MATLAB, is studied. Detailed test results of the developed instance of the algorithm, in selected problems from the relevant literature, are presented.