Road area planning method and device

Abstract

The embodiment of the invention discloses a road area planning method and device. The specific implementation mode of the method comprises the steps that network structure information and statistical information of a road area are obtained, the network structure information comprises node information and line information, and the statistical information comprises the average daily parcel number, the average unit income and the average parcel processing duration of each node; generating various road area schemes for distributing nodes and lines to a predetermined number of couriers; based on the network structure information and the statistical information, a multi-traveling salesman model with minimization of income difference between couriers as a target is established, and constraints of the multi-traveling salesman model include duration constraints; and solving the multi-traveler model under various road area schemes to obtain the road area scheme with the minimum income difference between the couriers, and outputting the road area corresponding to the courier. According to the embodiment, the income difference between couriers is reduced, the on-time completion rate of parcels is maximized, and the calculation time is shortened.

Description

Technical Field

[0001] Embodiments of the present disclosure relate to the field of logistics technology, and particularly to a road area planning method and apparatus. Background Art

[0002] The express delivery network of an express delivery company includes nodes such as warehouses, sorting centers, and business departments. After the goods leave the warehouse, they will pass through nodes such as sorting centers and finally reach the business department. After arriving at the business department, the courier will separate the parcels according to the communities and then load the parcels of the communities they are responsible for onto the delivery vehicle and then make deliveries.

[0003] How to allocate the communities responsible for each business department to different couriers so that the on-time completion rate of the delivery tasks is the highest and the income of the couriers is as fair as possible is a problem that the express delivery company needs to solve. This is the standard term in the express delivery industry, "road area planning".

[0004] Currently, the method mainly adopted is manual allocation by the station master of the business department. When allocating, the main factors considered by the station master are: 1) the highest on-time completion rate of the delivery tasks; 2) the shortest possible travel path of the courier; 3) the communities responsible for the courier are as much on the same route as possible and do not cross each other.

[0005] When the station master of the business department allocates communities, they often allocate the communities with short distances and large parcel volumes to the employees with good relationships or long working years, which increases the income gap between employees. This leads to a high turnover rate among employees with low incomes. Sometimes, the results of the station master's allocation based on experience may cause delays in parcels in some communities. When the area responsible for the business department is large and there are many couriers, it takes too long to allocate communities, and the timeliness of parcel delivery cannot be guaranteed. Summary of the Invention

[0006] Embodiments of the present disclosure propose a road area planning method and apparatus.

[0007] In a first aspect, embodiments of the present disclosure provide a road area planning method, including: obtaining network structure information and statistical information of a road area, where the network structure information includes node information and line information, and the statistical information includes the average daily parcel quantity, average single income, and average parcel processing duration of each node; generating various road area plans for allocating nodes and lines to a predetermined number of couriers; establishing a multi-traveling salesman model with the goal of minimizing the income gap between couriers based on the network structure information and the statistical information, where the constraints of the multi-traveling salesman model include duration constraints; solving the multi-traveling salesman model under various road area plans, obtaining the road area plan with the smallest income gap between couriers, and outputting the road areas corresponding to the couriers.

[0008] In some embodiments, establishing a multi-traveling salesman model aiming to minimize the income gap among couriers based on the network structure information and the statistical information includes: calculating the travel time of the routes in various road area plans according to the average package processing duration of the nodes; allocating routes with travel time not exceeding a predetermined threshold to each courier; calculating the income of the courier according to the daily average number of packages and the average income per order of the nodes included in the route allocated to each courier; and calculating the income gap between the courier with the highest income and the courier with the lowest income.

[0009] In some embodiments, solving the multi-traveling salesman model under various road area plans to obtain the road area plan with the smallest income gap among couriers includes: traversing each combination of nodes, routes, and couriers from various road area plans; calculating the income of the courier according to the daily average number of packages and the average income per order of the nodes included in the route allocated to the courier in each combination; calculating the income gap between the courier with the highest income and the courier with the lowest income in each combination; and selecting the road area plan with the smallest income gap among couriers from all combinations.

[0010] In some embodiments, the method further includes: checking whether there is duplicate data in the node information and the route information; and if there is duplicate data, deleting the duplicate data.

[0011] In some embodiments, the method further includes: checking whether there are isolated nodes that are not connected to other nodes according to the node information and the route information; and if there are isolated nodes, prompting the user to supplement the route information.

[0012] In some embodiments, the method further includes: visually outputting the node information, the route information, and the road area plan with the smallest income gap among couriers for the user to view.

[0013] In some embodiments, the method further includes: if the optimal solution is not obtained within a predetermined time and the current solution time is less than or equal to the maximum solution time, increasing the solution time and continuing to solve the multi-traveling salesman model under various road area plans.

[0014] In some embodiments, the method further includes: if the multi-traveling salesman model has no feasible solution, analyzing the network structure information and the statistical information to find the reason for no solution.

[0015] In some embodiments, the method further includes: in response to receiving a message of line blockage between nodes, using the line blockage as a constraint to re-solve the multi-traveling salesman model to obtain an updated road area plan with the smallest income gap among couriers.

[0016] Second aspect, embodiments of the present disclosure provide a road area planning device, including: an acquisition unit configured to acquire network structure information and statistical information of a road area, where the network structure information includes node information and line information, and the statistical information includes the average daily parcel quantity, average income per order, and average parcel processing duration of each node; a generation unit configured to generate various road area plans for allocating nodes and lines to a predetermined number of couriers; a construction unit configured to construct a multi-travelling salesman model aiming to minimize the income gap among couriers based on the network structure information and the statistical information, where the constraints of the multi-travelling salesman model include duration constraints; a solving unit configured to solve the multi-travelling salesman model under various road area plans, obtain the road area plan with the minimum income gap among couriers, and output the corresponding road areas of the couriers.

[0017] In some embodiments, the construction unit is further configured to: calculate the travel time of lines in various road area plans according to the average parcel processing duration of nodes; allocate lines with travel time not exceeding a predetermined threshold to each courier; calculate the income of a courier according to the average daily parcel quantity and average income per order of the nodes included in the lines allocated to the courier; calculate the income gap between the courier with the highest income and the courier with the lowest income.

[0018] In some embodiments, the solving unit is further configured to: traverse each combination of nodes, lines, and couriers from various road area plans; calculate the income of a courier according to the average daily parcel quantity and average income per order of the nodes included in the lines allocated to the courier in each combination; calculate the income gap between the courier with the highest income and the courier with the lowest income in each combination; select the road area plan with the minimum income gap among couriers from all combinations.

[0019] In some embodiments, the device further includes an inspection unit configured to: check whether there is duplicate data in the node information and the line information; if there is duplicate data, delete the duplicate data.

[0020] In some embodiments, the device further includes an inspection unit configured to: check whether there are isolated nodes that are not connected to other nodes according to the node information and the line information; if there are isolated nodes, prompt the user to supplement the line information.

[0021] In some embodiments, the device further includes an output unit configured to: visually output the node information, the line information, and the road area plan with the minimum income gap among couriers for the user to view.

[0022] In some embodiments, the solving unit is further configured to: if an optimal solution is not obtained within a predetermined time and the current solving time is less than or equal to the maximum solving time, increase the solving time and continue to solve the multiple traveling salesman model under various road area schemes.

[0023] In some embodiments, the solving unit is further configured to: if the multiple traveling salesman model has no feasible solution, analyze the network structure information and the statistical information to find the reason for no solution.

[0024] In some embodiments, the solving unit is further configured to: in response to receiving a message of line blockage between nodes, use the line blockage as a constraint to re-solve the multiple traveling salesman model to obtain an updated road area scheme with the smallest income gap between couriers.

[0025] In a third aspect, an embodiment of the present disclosure provides an electronic device for road area planning, including: one or more processors; a storage device storing one or more computer programs thereon, when the one or more computer programs are executed by the one or more processors, enabling the one or more processors to implement the method according to any one of the first aspect.

[0026] In a fourth aspect, an embodiment of the present disclosure provides a computer-readable medium storing a computer program thereon, wherein the computer program, when executed by a processor, implements the method according to any one of the first aspect.

[0027] The road area planning method and device provided by the embodiments of the present disclosure abstract the road area planning problem into a classical operations research model: the multiple traveling salesman problem (MTSP, Multiple Traveling Salesman Model). The goal of the model is to minimize the income gap between couriers, and then the optimal result is obtained by algorithm solving. This method can reduce the income gap between couriers and ensure fairness. And by comprehensively considering the travel time and delivery time of couriers, the on-time completion rate of packages is maximized. It provides a calculation tool for the business department and reduces its calculation time.

[0028] It should be understood that the content described in this part is not intended to identify the key or important features of the embodiments of the present disclosure, nor is it used to limit the scope of the present disclosure. Other features of the present disclosure will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0029] By reading the detailed description of the non-limiting embodiments with reference to the following drawings, other features, objectives, and advantages of the present disclosure will become more apparent:

[0030] Figure 1It is an exemplary system architecture diagram to which an embodiment of the present disclosure can be applied;

[0031] Figure 2 It is a flowchart of an embodiment of the road area planning method according to the present disclosure;

[0032] Figures 3a - 3c It is a schematic diagram of an application scenario of the road area planning method according to the present disclosure;

[0033] Figure 4 It is a flowchart of another embodiment of the road area planning method according to the present disclosure;

[0034] Figure 5 It is a schematic structural diagram of an embodiment of the road area planning device according to the present disclosure;

[0035] Figure 6 It is a schematic structural diagram of a computer system of an electronic device suitable for implementing the embodiments of the present disclosure. Detailed implementation manners

[0036] The present disclosure will be further described in detail below in conjunction with the accompanying drawings and embodiments. It can be understood that the specific embodiments described herein are only used to explain the related invention, rather than limiting the invention. Additionally, it should be noted that for the convenience of description, only parts related to the relevant invention are shown in the drawings.

[0037] It should be noted that, without conflict, the embodiments in the present disclosure and the features in the embodiments can be combined with each other. The present disclosure will be described in detail below with reference to the accompanying drawings and embodiments.

[0038] Figure 1 It shows an exemplary system architecture 100 to which an embodiment of the road area planning method or the road area planning device of the present disclosure can be applied.

[0039] As Figure 1 shown, the system architecture 100 may include terminal devices 101, 102, 103, a network 104, and a server 105. The network 104 is used to provide a medium for communication links between the terminal devices 101, 102, 103 and the server 105. The network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, etc.

[0040] Users can use the terminal devices 101, 102, 103 to interact with the server 105 through the network 104 to receive or send messages, etc. Various communication client applications may be installed on the terminal devices 101, 102, 103, such as logistics distribution applications, web browser applications, shopping applications, search applications, instant messaging tools, email clients, social platform software, etc.

[0041] The terminal devices 101, 102, and 103 can be hardware or software. When the terminal devices 101, 102, and 103 are hardware, they can be various electronic devices with a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, e-book readers, MP3 players (Moving Picture Experts Group Audio Layer III), MP4 (Moving Picture Experts Group Audio Layer IV) players, laptop computers, desktop computers, and so on. When the terminal devices 101, 102, and 103 are software, they can be installed in the above-listed electronic devices. They can be implemented as multiple software or software modules (for example, used to provide distributed services), or can be implemented as a single software or software module. No specific limitation is made here.

[0042] The server 105 can be a server providing various services, such as a background planning server that supports the road area planning web page displayed on the terminal devices 101, 102, and 103. The background planning server can analyze and process data such as the received line information and order information, and feedback the processing results (such as the allocated cell and route) to the terminal devices. The courier can process the order according to the allocated cell and route to achieve income balance.

[0043] It should be noted that the server can be hardware or software. When the server is hardware, it can be implemented as a distributed server cluster composed of multiple servers, or can be implemented as a single server. When the server is software, it can be implemented as multiple software or software modules (for example, multiple software or software modules used to provide distributed services), or can be implemented as a single software or software module. No specific limitation is made here. The server can also be a server of a distributed system, or a server combined with a blockchain. The server can also be a cloud server, or an intelligent cloud computing server or intelligent cloud host with artificial intelligence technology.

[0044] It should be noted that the road area planning method provided by the embodiments of the present disclosure is generally executed by the server 105. Correspondingly, the road area planning device is generally set in the server 105.

[0045] It should be understood that Figure 1 the numbers of the terminal devices, network, and server in

[0046] Continue to refer to Figure 2, which shows the process 200 of an embodiment of the road area planning method according to the present disclosure. The road area planning method includes the following steps:

[0047] Step 201, obtaining the network structure information and statistical information of the road area.

[0048] In this embodiment, the network structure information may include node information and line information, and the statistical information may include the average daily parcel quantity, average income per order, and average parcel processing duration of each node. The average parcel processing duration may include the average distribution duration per order within the node and the travel time between nodes.

[0049] A set of input data formats is designed according to the model characteristics and data in actual business. Users only need to collect data as required and organize it into a standard format to calculate the desired results. The node information of the nodes included in the road area and the line information between the nodes in the map can be obtained. Table 1 shows the input format of the data. A node represents a community or business department, where the business department is unique, and the node corresponding to the community can also be called a demand node. Users need to statistically calculate the average daily parcel quantity of each community, the average processing duration of each parcel, and the average income per order brought to the couriers in advance according to historical order information. Table 2 shows the connection relationship between the nodes. In reality, any two nodes can be directly or indirectly connected to avoid the communities assigned to the couriers from overlapping. Users should only consider that there are direct lines only between adjacent communities, but the business department can be connected to any community.

[0050]

[0051] Table 1

[0052]

[0053]

[0054] Table 2

[0055] Figure 3a Shows the area responsible for a business department. A color block represents a community. Although three communities are assigned to a courier in the figure, this actually does not meet the expectations of the business department. Therefore, although any two communities can be reached by road, in order to prevent the communities responsible for the couriers from overlapping, we stipulate that there is a line only when two communities are adjacent. The business department has a line relationship with all communities. In addition Figure 3a there is also a river in it. In the expectation of the business department manager, the area responsible for the courier should be on the same side of the river as much as possible. Other business departments may face situations such as viaducts and highways, and users can add or delete lines according to the actual situation.

[0056] Based on the network structure information and statistical information, Tables 3 and 4 are sorted out, which show the sets and parameters used in the model. The values of the parameters in Table 4 are all obtained by converting the input data.

[0057] After the user inputs the data, the program first sorts out these parameters and then starts modeling and solving.

[0058] Set Meaning I Set of demand nodes (communities) o Business department I′ Set I′ of business department and demand nodes = I ∪ {o} K Set of couriers

[0059] Table 3

[0060] Parameter Meaning <![CDATA[m i > Demand of node i <![CDATA[c i > Average income per order of node i <![CDATA[r i > Average delivery time per order of node i <![CDATA[d ij > Travel time between node i and node j v Number of couriers n Number of nodes M Sum of demands of each node

[0061] Table 4

[0062] Step 202: Generate various road area plans for allocating nodes and routes to a predetermined number of couriers.

[0063] In this embodiment, various road area plans are composed of decision variables. Table 5 shows the variables in the model, where x ij represents whether the route (i, j) is selected; t ijk represents whether the route (i, j) is selected and allocated to courier k; y ik represents whether node i is assigned to courier k; the order of visiting node i; z max represents the income of the courier with the highest income; z min represents the income of the courier with the lowest income.

[0064] Variable Meaning <![CDATA[x ij > 0 - 1 variable, whether to select route (i, j) <![CDATA[t ijk > 0 - 1 variable, whether to assign route (i, j) to courier k <![CDATA[y ik > 0 - 1 variable, whether to assign node i to courier k <![CDATA[u i > Order of visiting node i (to eliminate sub - loops by users) <![CDATA[z max > Income of the courier with the highest income <![CDATA[z min > Income of the courier with the lowest income

[0065] Table 5

[0066] Step 203: Based on the network structure information and statistical information, establish a multi-traveling salesman model with the goal of minimizing the income gap between couriers.

[0067] In this embodiment, the constraints of the multi-traveling salesman model include duration constraints and may also include at least one of the following: income constraints, route constraints, and node constraints.

[0068] The goal of the model is to minimize the income gap between couriers.

[0069] min(z max -z min )#(0)

[0070] The model constraints may include at least one of the following:

[0071]

[0072]

[0073]

[0074]

[0075]

[0076]

[0077]

[0078]

[0079]

[0080]

[0081]

[0082]

[0083]

[0084]

[0085]

[0086] Formula (1) represents the income of each courier;

[0087] Formula (2) represents the income of the courier with the highest income;

[0088] Formula (3) represents the income of the courier with the lowest income;

[0089] The route of Formula (4) must be selected for the courier to pass through this route;

[0090] Formulas (5) and (6) mean that only when nodes i and j are assigned to courier k can courier k pass through route (i, j);

[0091] Each demand node in Formula (7) can only be assigned to one courier;

[0092] Formulas (8) and Constraint (9) mean that each demand node has only one incoming arc and one outgoing arc;

[0093] Formulas (10) and Constraint (11) mean that these nodes require v couriers for distribution;

[0094] Formula (12) represents the elimination of the sub - tour constraint;

[0095] Formula (13) represents the upper and lower limit requirements for the income of each dispatcher, where α < 1 and β > 1;

[0096] Formula (14) indicates that the travel time of each courier cannot exceed the maximum limit γ;

[0097] Formula (15) indicates the value range of the variable.

[0098] Among them, the income constraint may include at least one of Formulas (1)-(3) and (13). The route constraint may include at least one of Formulas (4)-(6) and (12). The node constraint may include at least one of Formulas (7)-(11). The duration constraint may include Formula (14). The duration constraint may also include that the delivery time between nodes cannot exceed a predetermined first duration, or the delivery time within a node cannot exceed a predetermined second duration.

[0099] The elimination of sub-tour constraints is a conventional constraint in the TSP. TSP: It means that a traveler (1 person) wants to travel through n cities, requiring each city to be visited and only visited once and then return to the departure city, and requiring the shortest distance to be traveled.

[0100] Step 204, solve the multi-traveling salesman model under various road area schemes, and obtain and output the road area scheme with the smallest income gap among couriers.

[0101] In this embodiment, the decision variables, constraints, and objectives of the model can be set according to the syntax requirements of the mathematical model and the solver; the solution parameters such as the maximum solution time and the minimum solution gap can be set. The solver mainly uses the mathematical programming method for the optimization solution of large-scale complex problems in the form of industrial software, and is the core tool for solving various mathematical programming problems, which has important value and significance in actual production and life. In the industrial field, as the core engine for the optimization of the industrial chain and supply chain, the solver can provide intelligent decision-making for complex application scenarios, help optimize enterprise decision-making, and achieve cost reduction and efficiency improvement. Currently, the mathematical programming solvers on the market are mainly divided into two categories: commercial solvers (such as Gurobi, IBM Cplex, etc.) and open-source solvers (such as SCIP, etc.). In addition, there are some commercial calculation software such as Matlab, and even the commonly used Excel spreadsheet contains a solver tool that can solve some mathematical programming problems with a relatively small scale.

[0102] After parsing the model results and obtaining the values of each decision variable and the objective function. As shown in Table 6, the calculation results are as follows: the maximum number of delivery communities for a courier is between 4 and 6; the number of parcels delivered is between 58 and 76, with a difference of 30%; the income of the courier is between 70 and 88, with a gap of 20%.

[0103] Courier serial number Vehicle routing Quantity of parcels delivered Courier income 0 [0,4,12,3,1,0] 61 69.87 1 [0,9,20,10,11,7,18,0] 70 86.74 2 [0,14,15,2,13,0] 58 74.39 3 [0,19,8,17,16,5,6,0] 76 88.82

[0104] Table 6

[0105] It is also possible to visualize the delivery routes of couriers. Figure 3b It shows the connection relationships between nodes, where node 0 is the location of the business department. Figure 3c It shows the calculation results, and it can be found that the areas responsible by couriers are interconnected.

[0106] The multi-travelling salesman model of this application fits reality, focuses on examining the income fairness of couriers, and has good implementability: When algorithm engineers build models, they often ignore some business requirements in order to pursue the lowest cost, resulting in the difficulty of implementing the model results. However, this model strictly follows the business requirements. On the one hand, it considers the travel time of each courier, the on-time completion rate requirement of packages, the adjacent relationships between nodes, and the blocking of the connection relationships between communities by rivers and highways; on the other hand, it takes the income fairness of couriers as the goal, increases the acceptance of couriers, and makes the solution easier to implement.

[0107] In some alternative implementation manners of this embodiment, establishing a multi-travelling salesman model with the goal of minimizing the income gap between couriers based on the network structure information and the statistical information includes: calculating the travel time of the routes in various road area schemes according to the average package processing duration of nodes; allocating routes with travel time not exceeding a predetermined threshold to each courier; calculating the income of the courier according to the average daily package quantity and the income per order of the nodes included in the routes allocated to each courier; calculating the income gap between the courier with the highest income and the courier with the lowest income. The travel time includes the driving time between nodes and the average package processing duration. In order to meet the highest on-time completion rate of delivery tasks, it is necessary to ensure that the travel time of each courier is within the time required by the order. The income of each courier can be estimated by the average daily package quantity and the income per order of the node where the courier is located. And restricting the travel time of couriers can enable couriers to process more orders per unit time, thereby improving the node delivery efficiency.

[0108] In some alternative implementation manners of this embodiment, solving the multi-travelling salesman model under various road area schemes to obtain the road area scheme with the smallest income gap between couriers includes: traversing each combination of nodes, routes, and couriers from various road area schemes; calculating the income of the courier according to the average daily package quantity and the income per order of the nodes included in the routes allocated to the courier in each combination; calculating the income gap between the courier with the highest income and the courier with the lowest income in each combination; selecting the road area scheme with the smallest income gap between couriers from all combinations. It is necessary to traverse each combination and calculate the income gap between couriers under each combination. A mathematical programming solver can be used to calculate the results of each combination scheme one by one, and finally select the combination with the smallest income gap between couriers.

[0109] In some alternative implementation manners of this embodiment, the method further includes: checking whether there is duplicate data in the node information and the line information; if there is duplicate data, deleting the duplicate data. This can avoid duplicate calculations and increase the amount of calculation.

[0110] In some alternative implementation manners of this embodiment, the method further includes: checking, according to the node information and the line information, whether there are isolated nodes that are not connected to other nodes; if there are isolated nodes, prompting the user to supplement the line information. If there are isolated nodes, it will definitely lead to no solution for the model. Checking isolated nodes in advance can avoid ineffective calculations.

[0111] In some alternative implementation manners of this embodiment, the method further includes: visually outputting a road area scheme with the smallest income gap among the node information, the line information, and the couriers for the user to view. Visualizing the nodes and lines enables the user to have a more intuitive understanding of the data.

[0112] Optionally, the maximum value, average value, and minimum value of the order volumes of each community can be statistically calculated. The operator can judge whether it is necessary to split the communities with relatively large order volumes into multiple communities based on this.

[0113] Optionally, the average income of the couriers can be calculated; the operator can judge the approximate income level of the couriers based on this. Thus, when setting the constraints of the model, the maximum and minimum income values can be set within a reasonable range.

[0114] In some alternative implementation manners of this embodiment, the method further includes: if the optimal solution is not obtained within a predetermined time and the current solution time is less than or equal to the maximum solution time, increasing the solution time and continuing to solve the multi-traveling salesman model under various road area schemes. First, finding the optimal solution within the specified time can reduce the calculation time. If the optimal solution is not obtained within the specified time, then increase the solution time to ensure that the optimal solution can be obtained.

[0115] In some alternative implementation manners of this embodiment, the method further includes: if the multi-traveling salesman model has no feasible solution, analyzing the network structure information and the statistical information to find the reason for no solution. It is possible to check whether there are isolated nodes, whether the order volume of the community is too large, etc.

[0116] Further referring to Figure 4 , which shows the flow 400 of another embodiment of the road area planning method. The flow 400 of this road area planning method includes the following steps:

[0117] Step 401, obtaining the network structure information and the statistical information of the road area.

[0118] Step 402, generating various road area schemes for allocating nodes and lines to a predetermined number of couriers.

[0119] Step 403: Establish a multi-traveling salesman model aiming to minimize the income gap among couriers based on the network structure information and statistical information.

[0120] Step 404: Solve the multi-traveling salesman model under various road area schemes, obtain the road area scheme with the smallest income gap among couriers, and output the corresponding road areas for the couriers.

[0121] Steps 401 - 404 are basically the same as steps 201 - 204, so they will not be elaborated here.

[0122] Step 405: In response to receiving a message about line interruption between nodes, use the line interruption as a constraint to re-solve the multi-traveling salesman model, and obtain an updated road area scheme with the smallest income gap among couriers.

[0123] In this embodiment, if the line between two nodes (i, j) is interrupted, the decision variable x ij can be set to 0. Then re-solve the multi-traveling salesman model, and the obtained road area scheme will not assign x ij to any courier.

[0124] The delivery scope of a courier can be blocked by configuring lines, or lines can be added to set a special coverage scope.

[0125] Further referring to Figure 5 , as an implementation of the methods shown in the above figures, the present disclosure provides an embodiment of a road area planning device. This device embodiment corresponds to the method embodiment shown in Figure 2 , and this device can be specifically applied to various electronic devices.

[0126] As shown in Figure 5 , the road area planning device 500 in this embodiment includes: an acquisition unit 501, a generation unit 502, an establishment unit 503, and a solution unit 504. Among them, the acquisition unit 501 is configured to acquire the network structure information and statistical information of the road area, where the network structure information includes node information and line information, and the statistical information includes the average daily parcel quantity, single-parcel income, and average parcel processing duration of each node; the generation unit 502 is configured to generate various road area schemes for allocating nodes and lines to a predetermined number of couriers; the establishment unit 503 is configured to establish a multi-traveling salesman model aiming to minimize the income gap among couriers based on the network structure information and the statistical information, where the constraints of the multi-traveling salesman model include duration constraints; the solution unit 504 is configured to solve the multi-traveling salesman model under various road area schemes, obtain the road area scheme with the smallest income gap among couriers, and output the corresponding road areas for the couriers.

[0127] In this embodiment, for the specific processing of the acquisition unit 501, generation unit 502, establishment unit 503, and solution unit 504 of the road area planning device 500, reference can be made to Figure 2 Steps 201, 202, 203, and 204 in the corresponding embodiment.

[0128] In some alternative implementation manners of this embodiment, the establishment unit 503 is further configured to: calculate the travel time of the lines in various road area schemes according to the average processing time of the parcels at the nodes; allocate lines with travel time not exceeding a predetermined threshold to each courier; calculate the income of the courier according to the average daily parcel quantity and the income per order of the nodes included in the lines allocated to each courier; calculate the income gap between the courier with the highest income and the courier with the lowest income.

[0129] In some alternative implementation manners of this embodiment, the solution unit 504 is further configured to: traverse each combination of nodes, lines, and couriers from various road area schemes; calculate the income of the courier according to the average daily parcel quantity and the income per order of the nodes included in the lines allocated to the courier in each combination; calculate the income gap between the courier with the highest income and the courier with the lowest income in each combination; select the road area scheme with the smallest income gap between couriers from all combinations.

[0130] In some alternative implementation manners of this embodiment, the device 500 further includes an inspection unit (not shown in the drawings), which is configured to: check whether there is duplicate data in the node information and the line information; if there is duplicate data, delete the duplicate data.

[0131] In some alternative implementation manners of this embodiment, the device 500 further includes an inspection unit (not shown in the drawings), which is configured to: check whether there are isolated nodes that are not connected to other nodes according to the node information and the line information; if there are isolated nodes, prompt the user to supplement the line information.

[0132] In some alternative implementation manners of this embodiment, the device 500 further includes an output unit (not shown in the drawings), which is configured to: visually output the node information, the line information, and the road area scheme with the smallest income gap between couriers for the user to view.

[0133] In some alternative implementation manners of this embodiment, the solution unit 504 is further configured to: if an optimal solution is not obtained within a predetermined time and the current solution time is less than or equal to the maximum solution time, increase the solution time and continue to solve the multi-traveling salesman model under various road area schemes.

[0134] In some alternative implementation manners of this embodiment, the solving unit 504 is further configured to: if the multi-traveling salesman model has no feasible solution, analyze the network structure information and the statistical information to find the reason for no solution.

[0135] In some alternative implementation manners of this embodiment, the solving unit 504 is further configured to: in response to receiving a message of line interruption between nodes, use the line interruption as a constraint to re-solve the multi-traveling salesman model, and obtain an updated road area plan with the smallest income gap between couriers.

[0136] It should be noted that in the technical solution of the present disclosure, in aspects such as the collection, gathering, update, analysis, processing, use, transmission, and storage of user personal information, it complies with the provisions of relevant laws and regulations, is used for legal purposes, and does not violate public order and good customs. Necessary measures are taken for user personal information to prevent illegal access to user personal information data, and the security of user personal information, network security, and national security are maintained.

[0137] According to an embodiment of the present disclosure, the present disclosure also provides an electronic device and a readable storage medium.

[0138] An electronic device includes: one or more processors; a storage device on which one or more computer programs are stored, and when the one or more computer programs are executed by the one or more processors, the one or more processors implement the method described in process 200 or 400.

[0139] A computer-readable medium has a computer program stored thereon, where the computer program, when executed by a processor, implements the method described in process 200 or 400.

[0140] Figure 6 FIG. shows a schematic block diagram of an exemplary electronic device 600 that can be used to implement the embodiments of the present disclosure. The electronic device is intended to represent various forms of digital computers, such as, a laptop computer, a desktop computer, a workbench, a personal digital assistant, a server, a blade server, a mainframe computer, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as, a personal digital processor, a cellular phone, a smart phone, a wearable device, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present disclosure described and / or claimed herein.

[0141] As Figure 6As shown, device 600 includes a computing unit 601, which can perform various appropriate actions and processes according to a computer program stored in a read-only memory (ROM) 602 or a computer program loaded from a storage unit 608 into a random access memory (RAM) 603. In the RAM 603, various programs and data required for the operation of the device 600 can also be stored. The computing unit 601, the ROM 602, and the RAM 603 are connected to each other via a bus 604. An input / output (I / O) interface 605 is also connected to the bus 604.

[0142] Multiple components in the device 600 are connected to the I / O interface 605, including: an input unit 606, such as a keyboard, a mouse, etc.; an output unit 607, such as various types of displays, speakers, etc.; a storage unit 608, such as a magnetic disk, an optical disc, etc.; and a communication unit 609, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 609 allows the device 600 to exchange information / data with other devices via a computer network such as the Internet and / or various telecommunication networks.

[0143] The computing unit 601 can be various general-purpose and / or special-purpose processing components with processing and computing capabilities. Some examples of the computing unit 601 include but are not limited to a central processing unit (CPU), a graphics processing unit (GPU), various dedicated artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, a digital signal processor (DSP), and any appropriate processor, controller, microcontroller, etc. The computing unit 601 executes the various methods and processes described above, such as the road area planning method. For example, in some embodiments, the road area planning method can be implemented as a computer software program, which is tangibly contained in a machine-readable medium, such as the storage unit 608. In some embodiments, part or all of the computer program can be loaded and / or installed onto the device 600 via the ROM 602 and / or the communication unit 609. When the computer program is loaded into the RAM 603 and executed by the computing unit 601, one or more steps of the road area planning method described above can be executed. Alternatively, in other embodiments, the computing unit 601 can be configured to execute the road area planning method in any other appropriate way (e.g., by means of firmware).

[0144] The various embodiments of the systems and techniques described above in this specification can be implemented in digital electronic circuitry, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on a chip (SOCs), complex programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments can include: being implemented in one or more computer programs that are executable and / or interpretable on a programmable system including at least one programmable processor, which can be a special-purpose or general-purpose programmable processor that receives data and instructions from, and transmits data and instructions to, a storage system, at least one input device, and at least one output device.

[0145] The program code for implementing the methods of the present disclosure can be written in any combination of one or more programming languages. These program codes can be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the program codes, when executed by the processor or controller, cause the functions / operations specified in the flowchart and / or block diagram to be implemented. The program code can be executed entirely on the machine, partially on the machine, as a stand-alone software package partially on the machine and partially on a remote machine, or entirely on the remote machine or server.

[0146] In the context of the present disclosure, a machine-readable medium can be a tangible medium that can contain or store a program for use by or in connection with an instruction execution system, apparatus, or device. A machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium can include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, 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 disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0147] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device for displaying information to the user (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor); and a keyboard and a pointing device (e.g., a mouse or a trackball) through which the user can provide input to the computer. Other kinds of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).

[0148] The systems and techniques described herein can be implemented in a computing system including backend components (e.g., as a data server), or a computing system including middleware components (e.g., an application server), or a computing system including frontend components (e.g., a user computer having a graphical user interface or a web browser through which the user can interact with an implementation of the systems and techniques described herein), or a computing system including any combination of such backend components, middleware components, or frontend components. The components of the system can be interconnected to each other by digital data communication in any form or medium (e.g., a communication network). Examples of communication networks include: local area network (LAN), wide area network (WAN), and the Internet.

[0149] A computer system can include a client and a server. The client and the server are generally far from each other and usually interact through a communication network. The client - server relationship is created by computer programs running on the respective computers and having a client - server relationship with each other. The server can be a server of a distributed system, or a server combined with a blockchain. The server can also be a cloud server, or an intelligent cloud computing server or an intelligent cloud host with artificial intelligence technology. The server can be a server of a distributed system, or a server combined with a blockchain. The server can also be a cloud server, or an intelligent cloud computing server or an intelligent cloud host with artificial intelligence technology.

[0150] It should be understood that various forms of the processes shown above can be used, with steps reordered, added, or deleted. For example, the steps recited in this disclosure can be executed in parallel, sequentially, or in a different order, as long as the desired results of the technical solutions disclosed in this disclosure can be achieved, and no limitation is imposed herein.

[0151] The above specific embodiments do not constitute a limitation on the protection scope of the present disclosure. Those skilled in the art should understand that various modifications, combinations, sub - combinations and substitutions can be made according to design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principle of the present disclosure shall be included within the protection scope of the present disclosure.

Claims

1. A road area planning method, comprising: Obtain the network structure information and statistical information of the road area, where the network structure information includes node information and line information, and the statistical information includes the average daily parcel quantity, average income per order, and average parcel processing duration of each node; Generate various road area plans for allocating nodes and lines to a predetermined number of couriers; Establish a multi-travelling salesman model with the goal of minimizing the income gap between couriers based on the network structure information and the statistical information, where the constraints of the multi-travelling salesman model include duration constraints; Solve the multi-travelling salesman model under various road area plans, obtain the road area plan with the smallest income gap between couriers, and output the corresponding road area for the couriers.

2. The method according to claim 1, wherein, The establishing a multi-travelling salesman model with the goal of minimizing the income gap between couriers based on the network structure information and the statistical information includes: Calculate the travel time of the lines in various road area plans according to the average parcel processing duration of the nodes; Allocate lines with travel time not exceeding a predetermined threshold to each courier; calculate the income of the courier according to the average daily parcel quantity and average income per order of the nodes included in the lines allocated to each courier; Calculate the income gap between the courier with the highest income and the courier with the lowest income.

3. The method according to claim 1, wherein, The solving the multi-travelling salesman model under various road area plans to obtain the road area plan with the smallest income gap between couriers includes: Traverse each combination of nodes, lines, and couriers from various road area plans; Calculate the income of the courier according to the average daily parcel quantity and average income per order of the nodes included in the lines allocated to the courier in each combination; Calculate the income gap between the courier with the highest income and the courier with the lowest income in each combination; Select the road area plan with the smallest income gap between couriers from all combinations.

4. The method according to claim 1, wherein, The method further includes: Check whether there are isolated nodes that are not connected to other nodes according to the node information and the line information; If there are isolated nodes, prompt the user to supplement the line information.

5. The method according to claim 1, wherein, The method further includes: Visually output the node information, the line information, and the road area plan with the smallest income gap between couriers for the user to view.

6. The method according to claim 1, wherein, The method further includes: If the optimal solution is not obtained within a predetermined time and the current solving time is less than or equal to the maximum solving time, increase the solving time and continue to solve the multi-travelling salesman model under various road area plans.

7. The method according to claim 1, wherein, The method further includes: If the multi-travelling salesman model has no feasible solution, analyze the network structure information and the statistical information to find the reason for no solution.

8. The method according to any one of claims 1-7, wherein, The method further includes: In response to receiving a message of line blockage between nodes, re-solve the multi-travelling salesman model with the line blockage as a constraint to obtain an updated road area plan with the smallest income gap between couriers.

9. A road area planning device, comprising: An obtaining unit configured to obtain the network structure information and statistical information of the road area, where the network structure information includes node information and line information, and the statistical information includes the average daily parcel quantity, average income per order, and average parcel processing duration of each node; A generating unit configured to generate various road area plans for allocating nodes and lines to a predetermined number of couriers; A building unit, configured to establish a multi-travelling salesman model aiming at minimizing the income gap among couriers based on the network structure information and the statistical information, wherein the constraints of the multi-travelling salesman model include duration constraints; A solving unit, configured to solve the multi-travelling salesman model under various road area schemes, obtain a road area scheme with the smallest income gap among couriers, and output the corresponding road areas of the couriers.

10. An electronic device for road area planning, comprising: One or more processors; A storage device having stored thereon one or more computer programs, When the one or more computer programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1-8.

11. A computer-readable medium having a computer program stored thereon, wherein, When the computer program is executed by a processor, the method according to any one of claims 1-8 is implemented.

Images