Šio darbo tikslas – sukurti trimačių dėžių su papildomu orientacijos erdvėje apribojimu pakavimo optimizavimo algoritmą, o realizavus jį programinėmis priemonėmis – ištirti jo efektyvumą su atsitiktinai sugeneruotų kraunamų dėžių rinkiniais ir prie skirtingų algoritmo veikimo parametrų. Taip pat sukurti ir pakavimo optimizavimo sprendinio vizualizavimo trimatėje erdvėje programinę įrangą. / Presented work covers one of the most complex areas of combinatorial optimization – three dimensional bin packing problem. Solution methods of this problem are applied in the real world from logistics, packing optimization to VLSI circuit and automobile engineering. Several heuristic packing algorithms suggested by other authors are analyzed. Approach based on tree-search and wall building strategy is chosen to create a 3D packing optimization algorithm. A bin orientation in space restriction is added to classical 3D bin packing problem to make it more complex and more suited for real world applications. A prototype of created algorithm is created and tested with randomly generated data collections. Each data sample is processed with and without bin orientation in space restriction. Influence of restriction and maximal tree width on packing efficiency and computational time is statistically analyzed. Visualization tool based on Microsoft Direct X technology is created to view results of packing optimization.

Whether you are in industrial manufacturing striving to optimize your supply chain, international or domestic carrier committed to lower your operational costs, retailer dedicated to run your distribution network more efficiently, or anywhere else where the words "cargo", "freight", "shipment" are in your business language, automated load planning and optimization will significantly improve your business process. While the concept of computerized simulation of 3D load building is not new, with some companies offering software solutions for "virtual" loading, no one has a single product that is capable to handle complex variety of business rules and constraints of the modern transportation industry. We are analyzing the problems related with 3D box loading and then to analyze existing 3D load building systems. After accumulating all analyzes data we are having enough experience to create our own algorithm. And we did it! We create 3D box loading algorithm witch is fast and accurate and 3D box loading system which is using this new algorithm. To ensure that we succeeded we compare this new system with existing 3D box loading software to make sure that it’s really useful for solving logistic problems. After testing we are sure that we made a big job and we have created system, which can compete with the logistic IT leaders made solutions.