CN114330822A - Three-dimensional boxing method and system - Google Patents
Three-dimensional boxing method and systemDownload PDFInfo
- Publication number
- CN114330822A CN114330822ACN202111385597.2ACN202111385597ACN114330822ACN 114330822 ACN114330822 ACN 114330822ACN 202111385597 ACN202111385597 ACN 202111385597ACN 114330822 ACN114330822 ACN 114330822A
- Authority
- CN
- China
- Prior art keywords
- carriage
- order
- goods
- loaded
- volume
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Abstract
Description
Translated fromChinese技术领域technical field
本发明涉及物流系统设备技术领域，具体涉及一种基于遗传算法的三维装箱方法及系统。The invention relates to the technical field of logistics system equipment, in particular to a three-dimensional packing method and system based on a genetic algorithm.
背景技术Background technique
随着物流行业的快速发展，为解决箱柜类货物装载过程中存在的效率低下，人工成本高的问题，越来越多的企业开始关注于物流配送过程的优化。装箱作为仓储运输中重要的一个环节，借助于三维装箱技术，装箱工作人员可以根据系统推荐的订单顺序以及订单内物品的摆放方式有序装载货物，最大化的利用装载空间。所以三维装箱技术，对于提高物流装载，资源分配等方面的改进具有重要的实际应用价值。With the rapid development of the logistics industry, in order to solve the problems of low efficiency and high labor costs in the loading process of container goods, more and more enterprises have begun to focus on the optimization of the logistics distribution process. Packing is an important part of warehousing and transportation. With the help of three-dimensional packing technology, packing staff can load goods in an orderly manner according to the order sequence recommended by the system and the arrangement of items in the order, and maximize the use of loading space. Therefore, the three-dimensional packing technology has important practical application value for improving logistics loading, resource allocation and other aspects.
三维装箱问题，是一类组合优化问题，是一种为物流中心优化装箱秩序的系统，目的旨在提高装箱率，减少箱体的占用，继而减少成本。在实际的装箱中，仓中货物由公司仓库管理系统下单后，经配货系统打印出的配货单后，由仓库配货员为下单的客户配货，之后货物由中心仓运输到各个地区。每批货物一般会分成N个订单，按照派送的顺序送达到各个地区。在装箱的过程中会有很多的约束：每种货物的载重级别；套机的约束；摆放限制的约束；承重面的约束(比方说，冰箱立放可以承重，则选择；卧放就不能承重，则去除选择)；摆放的方向等。随着货物量的增大，物品种类的增加，装载的约束条件也就越多。目前该领域利用传统的人工装载策略的方式，已经无法满足当前业务需要，使用人工装载的方式在装卸过程中物品的摆放大都是依靠装卸工作人员的经验得到的，系统性较差，并且随着货物种类的增加，也会消耗更多的时间成本。所以，在装箱之前先设计出一份合理的装箱方案，才能提高装载率，节约时间。The three-dimensional packing problem is a kind of combinatorial optimization problem. It is a system that optimizes packing order for logistics centers. In the actual packing, after the goods in the warehouse are ordered by the company's warehouse management system, after the distribution list printed by the distribution system, the warehouse distribution staff will distribute the goods for the customer who placed the order, and then the goods will be transported by the central warehouse to various regions. Each batch of goods is generally divided into N orders and delivered to various regions according to the order of delivery. There will be many constraints in the process of packing: the load level of each kind of goods; the constraints of the set machine; the constraints of the placement limit; If it cannot bear weight, remove the selection); the direction of placement, etc. With the increase in the amount of goods, the variety of items increases, and the constraints on loading become more numerous. At present, the traditional manual loading strategy in this field has been unable to meet the current business needs. In the manual loading method, the placement of items in the loading and unloading process is mostly obtained by the experience of the loading and unloading staff, which is less systematic and varies with With the increase in the variety of goods, it will also consume more time costs. Therefore, designing a reasonable packing plan before packing can improve the loading rate and save time.
在实际的装车过程中，一个装箱顺序的优劣与否并不是单独的由一个箱体的位置决定的，一段连续的装箱序列或者说一部分的箱体编码区间才是决定整个装箱效果是否优秀的关键。在传统的优化领域，对于装箱优化的算法有很多，比如，George等提出以空间分割为原则的启发式算法，建立一种标准的装箱秩序，这种方法可以降低使用以空间分割原则的启发式算法进行装填时，由于没有引导约束而产生的局部装填混乱，从而更加接近真实的最优解。但是该算法的最终结果依赖于初始装箱序列，如果初始装箱序列不高，容易陷入局部最优。张雅舰等在遗传算法导入降序最佳适应算法提高求解速度；游伟等提出了一种混合遗传算法，将关键点构造法与遗传算法结合；但是以上两种方法都是针对与约束少的小件货物，所以应用的范围比较有限，翟钰结合遗传算法的概念提出混合遗传算法，这种算法的初始方案对装箱序列的影响降低了，但是算法的鲁棒性较低。In the actual loading process, the quality of a packing sequence is not determined by the position of a box alone. A continuous packing sequence or a part of the box coding interval determines the entire packing. The key to whether the effect is excellent. In the traditional optimization field, there are many algorithms for packing optimization. For example, George et al. proposed a heuristic algorithm based on the principle of space division to establish a standard packing order. This method can reduce the use of space division principles. When the heuristic algorithm is used for filling, the local filling confusion caused by the absence of guiding constraints is closer to the real optimal solution. However, the final result of the algorithm depends on the initial packing sequence. If the initial packing sequence is not high, it is easy to fall into a local optimum. Zhang Yajian et al. introduced the descending optimal adaptation algorithm to the genetic algorithm to improve the solution speed; You Wei et al. proposed a hybrid genetic algorithm, which combines the key point construction method with the genetic algorithm; however, the above two methods are aimed at less constraints. Small goods, so the scope of application is relatively limited. Zhai Yu proposed a hybrid genetic algorithm based on the concept of genetic algorithm. The initial scheme of this algorithm has a reduced impact on the packing sequence, but the algorithm has low robustness.
发明内容SUMMARY OF THE INVENTION
本发明的目的在于提供一种基于优化的遗传算法，能够更好的获得适合的装载序列，提高货车的装载率和工作效率，克服传统人工装载方式工作效率低下的弊端的三维装箱方法及系统，以解决上述背景技术中存在的至少一项技术问题。The purpose of the present invention is to provide a three-dimensional packing method and system based on an optimized genetic algorithm, which can better obtain a suitable loading sequence, improve the loading rate and working efficiency of the truck, and overcome the disadvantages of the traditional manual loading method of low working efficiency. , so as to solve at least one technical problem existing in the above background art.
为了实现上述目的，本发明采取了如下技术方案：In order to achieve the above object, the present invention has adopted the following technical solutions:
一方面，本发明提供一种三维装箱方法，包括：In one aspect, the present invention provides a three-dimensional bin packing method, comprising:
将订单中的货物按照体积大小顺序排序，体积大的货物个体优先装入车厢；以已装入车厢的最后一个货物个体为中心，判断车厢内剩余空间容积是否不小于当前订单剩余货物个体的体积之和，若是，则该该当前订单可以装入车厢内，否则该当前订单排除装入该车厢内。Sort the goods in the order in order of size, and the bulky goods will be loaded into the carriage first; taking the last cargo that has been loaded into the carriage as the center, determine whether the volume of the remaining space in the carriage is not less than the volume of the remaining goods in the current order. The sum, if yes, the current order can be loaded into the car, otherwise the current order is excluded from being loaded into the car.
优选的，所述三维装箱方法还包括对车厢的容积按照大小顺序排列，优先利用容积大的车厢。Preferably, the three-dimensional packing method further includes arranging the volumes of the carriages in order of size, and preferentially using the carriages with larger volumes.
优选的，利用遗传算法对订单初始化，根据染色体的排序计算该订单初始化的方式，判断是否能够满足车厢的载重要求和车厢的容积要求。Preferably, a genetic algorithm is used to initialize the order, and the order initialization method is calculated according to the sorting of chromosomes, so as to determine whether the load requirements of the carriage and the volume requirements of the carriage can be met.
优选的，经过初始化之后，得到订单装如车厢的序列；根据这个序列，计算可以装入车厢内订单的总体积和总的重量是否超出了当前车厢的空闲体积以及车厢的载重，如果能够满足约束条件，那么就可以保留这条染色体，如果不满足，则需要舍弃该染色体。Preferably, after initialization, a sequence in which orders are loaded into a carriage is obtained; according to this sequence, it is calculated whether the total volume and total weight of the orders that can be loaded into the carriage exceed the free volume of the current carriage and the load of the carriage, and if the constraints can be satisfied If the condition is met, the chromosome can be kept, and if it is not satisfied, the chromosome needs to be discarded.
优选的，把满足约束条件的订单序列看作是一个数组，通过提取数组中每一维度的值判断哪些订单可以装入当前车厢。Preferably, the sequence of orders that satisfy the constraints is regarded as an array, and which orders can be loaded into the current carriage are determined by extracting the value of each dimension in the array.
优选的，根据所述数组对对订单内货物个体位置摆放的染色体进行编码，根据编码，判断货物个体放置的位置是否能满足车厢的容积约束。Preferably, the chromosomes that place the positions of the individual goods in the order are coded according to the array, and according to the coding, it is judged whether the positions of the individual goods can meet the volume constraints of the carriage.
优选的，提取出所述数组中数据的前两位使用染色体编码方式让其发生变异，即货物个体的放入顺序发生改变，接着提取出该数据的最后一位让每个货物的相对位置交叉，得到一个变异和交叉后的货物个体编号和相对位置，完成编码。Preferably, the first two bits of the data in the array are extracted to make them mutated by means of chromosome coding, that is, the order in which the individual cargoes are placed is changed, and then the last bit of the data is extracted to cross the relative positions of each cargo. , to obtain the individual number and relative position of the cargo after mutation and crossover, and complete the coding.
优选的，如果是首个订单最初的货物放入，那么就只需要根据预先设定的码垛要求装载即可；如果其他货物个体放到最初的货物上面的空间，需要考虑该其他货物个体是否小于所述最初的货物个体的容积，并确定是否能满足载重约束；以当前想要放置货物个体的位置为坐标，判断三个维度上的长宽高是否能够满足约束；评价第一代的适应度值，与子代进行比较，选择一个适应度最优的方案作为最终的装箱方案。Preferably, if the initial goods of the first order are put in, it only needs to be loaded according to the preset palletizing requirements; if other goods are placed in the space above the original goods, it is necessary to consider whether the other goods are It is smaller than the volume of the initial individual cargo, and determines whether the load constraint can be met; taking the position where the cargo individual is currently intended to be placed as the coordinates, judge whether the length, width, and height in the three dimensions can meet the constraints; evaluate the adaptation of the first generation The degree value is compared with the offspring, and a scheme with the best fitness is selected as the final packing scheme.
第二方面，本发明提供一种三维装箱系统，包括：In a second aspect, the present invention provides a three-dimensional box packing system, comprising:
逻辑控制器，其被配置为：将订单中的货物按照体积大小顺序排序，体积大的货物个体优先装入车厢；以已装入车厢的最后一个货物个体为中心，判断车厢内剩余空间容积是否不小于当前订单剩余货物个体的体积之和，若是，则该该当前订单可以装入车厢内，否则该当前订单排除装入该车厢内。The logic controller is configured to: sort the goods in the order in order of size, and put the bulky goods into the carriage first; take the last cargo that has been loaded into the carriage as the center, determine whether the remaining space volume in the carriage is not It is not less than the sum of the volume of the remaining goods in the current order. If so, the current order can be loaded into the carriage, otherwise the current order is excluded from being loaded into the carriage.
第三方面，本发明提供一种非暂态计算机可读存储介质，所述非暂态计算机可读存储介质用于存储计算机指令，所述计算机指令被处理器执行时，实现如上所述的三维装箱方法。In a third aspect, the present invention provides a non-transitory computer-readable storage medium, the non-transitory computer-readable storage medium is used to store computer instructions, and when the computer instructions are executed by a processor, realize the above three-dimensional packing method.
第四方面，本发明提供一种电子设备，包括：处理器、存储器以及计算机程序；其中，处理器与存储器连接，计算机程序被存储在存储器中，当电子设备运行时，所述处理器执行所述存储器存储的计算机程序，以使电子设备执行实现如上所述的三维装箱方法的指令。In a fourth aspect, the present invention provides an electronic device, comprising: a processor, a memory, and a computer program; wherein the processor is connected to the memory, the computer program is stored in the memory, and when the electronic device runs, the processor executes all A computer program stored in the memory to cause the electronic device to execute instructions for implementing the three-dimensional bin packing method described above.
本发明有益效果：获取了更多样化的订单序列，保证了更多的装箱选择空间；利用遗传算法新产生的后代子个体和原有的父代个体的差别较大，保证了在全局范围内的有效搜索，获得每个物品放入的具体位置，得到装箱方案，提高了货物装载的速度，减少了时间和人工成本，提高了工作效率以及车厢空间利用率。The beneficial effects of the invention are as follows: more diverse order sequences are obtained, which ensures more packing selection space; the difference between the newly generated offspring sub-individuals and the original parent-generation individuals by using the genetic algorithm is large, which ensures that the global Effective search within the range, obtain the specific location of each item, get the packing plan, improve the speed of cargo loading, reduce time and labor costs, and improve work efficiency and compartment space utilization.
本发明附加的方面和优点将在下面的描述中部分给出，这些将从下面的描述中变得明显，或通过本发明的实践了解到。Additional aspects and advantages of the present invention will be set forth in part in the following description, which will be apparent from the following description, or may be learned by practice of the present invention.
附图说明Description of drawings
为了更清楚地说明本发明实施例的技术方案，下面将对实施例描述中所需要使用的附图作简单地介绍，显而易见地，下面描述中的附图仅仅是本发明的一些实施例，对于本领域普通技术人员来讲，在不付出创造性劳动的前提下，还可以根据这些附图获得其他的附图。In order to illustrate the technical solutions of the embodiments of the present invention more clearly, the following briefly introduces the accompanying drawings used in the description of the embodiments. Obviously, the drawings in the following description are only some embodiments of the present invention. For those of ordinary skill in the art, other drawings can also be obtained from these drawings without any creative effort.
图1为本发明实施例所述的遗传算法进化优化中的一次迭代流程示意图。FIG. 1 is a schematic diagram of an iterative flow in the evolutionary optimization of a genetic algorithm according to an embodiment of the present invention.
图2为本发明实施例所述的基于遗传算法的三维装箱方案确定流程图。FIG. 2 is a flowchart for determining a three-dimensional packing scheme based on a genetic algorithm according to an embodiment of the present invention.
具体实施方式Detailed ways
下面详细叙述本发明的实施方式，所述实施方式的示例在附图中示出，其中自始至终相同或类似的标号表示相同或类似的元件或具有相同或类似功能的元件。下面通过附图描述的实施方式是示例性的，仅用于解释本发明，而不能解释为对本发明的限制。Embodiments of the present invention are described in detail below, examples of which are illustrated in the accompanying drawings, wherein the same or similar reference numerals refer to the same or similar elements or elements having the same or similar functions throughout. The embodiments described below through the accompanying drawings are exemplary and are only used to explain the present invention, but not to be construed as a limitation of the present invention.
本技术领域技术人员可以理解，除非另外定义，这里使用的所有术语(包括技术术语和科学术语)具有与本发明所属领域中的普通技术人员的一般理解相同的意义。It will be understood by those skilled in the art that, unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.
还应该理解的是，诸如通用字典中定义的那些术语应该被理解为具有与现有技术的上下文中的意义一致的意义，并且除非像这里一样定义，不会用理想化或过于正式的含义来解释。It should also be understood that terms such as those defined in general dictionaries should be understood to have meanings consistent with their meanings in the context of the prior art and, unless defined as herein, are not to be taken in an idealized or overly formal sense. explain.
本技术领域技术人员可以理解，除非特意声明，这里使用的单数形式“一”、“一个”、“所述”和“该”也可包括复数形式。应该进一步理解的是，本发明的说明书中使用的措辞“包括”是指存在所述特征、整数、步骤、操作、元件和/或组件，但是并不排除存在或添加一个或多个其他特征、整数、步骤、操作、元件和/或它们的组。It will be understood by those skilled in the art that the singular forms "a", "an", "the" and "the" as used herein can include the plural forms as well, unless expressly stated otherwise. It should be further understood that the word "comprising" used in the description of the present invention refers to the presence of stated features, integers, steps, operations, elements and/or components, but does not exclude the presence or addition of one or more other features, Integers, steps, operations, elements and/or groups thereof.
在本说明书的描述中，参考术语“一个实施例”、“一些实施例”、“示例”、“具体示例”、或“一些示例”等的描述意指结合该实施例或示例描述的具体特征、结构、材料或者特点包含于本发明的至少一个实施例或示例中。而且，描述的具体特征、结构、材料或者特点可以在任一个或多个实施例或示例中以合适的方式结合。此外，在不相互矛盾的情况下，本领域的技术人员可以将本说明书中描述的不同实施例或示例以及不同实施例或示例的特征进行结合和组合。In the description of this specification, description with reference to the terms "one embodiment," "some embodiments," "example," "specific example," or "some examples", etc., mean specific features described in connection with the embodiment or example , structure, material or feature is included in at least one embodiment or example of the present invention. Furthermore, the particular features, structures, materials or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, those skilled in the art may combine and combine the different embodiments or examples described in this specification, as well as the features of the different embodiments or examples, without conflicting each other.
为便于理解本发明，下面结合附图以具体实施例对本发明作进一步解释说明，且具体实施例并不构成对本发明实施例的限定。In order to facilitate the understanding of the present invention, the present invention will be further explained and described below with reference to the accompanying drawings with specific embodiments, and the specific embodiments do not constitute limitations to the embodiments of the present invention.
本领域技术人员应该理解，附图只是实施例的示意图，附图中的部件并不一定是实施本发明所必须的。Those skilled in the art should understand that the accompanying drawings are only schematic diagrams of the embodiments, and the components in the accompanying drawings are not necessarily necessary to implement the present invention.
实施例1Example 1
本实施例1提供一种三维装箱系统，该系统包括：The present embodiment 1 provides a three-dimensional box packing system, which includes:
逻辑控制器，其被配置为：将订单中的货物按照体积大小顺序排序，体积大的货物个体优先装入车厢；以已装入车厢的最后一个货物个体为中心，判断车厢内剩余空间容积是否不小于当前订单剩余货物个体的体积之和，若是，则该该当前订单可以装入车厢内，否则该当前订单排除装入该车厢内。The logic controller is configured to: sort the goods in the order in order of size, and put the bulky goods into the carriage first; take the last cargo that has been loaded into the carriage as the center, determine whether the remaining space volume in the carriage is not It is not less than the sum of the volume of the remaining goods in the current order. If so, the current order can be loaded into the carriage, otherwise the current order is excluded from being loaded into the carriage.
本实施例1中，利用上述的三维装箱系统，可实现一种三维装箱方法，包括：对车厢的容积按照大小顺序排列，优先利用容积大的车厢；将订单中的货物按照体积大小顺序排序，体积大的货物个体优先装入车厢；以已装入车厢的最后一个货物个体为中心，判断车厢内剩余空间容积是否不小于当前订单剩余货物个体的体积之和，若是，则该该当前订单可以装入车厢内，否则该当前订单排除装入该车厢内。In Embodiment 1, using the above-mentioned three-dimensional packing system, a three-dimensional packing method can be implemented, including: arranging the volumes of the carriages in order of size, and preferentially using the carriages with large volumes; Sorting, the cargo with large volume is preferentially loaded into the carriage; taking the last cargo that has been loaded into the carriage as the center, it is judged whether the volume of the remaining space in the carriage is not less than the sum of the volumes of the remaining cargoes in the current order, and if so, the current The order can be loaded into the car, otherwise the current order is excluded from being loaded into the car.
利用遗传算法对订单初始化，根据染色体的排序计算该订单初始化的方式，判断是否能够满足车厢的载重要求和车厢的容积要求。The genetic algorithm is used to initialize the order, and the method of order initialization is calculated according to the sorting of chromosomes, so as to judge whether it can meet the load requirements of the carriage and the volume requirements of the carriage.
经过初始化之后，得到订单装如车厢的序列；根据这个序列，计算可以装入车厢内订单的总体积和总的重量是否超出了当前车厢的空闲体积以及车厢的载重，如果能够满足约束条件，那么就可以保留这条染色体，如果不满足，则需要舍弃该染色体。After initialization, the sequence in which the order is loaded into the carriage is obtained; according to this sequence, it is calculated whether the total volume and total weight of the order that can be loaded into the carriage exceeds the free volume of the current carriage and the load of the carriage. If the constraints can be met, then This chromosome can be kept, and if it is not satisfied, the chromosome needs to be discarded.
把满足约束条件的订单序列看作是一个数组，通过提取数组中每一维度的值判断哪些订单可以装入当前车厢。Consider the sequence of orders that meet the constraints as an array, and determine which orders can be loaded into the current car by extracting the value of each dimension in the array.
根据所述数组对对订单内货物个体位置摆放的染色体进行编码，根据编码，判断货物个体放置的位置是否能满足车厢的容积约束。The chromosomes that place the positions of the individual goods in the order are coded according to the array, and according to the coding, it is judged whether the positions of the individual goods can meet the volume constraints of the carriage.
提取出所述数组中数据的前两位使用染色体编码方式让其发生变异，即货物个体的放入顺序发生改变，接着提取出该数据的最后一位让每个货物的相对位置交叉，得到一个变异和交叉后的货物个体编号和相对位置，完成编码。The first two bits of the data in the array are extracted to make them mutated by chromosome coding, that is, the order of individual cargoes is changed, and then the last bit of the data is extracted to cross the relative positions of each cargo to obtain a The individual number and relative position of the cargo after mutation and crossover complete the coding.
如果是首个订单最初的货物放入，那么就只需要根据预先设定的码垛要求装载即可；如果其他货物个体放到最初的货物上面的空间，需要考虑该其他货物个体是否小于所述最初的货物个体的容积，并确定是否能满足载重约束；以当前想要放置货物个体的位置为坐标，判断三个维度上的长宽高是否能够满足约束；评价第一代的适应度值，与子代进行比较，选择一个适应度最优的方案作为最终的装箱方案。If the initial goods of the first order are placed, it only needs to be loaded according to the preset palletizing requirements; if other goods are placed in the space above the original goods, it is necessary to consider whether the other goods are smaller than the stated The initial volume of the individual cargo, and determine whether it can meet the load constraints; take the current position where the cargo individual is to be placed as the coordinates, determine whether the length, width and height in the three dimensions can meet the constraints; evaluate the fitness value of the first generation, Compare with the offspring, and choose a scheme with the best fitness as the final binning scheme.
综上，本实施例1中，使用遗传算法，它是一种随机性搜索算法，有很强的全局搜索能力，所以比较适合求解装箱卸货问题。在整个装箱过程中，为了提高装箱率，设置了如下的约束条件：将装载的车辆空间按照容积从小到大进行排序，并且优先利用空间大的货车；体积大的个体优先装入，以大体积的物体作为整个订单的底部，减少该订单的物体间的空隙；根据装货方式，装完一个物品后，以该物品为中心，产生上、左、前3个子空间，如果可用空间容积不小于当前订单剩余物品的最小体积，表示该订单可以放入车厢内，否则作为该订单排除。这样的方式，既可以提高车厢的空间利用率，又可以满足货物的约束条件。To sum up, in this embodiment 1, the genetic algorithm is used, which is a random search algorithm and has a strong global search capability, so it is more suitable for solving the problem of packing and unloading. In the whole packing process, in order to improve the packing rate, the following constraints are set: the loaded vehicle space is sorted according to the volume from small to large, and the trucks with large space are preferentially used; A large-volume object is used as the bottom of the entire order to reduce the gap between the objects of the order; according to the loading method, after an item is loaded, the upper, left and first subspaces are generated with the item as the center, if the available space volume Not less than the minimum volume of the remaining items in the current order, indicating that the order can be put into the carriage, otherwise it will be excluded as the order. In this way, the space utilization rate of the carriage can be improved, and the constraints of the cargo can be met.
实施例2Example 2
如图1至图2所示，为了克服传统人工装载方式工作效率低下的弊端，本实施例2中，提供了一种使用遗传算法进行装箱方案优化的三维装箱方法，可以提高在某些约束范围下的装箱率和工作效率。As shown in Fig. 1 to Fig. 2, in order to overcome the disadvantage of low working efficiency of the traditional manual loading method, in this embodiment 2, a three-dimensional packing method using genetic algorithm to optimize the packing scheme is provided, which can improve the Packing rate and productivity under constraints.
在整个优化过程中包括以下几个方面：The entire optimization process includes the following aspects:
(1)确定优化目标：
其中，li、wi、hi分别表示货物个体的箱体i(i＝1,2,...,s)的长、宽、高，L、W、H表示车厢的长、宽、高，am表示订单m的放置状态。am＝0代表订单m没有被装进厢容器中，am＝1代表订单m已经被装入厢容器内，同时坐标(xi,yi,zi)表示每个订单内的物品i在车厢容器中的放置点位置。Among them, li ,wi , and hi represent the length, width and height of the individual cargo boxi (i=1, 2,..., s), respectively, and L, W, and H represent the length, width, and height of the carriage. high, am represents the placement status of order m. am = 0 means that the order m is not loaded into the car container, am =1 means that the order m has been loaded into the car container, and the coordinates (xi , yi , zi ) represent the item i in each order The drop point location in the carriage container.
其中，
代表车厢剩余的体积，剩余体积越小，那么车辆的空间利用率越高。Represents the remaining volume of the compartment. The smaller the remaining volume, the higher the space utilization of the vehicle.
(2)订单特点：每个订单内包括不止一种的货物，每种货物的形状、大小不一。(2) Order features: Each order includes more than one kind of goods, and each kind of goods has different shapes and sizes.
(3)货物特点：货物外包装规整，货物重量可以不等，标有明确的承压、堆叠、放置朝向的要求，码垛规则。(3) Characteristics of goods: The outer packaging of the goods is regular, the weight of the goods can vary, and there are clear requirements for pressure bearing, stacking, placement orientation, and stacking rules.
(4)货箱要求：常规尺寸的货箱，外形是规则的且有明确的长宽高，有明确的自重限重参数，有明确的装卸方式。(4) Requirements for cargo boxes: regular-sized cargo boxes have regular shapes, clear length, width and height, clear self-weight limit parameters, and clear loading and unloading methods.
(5)装箱模式：多货多箱，单货多箱等，目前最为广泛的是多货多箱，根据某些规则要求，合理的安排配送订单。(5) Packing mode: multi-cargo multi-carton, single-cargo multi-carton, etc. Currently, the most common one is multi-cargo multi-carton. According to certain rules and requirements, the distribution order is reasonably arranged.
(6)装卸方式：在满足约束的条件下，货物的摆放应该由里往外，从下往上，从左往右；卸货顺序应该是后进先出的顺序。比方说：1，2，3，4…N代表订单顺序，那么卸货的顺序应该是逆序：N，N-1,…,1.(6) Loading and unloading method: Under the condition that the constraints are met, the goods should be placed from the inside to the outside, from the bottom to the top, and from the left to the right; the unloading sequence should be the order of last-in, first-out. For example: 1, 2, 3, 4...N represents the order of the order, then the order of unloading should be reversed: N, N-1,...,1.
(7)为了方便配送，订单也以用户为单位，到达目的地时以完整的订单为单位卸货。每辆车从中转站出发访问每个驿站点，并且回到中转站，每个中转站有且仅能被一辆车访问。(7) In order to facilitate delivery, the order is also based on the user, and the complete order is unloaded when it arrives at the destination. Each car starts from the transfer station to visit each post station, and returns to the transfer station, each transfer station has and can only be visited by one vehicle.
本实施例中，使用的是遗传算法，如图1所示，它是一种随机性搜索算法，有很强的全局搜索能力，所以比较适合求解装箱卸货问题。在整个装箱过程中，为了提高装箱率，设置了如下的约束条件：将装载的车辆空间按照容积从小到大进行排序，并且优先利用空间大的货车；体积大的个体优先装入，以大体积的物体作为整个订单的底部，减少该订单的物体间的空隙；根据装货方式，装完一个物品后，以该物品为中心，产生上、左、前3个子空间，如果可用空间容积不小于当前订单剩余物品的最小体积，表示该订单可以放入车厢内，否则作为该订单排除。这样的方式，既可以提高车厢的空间利用率，又可以满足货物的约束条件。In this embodiment, a genetic algorithm is used, as shown in FIG. 1 , it is a random search algorithm with strong global search ability, so it is more suitable for solving the problem of packing and unloading. In the whole packing process, in order to improve the packing rate, the following constraints are set: the loaded vehicle space is sorted according to the volume from small to large, and the trucks with large space are preferentially used; A large-volume object is used as the bottom of the entire order to reduce the gap between the objects of the order; according to the loading method, after an item is loaded, the upper, left and first subspaces are generated with the item as the center, if the available space volume Not less than the minimum volume of the remaining items in the current order, indicating that the order can be put into the carriage, otherwise it will be excluded as the order. In this way, the space utilization rate of the carriage can be improved, and the constraints of the cargo can be met.
具体的实现步骤如下：The specific implementation steps are as follows:
第一步：由于是多货多箱，所以需要先对车厢的容积排序(优先利用大车)。Step 1: Since there are multiple cargoes and multiple boxes, the volume of the carriages needs to be sorted first (use the carts first).
第二步：以订单为单位进行优化，订单的装载顺序对三维装箱的空间占有率有着非常大的影响，优化过程如下：Step 2: Optimize by order. The loading order of the order has a great influence on the space occupancy rate of 3D packing. The optimization process is as follows:
(1)假设一共有s个订单，首先对s个订单初始化，得到大小为s的染色体，先将s设置为20。种群大小设置为N，即有N个大小为s的染色体。这N个二进制串构成初始种群。每一个订单的重量和体积都是既定的，通过对订单初始化的结果，根据染色体的排序计算该订单初始化的方式，然后判断是否能够满足车的载重要求和车的体积。(1) Assuming a total of s orders, first initialize the s orders to obtain a chromosome of size s, first set s to 20. The population size is set to N, that is, there are N chromosomes of size s. These N binary strings constitute the initial population. The weight and volume of each order are given. Through the result of order initialization, the order initialization method is calculated according to the sorting of chromosomes, and then it is judged whether it can meet the load requirements of the car and the volume of the car.
(2)编码染色体分别为1和0(1表示放入，0表示不放)。例如：经过初始化之后，得到的订单装车序列为[11000000111011010100],表示1，2，9，10，11，13，14，16，18号订单可以装入车内。根据适者生存的准则选择下一代的个体，在选择时以适应度为原则。对于选中的个体，随机的选择两个个体相同的位置，按交叉概率，对选中的位置实行交换。同样，已变异概率pm对某些个体的某些位执行变异。根据这个订单序列，首先计算可以装入车内订单的总体积和总的重量是否超出了当前车的空闲体积以及车的载重，也就是说，在初始化染色体之后，计算染色体为1的订单的体积之和以及订单的总重量是否超出了车厢的约束；如果能够满足条件，那么就可以保留这条染色体，如果达不到条件，就需要舍弃该染色体。(2) The coding chromosomes are 1 and 0 respectively (1 means put in, 0 means no put). For example: after initialization, the obtained order loading sequence is [11000000111011010100], indicating that orders 1, 2, 9, 10, 11, 13, 14, 16, and 18 can be loaded into the car. The next generation of individuals is selected according to the criterion of survival of the fittest, and the selection is based on the principle of fitness. For the selected individuals, randomly select the same position of two individuals, and exchange the selected positions according to the crossover probability. Likewise, the mutated probability pm performs mutation on some bits of some individuals. According to this order sequence, first calculate whether the total volume and total weight of the orders that can be loaded into the car exceed the current car's free volume and the car's load, that is, after initializing the chromosome, calculate the volume of the order with chromosome 1 The sum and the total weight of the order exceed the constraints of the carriage; if the condition is met, the chromosome can be kept, and if the condition is not met, the chromosome needs to be discarded.
(3)把满足条件的订单序列看作是一个数组，通过提取数组中每一维度的值判断哪些订单可以装入当前车辆。由于不同的装箱顺序对于装箱率的提升也有很大的影响，所以需要对订单的装入顺序进行优化。首先将装箱序列初始化，种群大小为N，从可选的订单中，随机选择一个可变异位置且只变异一次。接下来对选中订单根据订单装载的次序，对该订单内的物体编码初始化，得到的染色体的每一位分别说明如下：前两位是装车的物品编号，接着是参考物品的编号，最后是相对位置，每个物品的摆放位置由5位的double型数据组成，并将他们存放在数组内。假设一共有5个货物，给每一个物品编号分别为(1,2,3,4,5)，每个位置的设置为：0放在左下角，1放在右上角，-1初始序列一个物品放在车厢的(0,0,0)位置，也代表物品左上角的位置。(3) The order sequence that meets the conditions is regarded as an array, and which orders can be loaded into the current vehicle by extracting the value of each dimension in the array. Since different packing orders also have a great influence on the improvement of packing rate, it is necessary to optimize the packing order of orders. First initialize the binning sequence, the population size is N, from the optional order, randomly select a mutable position and mutate only once. Next, according to the order in which the order is loaded, the code of the objects in the order is initialized, and each bit of the obtained chromosome is explained as follows: the first two are the number of the loaded item, followed by the number of the reference item, and finally the Relative position, the placement position of each item is composed of 5-bit double data, and they are stored in the array. Suppose there are 5 items in total, number each item as (1, 2, 3, 4, 5), and the settings for each position are: 0 in the lower left corner, 1 in the upper right corner, and -1 for the initial sequence The item is placed at the (0,0,0) position of the carriage, which also represents the position of the upper left corner of the item.
(4)变异与交叉：提取出该数组中数据的前两位使用染色体编码方式让其发生变异，即物品的放入顺序发生改变，接着取出该数据的最后一位让每个物体的相对位置交叉，得到一个变异和交叉后的物体编号和相对位置。初始化交叉概率pc，初始化最大迭代次数MAXeva。在优化迭代的次数达到最大迭代次数MAXeva后输出结果种群pop。(4) Mutation and crossover: The first two bits of the data in the array are extracted to mutate them using chromosome coding, that is, the order in which the items are placed is changed, and then the last bit of the data is taken out to make the relative position of each object Cross, get a mutated and crossed object number and relative position. Initialize the crossover probability pc , and initialize the maximum number of iterations MAXeva. After the number of optimization iterations reaches the maximum number of iterations MAXeva, the resulting population pop is output.
这样就完成了一次对物品位置摆放的染色体编码，同理，之后订单内的物品编码方式如上所示。需要根据各种约束条件判断初始化之后的编码是否可行，即对物品编码后，判断物品放置的位置是否能满足车厢的长，宽，高，承重面和承重级等约束。例如，1号订单可以放入当前车辆，并且1号订单是最先放入车内，那么就对一号订单内的物品进行编码。由于订单与订单之间是紧挨着排放，并且订单中的货物基本都是大型物件，所以订单与订单之间我们默认不叠放，不混放。因此每个物品的参考物品编号都是同一订单内的物品，重要的是参考物品必须已经放入到车厢内的。In this way, the chromosome coding for the position of the item is completed. Similarly, the item coding method in the order is as shown above. It is necessary to judge whether the coding after initialization is feasible according to various constraints, that is, after coding the item, judge whether the position of the item can meet the constraints of the length, width, height, load-bearing surface and load-bearing level of the carriage. For example, the No. 1 order can be put into the current vehicle, and the No. 1 order is the first to be put into the car, then the items in the No. 1 order are coded. Since orders are placed next to each other, and the goods in the orders are basically large objects, we do not stack or mix orders by default. Therefore the reference item number of each item is the item in the same order, it is important that the reference item must have been put into the carriage.
(5)如果是首个订单最初的物品(1号物体)放入，那么就只需要根据所提出的码垛要求装载即可。如果其他物品放到1号物体上面的空间(也就是出现叠放时)需要考虑它的长宽高是否小于1号物体的长宽高，以免出现悬空的情况，并确定载重等约束是否能满足；N条这样的染色体的指定位置进行变异以及交叉。这个时候需要以当前想要放置物品的位置为坐标，判断他的三个维度上的长宽高是否能够满足约束。最后需要评价第一代的适应度值(装箱率)，与接下来的子代进行比较，从而选择一个适应度最优的解决方案。(5) If it is the first item of the first order (object No. 1), it only needs to be loaded according to the proposed palletizing requirements. If other items are placed in the space above the No. 1 object (that is, when stacking occurs), you need to consider whether its length, width and height are less than the length, width and height of the No. 1 object to avoid hanging in the air, and determine whether the load and other constraints can be satisfied. ; N such chromosomes are mutated and crossed over at specified positions. At this time, it is necessary to use the current position where the item is to be placed as the coordinates to determine whether the length, width and height of its three dimensions can meet the constraints. Finally, it is necessary to evaluate the fitness value (packing rate) of the first generation and compare it with the next generation, so as to select a solution with the best fitness.
遗传算法新产生的后代子个体和原有的父代个体的差别较大，所以在全局搜索能力上有着不俗的表现，经常被用于处理复杂优化问题。通过三维装箱可以获得每个物品放入的具体位置，提高装载的速度，减少时间和人工的成本，更重要的是可以提高装箱率。The new offspring of the genetic algorithm are quite different from the original parent, so they have a good performance in the global search ability, and are often used to deal with complex optimization problems. Through three-dimensional packing, the specific position of each item can be obtained, the loading speed can be improved, the time and labor cost can be reduced, and more importantly, the packing rate can be improved.
实施例3Example 3
本发明实施例3提供一种非暂态计算机可读存储介质，所述非暂态计算机可读存储介质用于存储计算机指令，所述计算机指令被处理器执行时，实现如上所述的三维装箱方法，该方法包括：Embodiment 3 of the present invention provides a non-transitory computer-readable storage medium, where the non-transitory computer-readable storage medium is used to store computer instructions, and when the computer instructions are executed by a processor, the above three-dimensional installation is realized. box method, which includes:
将订单中的货物按照体积大小顺序排序，体积大的货物个体优先装入车厢；以已装入车厢的最后一个货物个体为中心，判断车厢内剩余空间容积是否不小于当前订单剩余货物个体的体积之和，若是，则该该当前订单可以装入车厢内，否则该当前订单排除装入该车厢内。Sort the goods in the order in order of size, and the bulky goods will be loaded into the carriage first; taking the last cargo that has been loaded into the carriage as the center, determine whether the volume of the remaining space in the carriage is not less than the volume of the remaining goods in the current order. The sum, if yes, the current order can be loaded into the car, otherwise the current order is excluded from being loaded into the car.
实施例4Example 4
本发明实施例4提供一种计算机程序(产品)，包括计算机程序，所述计算机程序当在一个或多个处理器上运行时，用于实现如上所述的三维装箱方法，该方法包括：Embodiment 4 of the present invention provides a computer program (product), including a computer program, when the computer program is run on one or more processors, for implementing the above three-dimensional packing method, the method includes:
将订单中的货物按照体积大小顺序排序，体积大的货物个体优先装入车厢；以已装入车厢的最后一个货物个体为中心，判断车厢内剩余空间容积是否不小于当前订单剩余货物个体的体积之和，若是，则该该当前订单可以装入车厢内，否则该当前订单排除装入该车厢内。Sort the goods in the order in order of size, and the bulky goods will be loaded into the carriage first; taking the last cargo that has been loaded into the carriage as the center, determine whether the volume of the remaining space in the carriage is not less than the volume of the remaining goods in the current order. The sum, if yes, the current order can be loaded into the car, otherwise the current order is excluded from being loaded into the car.
实施例5Example 5
本发明实施例5提供一种电子设备，包括：处理器、存储器以及计算机程序；其中，处理器与存储器连接，计算机程序被存储在存储器中，当电子设备运行时，所述处理器执行所述存储器存储的计算机程序，以使电子设备执行实现如上所述的三维装箱方法的指令，该方法包括：Embodiment 5 of the present invention provides an electronic device, including: a processor, a memory, and a computer program; wherein the processor is connected to the memory, the computer program is stored in the memory, and when the electronic device runs, the processor executes the A computer program stored in the memory to cause the electronic device to execute instructions for implementing the three-dimensional binning method described above, the method comprising:
将订单中的货物按照体积大小顺序排序，体积大的货物个体优先装入车厢；以已装入车厢的最后一个货物个体为中心，判断车厢内剩余空间容积是否不小于当前订单剩余货物个体的体积之和，若是，则该该当前订单可以装入车厢内，否则该当前订单排除装入该车厢内。Sort the goods in the order in order of size, and the bulky goods will be loaded into the carriage first; taking the last cargo that has been loaded into the carriage as the center, determine whether the volume of the remaining space in the carriage is not less than the volume of the remaining goods in the current order. The sum, if yes, the current order can be loaded into the car, otherwise the current order is excluded from being loaded into the car.
本领域内的技术人员应明白，本发明的实施例可提供为方法、系统、或计算机程序产品。因此，本发明可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本发明可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.
本发明是参照根据本发明实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block in the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to the processor of a general purpose computer, special purpose computer, embedded processor or other programmable data processing device to produce a machine such that the instructions executed by the processor of the computer or other programmable data processing device produce Means for implementing the functions specified in a flow or flow of a flowchart and/or a block or blocks of a block diagram.
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory result in an article of manufacture comprising instruction means, the instructions The apparatus implements the functions specified in the flow or flow of the flowcharts and/or the block or blocks of the block diagrams.
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。These computer program instructions can also be loaded on a computer or other programmable data processing apparatus, where a series of operational steps are performed to produce a computer-implemented process, thereby executing instructions on the computer or other programmable apparatus Steps are provided for implementing the functions specified in a flow or flows of the flowcharts and/or a block or blocks of the block diagrams.
上述虽然结合附图对本发明的具体实施方式进行了描述，但并非对本发明保护范围的限制，所属领域技术人员应该明白，在本发明公开的技术方案的基础上，本领域技术人员在不需要付出创造性劳动即可做出的各种修改或变形，都应涵盖在本发明的保护范围之内。Although the specific embodiments of the present invention have been described above in conjunction with the accompanying drawings, they do not limit the scope of protection of the present invention. Those skilled in the art should understand that on the basis of the technical solutions disclosed in the present invention, those skilled in the art do not need to pay Various modifications or deformations that can be made by creative work shall be covered within the protection scope of the present invention.
Claims (10)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111385597.2ACN114330822A (en) | 2021-11-22 | 2021-11-22 | Three-dimensional boxing method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111385597.2ACN114330822A (en) | 2021-11-22 | 2021-11-22 | Three-dimensional boxing method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114330822Atrue CN114330822A (en) | 2022-04-12 |
Family
ID=81046665
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111385597.2APendingCN114330822A (en) | 2021-11-22 | 2021-11-22 | Three-dimensional boxing method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114330822A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116993247A (en)* | 2023-09-26 | 2023-11-03 | 亿海蓝（北京）数据技术股份公司 | Container optimized loading method and system, and readable storage medium |
| CN117910905A (en)* | 2024-01-30 | 2024-04-19 | 镇江全通供应链管理有限公司 | Intelligent management system for object transportation |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109345017A (en)* | 2018-10-08 | 2019-02-15 | 南京航空航天大学 | An optimization method for material distribution in workshop considering packing constraints |
| CN110189077A (en)* | 2019-05-20 | 2019-08-30 | 华南理工大学 | A Multi-Stage Vehicle-Cargo Matching Method Considering 3D Loading Constraints |
| CN110443397A (en)* | 2018-05-04 | 2019-11-12 | 青岛日日顺物流有限公司 | A kind of order allocator |
| CN112990528A (en)* | 2020-06-28 | 2021-06-18 | 青岛盈智科技有限公司 | Logistics transportation stowage management method and device |
- 2021
- 2021-11-22CNCN202111385597.2Apatent/CN114330822A/enactivePending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110443397A (en)* | 2018-05-04 | 2019-11-12 | 青岛日日顺物流有限公司 | A kind of order allocator |
| CN109345017A (en)* | 2018-10-08 | 2019-02-15 | 南京航空航天大学 | An optimization method for material distribution in workshop considering packing constraints |
| CN110189077A (en)* | 2019-05-20 | 2019-08-30 | 华南理工大学 | A Multi-Stage Vehicle-Cargo Matching Method Considering 3D Loading Constraints |
| CN112990528A (en)* | 2020-06-28 | 2021-06-18 | 青岛盈智科技有限公司 | Logistics transportation stowage management method and device |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116993247A (en)* | 2023-09-26 | 2023-11-03 | 亿海蓝（北京）数据技术股份公司 | Container optimized loading method and system, and readable storage medium |
| CN117910905A (en)* | 2024-01-30 | 2024-04-19 | 镇江全通供应链管理有限公司 | Intelligent management system for object transportation |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113222293B (en) | Intelligent stereoscopic warehouse optimal scheduling method | |
| CN107480922B (en) | Establishment method of cargo space allocation and scheduling model under the two-vehicle operation mode of two-end type on the same track | |
| KR101384739B1 (en) | Method for loading in container by considering weight balances | |
| CN109359739A (en) | Genetic Algorithm-Based Stacking Combination Method, Apparatus, Equipment and Storage Medium | |
| CN103246941B (en) | Space scheduling method stored up by a kind of Containers For Export harbour | |
| Jamrus et al. | Extended priority-based hybrid genetic algorithm for the less-than-container loading problem | |
| CN109460859B (en) | Workshop layout optimization method | |
| CN114330822A (en) | Three-dimensional boxing method and system | |
| CN110175404B (en) | Cargo loading adjustment method and device | |
| CN111815233B (en) | Goods position optimization method based on total logistics amount and energy consumption | |
| CN110599000B (en) | Automatic dock turning evaluation method, box position distribution method and related devices | |
| CN113762899A (en) | Mixed algorithm-based three-dimensional cargo boxing method | |
| CN106779153A (en) | Optimization method is distributed in a kind of intelligent three-dimensional warehouse goods yard | |
| CN107967586A (en) | A kind of power grid goods and materials storage optimization method | |
| CN113408988B (en) | Scheduling optimization method for warehouse system, electronic equipment and storage medium | |
| CN109886447A (en) | For flood control take precautions against drought goods and materials intelligent storage goods yard distribution method and system | |
| CN110378644A (en) | A kind of harbour dangerous material container space distribution model and algorithm | |
| CN111882200A (en) | Vehicle and goods matching method considering vehicle path and three-dimensional boxing | |
| CN116644807B (en) | A hybrid adaptive genetic algorithm for three-dimensional multi-box flexible packing | |
| CN117252037B (en) | Three-dimensional boxing method and device, electronic equipment and storage medium | |
| CN116136990A (en) | Vehicle path planning method considering three-dimensional boxing problem | |
| Kaabi et al. | Toward smart logistics: A new algorithm for a multi-objective 3D bin packing problem | |
| CN110544019A (en) | container cargo loading method and system for intelligent ship | |
| CN1936937A (en) | Heuristic Vehicle Allocation Method under Multiple Constraints | |
| CN103729753A (en) | Three-stage matching tobacco distribution method based on transportation scheduling |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | Application publication date:20220412 | |
| RJ01 | Rejection of invention patent application after publication |