Vehicle boxing planning method, device and equipment

Abstract

The invention provides a planning method, device and equipment for vehicle boxing. The method comprises the steps that the compartment size of a vehicle is obtained, and the size and the original attribute of a to-be-loaded material box are obtained; based on the height of the compartment and the size of the to-be-loaded material box, stacking of the to-be-loaded material box is simulated, and an original rectangle is obtained; determining a target attribute of the original rectangle based on the original attribute of the to-be-loaded material box corresponding to the original rectangle; based on the target attribute and the loading waste area, calculating a target evaluation score of filling the first rectangle at each loadable point of the first rectangle simulated by each original rectangle; taking the original rectangle corresponding to the target evaluation score meeting the score requirement as a target rectangle, and taking the corresponding loadable point as a target loading point; filling the target rectangle into the first rectangle at the target loading point; and based on each target rectangle and each target loading point, determining a planning result of vehicle boxing. According to the scheme, the boxing efficiency and the loading rate are improved.

Description

Technical Field

[0001] The present application relates to the technical field of vehicle packing, and in particular to a planning method, device and equipment for vehicle packing. Background Art

[0002] Inbound logistics refers to the logistics process from raw material and parts suppliers to the internal logistics of the production enterprise. It is an important part of supply chain logistics, and is mainly responsible for transporting various materials required for production to the production site of the enterprise at the right time, in the right quantity and in good condition, so as to ensure the smooth development of production activities.

[0003] Based on the demand for various materials in enterprise production, loading plans are usually generated at regular intervals. The various materials in the loading plan need to be transported to the enterprise production site. Different vehicle packing methods may result in different vehicle loading rates. A higher vehicle loading rate can reduce the number of vehicle usage and transportation costs.

[0004] In the related art, the vehicle packing is usually planned based on the experience of the staff, but this method is inefficient and has a low loading rate. Summary of the invention

[0005] In view of the above problems, the present application aims to provide a vehicle packing planning method, device and equipment to improve the efficiency and loading rate of vehicle packing.

[0006] In a first aspect, the present application provides a vehicle packing planning method, the method comprising:

[0007] Obtain the dimensions of the vehicle compartment, and obtain the dimensions and original attributes of multiple boxes to be loaded; the dimensions include length, width, and height; the original attributes include mandatory and optional;

[0008] Based on the height of the carriage and the sizes of the multiple boxes to be loaded, the stacking of the boxes to be loaded is simulated to obtain an original rectangle; based on the original attributes of at least one box to be loaded corresponding to the original rectangle, the target attributes of the original rectangle are determined;

[0009] Based on the target attributes and the loading waste area, the target evaluation score of each original rectangle is calculated to simulate the filling of the first rectangle at each loadable point of the first rectangle; the original rectangle corresponding to the target evaluation score that meets the score requirement is used as the target rectangle, and the corresponding loadable point is used as the target loading point; the target rectangle is filled into the first rectangle at the target loading point; wherein the length of the first rectangle is equal to the length of the carriage, and the width of the first rectangle is equal to the width of the carriage;

[0010] If it is determined that any original rectangle cannot be filled into the first rectangle or all original rectangles have been filled into the first rectangle, a planning result of vehicle packing is determined based on each target rectangle and each target loading point.

[0011] In a possible implementation, the step of calculating the target evaluation score of each original rectangle simulating filling the first rectangle at each loadable point of the first rectangle based on the target attribute and the loading waste area includes:

[0012] Simulating the current loading boundary using the skyline to obtain at least one original line segment; wherein the current loading boundary is obtained by simulating a packing process by filling the target rectangle into the first rectangle; and every two original line segments are parallel to each other;

[0013] Select a loadable point on the original line segment;

[0014] Based on the target attributes and the loading waste area, the target evaluation score of each original rectangle simulating filling the first rectangle at each loadable point is calculated.

[0015] In a possible implementation, the step of calculating the target evaluation score of each original rectangle simulating filling the first rectangle at each loadable point of the first rectangle based on the target attribute and the loading waste area further includes:

[0016] Determine the original line segments obtained after the original rectangle simulation is filled with the first moment at the first loadable point of the first rectangle, and determine the maximum distance between the original line segments;

[0017] If the maximum distance is less than a preset threshold and there are at least two original rectangles that can be filled into the first rectangle at the first loadable point, then based on the target attributes and loading waste area, the target evaluation score of each original rectangle simulating filling the first rectangle at each loadable point of the first rectangle is calculated.

[0018] In a possible implementation, the method further includes using the skyline to simulate the current loading boundary to obtain N original line segments with a front-to-back order; the selecting of the loadable points on the original line segments includes:

[0019] If it is determined that the current original line segment is the first original line segment, the left endpoint of the current original line segment is used as the loadable point;

[0020] If it is determined that the current original line segment is the last original line segment, the right endpoint of the current original line segment is used as the loadable point;

[0021] If it is determined that the current original line segment is neither the first original line segment nor the last original line segment, and the current original line segment is lower than the previous original line segment, the left endpoint of the current original line segment is used as the loadable point;

[0022] If it is determined that the current original line segment is neither the first original line segment nor the last original line segment, and the current original line segment is lower than the last original line segment, the right endpoint of the current original line segment is used as the loadable point.

[0023] In a possible implementation, the step of calculating the evaluation score of each original rectangle simulating filling the first rectangle at each loadable point of the first rectangle based on the target attribute and the loading waste area includes:

[0024] Determining, based on the target attribute of the current original rectangle, a first evaluation score of the current original rectangle simulating filling the first rectangle at the second loadable point of the first rectangle;

[0025] Determine the loading waste area of ​​each original rectangle to simulate filling the first rectangle at the second loadable point of the first rectangle; sort the loading waste areas corresponding to each original rectangle to obtain a target sequence;

[0026] Determine, based on the position of the loading waste area corresponding to the current original rectangle in the target sequence, a second evaluation score of the current original rectangle simulating filling the first rectangle at the second loadable point of the first rectangle;

[0027] Based on the first evaluation score and the second evaluation score, a target evaluation score is determined.

[0028] In a possible implementation, determining the target attribute of the original rectangle based on the original attribute of at least one to-be-loaded container corresponding to the original rectangle includes:

[0029] If the original attribute of at least one to-be-loaded material box corresponding to the original rectangle has a must-load condition, then the target attribute of the original rectangle is determined to be a must-load condition;

[0030] If the original attributes of at least one to-be-loaded material box corresponding to the original rectangle are all optional, then the target attribute of the original rectangle is determined to be optional.

[0031] In a second aspect, the present application provides a vehicle packing planning device, the device comprising:

[0032] An acquisition unit is used to acquire the dimensions of the vehicle compartment and the dimensions and original attributes of multiple boxes to be loaded; the dimensions include length, width and height; the original attributes include mandatory and optional;

[0033] A stacking unit is used to simulate the stacking of the boxes to be loaded based on the height of the carriage and the sizes of the multiple boxes to be loaded to obtain an original rectangle; based on the original attributes of at least one box to be loaded corresponding to the original rectangle, determine the target attributes of the original rectangle;

[0034] The filling unit is used to calculate the target evaluation score of each original rectangle simulating the filling of the first rectangle at each loadable point of the first rectangle based on the target attribute and the loading waste area; the original rectangle corresponding to the target evaluation score that meets the score requirement is used as the target rectangle, and the corresponding loadable point is used as the target loading point; the target rectangle is filled into the first rectangle at the target loading point; wherein the length of the first rectangle is equal to the length of the carriage, and the width of the first rectangle is equal to the width of the carriage;

[0035] The planning unit is used to determine the planning result of the vehicle packing based on each target rectangle and each target loading point if it is determined that any original rectangle can no longer be filled into the first rectangle or all the original rectangles have been filled into the first rectangle.

[0036] In a third aspect, an embodiment of the present application further provides an electronic device, comprising: a processor, and a memory communicatively connected to the processor;

[0037] The memory stores computer-executable instructions;

[0038] The processor executes the computer-executable instructions stored in the memory to implement the method in any possible implementation of the first aspect above.

[0039] In a fourth aspect, an embodiment of the present application further provides a computer-readable storage medium, wherein the computer-readable storage medium stores computer execution instructions, and when the computer execution instructions are executed by a processor, they are used to implement the method in any possible implementation of the above-mentioned first aspect.

[0040] According to a fifth aspect of the present disclosure, a computer program product is provided, including a computer program, which, when executed by a processor, implements the method in any possible implementation manner of the first aspect.

[0041] The present application provides a vehicle packing planning method, device and equipment, the method comprising: obtaining the dimensions of a vehicle compartment, and obtaining the dimensions and original attributes of a plurality of boxes to be loaded; wherein the dimensions include length, width and height; the original attributes include mandatory and optional; based on the height of the compartment and the dimensions of a plurality of boxes to be loaded, simulating the stacking of the boxes to be loaded to obtain an original rectangle; based on the original attributes of at least one box to be loaded corresponding to the original rectangle, determining the target attributes of the original rectangle; based on the target attributes and the loading waste area, calculating the target evaluation score of each original rectangle simulating the filling of the first rectangle at each loadable point of the first rectangle; taking the original rectangle corresponding to the target evaluation score that meets the score requirements as the target rectangle, and taking the corresponding loadable point as the target loading point; filling the target rectangle into the first rectangle at the target loading point; wherein the length of the first rectangle is equal to the length of the compartment, and the width of the first rectangle is equal to the width of the compartment; if it is determined that any original rectangle can no longer be filled into the first rectangle or all original rectangles have been filled into the first rectangle, then determining the planning result of the vehicle packing based on each target rectangle and each target loading point. This solution realizes automatic planning of vehicle packing based on the size of the carriage, as well as the size and original attributes of the material boxes to be loaded, thereby improving the packing efficiency. Moreover, this solution realizes three-dimensional vehicle packing planning by using a one-dimensional plus two-dimensional method, with fast calculation speed and high efficiency. Specifically, first simulate the stacking of the one-dimensional material boxes to be loaded to obtain the original rectangle. Then, use the target attributes of the original rectangle and the target evaluation score calculated by the loading waste area to select the target rectangle from the original rectangle, and select the target loading point from the loadable points, and then fill the two-dimensional target rectangle into the first rectangle at the target loading point. Then, the planning results of vehicle packing are obtained based on each target rectangle and each target loading point. Using the planning results for vehicle packing improves the vehicle loading rate. BRIEF DESCRIPTION OF THE DRAWINGS

[0042] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.

[0043] Figure 1 A schematic diagram of a process flow of a vehicle packing planning method provided in Example 1 of the present application;

[0044] Figure 2 A flow chart of another vehicle packing planning method provided in Embodiment 2 of the present application;

[0045] Figure 3 A schematic diagram of a current loading boundary of a skyline simulation provided in the second embodiment of the present application;

[0046] Figure 4 A schematic diagram of simulating vehicle loading provided in Example 2 of the present application;

[0047] Figure 5 A schematic diagram of another simulated vehicle loading provided in Example 2 of the present application;

[0048] Figure 6 A schematic diagram of the structure of a vehicle packing planning device provided in Embodiment 3 of the present application;

[0049] Figure 7 A hardware structure diagram of an electronic device provided in Example 4 of the present application.

[0050] The above drawings have shown clear embodiments of the present application, which will be described in more detail later. These drawings and text descriptions are not intended to limit the scope of the present application in any way, but to illustrate the concept of the present application to those skilled in the art by referring to specific embodiments.

[0051] Description of reference numerals:

[0052] 600-vehicle packing planning device; 601-acquisition unit; 602-stacking unit; 603-filling unit; 604-planning unit;

[0053] 701 - processor; 702 - memory; 703 - communication interface; 704 - communication bus. DETAILED DESCRIPTION

[0054] Exemplary embodiments will be described in detail herein, examples of which are shown in the accompanying drawings. When the following description refers to the drawings, the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with the present application. Instead, they are merely examples of devices and methods consistent with some aspects of the present application as detailed in the appended claims.

[0055] In the embodiments of the present application, words such as "first" and "second" are used to distinguish the same or similar items with substantially the same functions and effects. Those skilled in the art can understand that words such as "first" and "second" do not limit the quantity and execution order, and words such as "first" and "second" do not necessarily limit the difference.

[0056] It should be noted that in the embodiments of the present application, words such as "exemplary" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary" or "for example" in the present application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a concrete way. In the embodiments of the present application, "at least one" refers to one or more, and "more than one" refers to two or more.

[0057] This solution can be applied in the scenario of automobile complete vehicle production. In the scenario of automobile complete vehicle production, it is necessary to transport various parts required for automobile complete vehicle production from the transfer warehouse to the production line. There can be multiple transportation routes, each of which is usually fixed, and the vehicle model corresponding to each transportation route is usually fixed. The compartment size of vehicles of the same model is the same. Usually, a loading task is generated according to production needs at fixed intervals. Each loading task includes at least one loading plan. A loading plan corresponds to a transportation route and a vehicle model. Different loading plans may correspond to different transportation routes and vehicle models. The size of the material box to be loaded can be determined based on the information of various parts currently required in the current loading plan, and its corresponding original attribute is mandatory. Usually, only the various parts currently required in the current loading plan are transported, which is likely to result in a low loading rate. Therefore, in order to improve the loading rate, the size of the material box to be loaded will also be determined according to the next loading plan of the current loading plan, and its corresponding original attribute is optional.

[0058] In the related art, the planning of vehicle loading usually relies on the experience of the staff. However, this method is inefficient and has a low loading rate. Especially for emergencies such as temporary requests for additional delivery of goods, manual methods are difficult to respond quickly, which may lead to planning confusion.

[0059] In order to solve the above technical problems, the embodiment of the present application provides a planning method, device and equipment for vehicle packing, which realizes automatic planning of vehicle packing based on the size of the carriage, the size and original attributes of the material box to be loaded, and improves the packing efficiency. And for emergencies such as temporary requirements for additional delivery of goods, the automatic planning method of vehicle packing can respond quickly, avoiding the planning confusion that may be caused by manual methods. And this scheme uses a one-dimensional plus two-dimensional method to realize three-dimensional vehicle packing planning, with fast calculation speed and high efficiency. Specifically, first simulate the stacking of one-dimensional material boxes to be loaded to obtain the original rectangle, then use the target attribute of the original rectangle and the target evaluation score calculated by the loading waste area to select the target rectangle from the original rectangle, and select the target loading point from the loadable point, and then fill the two-dimensional target rectangle into the first rectangle at the target loading point. Then, the planning result of vehicle packing is obtained based on each target rectangle and each target loading point. Using the planning result for vehicle packing improves the loading rate of the vehicle.

[0060] Figure 1 This is a flow chart of a vehicle packing planning method provided in the first embodiment of the present application. This embodiment can be applied to the vehicle packing planning scenario. The method can be executed by a vehicle packing planning device, which can be implemented by software and / or hardware and specifically configured in an electronic device. Figure 1 As shown, the method includes:

[0061] Step 101, obtaining the dimensions of the vehicle compartment, and obtaining the dimensions and original attributes of a plurality of boxes to be loaded; wherein the dimensions include length, width and height; and the original attributes include mandatory and optional.

[0062] Among them, the loading box is used to load various materials that need to be transported.

[0063] In implementation, the required to-be-loaded containers are loaded with various materials needed for current production. The required to-be-loaded containers must be loaded into vehicles for transportation. The optional to-be-loaded containers are loaded with various materials needed for future production. In order to improve the loading rate of the vehicle, you can transport the required to-be-loaded containers as well as some optional to-be-loaded containers as needed.

[0064] Specifically, the number of multiple boxes to be loaded can be obtained. Each box to be loaded can also be numbered for easy management. Information about the materials loaded in each box to be loaded can also be recorded. Information about the material provider can also be recorded. Information about the loading plan corresponding to the materials loaded in the box to be loaded can also be recorded.

[0065] Specifically, the vehicle type may be acquired, and then the size of the vehicle compartment may be acquired by using a preset association between the vehicle type and the size of the vehicle compartment.

[0066] Step 102 , based on the height of the carriage and the sizes of multiple boxes to be loaded, simulate the stacking of the boxes to be loaded to obtain an original rectangle; based on the original attributes of at least one box to be loaded corresponding to the original rectangle, determine the target attributes of the original rectangle.

[0067] In implementation, different boxes to be loaded can only be stacked if they have the same length and width; or, if the length difference is within a first threshold and the width difference is within a second threshold.

[0068] In practice, the total height of the stacked multiple boxes to be loaded is less than the height of the carriage, and the total height is the sum of the heights of the boxes to be loaded.

[0069] The maximum length of the stackable multiple to-be-loaded boxes can be used as the length of the original rectangle, and the maximum width of the stackable multiple to-be-loaded boxes can be used as the width of the original rectangle. Then, the two-dimensional original rectangle is used to simulate the to-be-loaded boxes.

[0070] In one achievable manner, if the original attributes of at least one to-be-loaded box corresponding to the original rectangle are mandatory, the target attribute of the original rectangle is determined to be mandatory; if the original attributes of at least one to-be-loaded box corresponding to the original rectangle are all optional, the target attribute of the original rectangle is determined to be optional.

[0071] Specifically, in this way, the target attribute of the original rectangle can be conveniently determined.

[0072] Step 103, based on the target attributes and the loading waste area, calculate the target evaluation score of each original rectangle simulating filling the first rectangle at each loadable point of the first rectangle; use the original rectangle corresponding to the target evaluation score that meets the score requirements as the target rectangle, and use the corresponding loadable point as the target loading point; fill the target rectangle into the first rectangle at the target loading point; wherein the length of the first rectangle is equal to the length of the car body, and the width of the first rectangle is equal to the width of the car body.

[0073] The target attribute is the target attribute of the original rectangle.

[0074] The loading wasted area refers to the wasted area of ​​the first rectangle that may be caused when the original rectangle is simulated to fill in the first rectangle at any loadable point of the first rectangle.

[0075] Considering that mandatory items must be loaded and optional items do not have to be loaded, the loading priority of mandatory items can be set higher than that of optional items. Considering that the smaller the loading waste area, the higher the loading rate of the vehicle, the smaller the loading waste area, the higher the loading priority can be set. Therefore, based on the above considerations, the target evaluation score can be calculated.

[0076] In implementation, the score requirement may be to select the one with the largest value among the evaluation scores of each target. The score requirement may also be to select the one with the second largest value among the evaluation scores of each target.

[0077] The loadable point refers to a location point in the first rectangle that can be used to place the target rectangle.

[0078] In implementation, the target rectangle may be filled into the first rectangle at the target loading point to simulate loading the to-be-loaded container into the carriage.

[0079] During implementation, after the target rectangle is filled into the first rectangle at the target loading point, the loadable point can be updated, and the step of calculating the target evaluation score of each original rectangle simulating filling the first rectangle at each loadable point of the first rectangle based on the target attributes and loading waste area is continued until any original rectangle can no longer be filled in the first rectangle or all the original rectangles have been filled in the first rectangle.

[0080] In practice, in order to facilitate loading, the length of the target rectangle must be parallel to the length of the first rectangle or the width of the first rectangle. In other words, when the container to be loaded is loaded, its length must be parallel to the length of the carriage or the width of the carriage. In other words, the container to be loaded can be flipped in length and width on the plane where the bottom of the carriage is located, further improving the loading rate.

[0081] Step 104 : If it is determined that any original rectangle cannot be filled into the first rectangle or all original rectangles have been filled into the first rectangle, a planning result of vehicle packing is determined based on each target rectangle and each target loading point.

[0082] In implementation, at least one vehicle may be used for this loading and transportation. The vehicle number may be coded, and the loading of each vehicle may be simulated in the order of the vehicle number coding until all the required containers to be loaded can be loaded into the vehicle, and the last vehicle is loaded with the required containers to be loaded, and at least one of the following conditions is satisfied: the first rectangle corresponding to the last vehicle cannot be filled with any original rectangle, and all original rectangles have been filled in the first rectangle.

[0083] Among them, the planning results of vehicle loading may include: the number of the to-be-loaded material box corresponding to the target rectangle, the information of the materials loaded in the to-be-loaded material box corresponding to the target rectangle, the train number, the three-dimensional coordinates of the center points of each to-be-loaded material box corresponding to each target rectangle based on a preset three-dimensional coordinate system, the height of the to-be-loaded material box corresponding to the target rectangle, the length of the target rectangle in the length direction of the first rectangle, that is, the length of each to-be-loaded material box corresponding to the target rectangle along the length direction of the car body, the length of the target rectangle in the width direction of the first rectangle, that is, the length of each to-be-loaded material box corresponding to the target rectangle along the width direction of the car body, vehicle model information, loading rate, total weight of cargo, and loading order of each to-be-loaded material box.

[0084] The vehicle packing planning method provided in the above embodiment realizes automatic planning of vehicle packing based on the size of the carriage, the size and original attributes of the material box to be loaded, and improves the packing efficiency. And for emergencies such as temporary requirements for additional delivery of goods, the automatic planning of vehicle packing can respond quickly, avoiding the planning confusion that may be caused by manual methods. And this scheme uses a one-dimensional plus two-dimensional method to realize three-dimensional vehicle packing planning, with fast calculation speed and high efficiency. Specifically, first simulate the stacking of one-dimensional material boxes to be loaded to obtain the original rectangle, then use the target attributes of the original rectangle and the target evaluation score calculated by the loading waste area to select the target rectangle from the original rectangle, and select the target loading point from the loadable points, and then fill the two-dimensional target rectangle into the first rectangle at the target loading point. Then, the planning result of vehicle packing is obtained based on each target rectangle and each target loading point. Using the planning result for vehicle packing improves the loading rate of the vehicle.

[0085] Figure 2 A flow chart of another vehicle packing planning method provided in Example 2 of the present application. Figure 1 On the basis of the illustrated embodiment, the planning method for vehicle packing is improved.

[0086] like Figure 2 As shown, a vehicle packing planning method may include the following steps:

[0087] Step 201, obtain the dimensions of the vehicle compartment, and obtain the dimensions and original attributes of multiple boxes to be loaded; wherein the dimensions include length, width and height; and the original attributes include mandatory and optional.

[0088] Specifically, the principle and implementation of step 201 are similar to those of step 101 and will not be described in detail.

[0089] Step 202 , based on the height of the carriage and the sizes of multiple boxes to be loaded, simulate the stacking of the boxes to be loaded to obtain an original rectangle; based on the original attributes of at least one box to be loaded corresponding to the original rectangle, determine the target attributes of the original rectangle.

[0090] Specifically, the principle and implementation of step 202 are similar to those of step 102 and will not be described in detail.

[0091] Step 203, using the skyline to simulate the current loading boundary to obtain at least one original line segment; wherein the current loading boundary is obtained by simulating a packing process by filling the target rectangle into the first rectangle; and every two original line segments are parallel to each other.

[0092] refer to Figure 3 , solid color rectangles of different colors represent different target matrices. The rectangles with yellow-brown lines are the wasted areas, i.e., the loading waste areas. The horizontal line segments 1, 2, 3, and 4 represent the four original line segments.

[0093] Step 204, select a loadable point on the original line segment; based on the target attribute and the loading waste area, calculate the target evaluation score of each original rectangle simulating the first rectangle filled at each loadable point.

[0094] You can select loadable points on the original line segment according to loading needs.

[0095] In one implementable manner, the method also includes using the skyline to simulate the current loading boundary to obtain N original line segments with a front-to-back order; selecting loadable points on the original line segments, including: if the current original line segment is determined to be the first original line segment, then the left endpoint of the current original line segment is used as the loadable point; if the current original line segment is determined to be the last original line segment, then the right endpoint of the current original line segment is used as the loadable point; if the current original line segment is determined to be neither the first original line segment nor the last original line segment, and the current original line segment is lower than the previous original line segment, then the left endpoint of the current original line segment is used as the loadable point; if the current original line segment is determined to be neither the first original line segment nor the last original line segment, and the current original line segment is lower than the next original line segment, then the right endpoint of the current original line segment is used as the loadable point.

[0096] Wherein, N is greater than or equal to 1.

[0097] Specifically, the above method can conveniently realize the selection of loadable points on the original line segment, and the loadable points obtained in this way are used for vehicle loading, which is convenient for loading, helps to reduce the loading waste area, and thus can improve the loading rate.

[0098] In one implementable method, based on the target attributes and the loading waste area, the target evaluation score of each original rectangle simulating filling the first rectangle at each loadable point of the first rectangle is calculated, and it also includes: determining the original line segments obtained after the original rectangle is simulated to fill the first rectangle at the first loadable point of the first rectangle, and determining the maximum distance between the original line segments; if the maximum distance is less than a preset threshold, and there are at least two original rectangles that can be filled in the first rectangle at the first loadable point, then based on the target attributes and the loading waste area, the target evaluation score of each original rectangle simulating filling the first rectangle at each loadable point of the first rectangle is calculated.

[0099] In implementation, the distance between every two original line segments may be calculated respectively, and then the maximum value of these distances may be selected as the maximum distance between the original line segments.

[0100] In implementation, if the maximum distance is greater than or equal to a preset threshold, the corresponding original rectangle is not used as the target rectangle.

[0101] In implementation, it can be determined whether the original rectangle can be filled into the first rectangle at the first loadable point. If only one original rectangle can be filled into the first rectangle at the first loadable point, the preset first score value can be assigned to the target evaluation score corresponding to the original rectangle. The preset second score value amplitude is assigned to the target evaluation scores corresponding to other original rectangles other than the original rectangle. The preset first score value is greater than the preset second score value.

[0102] Specifically, by limiting the maximum distance between the original line segments and determining whether the original rectangle can be filled into the first rectangle at the first loadable point, vehicle loading can be facilitated.

[0103] In one implementable method, based on the target attribute and the loading waste area, the evaluation score of each original rectangle simulation filling in the first rectangle at each loadable point of the first rectangle is calculated, including: based on the target attribute of the current original rectangle, determining the first evaluation score of the current original rectangle simulation filling in the first rectangle at the second loadable point of the first rectangle; determining the loading waste area of ​​each original rectangle simulation filling in the first rectangle at the second loadable point of the first rectangle; sorting the loading waste areas corresponding to each original rectangle to obtain a target sequence; based on the position of the loading waste area corresponding to the current original rectangle in the target sequence, determining the second evaluation score of the current original rectangle simulation filling in the first rectangle at the second loadable point of the first rectangle; and determining the target evaluation score based on the first evaluation score and the second evaluation score.

[0104] Specifically, if the target attribute of the original rectangle is mandatory, the corresponding first evaluation score can be assigned a first score. If the target attribute of the original rectangle is optional, the corresponding first evaluation score can be assigned a second score. The first score is greater than the second score.

[0105] refer to Figure 4 , Figure 4 The new box in the middle refers to the current original rectangle. Solid rectangles of different colors represent different target matrices. The rectangles with yellow-brown lines are the wasted area, that is, the loading waste area. The rectangles with yellow-brown lines close to the new box are the loading waste areas corresponding to the current original rectangle.

[0106] refer to Figure 5 , Figure 5 The new box in the middle refers to the current original rectangle. Solid rectangles of different colors represent different target matrices. The rectangles with yellow-brown lines are the wasted area, that is, the loading waste area. The rectangles with yellow-brown lines close to the new box are the loading waste areas corresponding to the current original rectangle.

[0107] In implementation, the larger the loading waste area of ​​the current original rectangle is, the smaller the corresponding second evaluation score is.

[0108] In implementation, the first evaluation score and the second evaluation score may be weighted and summed to obtain the target evaluation score. The higher the target evaluation score corresponding to the original rectangle, the higher its loading priority.

[0109] Specifically, the above method can conveniently realize the target evaluation score of simulating filling the first rectangle at each loadable point of each original rectangle based on the target attribute and the loading waste area.

[0110] Step 205, taking the original rectangle corresponding to the target evaluation score that meets the score requirements as the target rectangle, and taking the corresponding loadable point as the target loading point; filling the target rectangle into the first rectangle at the target loading point; wherein the length of the first rectangle is equal to the length of the carriage, and the width of the first rectangle is equal to the width of the carriage.

[0111] Specifically, the implementation principle of step 205 and the technical effects produced refer to step 103.

[0112] Step 206: If it is determined that any original rectangle cannot be filled into the first rectangle or all original rectangles have been filled into the first rectangle, a planning result of vehicle packing is determined based on each target rectangle and each target loading point.

[0113] Specifically, the principle and implementation of step 206 are similar to those of step 104 and will not be described in detail.

[0114] Figure 6 This is a schematic diagram of the structure of a vehicle packing planning device provided in the third embodiment of the present application. The device may be in the form of software and / or hardware. Figure 6 As shown, a vehicle packing planning device 600 includes: an acquisition unit 601, a stacking unit 602, a filling unit 603, and a planning unit 604.

[0115] The acquisition unit 601 is used to acquire the dimensions of the vehicle compartment and the dimensions and original attributes of multiple boxes to be loaded; wherein the dimensions include length, width and height; and the original attributes include mandatory and optional.

[0116] The stacking unit 602 is used to simulate the stacking of the to-be-loaded boxes based on the height of the carriage and the sizes of the multiple to-be-loaded boxes to obtain an original rectangle; and determine the target attribute of the original rectangle based on the original attribute of at least one to-be-loaded box corresponding to the original rectangle;

[0117] The filling unit 603 is used to calculate the target evaluation score of each original rectangle simulating the filling of the first rectangle at each loadable point of the first rectangle based on the target attribute and the loading waste area; the original rectangle corresponding to the target evaluation score that meets the score requirement is used as the target rectangle, and the corresponding loadable point is used as the target loading point; the target rectangle is filled into the first rectangle at the target loading point; wherein the length of the first rectangle is equal to the length of the carriage, and the width of the first rectangle is equal to the width of the carriage;

[0118] The planning unit 604 is used to determine the planning result of the vehicle packing based on each target rectangle and each target loading point if it is determined that any original rectangle can no longer be filled into the first rectangle or all original rectangles have been filled into the first rectangle.

[0119] The filling unit 603 is specifically used to: simulate the current loading boundary by using the skyline to obtain at least one original line segment; wherein the current loading boundary is obtained by simulating the packing process by filling the target rectangle into the first rectangle; and every two original line segments are parallel to each other;

[0120] Select a loadable point on the original line segment;

[0121] Based on the target attributes and the loading waste area, the target evaluation score of each original rectangle simulating filling the first rectangle at each loadable point is calculated.

[0122] The filling unit 603 is specifically used to: determine the original line segments obtained after the original rectangle is simulated by filling the first moment at the first loadable point of the first rectangle, and determine the maximum distance between the original line segments;

[0123] If the maximum distance is less than a preset threshold and there are at least two original rectangles that can be filled into the first rectangle at the first loadable point, then based on the target attributes and loading waste area, the target evaluation score of each original rectangle simulating filling the first rectangle at each loadable point of the first rectangle is calculated.

[0124] The filling unit 603 is specifically used for: the method further includes using the skyline to simulate the current loading boundary to obtain N original line segments with a front-to-back order; if it is determined that the current original line segment is the first original line segment, the left endpoint of the current original line segment is used as a loadable point;

[0125] If it is determined that the current original line segment is the last original line segment, the right endpoint of the current original line segment is used as the loadable point;

[0126] If it is determined that the current original line segment is neither the first original line segment nor the last original line segment, and the current original line segment is lower than the previous original line segment, the left endpoint of the current original line segment is used as the loadable point;

[0127] If it is determined that the current original line segment is neither the first original line segment nor the last original line segment, and the current original line segment is lower than the next original line segment, the right endpoint of the current original line segment is used as the loadable point.

[0128] The filling unit 603 is specifically used to: determine a first evaluation score of the current original rectangle simulating filling the first rectangle at the second loadable point of the first rectangle based on the target attribute of the current original rectangle;

[0129] Determine the loading waste area of ​​each original rectangle to simulate filling the first rectangle at the second loadable point of the first rectangle; sort the loading waste areas corresponding to each original rectangle to obtain a target sequence;

[0130] Determine, based on the position of the loading waste area corresponding to the current original rectangle in the target sequence, a second evaluation score of the current original rectangle simulating filling the first rectangle at the second loadable point of the first rectangle;

[0131] Based on the first evaluation score and the second evaluation score, a target evaluation score is determined.

[0132] The stacking unit 602 is specifically configured to: if the original attribute of at least one to-be-loaded material box corresponding to the original rectangle has a must-load, determine that the target attribute of the original rectangle is a must-load;

[0133] If the original attributes of at least one to-be-loaded material box corresponding to the original rectangle are all optional, then the target attribute of the original rectangle is determined to be optional.

[0134] The vehicle packing planning device provided in the embodiment of the present application has the same implementation principle and technical effects as those of the aforementioned vehicle packing planning method embodiment. For the sake of brief description, for matters not mentioned in the device embodiment, reference may be made to the corresponding contents in the aforementioned vehicle packing planning method embodiment.

[0135] Figure 7 A hardware structure diagram of an electronic device provided in Embodiment 4 of the present application. This embodiment provides an electronic device, comprising: at least one processor 701, and a memory 702 in communication with the at least one processor 701; the memory 702 stores computer-executable instructions; the processor 701 executes the computer-executable instructions stored in the memory 702, so as to implement the vehicle packing planning method described in any of the above embodiments.

[0136] Figure 7 The electronic device shown also includes a communication interface 703 and a communication bus 704, wherein the processor 701, the memory 702 and the communication interface 703 are connected to each other via the communication bus 704. The communication bus 704 can be divided into an address bus, a data bus, a control bus, etc. Figure 7 In the figure, only one thick line is used to represent the communication bus 704, but it does not mean that there is only one communication bus 704 or one type of communication bus 704. The processor 701 may also be called a controller, and there is no limitation on the name.

[0137] In the embodiment of the present application, the memory 702 stores instructions that can be executed by at least one processor 701. The at least one processor 701 can execute the vehicle packing planning method discussed above by executing the instructions stored in the memory 702. The processor 701 can implement Figure 7 The functions of each module in the device shown.

[0138] Among them, the processor 701 is the control center of the device, and can use various interfaces and lines to connect the various parts of the entire control device. By running or executing instructions stored in the memory 702 and calling data stored in the memory 702, the various functions of the device and process data, the device can be monitored as a whole.

[0139] In one possible design, the processor 701 may include one or more processing units, and the processor 701 may integrate an application processor and a modem processor, wherein the application processor mainly processes an operating system, a user interface, and application programs, and the modem processor mainly processes wireless communications. It is understandable that the modem processor may not be integrated into the processor 701. In some embodiments, the processor 701 and the memory 702 may be implemented on the same chip or on separate chips.

[0140] The processor 701 may be a general-purpose processor, such as a central processing unit (CPU), a digital signal processor, an application-specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component, and may implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of the present application. A general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the vehicle packing planning method disclosed in the embodiments of the present application may be directly embodied as being executed by a hardware processor, or may be executed by a combination of hardware and software modules in the processor.

[0141] The memory 702 is a non-volatile computer-readable storage medium that can be used to store non-volatile software programs, non-volatile computer executable programs and modules. The memory 702 may include at least one type of storage medium, such as a flash memory, a hard disk, a multimedia card, a card-type memory, a random access memory (Random Access Memory, RAM), a static random access memory (Static Random Access Memory, SRAM), a programmable read-only memory (Programmable Read Only Memory, PROM), a read-only memory (Read Only Memory, ROM), an electrically erasable programmable read-only memory (Electrically Erasable Programmable Read-Only Memory, EEPROM), a magnetic memory, a disk, an optical disk, etc. The memory 702 is any other medium that can be used to carry or store a desired program code in the form of an instruction or data structure and can be accessed by a computer, but is not limited thereto. The memory 702 in the embodiment of the present application can also be a circuit or any other device that can realize a storage function, for storing program instructions and / or data.

[0142] By programming the processor 701, the code corresponding to the vehicle packing planning method described in the above embodiment can be fixed into the chip, so that the chip can execute the vehicle packing planning method when running. Figure 1 or Figure 2 The steps of the vehicle packing planning method of the embodiment shown are as follows: How to design and program the processor 701 is a technique known to those skilled in the art and will not be described in detail here.

[0143] The embodiment of the present application also provides a computer-readable storage medium, in which a computer-executable instruction is stored. When the computer-executable instruction is executed by a processor, it is used to implement the vehicle packing planning method described in any of the above embodiments. Therefore, it will not be described in detail here. In addition, the description of the beneficial effects of using the same method will not be described in detail. For technical details not disclosed in the computer storage medium embodiment involved in the present invention, please refer to the description of the method embodiment of the present invention.

[0144] In some possible implementations, various aspects of the vehicle packing planning method provided in the present application can also be implemented in the form of a program product, which includes a program code. When the program product is run on an apparatus, the program code is used to enable the control device to execute the steps of the vehicle packing planning method according to various exemplary embodiments of the present application described above in this specification.

[0145] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.

[0146] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0147] These computer program instructions may also be stored in a computer readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer readable memory produce an article of manufacture including an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0148] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.

[0149] Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

Claims

1. A vehicle packing planning method, characterized in that: The method comprises: Obtain the dimensions of the vehicle compartment, and obtain the dimensions and original attributes of multiple boxes to be loaded; the dimensions include length, width, and height; the original attributes include mandatory and optional; Based on the height of the carriage and the sizes of the multiple boxes to be loaded, the stacking of the boxes to be loaded is simulated to obtain an original rectangle; based on the original attributes of at least one box to be loaded corresponding to the original rectangle, the target attributes of the original rectangle are determined; Based on the target attributes and the loading waste area, the target evaluation score of each original rectangle is calculated to simulate the filling of the first rectangle at each loadable point of the first rectangle; the original rectangle corresponding to the target evaluation score that meets the score requirement is used as the target rectangle, and the corresponding loadable point is used as the target loading point; the target rectangle is filled into the first rectangle at the target loading point; wherein the length of the first rectangle is equal to the length of the carriage, and the width of the first rectangle is equal to the width of the carriage; If it is determined that any original rectangle cannot be filled into the first rectangle or all original rectangles have been filled into the first rectangle, a planning result of vehicle packing is determined based on each target rectangle and each target loading point.

2. The method according to claim 1, characterized in that The step of calculating the target evaluation score of each original rectangle simulating filling the first rectangle at each loadable point of the first rectangle based on the target attribute and the loading waste area includes: Simulating the current loading boundary using the skyline to obtain at least one original line segment; wherein the current loading boundary is obtained by simulating a packing process by filling the target rectangle into the first rectangle; and every two original line segments are parallel to each other; Select a loadable point on the original segment; Based on the target attributes and the loading waste area, the target evaluation score of each original rectangle simulating filling the first rectangle at each loadable point is calculated.

3. The method according to claim 2, characterized in that The step of calculating the target evaluation score of each original rectangle simulating filling the first rectangle at each loadable point of the first rectangle based on the target attribute and the loading waste area also includes: Determine the original line segments obtained after the original rectangle simulation is filled with the first moment at the first loadable point of the first rectangle, and determine the maximum distance between the original line segments; If the maximum distance is less than a preset threshold, and there are at least two original rectangles that can be filled into the first rectangle at the first loadable point, then based on the target attributes and loading waste area, the target evaluation score of each original rectangle simulating filling the first rectangle at each loadable point of the first rectangle is calculated.

4. The method according to claim 2, characterized in that: The method further includes using the skyline to simulate the current loading boundary to obtain N original line segments with a front-to-back order; The step of selecting a loadable point on the original line segment comprises: If it is determined that the current original line segment is the first original line segment, the left endpoint of the current original line segment is used as the loadable point; If it is determined that the current original line segment is the last original line segment, the right endpoint of the current original line segment is used as the loadable point; If it is determined that the current original line segment is neither the first original line segment nor the last original line segment, and the current original line segment is lower than the previous original line segment, the left endpoint of the current original line segment is used as the loadable point; If it is determined that the current original line segment is neither the first original line segment nor the last original line segment, and the current original line segment is lower than the last original line segment, the right endpoint of the current original line segment is used as the loadable point.

5. The method according to claim 1, characterized in that: The step of calculating the evaluation score of each original rectangle simulating filling the first rectangle at each loadable point of the first rectangle based on the target attribute and the loading waste area comprises: Determining, based on the target attribute of the current original rectangle, a first evaluation score of the current original rectangle simulating filling the first rectangle at the second loadable point of the first rectangle; Determine the loading waste area of ​​each original rectangle to simulate filling the first rectangle at the second loadable point of the first rectangle; sort the loading waste areas corresponding to each original rectangle to obtain a target sequence; Determine, based on the position of the loading waste area corresponding to the current original rectangle in the target sequence, a second evaluation score of the current original rectangle simulating filling the first rectangle at the second loadable point of the first rectangle; Based on the first evaluation score and the second evaluation score, a target evaluation score is determined.

6. The method according to claim 1, characterized in that The determining of the target attribute of the original rectangle based on the original attribute of at least one to-be-loaded material box corresponding to the original rectangle includes: If the original attribute of at least one to-be-loaded material box corresponding to the original rectangle has a must-load condition, then the target attribute of the original rectangle is determined to be a must-load condition; If the original attributes of at least one to-be-loaded material box corresponding to the original rectangle are all optional, then the target attribute of the original rectangle is determined to be optional.

7. A vehicle packing planning device, characterized in that: The device comprises: An acquisition unit is used to acquire the dimensions of the vehicle compartment and the dimensions and original attributes of multiple boxes to be loaded; the dimensions include length, width and height; the original attributes include mandatory and optional; A stacking unit is used to simulate the stacking of the boxes to be loaded based on the height of the carriage and the sizes of the multiple boxes to be loaded to obtain an original rectangle; based on the original attributes of at least one box to be loaded corresponding to the original rectangle, determine the target attributes of the original rectangle; The filling unit is used to calculate the target evaluation score of each original rectangle simulating the filling of the first rectangle at each loadable point of the first rectangle based on the target attribute and the loading waste area; the original rectangle corresponding to the target evaluation score that meets the score requirement is used as the target rectangle, and the corresponding loadable point is used as the target loading point; the target rectangle is filled into the first rectangle at the target loading point; wherein the length of the first rectangle is equal to the length of the carriage, and the width of the first rectangle is equal to the width of the carriage; The planning unit is used to determine the planning result of the vehicle packing based on each target rectangle and each target loading point if it is determined that any original rectangle can no longer be filled into the first rectangle or all the original rectangles have been filled into the first rectangle.

8. An electronic device, characterized in that: comprising a processor, and a memory communicatively connected to the processor; The memory stores computer-executable instructions; The processor executes the computer-executable instructions stored in the memory, so that the processor executes the vehicle packing planning method according to any one of claims 1 to 6.

9. A computer-readable storage medium, characterized in that: The storage medium stores a computer program, and when the computer program is executed by a processor, the vehicle packing planning method according to any one of claims 1 to 6 is implemented.

10. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the vehicle packing planning method described in any one of claims 1 to 6 is implemented.

Images