Powiadomienia systemowe
- Sesja wygasła!
- Sesja wygasła!
- Sesja wygasła!
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
The paper characterises a class of problems for packing boxes in the container. It presents the current state of knowledge in this area and distinguishes evolutionary algorithms, as the most promising in the search for quasi-optimal loading conditions. The method proposed in the paper focuses on certain criteria important from a practical point of view, which in a formalised manner have not been included so far in the solving-problems models. Apart from the traditional consideration of the problem of three-dimensional space loading maximisation, the proposed method considers the deviation of the loaded container weight centre from its symmetry planes and the availability of packages during unloading. New elements in the described method are: the applied criteria, penalty function, way of coding the container loading state in the evolutionary algorithm and fast crossover and mutations operators dedicated to the adopted coding. It was observed that the evolution in the developed algorithm occurs properly, that is seeking to minimise the criteria. The article also includes a calculation example showing the effect of the method with the discussion of the results indicating the advantages and disadvantages of the proposed solution. The performance of the algorithm has been considered in the context of time necessary to obtain the acceptable solution and quality of the obtained solution. It was found that the algorithm in its current form is a strong base for its further improvement.
Czasopismo
Rocznik
Tom
Strony
65--74
Opis fizyczny
Bibliogr. 10 poz., rys., tab., wykr., wzory
Twórcy
autor
- West Pomeranian University of Technology Szczecin, Faculty of Maritime Technology and Transport, Szczecin, Poland
autor
- West Pomeranian University of Technology Szczecin, Faculty of Maritime Technology and Transport, Szczecin, Poland
Bibliografia
- [1] BOŻEJKO, W., KACPRZAK, Ł., WODECKI, M., 2014. Równoległe algorytmy populacyjne dla trójwymiarowego problemu pakowania. Konosala R. (eds.) Innowacje w Zarządzaniu i Inżynierii Produkcji. Opole: Oficyna Wydawnicza Polskiego Towarzystwa Zarządzania Produkcją, pp. 494-506.
- [2] GEORGE, J. A., ROBINSON, D. F., 1980. A heuristic for packing boxes into a container. Computer and Operations Research, 7(3), pp. 147-156.
- [3] GONÇALVES, J. F., RESENDE, M. G. C., 2013. A biased random-key genetic algorithm for a 2D and 3D bin packing problem. International Journal of Production Economics, 145, pp. 500–510.
- [4] GÜRBÜZ, M. Z., AKYOKUŞ, S., EMIROĞLU, I., GÜRAN, A., 2009. An Efficient Algorithm for 3D Rectangular Box Packing. Applied Automatic Systems: Proceedings of Selected AAS 2009 Papers, Ohrid 26-29.09.2009, pp. 131-134.
- [5] KACPRZAK, Ł., RUDY, J., ŻELAZNY, D., 2014. Wielokryterialny trójwymiarowy problem pakowania. Gospodarka Materiałowa i Logistyka, 11, pp. 40-44.
- [6] LODI, A., MARTELLO, S., VIGO, D., 2002. Heuristic algorithms for the three-dimensional bin packing problem. European Journal of Operational Research, 141(2), pp. 410-420.
- [7] SUAREZ, J. G., ANTICONA, M. T., 2010. Two GRASP Metaheuristic for the Capacitated Vehicle Routing Problem Considering Split Delivery and Solving the Three Dimensional Bin Packing Problem. Advances in Information Sciences and Service Sciences, 2(2), pp. 42–50.
- [8] MAAROUF, W. F., BARBAR, A. M., OWAYJAN, M. J.,2008. A New Heuristic Algorithm for the 3D Bin Packing Problem. Innovations and Advanced Techniques in Systems, Computing Sciences and Software Engineering, pp. 342-345.
- [9] WU, Y., LI, W., GOH, M., SOUZA, R., 2010. Three-dimensional bin packing problem with variable bin height. European Journal of Operational Research, 202(2), pp. 347-355.
- [10] YAP, W. Y., LAM, J. S. L., 2013. 80 million-twenty-foot equivalent-unit container port? Sustainability issues in port and coastal development. Ocean & Coastal Management, 71, pp. 13-25.
Uwagi
PL
Opracowanie rekordu w ramach umowy 509/P-DUN/2018 ze środków MNiSW przeznaczonych na działalność upowszechniającą naukę (2018).
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-b92195e2-dcc4-4278-9f91-b4fee8c93b56