Method, device, computing equipment and medium for transporting goods
By establishing a cellular transmission model, optimizing the picking time and transmission path of the conveying line, the problems of low picking efficiency and path congestion in the existing technology are solved, and more efficient conveying line transmission and warehouse picking efficiency are achieved.
Patent Information
- Application Number
- CN202010793108.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2020-08-07
- Publication Date
- 2024-11-26
- Estimated Expiration
- 2040-08-07
AI Technical Summary
The existing conveyor line path optimization solution cannot effectively improve picking efficiency, resulting in the impact of the timeliness of order shipments, especially when the number of picking boxes is large, it is prone to path congestion.
By establishing a cellular transmission model, using the delivery task data and delivery parameters, the optimal departure time and optimal delivery path of each cargo are determined, and the picking time and transmission path of the conveyor line are optimized to achieve total flow minimization and path efficiency maximize.
It effectively improves the transmission efficiency of the conveyor line, improves the picking efficiency of the warehouse, reduces the congestion in the picking path, and improves the timeliness of order shipments.
Smart Images

Figure CN113762564B_ABST
Abstract
Description
Technical Field
[0001] The present disclosure relates to the fields of computer technology, Internet technology, and electronic technology, and more specifically, to a method, device, computing equipment, and medium for transporting goods. Background Art
[0002] With the rapid development of e-commerce, more and more users choose to shop online. Each warehouse of the e-commerce platform needs to process tens of thousands of orders of all sizes every day, and the delivery efficiency of the orders will directly affect the user's consumption experience. The transmission efficiency of the conveyor line is closely related to the efficiency of order delivery. The improvement of the transmission efficiency of the conveyor line has a positive impact on the user experience and the reduction of operating costs. The existing conveyor line path optimization scheme selects a certain number of orders according to the transmission wave, locates the shelf position of all goods in the selected order, and each shelf position corresponds to a node. The conveyor line path optimization scheme is generated according to the position of the node. The two common path optimization schemes are: U-type path generation scheme and A* path generation scheme.
[0003] The transmission path determined by the U-shaped path generation scheme is not optimal. If the goods are picked according to this transmission path, the conveyor line will take a lot of detours, affecting the overall picking efficiency. The transmission path based on the A* algorithm will mostly choose the shortest path and the second shortest path. When the number of picking boxes is large, it is easy to cause large-scale congestion on the picking path and reduce the transmission efficiency of the conveyor line.
[0004] Therefore, the above warehouse conveyor line path optimization solution cannot guarantee the picking efficiency, thus affecting the delivery timeliness of the order. Summary of the invention
[0005] In view of this, the present disclosure provides a method, apparatus, computing device and medium for transporting goods.
[0006] One aspect of the present disclosure provides a method for transporting goods, comprising: acquiring transport task data, the transport task data comprising at least one starting point, at least one end point, at least one departure time, and the number of goods to be transported, wherein there is at least one transport path between the at least one starting point and the at least one end point; acquiring transport parameters of each transport path in the at least one transport path; establishing a cellular transport model based on the transport task data and the transport parameters; using the cellular transport model, determining an optimal departure time for each of the goods from the at least one departure time, and determining an optimal transport path from the at least one transport path; and transporting the goods at the optimal departure time of each of the goods via the optimal transport path of the goods.
[0007] According to an embodiment of the present disclosure, establishing a cellular transmission model based on the transport task data and the transport parameters includes: determining an objective function of the cellular transmission model with the goal of minimizing the total flow of the at least one transport path; and determining a constraint function of the cellular transmission model based on the transport task data and the transport parameters.
[0008] According to an embodiment of the present disclosure, the transport path includes a plurality of sections; the objective function of the cellular transport model is determined with the minimum total flow of the at least one transport path as the goal, including: establishing the objective function according to the following formula:
[0009]
[0010] Wherein, f(x) is the objective function, is the quantity of goods in the i-th section of the multiple transport routes at time t, is the time set, C is the set of all road sections, C S is the endpoint set, m is a preset dummy variable, and m is a positive integer.
[0011] According to an embodiment of the present disclosure, the optimal departure time of each cargo is determined from the at least one departure time, and the optimal transportation path is determined from the at least one transportation path through the cellular transmission model, including: solving the cellular transmission model using a branch and bound algorithm to obtain the optimal departure time and optimal transportation path for each cargo.
[0012] According to an embodiment of the present disclosure, the transport parameters include the capacity, blocking density and reverse impact speed of each section in the multiple transport paths, the capacity is used to indicate the maximum cargo flow when each section is not blocked, the blocking density is used to indicate the cargo density when each section is blocked, and the reverse impact speed is used to indicate the speed of reverse movement of cargo when each section is blocked.
[0013] Another aspect of the present disclosure provides a cargo transportation device, comprising: a first acquisition module, used to acquire transportation task data, the transportation task data including at least one starting point, at least one end point, at least one departure time and the number of cargoes to be transported, wherein there is at least one transportation path between the at least one starting point and the at least one end point; a second acquisition module, used to acquire transportation parameters of each transportation path in the at least one transportation path; a modeling module, used to establish a cellular transmission model determination module according to the transportation task data and the transportation parameters, used to determine the optimal departure time of each cargo from the at least one departure time and determine the optimal transportation path from the at least one transportation path by using the cellular transmission model; and a transportation module, used to transport the cargo at the optimal departure time of each cargo via the optimal transportation path of the cargo.
[0014] According to an embodiment of the present disclosure, the modeling module includes: an objective function unit, which is used to determine the objective function of the cellular transmission model with the goal of minimizing the total flow of the at least one transmission path; and a constraint function unit, which is used to determine the constraint function of the cellular transmission model based on the transmission task data and the transmission parameters.
[0015] According to an embodiment of the present disclosure, the transport path includes a plurality of sections; the objective function unit is specifically used to establish the objective function according to the following formula:
[0016]
[0017] Wherein, f(x) is the objective function, is the quantity of goods in the i-th section of the multiple transport routes at time t, is the time set, C is the set of all road sections, C S is the endpoint set, m is a preset dummy variable, and m is a positive integer.
[0018] Another aspect of the present disclosure provides a computing device, including: one or more processors; a storage device for storing one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the method as described above.
[0019] Another aspect of the present disclosure provides a computer-readable storage medium storing computer-executable instructions, which are used to implement the above method when executed.
[0020] Another aspect of the present disclosure provides a computer program, which includes computer executable instructions, and the instructions are used to implement the method described above when executed.
[0021] According to the embodiments of the present disclosure, by simultaneously optimizing the picking time and the transmission path of the conveyor line, the transmission efficiency of the conveyor line is effectively improved, thereby improving the picking efficiency of the warehouse. BRIEF DESCRIPTION OF THE DRAWINGS
[0022] The above and other objects, features and advantages of the present disclosure will become more apparent through the following description of the embodiments of the present disclosure with reference to the accompanying drawings, in which:
[0023] Figure 1 An exemplary system architecture to which a method for transporting goods according to an embodiment of the present disclosure can be applied is schematically shown;
[0024] Figure 2A A flow chart schematically shows a method for transporting goods according to an embodiment of the present disclosure;
[0025] Figure 2B Schematically illustrates the delivery task data and delivery parameters according to an embodiment of the present disclosure;
[0026] Figure 3 A schematic diagram of a branch and bound algorithm according to an embodiment of the present disclosure is schematically shown;
[0027] Figure 4 Schematically shows a schematic diagram of a conveyor line according to another embodiment of the present disclosure;
[0028] Figure 5 A block diagram schematically shows a device for transporting goods according to an embodiment of the present disclosure; and
[0029] Figure 6 The block diagram of a computer system suitable for implementing the method described above according to an embodiment of the present disclosure is schematically shown. DETAILED DESCRIPTION
[0030] Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. However, it should be understood that these descriptions are exemplary only and are not intended to limit the scope of the present disclosure. In the following detailed description, for ease of explanation, many specific details are set forth to provide a comprehensive understanding of the embodiments of the present disclosure. However, it is apparent that one or more embodiments may also be implemented without these specific details. In addition, in the following description, descriptions of known structures and technologies are omitted to avoid unnecessary confusion of the concepts of the present disclosure.
[0031] The terms used herein are only for describing specific embodiments and are not intended to limit the present disclosure. The terms "comprise", "include", etc. used herein indicate the existence of the features, steps, operations and / or components, but do not exclude the existence or addition of one or more other features, steps, operations or components.
[0032] All terms (including technical and scientific terms) used herein have the meanings commonly understood by those skilled in the art, unless otherwise defined. It should be noted that the terms used herein should be interpreted as having a meaning consistent with the context of this specification, and should not be interpreted in an idealized or overly rigid manner.
[0033] In the case of using expressions such as "at least one of A, B, and C, etc.", it should generally be interpreted as the meaning of the expression generally understood by those skilled in the art (for example, "a system having at least one of A, B, and C" should include but is not limited to a system having A alone, B alone, C alone, A and B, A and C, B and C, and / or A, B, C, etc.). In the case of using expressions such as "at least one of A, B, or C, etc.", it should generally be interpreted as the meaning of the expression generally understood by those skilled in the art (for example, "a system having at least one of A, B, or C" should include but is not limited to a system having A alone, B alone, C alone, A and B, A and C, B and C, and / or A, B, C, etc.).
[0034] The embodiment of the present disclosure provides a method for transporting goods and a device capable of applying the method. The method includes obtaining transport task data, the transport task data including at least one starting point, at least one end point, at least one departure time, and the number of goods to be transported, wherein there is at least one transport path between the at least one starting point and the at least one end point; obtaining the transport parameters of each transport path in the at least one transport path; establishing a cellular transmission model based on the transport task data and the transport parameters; using the cellular transmission model, determining the optimal departure time of each goods from the at least one departure time, and determining the optimal transport path from the at least one transport path; and for each of the goods, at the optimal departure time of the goods, transporting the goods via the optimal transport path of the goods.
[0035] Figure 1 The exemplary system architecture 100 to which the method for transporting goods according to an embodiment of the present disclosure can be applied is schematically shown. It should be noted that: Figure 1What is shown is merely an example of a system architecture to which the embodiments of the present disclosure can be applied, in order to help those skilled in the art understand the technical content of the present disclosure, but it does not mean that the embodiments of the present disclosure cannot be used in other devices, systems, environments or scenarios.
[0036] like Figure 1 As shown, the system architecture 100 according to this embodiment may include a control system 101 and a conveyor line system 102 .
[0037] The control system 101 can be used to generate an optimized transportation plan according to the transportation task (such as a picking task), and then control the conveyor line system 102 to transport each cargo (such as a picking box) from one location in the site to another via the optimal transportation path at the optimal transportation time, thereby completing the time and space transfer of the production cargo.
[0038] The conveyor line system 102 may include one or more conveyor lines. The conveyor line system 102 may be used to receive instructions from the control system 101 and, according to the instructions, convey the goods on the conveyor line to the destination along a specified path at a specified time.
[0039] Figure 2A The flowchart of the method for transporting goods according to the embodiment of the present disclosure is schematically shown.
[0040] like Figure 2A As shown, the method includes, in operation S210, obtaining transport task data.
[0041] According to an embodiment of the present disclosure, the transport task data may be used to represent information of the goods to be transported, the starting point and the end point of the transport, available departure times, etc. Exemplarily, the transport task data may include at least one starting point, at least one end point, at least one departure time, and the quantity of goods to be transported, wherein there is at least one transport path between at least one starting point and at least one end point.
[0042] Then, in operation S220, a conveying parameter of each conveying path of the at least one conveying path is acquired.
[0043] According to an embodiment of the present disclosure, the transport parameters may include, for example, the capacity, blocking density and reverse impact speed of each section in multiple transport paths, wherein the capacity is used to indicate the maximum cargo flow rate of each section when no blocking occurs, the blocking density is used to indicate the cargo density of each section when blocking occurs, and the reverse impact speed is used to indicate the speed of reverse movement of cargo when blocking occurs in each section.
[0044] In operation S230 , a cellular transport model is established according to the transport task data and the transport parameters.
[0045] Figure 2BThe flowchart of establishing a cellular transport model according to the transport task data and transport parameters according to an embodiment of the present disclosure is schematically shown. Figure 2B As shown, operation S230 may include operations S231 to S232, for example.
[0046] More specifically, in operation S231 , the objective function of the cellular transport model is determined with the goal of minimizing the total flow of at least one transport path.
[0047] In this embodiment, the following assumptions are made: the dynamic network flow of the transmission line is based on the optimization of the entire network system; the cellular transmission model is an advanced spatial queuing model, which has good characteristics of capturing spatial queuing and shock wave propagation, and can be used for flow propagation in the transmission line network. At the same time, taking the minimum overall flow of the transmission line as the objective function, considering the capacity of the cell and the prevention of blocking flow restrictions and other factors, the following symbols are defined for the convenience of explanation. For example, Table 1 shows the definition of the set symbol according to the embodiment of the present disclosure, Table 2 shows the definition of the parameter according to the embodiment of the present disclosure, and Table 3 shows the definition of the variable according to the embodiment of the present disclosure.
[0048] Table 1
[0049]
[0050] Table 2
[0051]
[0052]
[0053] Table 3
[0054]
[0055] According to an embodiment of the present disclosure, the objective function may be established according to the following formula (1):
[0056]
[0057] Among them, f(x) is the objective function, as shown in Tables 1 to 4, is the quantity of goods in the i-th section of multiple transport routes at time t, is the time set, C is the set of all road sections, C S is the endpoint set, m is a preset dummy variable, and m is a positive integer.
[0058] In operation S232 , a constraint function of the cellular transport model is determined according to the transport task data and the transport parameters.
[0059] According to an embodiment of the present disclosure, the following constraint functions (2) to (20) may be established based on the transport task data and transport parameters:
[0060]
[0061]
[0062]
[0063]
[0064]
[0065]
[0066]
[0067]
[0068]
[0069]
[0070]
[0071] m≤M s (13)
[0072]
[0073]
[0074]
[0075]
[0076]
[0077]
[0078]
[0079] Among them, constraint (2) represents the flow conservation constraint.
[0080] Equation (3) indicates that the number of picking boxes in each cell is equal to the sum of the number of picking boxes on all paths passing through the cell.
[0081] Constraint (4) indicates that the number of picking boxes on a road segment between cells is equal to the sum of the number of picking boxes on all paths passing through the road segment.
[0082] Constraint (5) indicates that for the starting cell, the number of picking boxes of a certain cell passing through the path r at each moment is equal to the sum of the picking box flow of the same path passing through the cell at the previous moment plus the number of picking boxes of the cell on the path at the previous moment minus the sum of the picking boxes flowing to the downstream cells at the previous moment.
[0083] Constraint (6) represents the flow balance relationship of path r passing through a certain cell at each moment for all other cells.
[0084] Constraint (7) represents the flow balance relationship for the terminal cell.
[0085] Constraint (8) indicates that the number of picking boxes flowing from a certain cell to the downstream cell cannot exceed the number of picking boxes of the current cell.
[0086] Constraint (9) indicates that the quantity of goods flowing into a certain cell picking box from the upstream cell cannot exceed the remaining capacity.
[0087] Constraint (10) indicates that the number of picking boxes that flow into this cell from the upstream cell cannot exceed the maximum number of picking boxes that this cell can pass through.
[0088] Constraint (11) indicates that the number of picking boxes flowing from a certain cell to the downstream cell cannot exceed the maximum number of picking boxes that the cell can accommodate.
[0089] Constraints (12) and (13) represent constraints to prevent network congestion.
[0090] Constraint (14) indicates that at a certain time t, the total number of picking boxes on path r is equal to the flow of the path at that time.
[0091] Constraint (15) indicates that for a certain picking box, the picking box can only choose one of the paths during the whole process.
[0092] Constraint (16) indicates that the number of departures for each OD pair during the simulation period is equal to the total number of required picks.
[0093] Constraint (17) represents a 0-1 restriction, which means that if a certain picking box is on a certain path at a certain time, it is 1, otherwise it is 0.
[0094] Constraints (18) to (20) represent initial conditions and non-negative positive integer restrictions.
[0095] Then, returning to FIG. 2 , in operation S240 , the cellular transport model is used to determine the optimal departure time of each cargo from at least one departure time, and to determine the optimal transportation path from at least one transportation path.
[0096] It can be understood that the cellular transport model established in operation S230 is a linear integer programming. According to the embodiment of the present disclosure, the cellular transport model can be solved by using a branch and bound algorithm to obtain the optimal departure time and optimal transport path for each cargo. Figure 3 shown.
[0097] Exemplarily, the cellular transport model can be solved by the following steps.
[0098] Step 1: Set up F u =+∞;
[0099] Step 2: Choose subscript k∈NF and solve the following relaxed problem:
[0100]
[0101] st(2)-(16)
[0102]
[0103]
[0104]
[0105]
[0106] Among them, st(2)-(16) means that the above constraints (2)-(16) are satisfied.
[0107] The optimal solution is Optimal value obj k ; If there is no optimal solution, set obj k =+∞.
[0108] Step 3: If obj k =+∞, set NF:=NF\{k} and go to step 7; otherwise, go to step 4.
[0109] Step 4: If obj k ≥F u , then set NF:=NF\{k} and go to step 7; otherwise, go to step 5.
[0110] Step 5: Object k <F u , Here S(P0) is the feasible region composed of (2)- (20), then let F u =obj k , NF:=NF\{k}, go to step 7, otherwise go to step 6.
[0111] Step 6: If obj k <F u , Then select the variables that do not satisfy the integer constraint, by adding the constraint and The original problem is decomposed into two subsets and Set NF: = NF\{k}∪{k1, k2}, and go to step (2)
[0112] Step 7: If Go to step 2. Then terminate, then is the optimal solution, F u is the optimal value if Then there is no optimal solution for P0.
[0113] In operation S250 , for each cargo, the cargo is transported at the optimal departure time of the cargo and via the optimal transportation path of the cargo.
[0114] According to the embodiments of the present disclosure, control instructions can be determined based on the optimal departure time and optimal transportation path of each cargo, and the conveyor line can be instructed to transport the cargo at the optimal departure time and via the optimal transportation path of the cargo according to the control instructions.
[0115] The embodiment of the present disclosure provides a method for transporting goods. When establishing a cellular transport model, the overall system flow path optimization goal is considered, the objective function is established with the overall optimal picking flow as the measurement standard, and the constraint function is set by considering factors such as road section capacity and flow congestion, so as to obtain the optimal departure time and optimal transport path for each cargo. Since the picking time and the transport path of the conveyor line are optimized at the same time, compared with the path optimization scheme that does not consider the optimization of the picking time of the conveyor line, the overall efficiency of the road network is improved, thereby improving the picking efficiency of the warehouse.
[0116] In addition, by setting penalty coefficients and constraints, the problem of congestion and delays in the transmission line can be at least partially eliminated.
[0117] Reference below Figure 4 , the method shown in FIG2 is further described in conjunction with a specific embodiment. Those skilled in the art can understand that the following exemplary embodiments are only used to understand the present disclosure, and the present disclosure is not limited thereto.
[0118] like Figure 4As shown in the figure, taking a certain outbound task of a warehouse as an example, each section of the conveyor line can be regarded as a node, the conveyor line nodes 1 and 14 are the starting points, and nodes 13 and 26 are the end points of the conveyor line. There are 25 paths between the starting point and the end point of the conveyor line. The total time period of the model is set to 60 time periods. Except for the starting point and the end point, the traffic capacity of each node in each time period is 10, and the blocking density of each node is 17. From the starting point 1 to the starting point 13, the number of pickings from the starting point 1 to the end point 13 is 50, the number of pickings from the starting point 1 to the end point 26 is 100, the number of pickings from the starting point 14 to the end point 13 is 80, and the number of pickings from the starting point 14 to the end point 26 is 80. At the same time, the reverse shock wave velocity of each node is 1.
[0119] The specific technical scheme is as follows: First, make assumptions about the warehouse operating environment and establish a mathematical model; second, consider the characteristics of the cellular transmission model, and establish the objective function with the minimum flow rate of the overall conveyor line as the measurement standard; third, according to the characteristics of the cellular transmission model, eliminate the road network blocking constraints based on the penalty coefficient; fourth, use the branch and bound algorithm to solve the relevant mathematical model; fifth, by solving the model, obtain the optimal picking time and optimal path for each picking box on the conveyor line, thereby ensuring that the entire road network is optimized.
[0120] After calculation, the departure time and optimal path of each picking box are shown in Table 4.
[0121] Table 4
[0122] Pick box number path Departure Time 1 1-5-9-13 time_1 2 1-29-18-13 time_31 3 1-5-9-13 time_11 4 1-5-9-13 time_34 … … … 309 14-30-34-42-46-26 time_9 310 14-30-18-42-46-26 time_20
[0123] Each picking box is then transported according to the path and departure time shown in Table 4.
[0124] Figure 5 A block diagram of a cargo conveying device according to an embodiment of the present disclosure is schematically shown.
[0125] like Figure 5 As shown, the apparatus 500 may include, for example, a first acquisition module 510 , a second acquisition module 520 , a modeling module 530 , a determination module 540 , and a delivery module 550 .
[0126] The first acquisition module 510, for example, can acquire delivery task data, which includes at least one starting point, at least one end point, at least one departure time, and the amount of goods to be transported, wherein there is at least one delivery path between at least one starting point and at least one end point.
[0127] The second acquisition module 520, for example, may acquire the transport parameters of each transport path in the at least one transport path.
[0128] The modeling module 530 can, for example, establish a cellular transport model based on the transport task data and transport parameters.
[0129] The determination module 540 may, for example, use a cellular transport model to determine an optimal departure time for each cargo from at least one departure time, and determine an optimal transport path from at least one transport path.
[0130] The transport module 550 , for example, can transport each cargo at the optimal departure time of the cargo via the optimal transport path of the cargo.
[0131] According to the embodiments of the present disclosure, by simultaneously optimizing the conveyor line picking time and the transmission path, the overall efficiency of the road network is improved, thereby improving the picking efficiency of the warehouse, compared with the path optimization scheme that does not consider the conveyor line picking time optimization.
[0132] According to an embodiment of the present disclosure, the modeling module may include, for example:
[0133] The objective function unit may, for example, determine the objective function of the cellular transport model with the goal of minimizing the total flow of at least one transport path.
[0134] The constraint function unit can, for example, determine the constraint function of the cellular transmission model according to the transmission task data and the transmission parameters.
[0135] According to an embodiment of the present disclosure, the transport path includes a plurality of sections; the objective function unit can be specifically used for:
[0136] The objective function is established according to the following formula:
[0137]
[0138] Where f(x) is the objective function, is the quantity of goods in the i-th section of multiple transport routes at time t, is the time set, C is the set of all road sections, C S is the endpoint set, m is a preset dummy variable, and m is a positive integer.
[0139] According to the embodiments of the present invention, any one or more of the modules, submodules, units, and subunits, or at least part of the functions of any one of them can be implemented in one module. According to the embodiments of the present invention, any one or more of the modules, submodules, units, and subunits can be split into multiple modules for implementation. According to the embodiments of the present invention, any one or more of the modules, submodules, units, and subunits can be at least partially implemented as hardware circuits, such as field programmable gate arrays (FPGAs), programmable logic arrays (PLAs), systems on chips, systems on substrates, systems on packages, application specific integrated circuits (ASICs), or can be implemented by hardware or firmware in any other reasonable way of integrating or packaging the circuit, or implemented in any one of the three implementation methods of software, hardware, and firmware, or in any appropriate combination of any of them. Alternatively, according to the embodiments of the present invention, one or more of the modules, submodules, units, and subunits can be at least partially implemented as computer program modules, and when the computer program modules are run, the corresponding functions can be performed.
[0140] For example, any multiple of the first acquisition module 510, the second acquisition module 520, the modeling module 530, the determination module 540, and the delivery module 550 can be combined in one module for implementation, or any one of the modules can be split into multiple modules. Alternatively, at least part of the functions of one or more of these modules can be combined with at least part of the functions of other modules and implemented in one module. According to an embodiment of the present disclosure, at least one of the first acquisition module 510, the second acquisition module 520, the modeling module 530, the determination module 540, and the delivery module 550 can be at least partially implemented as a hardware circuit, such as a field programmable gate array (FPGA), a programmable logic array (PLA), a system on a chip, a system on a substrate, a system on a package, an application specific integrated circuit (ASIC), or can be implemented by hardware or firmware such as any other reasonable way of integrating or packaging the circuit, or implemented in any one of the three implementation methods of software, hardware, and firmware, or in an appropriate combination of any of them. Alternatively, at least one of the first acquisition module 510 , the second acquisition module 520 , the modeling module 530 , the determination module 540 , and the delivery module 550 may be at least partially implemented as a computer program module, and when the computer program module is executed, a corresponding function may be performed.
[0141] Figure 6 The block diagram of a computer system suitable for implementing the method described above according to an embodiment of the present disclosure is schematically shown. Figure 6 The computer system shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.
[0142] like Figure 6As shown, the computer system 600 according to the embodiment of the present disclosure includes a processor 601, which can perform various appropriate actions and processes according to the program stored in the read-only memory (ROM) 602 or the program loaded from the storage part 608 to the random access memory (RAM) 603. The processor 601 may include, for example, a general-purpose microprocessor (such as a CPU), an instruction set processor and / or a related chipset and / or a special-purpose microprocessor (for example, an application-specific integrated circuit (ASIC)), etc. The processor 601 may also include an onboard memory for caching purposes. The processor 601 may include a single processing unit or multiple processing units for performing different actions of the method flow according to the embodiment of the present disclosure.
[0143] In RAM 603, various programs and data required for the operation of system 600 are stored. Processor 601, ROM 602 and RAM 603 are connected to each other through bus 604. Processor 601 performs various operations of the method flow according to the embodiment of the present disclosure by executing the program in ROM 602 and / or RAM 603. It should be noted that the program can also be stored in one or more memories other than ROM 602 and RAM 603. Processor 601 can also perform various operations of the method flow according to the embodiment of the present disclosure by executing the program stored in the one or more memories.
[0144] According to an embodiment of the present disclosure, the system 600 may further include an input / output (I / O) interface 605, which is also connected to the bus 604. The system 600 may further include one or more of the following components connected to the I / O interface 605: an input section 606 including a keyboard, a mouse, etc.; an output section 607 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 608 including a hard disk, etc.; and a communication section 609 including a network interface card such as a LAN card, a modem, etc. The communication section 609 performs communication processing via a network such as the Internet. A drive 610 is also connected to the I / O interface 605 as needed. A removable medium 611, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 610 as needed, so that a computer program read therefrom is installed into the storage section 608 as needed.
[0145] According to an embodiment of the present disclosure, the method flow according to an embodiment of the present disclosure can be implemented as a computer software program. For example, an embodiment of the present disclosure includes a computer program product, which includes a computer program carried on a computer-readable storage medium, and the computer program contains a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication part 609, and / or installed from the removable medium 611. When the computer program is executed by the processor 601, the above-mentioned functions defined in the system of the embodiment of the present disclosure are executed. According to an embodiment of the present disclosure, the system, equipment, device, module, unit, etc. described above can be implemented by a computer program module.
[0146] The present disclosure also provides a computer-readable storage medium, which may be included in the device / apparatus / system described in the above embodiments; or may exist independently without being assembled into the device / apparatus / system. The above computer-readable storage medium carries one or more programs, and when the above one or more programs are executed, the method according to the embodiment of the present disclosure is implemented.
[0147] According to an embodiment of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium, for example, may include but is not limited to: a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. In the present disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program, which may be used by or in combination with an instruction execution system, an apparatus or a device. For example, according to an embodiment of the present disclosure, a computer-readable storage medium may include the ROM 602 and / or RAM 603 described above and / or one or more memories other than ROM 602 and RAM 603.
[0148] The flow charts and block diagrams in the accompanying drawings illustrate the possible architecture, functions and operations of the systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each box in the flow chart or block diagram can represent a module, a program segment, or a part of a code, and the above-mentioned module, program segment, or a part of a code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flow chart, and the combination of the boxes in the block diagram or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.
[0149] It will be appreciated by those skilled in the art that the features described in the various embodiments and / or claims of the present disclosure may be combined and / or combined in a variety of ways, even if such combinations and / or combinations are not explicitly described in the present disclosure. In particular, the features described in the various embodiments and / or claims of the present disclosure may be combined and / or combined in a variety of ways without departing from the spirit and teachings of the present disclosure. All of these combinations and / or combinations fall within the scope of the present disclosure.
[0150] The embodiments of the present disclosure are described above. However, these embodiments are only for illustrative purposes and are not intended to limit the scope of the present disclosure. Although the embodiments are described above separately, this does not mean that the measures in the various embodiments cannot be used in combination to advantage. The scope of the present disclosure is defined by the attached claims and their equivalents. Without departing from the scope of the present disclosure, those skilled in the art may make a variety of substitutions and modifications, which should all fall within the scope of the present disclosure.
Claims
1. A method for transporting goods, comprising: Acquire transportation task data, wherein the transportation task data includes at least one starting point, at least one end point, at least one departure time, and the quantity of goods to be transported, wherein there is at least one transportation path between the at least one starting point and the at least one end point; Acquiring a conveying parameter of each conveying path in the at least one conveying path; Establishing a cellular transmission model according to the transmission task data and the transmission parameters; Determining the optimal departure time of each cargo from the at least one departure time and determining the optimal delivery path from the at least one delivery path by using the cellular transport model; and For each of the goods, at the optimal departure time of the goods, the goods are transported via the optimal transport path of the goods; The establishing of the cellular transmission model according to the transport task data and the transport parameters includes: determining the constraint function of the cellular transmission model according to the transport task data and the transport parameters, wherein the constraint function includes: the number of picking boxes flowing from the cell to the downstream cell cannot exceed the maximum number of picking boxes that the cell can accommodate, and the number of picking boxes flowing from the upstream cell to the cell cannot exceed the remaining traffic capacity.
2. The method according to claim 1, wherein: The establishing of the cellular transmission model according to the transport task data and the transport parameters further comprises: Taking the minimum total flow of the at least one transport path as the goal, an objective function of the cellular transport model is determined.
3. The method according to claim 1, wherein: The transport path includes a plurality of sections; the objective function of the cellular transport model is determined with the minimum total flow of the at least one transport path as the goal, including: The objective function is established according to the following formula: f(x)= Wherein, f(x) is the objective function, For at the moment Multiple conveying paths The number of goods in a road segment, , Gather for the moment, For all road segments, is the endpoint set, is a preset dummy variable. Is a positive integer.
4. The method according to claim 1, wherein: Determining the optimal departure time of each cargo from the at least one departure time through the cellular transport model, and determining the optimal transportation path from the at least one transportation path, including: The cellular transport model is solved using a branch and bound algorithm to obtain the optimal departure time and optimal transport path for each cargo.
5. The method according to claim 1, wherein: The transport parameters include the capacity, blocking density and reverse impact speed of each section in the multiple transport paths. The capacity is used to indicate the maximum cargo flow when each section is not blocked, the blocking density is used to indicate the cargo density when each section is blocked, and the reverse impact speed is used to indicate the speed of reverse movement of cargo when each section is blocked.
6. A cargo conveying device, comprising: A first acquisition module is used to acquire transport task data, wherein the transport task data includes at least one starting point, at least one end point, at least one departure time, and the quantity of goods to be transported, wherein there is at least one transport path between the at least one starting point and the at least one end point; A second acquisition module, used to acquire a transport parameter of each transport path in the at least one transport path; A modeling module, used for establishing a cellular transport model according to the transport task data and the transport parameters; a determination module, configured to determine the optimal departure time of each cargo from the at least one departure time and determine the optimal transportation path from the at least one transportation path by using the cellular transport model; and A transport module, configured to transport each of the goods at an optimal departure time of the goods via an optimal transport path of the goods; The modeling module includes: A constraint function unit is used to determine the constraint function of the cellular transmission model according to the transportation task data and the transportation parameters, wherein the constraint function includes: the number of picking boxes flowing from the cell to the downstream cell cannot exceed the maximum number of picking boxes that the cell can accommodate, and the number of picking boxes flowing from the upstream cell to a certain cell cannot exceed the remaining traffic capacity.
7. The device according to claim 6, wherein: The modeling module also includes: The objective function unit is used to determine the objective function of the cellular transmission model with the minimum total flow of the at least one transmission path as the goal.
8. The device according to claim 7, wherein: The transport path includes a plurality of sections; the objective function unit is specifically used for: The objective function is established according to the following formula: f(x)= Wherein, f(x) is the objective function, For at the moment Multiple conveying paths The number of goods in a road segment, , Gather for the moment, For all road segments, is the endpoint set, is a preset dummy variable. Is a positive integer.
9. A computing device comprising: one or more processors; a storage device for storing one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors implement the method of any one of claims 1 to 5.
10. A computer-readable storage medium having executable instructions stored thereon, which, when executed by a processor, causes the processor to implement the method of any one of claims 1 to 5.
