Article path planning method and device

Abstract

The invention discloses an article path planning method and device, and relates to the technical field of intelligent logistics. The specific implementation mode of the method comprises the steps that all sorting centers contained in all article transportation paths are determined, and sorting data corresponding to all the sorting centers are obtained; generating an alternative sorting path corresponding to each article transportation path; wherein each alternative sorting path indicates a sorting center used for parcel establishment and parcel splitting; inputting the article transportation paths, the sorting data and the alternative sorting paths into a preset logistics sorting model, and outputting a target sorting path corresponding to each article transportation path; wherein the logistics sorting model takes the minimum cost sum of package establishment and package splitting as an objective function. According to the implementation mode, the process that each sorting center judges the package collecting and unpacking manually is avoided, and meanwhile an overall sorting scheme with lower cost is obtained in the overall dimension.

Description

Technical Field

[0001] The present invention relates to the field of smart logistics technology, and in particular to a method and device for item path planning. Background Art

[0002] At present, the planning of the transportation route of goods is usually based on the hub-and-spoke logistics network structure, which is divided into levels. For small parcels, they will be sorted as a whole in a certain section of the route by means of grouping, unpacked at a certain sorting center, and then sorted according to their respective destinations.

[0003] In the existing packaging process, it is usually necessary to rely on the personal experience of the dispatcher. While ensuring that the local sorting capacity is sufficient, the cargo is packaged according to the quantity of different destinations, and whether to package or unpack is determined based on the remaining sorting capacity, which greatly wastes cost resources. Summary of the invention

[0004] In view of this, the embodiment of the present invention provides an item path planning method and device, which can comprehensively consider all sorting centers included in the item transportation path and the sorting data corresponding to each sorting center through a preset logistics sorting model, and take the minimum total cost of package establishment and package splitting as the objective function to obtain the target sorting path corresponding to each item transportation path. It not only avoids the process of manual judgment of package collection and unpacking in each sorting center, but also obtains a lower-cost overall sorting solution from a global perspective.

[0005] To achieve the above objective, according to one aspect of an embodiment of the present invention, a method for item path planning is provided.

[0006] An item path planning method according to an embodiment of the present invention includes: determining each sorting center included in each item transportation path, and obtaining sorting data corresponding to each sorting center; generating an alternative sorting path corresponding to each item transportation path; wherein each alternative sorting path indicates a sorting center for package creation and package splitting; inputting the item transportation path, the sorting data and the alternative sorting path into a preset logistics sorting model, and outputting a target sorting path corresponding to each item transportation path; wherein the logistics sorting model takes minimizing the total cost of package creation and package splitting as an objective function.

[0007] Optionally, the sorting data includes: sorting method, sorting quantity, and sorting cost corresponding to each of the sorting methods; the objective function is to minimize the sum of the cost of package creation and package splitting corresponding to each of the sorting methods; wherein the cost of package creation and package splitting corresponding to each of the sorting methods is obtained by multiplying the sorting quantity by the sorting cost.

[0008] Optionally, generating the alternative sorting paths corresponding to each of the item transportation paths includes: for each item transportation path: using an exhaustive method, taking each of the sorting centers as a first sorting center for establishing a package and a second sorting center for splitting the package; arranging and combining each of the first sorting centers with each of the second sorting centers to obtain the alternative sorting paths corresponding to each of the item transportation paths.

[0009] Optionally, the constraints of the logistics sorting model include at least one of the following: the constraints of the logistics sorting model include at least one of the following: the item transportation path corresponding to each item is unique, the target sorting path corresponding to each item transportation path is unique, the sorting method of each sorting center is unique, the sorting quantity meets the sorting capacity of the sorting center, and the number of sorting flow directions of the target sorting path does not exceed the maximum number of sorting flow directions of the corresponding sorting method.

[0010] Optionally, the item transportation path, the sorting data and the alternative sorting path are input into a preset logistics sorting model, and a target sorting path corresponding to each item transportation path is output, including: under the condition of satisfying constraints, the sum of the costs of package establishment and package splitting corresponding to each of the sorting methods is minimized, and a first target sorting center for package establishment in each item transportation path, a second target sorting center for package splitting, the target sorting methods corresponding to the first sorting center and the second sorting center, and a target sorting volume corresponding to each of the sorting methods are calculated; the target sorting path is generated according to the first target sorting center, the second target sorting center, the target sorting method and the target sorting volume.

[0011] Optionally, the logistics sorting model is solved using a Gurobi solver.

[0012] To achieve the above objective, according to another aspect of an embodiment of the present invention, an object path planning device is provided.

[0013] An article path planning device according to an embodiment of the present invention comprises: a determination module for determining each sorting center included in each article transportation path and obtaining sorting data corresponding to each sorting center; a generation module for generating an alternative sorting path corresponding to each article transportation path; wherein each alternative sorting path indicates a sorting center for package establishment and package splitting; an output module for inputting the article transportation path, the sorting data and the alternative sorting path into a preset logistics sorting model, and outputting a target sorting path corresponding to each article transportation path; wherein the logistics sorting model takes the minimum sum of the costs of package establishment and package splitting as the objective function. .

[0014] To achieve the above objective, according to another aspect of an embodiment of the present invention, an electronic device for object path planning is provided.

[0015] An item path planning electronic device according to an embodiment of the present invention comprises: one or more processors; a storage device for storing one or more programs, and when the one or more programs are executed by the one or more processors, the one or more processors implement an item path planning method according to an embodiment of the present invention.

[0016] To achieve the above objective, according to another aspect of an embodiment of the present invention, a computer-readable storage medium is provided.

[0017] A computer-readable storage medium according to an embodiment of the present invention stores a computer program, which, when executed by a processor, implements an item path planning method according to an embodiment of the present invention.

[0018] An embodiment of the above invention has the following advantages or beneficial effects: through the preset logistics sorting model, all sorting centers included in the item transportation path and the sorting data corresponding to each sorting center can be fully considered, and the total cost of package establishment and package splitting is minimized as the objective function to obtain the target sorting path corresponding to each item transportation path. This not only avoids the process of manual judgment of package collection and unpacking in each sorting center, but also obtains a lower-cost overall sorting solution from a global perspective.

[0019] The further effects of the above-mentioned non-conventional optional manner will be described below in conjunction with specific implementation examples. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] The accompanying drawings are used to better understand the present invention and do not constitute an improper limitation of the present invention.

[0021] Figure 1 is a schematic diagram of the main process of the method for item path planning according to an embodiment of the present invention;

[0022] Figure 2 is a schematic diagram of an article transportation path according to an embodiment of the present invention;

[0023] Figure 3 is a schematic diagram of a main process of determining an alternative sorting path according to an embodiment of the present invention;

[0024] Figure 4 is a schematic diagram of a specific process of an item path planning method according to an embodiment of the present invention;

[0025] Figure 5 is a schematic diagram of a target sorting path obtained according to an embodiment of the present invention;

[0026] Figure 6 is a schematic diagram of main modules of an object path planning device according to an embodiment of the present invention;

[0027] Figure 7 is an exemplary system architecture diagram to which embodiments of the present invention may be applied;

[0028] Figure 8 It is a schematic diagram of the structure of a computer system of a terminal device or a server suitable for implementing an embodiment of the present invention. DETAILED DESCRIPTION

[0029] The following is a description of exemplary embodiments of the present invention in conjunction with the accompanying drawings, including various details of the embodiments of the present invention to facilitate understanding, which should be considered as merely exemplary. Therefore, it should be recognized by those of ordinary skill in the art that various changes and modifications may be made to the embodiments described herein without departing from the scope and spirit of the present invention. Similarly, for clarity and conciseness, the description of well-known functions and structures is omitted in the following description.

[0030] It should be pointed out that the embodiments of the present invention and the technical features therein may be combined with each other without conflict.

[0031] It should be noted that the collection, collection, updating, analysis, processing, use, transmission, storage and other aspects of user personal information involved in the technical solution of this disclosure are in compliance with the provisions of relevant laws and regulations, are used for legitimate purposes, and do not violate public order and good morals. Necessary measures are taken for user personal information to prevent illegal access to user personal information data and maintain the security of user personal information, network security and national security.

[0032] Figure 1 Schematic diagram of main steps of the method for item path planning according to an embodiment of the present invention.

[0033] like Figure 1 As shown, the object path planning method of the embodiment of the present invention mainly includes the following steps:

[0034] Step S101: determining each sorting center included in each item transportation path, and obtaining sorting data corresponding to each sorting center;

[0035] Step S102: generating an alternative sorting path corresponding to each item transport path; wherein each alternative sorting path indicates a sorting center for package creation and package splitting;

[0036] Step S103: Input the item transportation path, sorting data and alternative sorting paths into a preset logistics sorting model, and output the target sorting paths corresponding to each item transportation path; wherein the logistics sorting model takes the minimization of the total cost of package creation and package splitting as the objective function.

[0037] In the existing hub-and-spoke network structure, there is already a complete item transportation path. Since the transportation cost is usually higher than the sorting cost, the present invention determines the target sorting path on the existing item transportation path, that is, determines the target sorting center for package creation and package splitting on the inherent route. Figure 2 Taking the item transportation path shown as an example, from A to G, it includes transportation path 1 (A→C→E→G) and transportation path 2 (A→C→D→E→G), where each letter represents a sorting center. Taking transportation path 1 as an example, under the transportation path of A→C→E→G, packages can be created and split at different sorting centers. For example, multiple items are assembled in sorting center A, and are packaged in sorting centers C and E (that is, the items are not split, and are still sorted as a whole in the form of assembled packages), and are unpacked in sorting center G. It is also possible to gather packages in sorting center A, package in sorting center C, and unpack in sorting center E, and then sort each item in small packages to sorting center G. It can be seen that for each item transportation path, the specific locations for package creation and package splitting may vary depending on the number of sorting centers included in the item transportation path. Therefore, the purpose of the present invention is to determine the target sorting path corresponding to each item transportation path (that is, determine which sorting centers are used for package creation and which sorting centers are used for package splitting) from a global perspective and with the lowest total cost based on the sorting data of each sorting center through a logistics sorting model.

[0038] In an optional embodiment, the sorting data includes: sorting method, sorting quantity, and sorting costs corresponding to each sorting method. For different sorting centers, the possible sorting methods are also different. Usually, they can be divided into manual sorting and machine sorting. With the increasing degree of automation, most sorting centers are currently equipped with grid sorting machines to quickly perform machine sorting through the grid. For some goods with less volume or in remote areas, manual sorting can also be used to quickly sort items. In a further optional embodiment, the objective function is to minimize the sum of the costs of package establishment and package splitting corresponding to each sorting method; wherein, the costs of package establishment and package splitting corresponding to the sorting methods are obtained by multiplying the sorting quantity by the sorting cost. That is to say, the sum of the costs of package establishment and package splitting in the embodiment of the present invention refers to the sum of the costs of manual sorting and machine sorting.

[0039] Regarding the process of generating the alternative sorting path, in an optional embodiment, the following can be done: Figure 3 As shown, including:

[0040] Step S301: determining each sorting center included in each item transportation path, and obtaining sorting data corresponding to each sorting center;

[0041] For each item transportation path, execute step S302 to step S303;

[0042] Step S302: by exhaustive method, each sorting center is used as the first sorting center for establishing the package and as the second sorting center for splitting the package;

[0043] Step S303: Arrange and combine the first sorting centers and the second sorting centers to obtain candidate sorting paths corresponding to the respective item transportation paths.

[0044] Likewise Figure 2 Taking the above steps S301 to S303 as an example, the process is specifically described. Figure 2In the transport path A→C→E→G, each sorting center can be used as the first sorting center for package establishment and the second sorting center for package splitting, that is, by exhaustive enumeration, the first sorting centers are A, C, E, G, and the second sorting centers are also A, C, E, G. By making different permutations and combinations, we can get A package establishment→C package splitting→E package establishment→G package splitting, A package establishment→E package splitting→E package establishment→G package splitting, A package establishment→C package splitting→C package establishment→G package splitting, etc. It can be understood that as the starting point of the logistics transportation path, package splitting cannot be performed, and as the end point of the logistics transportation path, package establishment cannot be performed, so when determining the alternative sorting path, it is necessary to exclude the situation of A package splitting and G package establishment.

[0045] In an optional embodiment, the constraints of the logistics sorting model include at least one of the following: the item transportation path corresponding to each item is unique, the target sorting path corresponding to each item transportation path is unique, the sorting method of each sorting center is unique, the sorting quantity meets the sorting capacity of the sorting center, and the number of sorting directions of the target sorting path does not exceed the maximum number of sorting directions of the corresponding sorting method. Among them, the constraints are the key to solving the logistics sorting model. Only by limiting the constraints can the optimal solution be obtained corresponding to the objective function solution.

[0046] Among them, whether it is manual sorting or machine sorting, there are certain limitations on the sorting capacity of sorting. Due to the uneven efficiency of manual labor, we often use the maximum number of sorting flows to represent resource limitations, that is, the total number of manual sorting flows corresponding to the sorting center does not exceed the maximum number of manual sorting flows processed historically. For machine sorting, the number of slots in the slot sorting machine is also limited, that is, the total number of slots occupied by machine sorting does not exceed the sum of the number of slots in the slot sorting machine. Among them, the more slots there are, the more small parcels and item transportation routes that can be processed. Since the number of slots is related to multiple factors such as the number of small parcels, item transportation routes, and parcel size, in an embodiment of the present invention, for the number of slots occupied by each small parcel, a simplified algorithm that only considers the number of small parcels is used. For example, if the maximum amount of cargo that can be processed at each slot in site i is α i , then processing a flow with a packet volume of x requires Specifically, if the maximum amount of goods that can be handled by each compartment of site i is 144, then the flow direction with a small package volume not exceeding 144 only occupies one compartment, and the flow direction with a small package volume between 144 and 288 occupies two compartments.

[0047] Figure 4 A specific implementation of item path planning in an embodiment of the present invention is shown, including:

[0048] Step S401: determining each sorting center included in each item transportation path, and obtaining sorting data corresponding to each sorting center;

[0049] For each item transportation path, execute step S402 to step S403;

[0050] Step S402: by exhaustive method, each sorting center is used as the first sorting center for establishing the package and as the second sorting center for splitting the package;

[0051] Step S403: Arrange and combine each first sorting center and each second sorting center to obtain an alternative sorting path corresponding to each item transportation path;

[0052] Step S404: inputting the item transportation path, sorting data and alternative sorting paths into a preset logistics sorting model;

[0053] Step S405: Under the condition that the constraint conditions are met, the first target sorting center for package creation, the second target sorting center for package splitting, the target sorting methods corresponding to the first target sorting center and the second target sorting center, and the target sorting volume corresponding to each target sorting method are calculated in each item transportation path according to the minimum sum of the costs of package creation and package splitting corresponding to each sorting method;

[0054] Step S406: Generate a target sorting route according to the first target sorting center, the second target sorting center, the target sorting method and the target sorting quantity.

[0055] From the above process, it can be seen that by inputting multiple item transportation paths, sorting data of sorting centers corresponding to each item transportation path, and alternative sorting paths, the target sorting paths corresponding to each item transportation path can be obtained. Taking all item transportation paths and sorting data of each sorting center into consideration, the obtained target sorting path can ensure that the total cost of package creation and package splitting is minimized. In an optional embodiment, the logistics sorting model can be solved using a Gurobi solver.

[0056] Specifically, the construction process of the item sorting model is as follows:

[0057] The logistics network is defined as: G = {S, P}, where S is the set of sorting centers. Based on the item transportation path of each small package flow to (o, d), the set of all alternative sorting paths P can be generated. od , where od∈U, U is the set of small package flow directions. To build a mathematical model, we first need to define the set, business parameters, and decision variables, as shown below:

[0058] Data Collection Settings

[0059] U: the collection of small parcel flow directions;

[0060] S: the collection of sorting centers;

[0061] P od : The set of alternative sorting paths flowing to (o, d), od∈U;

[0062] P ik : The set of sorting paths passing through sorting center i and sorting center k, i, k∈S;

[0063] Parameter settings

[0064] The number of flows that can be manually sorted by sorting center i, i∈S;

[0065] g i : The total number of slots in sorting center i. The number of slots in the manual sorting center is 0, i∈S;

[0066] α i : The maximum amount of goods that can be processed by each slot of the sorting machine in sorting center i, i∈S;

[0067] The sorting cost per unit of cargo when sorting center i adopts manual sorting, i∈S;

[0068] The sorting cost per unit of cargo when sorting center i uses machine sorting, i∈S;

[0069] Decision variable settings

[0070] x od，p : 0-1 variable, indicating whether OD selects sorting path p for od, p∈P od ;

[0071] u ikd : 0-1 variable, indicating whether the small package destined for sorting center d is sorted to sorting center k at sorting center i, i,k,d∈S;

[0072] y ij : 0-1 variable, indicating whether sorting operation is performed in the sorting center i in the flow direction (i, j), i, j∈S;

[0073] 0-1 variable, indicating whether manual sorting is adopted in the flow direction (i, j) at sorting center i, i∈S, j∈S;

[0074] 0-1 variable, indicating whether machine sorting is adopted in the flow direction (i, j) at sorting center i, i∈S, j∈S;

[0075] Integer variable, representing the number of slots required when machine sorting is used for flow direction (i, j) at sorting center i, i∈S, j∈S;

[0076] Integer variable, the total number of small packages sorted manually by sorting center i, i∈S;

[0077] Integer variable, the total number of small packages sorted by machines at sorting center i, i∈S;

[0078] Integer variable, the total number of small packages in flow i, j that are manually sorted, i,j∈S;

[0079] Integer variable, the total number of small packages sorted by machines in flow i and j, i,j∈S.

[0080] Objective Function

[0081] The embodiment of the present invention takes the lowest total sorting cost as the optimization goal. The total sorting cost is the sum of the manual sorting cost (the total number of small packages sorted by manual sorting × the unit cost of manual sorting) and the machine sorting cost (the total number of small packages sorted by machine × the unit cost of machine sorting). The corresponding objective function expression is shown in the following formula (1):

[0082]

[0083] Constraints

[0084]

[0085]

[0086] Among them, formula (2) indicates that the item transportation path corresponding to each item can only correspond to one target sorting path; formula (3) indicates that for each sorting center, the flow direction with the same destination site needs to choose the same target sorting path; formula (4) indicates that when a small package with the destination site d is sorted at site i to site k (i.e., u ikd =1), there is a sorting operation from site i to site k; Formula (5) indicates that if for the flow direction (i, j), it cannot be sorted to site k (i.e., u i,j=0), the alternative sorting path containing this part of the route cannot be selected; Formula (6) indicates that for each flow direction of each sorting center, if sorting can only be done by manual sorting or machine sorting, it cannot be both; Formula (7) to Formula (9) indicate that the amount of goods in each flow direction that each sorting center needs to manually sort is equal to the sum of the small parcel quantities of all manual sorting flows in each site, and the small parcel quantity of one manual sorting flow direction is equal to the sum of all small parcel quantities of the selected sorting path; Formula (10) to Formula (12) indicate that each sorting center needs The cargo volume of each flow direction of the machine sorting operation is equal to the sum of the small parcel volumes of all machine sorting flows in each site, and the small parcel volume of one machine sorting flow direction is equal to the sum of all small parcel volumes selected to include the sorting path; Formula (13) indicates that the number of manual sorting flows of each sorting center is less than or equal to the existing number of manual sorting flows; Formula (14) indicates the number of slots occupied by the cargo volume of each flow direction; Formula (15) indicates that for each sorting center, the number of slots required for all small parcels that need to be processed by the machine does not exceed the number of slots currently available in the sorting center equipment.

[0087] The following is a specific example of an object path planning method and result provided by the present invention. Figure 2 For example, the sorting data corresponding to each sorting center are shown in Table 1 and Table 2, and the output target sorting path is shown in Table 3. Figure 2 The corresponding target sorting path diagram is as follows: Figure 5 shown.

[0088] Table 1 Transportation routes and cargo volume information of each item

[0089]

[0090] Table 2 Sorting methods and sorting costs of each sorting center

[0091]

[0092] Table 3 Target sorting paths corresponding to each item transportation path

[0093]

[0094] according to Figure 5 The results show that sorting center C is the core transfer hub. If the sorting equipment capacity of sorting center C is improved, the overall sorting efficiency can be greatly improved while effectively reducing costs. Furthermore, if sorting center C can support direct sorting of island sorting centers F, G and H3 flows, the sorting cost can be further saved.

[0095] It can be seen from the item path planning method according to the embodiment of the present invention that, through the preset logistics sorting model, all sorting centers included in the item transportation path and the sorting data corresponding to each sorting center can be fully considered, and the total cost of package establishment and package splitting is minimized as the objective function to obtain the target sorting path corresponding to each item transportation path. This not only avoids the process of manual judgment of package collection and unpacking at each sorting center, but also obtains a lower-cost overall sorting solution from a global perspective.

[0096] Figure 6 Schematic diagram of main modules of an object path planning device according to an embodiment of the present invention.

[0097] like Figure 6 As shown, the device 600 for item path planning in the embodiment of the present invention includes:

[0098] A determination module 601 is used to determine each sorting center included in each item transportation path, and obtain sorting data corresponding to each sorting center;

[0099] A generating module 602 is used to generate an alternative sorting path corresponding to each of the item transport paths; wherein each of the alternative sorting paths indicates a sorting center for package creation and package splitting;

[0100] The output module 603 is used to input the item transportation path, the sorting data and the alternative sorting path into a preset logistics sorting model, and output a target sorting path corresponding to each item transportation path; wherein the logistics sorting model takes the minimization of the total cost of package creation and package splitting as the objective function.

[0101] In an optional embodiment of the present invention, the sorting data includes: sorting method, sorting quantity, and sorting cost corresponding to each of the sorting methods; the objective function is to minimize the sum of the cost of package creation and package splitting corresponding to each of the sorting methods; wherein the cost of package creation and package splitting corresponding to each of the sorting methods is obtained by multiplying the sorting quantity by the sorting cost.

[0102] In an optional embodiment of the present invention, the generation module 602 is also used to, for each item transportation path: by exhaustive method, use each of the sorting centers as the first sorting center for establishing a package and as the second sorting center for splitting the package; arrange and combine each of the first sorting centers with each of the second sorting centers to obtain alternative sorting paths corresponding to each item transportation path.

[0103] In an optional embodiment of the present invention, the constraints of the logistics sorting model include at least one of the following: the item transportation path corresponding to each item is unique, the target sorting path corresponding to each item transportation path is unique, the sorting method of each sorting center is unique, the sorting quantity meets the sorting capacity of the sorting center, and the number of sorting flow directions of the target sorting path does not exceed the maximum number of sorting flow directions of the corresponding sorting method.

[0104] In an optional embodiment of the present invention, the output module 603 is further used to, under the condition of satisfying constraints, calculate the first target sorting center for package establishment, the second target sorting center for package splitting, the target sorting methods corresponding to the first target sorting center and the second target sorting center, and the target sorting quantity corresponding to each target sorting method in each item transportation path according to the minimum sum of the costs of package establishment and package splitting corresponding to each of the sorting methods, and generate the target sorting path according to the first target sorting center, the second target sorting center, the target sorting method and the target sorting quantity.

[0105] In an optional embodiment of the present invention, the logistics sorting model is solved using a Gurobi solver.

[0106] According to the article path planning device of the embodiment of the present invention, through the preset logistics sorting model, all sorting centers included in the article transportation path and the sorting data corresponding to each sorting center can be fully considered, and the total cost of package establishment and package splitting is minimized as the objective function to obtain the target sorting path corresponding to each article transportation path. This not only avoids the process of manual judgment of package collection and unpacking in each sorting center, but also obtains a lower-cost overall sorting solution from a global perspective.

[0107] Figure 7 An exemplary system architecture 700 is shown to which the method or device for item path planning according to an embodiment of the present invention may be applied.

[0108] like Figure 7 As shown, system architecture 700 may include terminal devices 701, 702, 703, network 704 and server 705. Network 704 is used to provide a medium for communication links between terminal devices 701, 702, 703 and server 705. Network 704 may include various connection types, such as wired, wireless communication links or optical fiber cables, etc.

[0109] The user can use the terminal devices 701, 702, 703 to interact with the server 705 through the network 704 to receive or send data, etc. Various communication client applications can be installed on the terminal devices 701, 702, 703, such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social platform software, etc.

[0110] The terminal devices 701 , 702 , and 703 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop computers, and desktop computers.

[0111] The server 705 may be a server that provides various services, such as a background management server that provides support for the item transportation path planning request sent by the user using the terminal devices 701, 702, and 703. The background management server may analyze and process the received item transportation path planning request and other data, and feed back the processing results (such as the target sorting path corresponding to each item transportation path) to the terminal device.

[0112] It should be noted that the item path planning method provided in the embodiment of the present invention is generally executed by the server 705 , and accordingly, the item path planning device is generally arranged in the server 705 .

[0113] It should be understood that Figure 7 The number of terminal devices, networks and servers in the embodiment is only for illustration. Any number of terminal devices, networks and servers may be provided according to implementation requirements.

[0114] Reference below Figure 8 , which shows a schematic diagram of the structure of a computer system 800 of a terminal device suitable for implementing an embodiment of the present invention. Figure 8 The terminal device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.

[0115] like Figure 8 As shown, the computer system 800 includes a central processing unit (CPU) 801, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 802 or a program loaded from a storage part 808 into a random access memory (RAM) 803. In the RAM 803, various programs and data required for the operation of the system 800 are also stored. The CPU 801, the ROM 802, and the RAM 803 are connected to each other via a bus 804. An input / output (I / O) first interface 805 is also connected to the bus 804.

[0116] The following components are connected to the I / O first interface 805: an input section 806 including a keyboard, a mouse, etc.; an output section 807 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 808 including a hard disk, etc.; and a communication section 809 including a network first interface card such as a LAN card, a modem, etc. The communication section 809 performs communication processing via a network such as the Internet. A drive 810 is also connected to the I / O first interface 805 as needed. A removable medium 811, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 810 as needed, so that a computer program read therefrom is installed into the storage section 808 as needed.

[0117] In particular, according to the embodiments disclosed in the present invention, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present invention include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes 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 809, and / or installed from the removable medium 811. When the computer program is executed by the central processing unit (CPU) 801, the above-mentioned functions defined in the system of the present invention are executed.

[0118] It should be noted that the computer-readable medium shown in the present invention may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, 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), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present invention, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device. In the present invention, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. This propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than computer-readable storage media, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.

[0119] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present invention. 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.

[0120] The modules involved in the embodiments of the present invention may be implemented by software or hardware. The modules described may also be set in a processor, for example, they may be described as: a processor includes a determination module, a generation module, and an output module. The names of these modules do not constitute a limitation on the modules themselves in some cases. For example, the determination module may also be described as "a module for determining each sorting center included in each item transportation path and obtaining sorting data corresponding to each sorting center".

[0121] As another aspect, the present invention also provides a computer-readable medium, which may be included in the device described in the above embodiment; or it may exist independently and not be assembled into the device. The above computer-readable medium carries one or more programs, and when the above one or more programs are executed by a device, the device includes: determining each sorting center included in each item transportation path, and obtaining the sorting data corresponding to each sorting center; generating an alternative sorting path corresponding to each item transportation path; wherein each alternative sorting path indicates a sorting center for package establishment and package splitting; inputting the item transportation path, the sorting data and the alternative sorting path into a preset logistics sorting model, and outputting the target sorting path corresponding to each item transportation path; wherein the logistics sorting model takes the minimum sum of the costs of package establishment and package splitting as the objective function.

[0122] According to the technical solution of the embodiment of the present invention, through the preset logistics sorting model, all sorting centers included in the item transportation path and the sorting data corresponding to each sorting center can be fully considered, and the total cost of package establishment and package splitting is minimized as the objective function to obtain the target sorting path corresponding to each item transportation path. This not only avoids the process of manual judgment of package collection and unpacking in each sorting center, but also obtains a lower-cost overall sorting solution from a global perspective.

[0123] The above specific implementations do not constitute a limitation on the protection scope of the present invention. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may occur depending on design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A method for item path planning, characterized in that: include: Determine each sorting center included in each item transportation path, and obtain sorting data corresponding to each sorting center; Generate an alternative sorting path corresponding to each of the item transport paths; wherein each of the alternative sorting paths indicates a sorting center for package creation and package splitting; Inputting the item transportation path, the sorting data and the alternative sorting path into a preset logistics sorting model, and outputting a target sorting path corresponding to each item transportation path; The logistics sorting model takes the minimization of the total cost of package creation and package splitting as the objective function.

2. The method according to claim 1, characterized in that The sorting data includes: sorting method, sorting quantity, and sorting cost corresponding to each sorting method; The objective function is to minimize the sum of the costs of package creation and package splitting corresponding to each of the sorting methods; The costs of creating and splitting packages respectively corresponding to the sorting methods are obtained by multiplying the sorting quantity by the sorting cost.

3. The method according to claim 1, characterized in that The generating of the candidate sorting paths corresponding to each of the item transport paths comprises: For each item transportation path: By exhaustive method, each of the sorting centers is used as a first sorting center for establishing a package and as a second sorting center for splitting the package; Each of the first sorting centers is arranged and combined with each of the second sorting centers to obtain an alternative sorting path corresponding to each item transportation path.

4. The method according to claim 2, characterized in that: The constraints of the logistics sorting model include at least one of the following: the item transportation path corresponding to each item is unique, the target sorting path corresponding to each item transportation path is unique, the sorting method of each sorting center is unique, the sorting quantity meets the sorting capacity of the sorting center, and the number of sorting flow directions of the target sorting path does not exceed the maximum number of sorting flow directions of the corresponding sorting method.

5. The method according to claim 4, characterized in that The step of inputting the item transport path, the sorting data and the candidate sorting path into a preset logistics sorting model, and outputting a target sorting path corresponding to each item transport path, comprises: Under the condition that the constraint conditions are met, the first target sorting center for package establishment, the second target sorting center for package splitting, the target sorting methods corresponding to the first target sorting center and the second target sorting center, and the target sorting volume corresponding to each target sorting method are calculated in each item transportation path according to the minimum sum of the costs of package establishment and package splitting corresponding to each of the sorting methods; The target sorting path is generated according to the first target sorting center, the second target sorting center, the target sorting method, and the target sorting quantity.

6. The method according to claim 1, characterized in that: The logistics sorting model is solved using the Gurobi solver.

7. A device for item path planning, characterized in that: include: A determination module, used to determine each sorting center included in each item transportation path, and obtain sorting data corresponding to each sorting center; A generating module, used for generating an alternative sorting path corresponding to each of the item transport paths; wherein each of the alternative sorting paths indicates a sorting center for package creation and package splitting; The output module is used to input the item transportation path, the sorting data and the alternative sorting path into a preset logistics sorting model, and output a target sorting path corresponding to each item transportation path; wherein the logistics sorting model takes the minimization of the total cost of package creation and package splitting as the objective function.

8. An electronic device for object path planning, characterized in that: include: 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 according to any one of claims 1 to 6.

9. A computer readable medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method according to any one of claims 1 to 6 is implemented.

10. A computer program product, comprising a computer program, wherein when the computer program is executed by a processor, the computer program implements the method according to any one of claims 1 to 6.

Images