Font Size: a A A

Optimization Of Single Container Mix-Loading Problem

Posted on:2019-06-23Degree:MasterType:Thesis
Country:ChinaCandidate:M YuanFull Text:PDF
GTID:2439330572463948Subject:Management Science and Engineering
Abstract/Summary:PDF Full Text Request
With the development of economic globalization and the growth of China's trade,logistics has become an important economic system for the country's economic development,and it is also an important link in the production of enterprises.In the era of the Internet,"smart logistics" has also become a research hotspot.The loading of containers as a key part of the logistics process has a significant impact on the transportation efficiency and transportation costs in the logistics process.The research on"smart" packing problem has also been given a new era significance.How to use scientific methods to make container loading more efficient has great practical significance.The introduction of the packing problem began in foreign countries.The methodology for the formation of packing problems has been widely used in the industrial field.It is an important methodology in optimization theory.At the same time,many scholars have proposed many solutions to the loading problems of containers in practical applications.Program.Containers correspond to different solutions in different application scenarios.Currently,many packaging problems are mainly divided into single-box loading and multi-box loading.The main parts of the research are mostly concentrated on constraints and algorithms.Less innovation.In the case of container loading pallets,most of the existing research considers one pallet as a unit of goods for optimal loading.This paper has innovated the problem model for the container loading pallet.The case of mixed loading is proposed,that is,the goods disassembled on the pallet and the pallet are simultaneously loaded into the container,and when the goods are loaded into the container in the tray unit,due to the specification restrictions of the tray and the container,between the tray and the tray and between the tray and the container There are often many gaps,and many gaps cause a lot of space in the container to be wasted.Therefore,this paper considers that the loading rate of the container can be improved by disassembling the goods on some of the pallets and filling the gap space with smaller objects.Low target.This paper calls the effective method of single-container loading problem-two-passive greedy forward tree search algorithm,and designs a heuristic algorithm based on double-passive greedy forward tree search algorithm to effectively solve the hybrid loading problem for enterprises.Providing guiding opinions in the logistics process to help enterprises improve efficiency,reduce costs,and improve the market competitiveness of enterprises has far-reaching theoretical and practical significance.As a component of the National Natural Science Foundation's key cooperation project.Based on the research results,the research focuses on the optimization method of single-container loading problem,which provides a method basis for the hybrid loading problem.The main research progress and results are as follows:(1)According to the investigation of the actual application of the container,the problem of the mixed loading mode of the tray and the box is proposed.Through the literature research on the existing boxing problems and methods,the objective function,related constraints and method basis of the hybrid loading problem are confirmed.In the case of satisfying the actual constraints such as complete shipment,including constraints,orthogonal placement,etc.,in order to maximize the container loading rate,a solution to solve the problem based on the greedy forward tree search method is proposed.(2)For the hybrid loading problem model,two coefficients are proposed.These two coefficients determine the number of pallets and boxes to be loaded.By setting the appropriate coefficient change rule,the method based on the greedy forward tree search is called to obtain the quantity.The optimization and packing scheme to form a set of packing solutions for the mixed loading mode.By analyzing 50 packing cases,the results show that the loading rate of the hybrid loading mode is significantly higher than that of the general loading mode.The innovations of this article are:(1)Propose the mixed loading problem mode,that is,the goods that are separated from the pallet and part of the pallet are loaded into the container,and the principle that the loading tray is mainly used in the container and the loading box is supplemented,and the box is loaded for the convenience of loading and unloading.The number is just right to form several pallets.(2)This paper calls the greedy forward tree search algorithm of double iteration to solve the hybrid loading problem,and converts the hybrid loading problem into the ordinary single-container loading problem by setting certain heuristic rules,thus the single-container loading problem solution.The effectiveness is reflected in the hybrid loading problem,ensuring the quality of understanding and forming a solution to the hybrid loading problem.
Keywords/Search Tags:loading optimization, mix loading, heuristic algorithm, tree search
PDF Full Text Request
Related items