Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: container packing

Sortuj według:

Ogranicz wyniki do:

Fast truck-packing of 3D boxes

Józefowska J., Pawlak G., Pesch E., Morze M., Kowalski D.

Engineering Management in Production and Services

2018

Vol. 10, no. 2

29--40

We present formulation and heuristic solution of a container packing problem observed in a household equipment factory’s sales and logistics department. The main feature of the presented MIP model is combining several types of constraints following from the considered application field. The developed best-fit heuristic is tested on the basis of a computational experiment. The obtained results show that the heuristic is capable of constructing good solutions in a very short time. Moreover, the approach allows easy adjustment to additional loading constraints.

Multi-objective evolutionary method for cargo arrangement in a loading space

Taraska M., Iwańkowicz R.

Archives of Transport

2017

Vol. 44, iss. 4

65--74

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.