A method, apparatus, storage medium, and electronic device for dividing business areas.

Abstract

This specification discloses a method, apparatus, storage medium, and electronic device for dividing business areas. For each business area, based on the delivery probability between the business area and its associated business areas, delivery relationships are established between the business area and its associated business areas, thereby determining the delivery difficulty of each business area. The business areas are then divided according to their delivery difficulty. This method divides business areas based on their delivery difficulty. In determining the delivery difficulty of each business area, delivery relationships are established between each business area and its associated business areas, thus taking into account the influence between business areas and ensuring the accuracy of the determined delivery difficulty, thereby improving the accuracy of business area division.

Description

Technical Field

[0001] This specification relates to the field of Internet technology, and in particular to a method, apparatus, storage medium and electronic device for dividing business areas. Background Technology

[0002] With the development of internet technology, more and more users are purchasing goods online. After a user completes their purchase, logistics or food delivery platforms can deliver the goods to the user using their delivery capacity. The pickup and delivery points for each order are distributed in different business areas, or Areas of Interest (AOIs). To facilitate delivery and other operations, logistics or food delivery platforms will merge multiple adjacent AOIs into a single overall business area or split a single AOI into multiple sub-business areas based on the delivery difficulty of each AOI. This allows them to assign delivery capacity to handle the logistics and delivery of orders within the divided business areas.

[0003] In existing technologies, the delivery difficulty of an AOI is usually determined based on the time information of its arrival at that AOI, i.e., the time it takes to deliver to that AOI.

[0004] However, in actual business operations, there are connections between different AOIs. That is, for each AOI, the delivery difficulty of other AOIs where its corresponding pickup or delivery point is located will affect the delivery difficulty of that AOI. For example, if the pickup or delivery point for AOI1 is located in AOI2, which has a higher delivery difficulty, then the delivery difficulty of AOI1 will increase accordingly. The method described above for determining AOI delivery difficulty only considers the delivery difficulty of each AOI itself, which can lead to inaccurate determinations and consequently, incorrect division of business areas.

[0005] Therefore, improving the accuracy of business area division is an urgent problem to be solved. Summary of the Invention

[0006] This specification provides a method and apparatus for dividing business areas, in order to partially solve the aforementioned problems existing in the prior art.

[0007] The following technical solution is adopted in this specification:

[0008] This specification provides a method for dividing business areas, including:

[0009] For each business region, retrieve all orders whose pickup location is in that business region, and use the business region corresponding to the delivery location of the retrieved orders as the associated business region;

[0010] Determine the total number of all acquired orders as the first quantity, and for each associated business region, determine the number of orders whose delivery location is within that associated business region from all acquired orders as the second quantity;

[0011] Based on the first quantity and the second quantity, determine the delivery probability from the business area to the associated business area;

[0012] Based on the delivery probability between this business area and each associated business area, establish the delivery relationship between each associated business area and this business area;

[0013] The delivery difficulty of each business area is determined based on the delivery relationship between each business area and its corresponding associated areas;

[0014] The business areas are divided according to the delivery difficulty of each area.

[0015] Optionally, before establishing the delivery relationship between each associated business area and the business area, the method further includes:

[0016] For each associated business area, based on the information in each order whose delivery location is in that associated business area, the average delivery time from that business area to that associated business area is determined, and this is used as the delivery cost between that associated business area and that business area.

[0017] Optionally, based on the delivery probability between the business area and each associated business area, a delivery relationship between the business area and the associated business area is established, specifically including:

[0018] For each associated business area, the total delivery cost between the business area and the associated business area is determined based on the delivery probability between the business area and the associated business area, and the delivery cost between the business area and the associated business area.

[0019] The total delivery cost between the business area and each associated business area, along with the delivery difficulty of each associated business area, is used to establish the delivery relationship between the business area and each associated business area.

[0020] Optionally, before dividing the business areas based on the delivery difficulty of each area, the specific steps include:

[0021] For each business region, determine whether the delivery difficulty of that business region is less than a specified threshold;

[0022] Based on the delivery difficulty of each business area, the business areas are divided into several regions, specifically including:

[0023] For each business region, a score is determined based on the delivery cost between the business region and its related business regions, and the delivery difficulty between the related business regions.

[0024] Based on the scores between this business area and each associated business area, a designated associated business area is determined; this business area is then merged with the designated associated business area to form a new business area.

[0025] Optionally, the business areas can be divided according to the delivery difficulty of each area, specifically including:

[0026] For each business region, determine whether the delivery difficulty in that region exceeds a specified threshold;

[0027] Based on the delivery difficulty of each business area, the business areas are divided into several regions, specifically including:

[0028] For each business region, identify the sub-business regions included in that business region;

[0029] For each sub-business area, identify the related sub-business areas within that business area, and designate them as the related sub-business areas of that sub-business area.

[0030] The scores of the sub-business area and its related sub-business areas are determined based on the delivery costs between the sub-business area and its related business areas, as well as the delivery difficulty of the sub-business area.

[0031] Based on the scores of the sub-business area and each associated sub-business area, a designated sub-business area is determined; and the designated sub-business area is then separated from the business area.

[0032] Optionally, the total number of all acquired orders is determined as a first quantity, and for each associated business area, the number of orders with delivery locations within that associated business area is determined as a second quantity, specifically including:

[0033] Determine the number of orders obtained within a specified period as the first quantity, and for each associated business region, determine the number of orders whose delivery location is in that associated business region from the orders within the specified period as the second quantity;

[0034] Determining the delivery probability from this business area to the associated business area specifically includes:

[0035] Based on the first quantity and the second quantity, determine the delivery probability from the business area to the associated business area within the specified period.

[0036] Optionally, based on the delivery probability between the business area and each associated business area, a delivery relationship between the business area and the associated business area is established, specifically including:

[0037] For each associated business area, based on the obtained order information, determine the number of orders delivered from that business area to that associated business area within a specified period using each delivery capacity, and use this as the third quantity;

[0038] Based on the third quantity and the delivery probability between the business area and the associated business area within the specified period, the delivery efficiency between the business area and the associated business area is determined.

[0039] Based on the sum of delivery efficiencies between the business area and each associated business area, and the delivery difficulty of each associated business area, establish the delivery relationship between each associated business area and the business area.

[0040] This specification provides a business area division device, including:

[0041] A delivery relationship establishment module is used to: acquire all orders with pickup locations in each business area, and designate the business areas corresponding to the delivery locations of the acquired orders as associated business areas; determine the total number of all acquired orders as a first quantity, and for each associated business area, determine the number of orders with delivery locations in that associated business area from among all acquired orders as a second quantity; determine the delivery probability from the current business area to the associated business area based on the first quantity and the second quantity; and establish delivery relationships between each associated business area and the current business area based on the delivery probabilities between the current business area and each associated business area.

[0042] The business area division module is used to determine the delivery difficulty of each business area based on the delivery relationship between each business area and its corresponding associated areas; and to divide each business area according to the delivery difficulty of each business area.

[0043] This specification provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the above-described business area division method.

[0044] This specification provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the above-described business area division method.

[0045] The above-mentioned technical solutions adopted in this specification can achieve the following beneficial effects:

[0046] In the business area division method provided in this specification, for each business area, a delivery relationship is established between each associated business area and the business area based on the delivery probability between the business area and each associated business area. The delivery difficulty of each business area is then determined through these relationships. Based on the delivery difficulty of each business area, the business areas are divided.

[0047] As can be seen from the above method, this approach divides business areas based on their delivery difficulty. When determining the delivery difficulty of each business area, a delivery relationship is established between the delivery difficulty of each business area and its related business areas. Then, based on the delivery relationship between each business area and its related business areas, the delivery difficulty of each business area is determined. This method considers the influence between business areas when determining their delivery difficulty, ensuring the accuracy of the determined delivery difficulty and thus improving the accuracy of business area division. Attached Figure Description

[0048] The accompanying drawings, which are included to provide a further understanding of this specification and form part of this specification, illustrate exemplary embodiments and are used to explain this specification, but do not constitute an undue limitation thereof. In the drawings:

[0049] Figure 1 This is a flowchart illustrating one method for dividing business areas as described in this specification.

[0050] Figure 2 A schematic diagram of a business area division device provided in this specification;

[0051] Figure 3 The corresponding information provided in this specification Figure 1 A schematic diagram of an electronic device. Detailed Implementation

[0052] In the delivery sector, especially for on-demand delivery, accurately dividing (merging or splitting) business areas can improve delivery efficiency. The server divides the business areas based on the delivery difficulty of each area. Therefore, accurately determining the delivery difficulty of each business area is a prerequisite for accurately dividing the scope of the business area.

[0053] In the embodiments of this specification, a delivery relationship is established between each business area and its associated business areas to determine the delivery difficulty of each business area. Then, based on the delivery difficulty of each business area, the business areas are divided. Specifically, for each order, the relationship between the business area corresponding to the order's pickup location and the business area corresponding to the order's delivery location is called an association relationship.

[0054] To make the objectives, technical solutions, and advantages of this specification clearer, the technical solutions of this specification will be clearly and completely described below in conjunction with specific embodiments and corresponding drawings. Obviously, the described embodiments are only a part of the embodiments of this specification, and not all of them. Based on the embodiments in this specification, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this specification.

[0055] The technical solutions provided in the various embodiments of this specification are described in detail below with reference to the accompanying drawings.

[0056] Figure 1 This is a flowchart illustrating one method for dividing business areas as described in this specification, specifically including the following steps:

[0057] S100: For each business area, obtain all orders whose pickup location is in that business area, and use the business area corresponding to the delivery location of the obtained orders as the associated business area.

[0058] The business area division method provided in this manual can be executed by electronic devices such as laptops, mobile phones, and servers, and this manual does not impose any restrictions on it. The following description only uses a server as the execution subject as an example. The server can be a server used to implement a logistics distribution platform or a logistics distribution scheduling system, and this manual does not impose any restrictions.

[0059] In the embodiments described in this specification, for each business region, the server can obtain all orders with pickup locations in that business region from all orders. The server can then use the obtained order information to determine the business region corresponding to the delivery location of each order, and designate the business region corresponding to the delivery location as the associated business region for that business region.

[0060] It is worth noting that the associated business area of ​​each business area can be any other business area or the business area itself; this specification does not impose any restrictions on this.

[0061] S102: Determine the total number of all orders obtained as the first quantity, and for each associated business area, determine the number of orders whose delivery location is in that associated business area from all the obtained orders as the second quantity.

[0062] The number of orders obtained in step S100, i.e. the number of orders whose delivery location is in the business area, is determined as the first quantity. The pickup locations of all orders obtained by the server are in the same business area, i.e., the business area.

[0063] Meanwhile, for each associated business area of ​​this business area, the server can determine the orders whose delivery location is in the associated business area and the order quantity based on the delivery location in the obtained order information, and use this as the second quantity.

[0064] For example, when determining the delivery difficulty of business area A, the server can obtain all orders with pickup locations in business area A and determine that the number of orders obtained is 500, so the first quantity is 500. Then, based on the order information in the obtained orders, the server can determine that the associated business areas of business area A are business area B and business area C, and that the number of orders with delivery locations in business area B is 100, so the second quantity for business area B is 100; and the number of orders with delivery locations in business area C is 400, so the second quantity for business area C is 400. Furthermore, the associated business areas of business area B are business area A and business area C, and the associated business areas of business area C are business area A and business area B.

[0065] S104: Determine the delivery probability from the business area to the associated business area based on the first quantity and the second quantity.

[0066] Specifically, by dividing the second quantity determined in step S102 by the first quantity, the server can determine the delivery probability from the business area to the associated business area.

[0067] Using the previous example, the server can calculate the delivery probability between business area A and associated business area B as 20% by dividing the second quantity 100 corresponding to associated business area B by the first quantity 500. Similarly, the server can calculate the delivery probability between business area A and associated business area C as 80% by dividing the second quantity 400 corresponding to associated business area C by the first quantity 500.

[0068] S106: Based on the delivery probability between this business area and each associated business area, establish the delivery relationship between each associated business area and this business area.

[0069] After determining the delivery probability between the business area and each associated business area, the server can establish the delivery relationship between each associated business area and the business area based on the delivery probability between the business area and each associated business area. The delivery relationship refers to the relationship between the delivery difficulty of the business area and the delivery difficulty of each associated business area.

[0070] Specifically, since the delivery difficulty of a business area is influenced by the delivery difficulty of its related business areas, the server can use the formula V(S)=∑ S P(S′|S)(R(S,S′)+γV(S′)) represents the delivery relationship between a business area and its associated business areas. Here, S is the business area, S' is the associated business area, V(S) is the delivery difficulty of the business area, P(S'|S) is the delivery probability from the business area to the associated business area, R(S,S') is the delivery cost between the business area and the associated business areas, V(S') is the delivery difficulty of the associated business areas, and γ is a coefficient set according to actual business needs. The delivery cost R(S,S') between the business area and the associated business areas can be time cost, economic cost, or other costs; this specification does not impose any restrictions on this.

[0071] When the delivery cost is a time cost, specifically, for each associated business area, the server can determine the average delivery time from that business area to that associated business area based on the delivery time of each order whose delivery location is in that associated business area, and use this as the delivery cost between that business area and that associated business area.

[0072] Using the previous example, the formula for determining the delivery relationship between business area A and related business areas B and C can be:

[0073] V(A)=P(B|A)(R(A,B)+γ(B))+P(C|A)(R(A,C)+γV(C));

[0074] V(B)=P(A|B)(R(B,A)+γ(A))+P(C|B)(R(B,C)+γV(C));

[0075] V(C)=P(A|C)(R(C,A)+γ(A))+P(B|C)(R(C,B)+γV(B)).

[0076] S108: Determine the delivery difficulty of each business area based on the delivery relationship between each business area and its corresponding related business areas.

[0077] Following the method in step S106, the delivery relationship between each business area and its associated business areas can be determined. Then, the server can calculate the delivery difficulty of each business area based on the delivery relationship between each business area and its corresponding associated business areas.

[0078] Continuing with the previous example, in the aforementioned set of delivery relationship equations between business area A and related business areas B and C, the server knows that the delivery probability between business area A and related business area B is P(B|A) = 0.2, and the delivery probability between business area A and related business area C is P(C|A) = 0.8. According to step S106, the server can determine the delivery cost R(A,B) between business area A and related business area B, and the delivery cost R(A,C) between business area A and related business area C, and γ is also known. Furthermore, the server can determine P(A|B), P(C|B), P(A|C), P(B|C), R(B,A), R(B,C), R(C,A), and R(C,B) according to steps S100 to S104.

[0079] Based on the above set of delivery relationship equations between business area A and related business areas B and C, the server can calculate the delivery difficulty V(A) of business area A, the delivery difficulty V(B) of business area B, and the delivery difficulty V(C) of business area C.

[0080] S110: Divide the business areas according to the delivery difficulty of each business area.

[0081] To avoid excessive differences in delivery difficulty between different business regions, the server can merge business regions into one business region or split a business region into multiple sub-business regions based on the delivery difficulty of each business region.

[0082] When the delivery difficulty in a certain business area is too high, the success rate of order acceptance for orders with pickup or delivery locations in that business area will be too low. Therefore, the server can reduce the delivery difficulty in that business area by splitting it into smaller parts.

[0083] Specifically, for each business region, if the delivery difficulty of that business region exceeds a specified threshold, it can be determined that the delivery difficulty of that business region is too high. The server can identify all sub-business regions included in that business region, and each sub-business region can identify its related sub-business regions within that business region.

[0084] For each sub-business area, the server can identify the sub-business areas that are related to it within the business area. As related sub-business areas, the delivery difficulty of each sub-business area and the related sub-business areas can be determined using the same method as steps S102 to S108. Thus, the delivery difficulty of each sub-business area within the business area can be determined.

[0085] The server can then determine the delivery difficulty between each sub-business area and each related sub-business area using the formula V(S, S') = R(S, S') + γV(S'), where S represents the sub-business area, S' is the sub-business area related to the sub-business area, V(S, S') is the delivery difficulty between the sub-business area and the related sub-business area, R(S, S') is the delivery cost between the sub-business area S and the related sub-business area S', γ is a coefficient set according to demand, and V(S') is the delivery difficulty of the related sub-business area.

[0086] Next, the server can identify the associated sub-business area with the highest delivery difficulty among the sub-business areas, designate it as the designated sub-business area, and then split the designated sub-business area out of the business area. The split designated sub-business area can be used as a new business area, and the remaining business areas excluding the designated sub-business area can also be used as a business area. At this point, the division of each business area is completed.

[0087] When the delivery difficulty of a certain business area is too low, it may result in low delivery costs for orders with pickup or delivery locations in that business area, and also low order acceptance rates for that business area. Therefore, the server can merge the various business areas into a new business area based on their difficulty.

[0088] Specifically, for each business region, when the server determines that the delivery difficulty of that business region is below a specified threshold, it can be determined that the delivery difficulty of that business region is too low. The server can identify the associated business regions of that business region, and determine the delivery difficulty between that business region and each associated business region using the formula V(S, S') = R(S, S') + γV(S'). Here, S is the business region, S' is the associated business region, V(S, S') is the delivery difficulty between the business region and the associated business regions (i.e., the delivery difficulty of the merged business region), R(S, S') is the delivery cost between the business region and the associated business regions, and γ is a coefficient set according to demand.

[0089] The server can identify the associated business region with the lowest delivery difficulty to the current business region, designate it as the designated associated business region, and merge the current business region with the designated associated business region into a single business region. At this point, the division of each business region is complete.

[0090] As can be seen from the above method, this method establishes a relationship between the delivery difficulty of each business area and the delivery difficulty of its related business areas, which can more accurately determine the delivery difficulty of each business area, thereby enabling the server to more accurately divide each business area.

[0091] In addition to using delivery probability and delivery cost as mentioned above to establish delivery relationships between each business area and related business areas, other methods can also be used to establish delivery relationships between each business area and related business areas.

[0092] Specifically, for each business area, the associated business areas are determined according to step S100. Then, based on the order information obtained from orders with pickup locations in that business area, the server determines the number of orders with pickup locations in that business area within a specified period, which is the first quantity. Furthermore, for each associated business area of ​​that business area, the server can determine the number of orders with pickup locations in that business area and delivery locations in that associated business area within the specified period, which is the second quantity. The server calculates the delivery probability between that business area and its associated business areas within the specified period by dividing the second quantity by the first quantity.

[0093] At the same time, the server can determine the number of orders delivered from the business area to the associated business area within a specified period based on the order information obtained from the orders, and use this as the third quantity.

[0094] Based on the third quantity and the delivery probability between the business area and the associated business area within a specified period, a delivery relationship between the business area and the associated business area can be established.

[0095] The formula V(t, S) = ∑ (t，S′) P(S′,t′|S,t)(R(t,S,S′)+V(t′,S′)) represents the delivery relationship between the business area and the associated business area. Here, t is any time, t′ is the time after the average delivery time from the business area to the associated business area starting from time t, V(t,S) is the delivery difficulty of the business area, V(t′,S′) is the delivery difficulty of the associated business area, P(S′,t′|S,t) is the delivery probability from the business area to the associated business area within a specified period, and R(t,S,S′) is the number of orders delivered from the business area to the associated business area within the specified period, i.e., the third quantity.

[0096] Furthermore, since orders closer to the current time have higher reference value, the server can obtain orders from the past month or past week in step S100. It is worth noting that since the delivery difficulty for each business area is based on orders from the past week or past month, these orders will change over time, and therefore the delivery difficulty for each business area will also change, rather than remaining constant. Moreover, whenever the referenced orders change, the server can use the methods in steps S100 to S106 to redetermine the delivery difficulty for each business area.

[0097] In the embodiments of this specification, in addition to determining the delivery cost between a business area and an associated business area based on the delivery time taken from the business area to the associated business area, the waiting time for each delivery capacity to wait for the next order in that business area can also be determined. The delivery cost between the business area and the associated business area can be determined by the waiting time in that business area and the delivery time from the business area to the associated business area.

[0098] In addition, the delivery difficulty in each business area can be used as a basis for dividing the business area and for determining delivery costs.

[0099] The above describes one or more embodiments of the business area division method provided in this specification. Based on the same idea, this specification also provides corresponding business area division devices, such as... Figure 2 As shown.

[0100] Figure 2 This specification provides a schematic diagram of a business area division device, which specifically includes:

[0101] Delivery relationship establishment module 201, business area division module 202, wherein:

[0102] The delivery relationship establishment module 201 is used to: acquire all orders with pickup locations in each business area, and designate the business areas corresponding to the delivery locations of the acquired orders as associated business areas; determine the quantity of all acquired orders as a first quantity, and for each associated business area, determine the quantity of orders with delivery locations in the associated business area from among all acquired orders as a second quantity; determine the delivery probability from the business area to the associated business area based on the first quantity and the second quantity; and establish delivery relationships between each associated business area and the business area based on the delivery probabilities between the business area and each associated business area.

[0103] The business area division module 202 is used to determine the delivery difficulty of each business area based on the delivery relationship between each business area and its corresponding associated area; and to divide each business area according to the delivery difficulty of each business area.

[0104] Optionally, the delivery relationship establishment module 201 is further configured to determine the average delivery time of each order in the associated business area based on the information in each order whose delivery location is in the associated business area, and use this as the delivery cost between the associated business area and the business area.

[0105] Optionally, the delivery relationship establishment module 201 specifically targets each associated business area, determines the total delivery cost between the business area and the associated business area based on the delivery probability between the business area and the associated business area, and the delivery cost between the business area and the associated business area; and establishes the delivery relationship between the business area and each associated business area based on the sum of the total delivery costs between the business area and each associated business area, and the delivery difficulty of each associated business area.

[0106] Optionally, the business area division module 202 is specifically used to determine, for each business area, that the delivery difficulty of the business area is less than a specified threshold; and to divide each business area according to the delivery difficulty of each business area, specifically including: for each business area, determining the score of each business area and each associated business area based on the delivery cost between the business area and each associated business area, and the delivery difficulty of each associated business area; determining a designated associated business area based on the score between the business area and each associated business area; and merging the business area and the designated associated business area to form a new business area.

[0107] Optionally, the business area division module 202 is specifically used to determine, for each business area, that the delivery difficulty of the business area is greater than a specified threshold; and to divide each business area according to the delivery difficulty of each business area, specifically including: for each business area, determining each sub-business area contained in the business area; for each sub-business area, determining the sub-business areas that are related to the sub-business area within the business area, as associated sub-business areas of the sub-business area; determining the score of the sub-business area and each associated sub-business area based on the delivery cost between the sub-business area and each associated sub-business area of ​​the sub-business area, and the delivery difficulty of the sub-business area; determining a designated sub-business area based on the score of the sub-business area and each associated sub-business area; and splitting the designated sub-business area from the business area.

[0108] Optionally, the delivery relationship establishment module 201 is specifically used to determine the number of orders obtained within a specified period as a first quantity, and for each associated business area, determine the number of orders whose delivery location is in the associated business area from the orders in the specified period as a second quantity; and determine the delivery probability from the business area to the associated business area, specifically including: determining the delivery probability from the business area to the associated business area within the specified period based on the first quantity and the second quantity.

[0109] Optionally, the delivery relationship establishment module 201 is specifically used to determine, for each associated business area, the number of orders delivered from that business area to that associated business area within a specified period based on the obtained order information, as a third quantity;

[0110] Based on the third quantity and the delivery probability between the business area and the associated business area within the specified period, the delivery efficiency between the business area and the associated business area is determined.

[0111] Based on the sum of delivery efficiencies between the business area and each associated business area, and the delivery difficulty of each associated business area, establish the delivery relationship between each associated business area and the business area.

[0112] This specification also provides a computer-readable storage medium storing a computer program that can be used to execute the above-described... Figure 1 The provided method for dividing business areas.

[0113] This instruction manual also provides Figure 3 The diagram shows a schematic structural representation of the electronic device. Figure 3 At the hardware level, the electronic device includes a processor, internal bus, network interface, memory, and non-volatile memory, and may also include other hardware required for the business operations. The processor reads the corresponding computer program from the non-volatile memory into memory and then runs it to achieve the above-mentioned functions. Figure 1 The described business area division method. Of course, in addition to software implementation, this specification does not exclude other implementation methods, such as logic devices or a combination of hardware and software, etc. That is to say, the execution subject of the following processing flow is not limited to each logic unit, but can also be hardware or logic devices.

[0114] In the 1990s, improvements to a technology could be clearly distinguished as either hardware improvements (e.g., improvements to the circuit structure of diodes, transistors, switches, etc.) or software improvements (improvements to the methodology). However, with technological advancements, many methodological improvements today can be considered direct improvements to the hardware circuit structure. Designers almost always obtain the corresponding hardware circuit structure by programming the improved methodology into the hardware circuit. Therefore, it cannot be said that a methodological improvement cannot be implemented using hardware physical modules. For example, a Programmable Logic Device (PLD) (such as a Field Programmable Gate Array (FPGA)) is such an integrated circuit whose logic function is determined by the user programming the device. Designers can program and "integrate" a digital system onto a PLD themselves, without needing chip manufacturers to design and manufacture dedicated integrated circuit chips. Furthermore, nowadays, instead of manually manufacturing integrated circuit chips, this programming is mostly implemented using "logic compiler" software. Similar to the software compiler used in program development, the original code before compilation must be written in a specific programming language, called a Hardware Description Language (HDL). There are many HDLs, such as ABEL (Advanced Boolean Expression Language), AHDL (Altera Hardware Description Language), Confluence, CUPL (Cornell University Programming Language), HDCal, JHDL (Java Hardware Description Language), Lava, Lola, MyHDL, PALASM, and RHDL (Ruby Hardware Description Language). Currently, the most commonly used are VHDL (Very-High-Speed ​​Integrated Circuit Hardware Description Language) and Verilog. Those skilled in the art should understand that by simply performing some logic programming on the method flow using one of these hardware description languages ​​and programming it into an integrated circuit, the hardware circuit implementing the logical method flow can be easily obtained.

[0115] The controller can be implemented in any suitable manner. For example, it can take the form of a microprocessor or processor and a computer-readable medium storing computer-readable program code (e.g., software or firmware) executable by the (micro)processor, logic gates, switches, application-specific integrated circuits (ASICs), programmable logic controllers, and embedded microcontrollers. Examples of controllers include, but are not limited to, the following microcontrollers: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20, and Silicon Labs C8051F320. A memory controller can also be implemented as part of the control logic of the memory. Those skilled in the art will also recognize that, in addition to implementing the controller in purely computer-readable program code form, the same functionality can be achieved by logically programming the method steps to make the controller take the form of logic gates, switches, application-specific integrated circuits, programmable logic controllers, and embedded microcontrollers. Therefore, such a controller can be considered a hardware component, and the means included therein for implementing various functions can also be considered as structures within the hardware component. Alternatively, the means for implementing various functions can be considered as both software modules implementing the method and structures within the hardware component.

[0116] The systems, devices, modules, or units described in the above embodiments can be implemented by computer chips or entities, or by products with certain functions. A typical implementation device is a computer. Specifically, a computer can be, for example, a personal computer, laptop computer, cellular phone, camera phone, smartphone, personal digital assistant, media player, navigation device, email device, game console, tablet computer, wearable device, or any combination of these devices.

[0117] For ease of description, the above devices are described in terms of function, divided into various units. Of course, in implementing this specification, the functions of each unit can be implemented in one or more software and / or hardware components.

[0118] Those skilled in the art will understand that embodiments of the present invention can be provided as methods, systems, or computer program products. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention can take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0119] This invention is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart illustrations and / or block diagrams. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0120] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0121] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0122] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.

[0123] Memory may include non-persistent storage in computer-readable media, such as random access memory (RAM) and / or non-volatile memory, such as read-only memory (ROM) or flash RAM. Memory is an example of computer-readable media.

[0124] Computer-readable media includes both permanent and non-permanent, removable and non-removable media that can store information using any method or technology. Information can be computer-readable instructions, data structures, modules of programs, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic magnetic disk storage or other magnetic storage devices, or any other non-transferable medium that can be used to store information accessible by a computing device. As defined herein, computer-readable media does not include transient computer-readable media, such as modulated data signals and carrier waves.

[0125] It should also be noted that the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0126] Those skilled in the art will understand that the embodiments of this specification can be provided as methods, systems, or computer program products. Therefore, this specification may take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this specification may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0127] This specification can be described in the general context of computer-executable instructions that are executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc., that perform a specific task or implement a specific abstract data type. This specification can also be practiced in distributed computing environments, where tasks are performed by remote processing devices connected via a communication network. In distributed computing environments, program modules can reside in local and remote computer storage media, including storage devices.

[0128] The various embodiments in this specification are described in a progressive manner. Similar or identical parts between embodiments can be referred to interchangeably. Each embodiment focuses on describing the differences from other embodiments. In particular, the system embodiments are basically similar to the method embodiments, so the description is relatively simple; relevant parts can be referred to the descriptions in the method embodiments.

[0129] The above description is merely an embodiment of this specification and is not intended to limit this specification. Various modifications and variations can be made to this specification by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this specification should be included within the scope of the claims of this specification.

Claims

1. A method for dividing business areas, characterized in that, include: For each business region, retrieve all orders whose pickup location is in that business region, and use the business region corresponding to the delivery location of the retrieved orders as the associated business region; Determine the number of orders obtained within a specified period as the first quantity, and for each associated business region, determine the number of orders whose delivery location is in that associated business region from the orders obtained within the specified period as the second quantity; Based on the first quantity and the second quantity, determine the delivery probability from the business area to the associated business area within the specified period; For each associated business area, based on the obtained order information, determine the number of orders delivered from that business area to that associated business area within a specified period using each delivery capacity, and use this as the third quantity; Based on the third quantity and the delivery probability between the business area and the associated business area within the specified period, the delivery efficiency between the business area and the associated business area is determined. Based on the sum of delivery efficiencies between the business area and each related business area, and the delivery difficulty of each related business area, establish the delivery relationship between each related business area and the business area. The delivery difficulty of each business area is determined based on the delivery relationship between each business area and its corresponding associated areas; The business areas are divided according to the delivery difficulty of each area.

2. The method as described in claim 1, characterized in that, Before establishing the delivery relationship between each associated business area and the business area, the method further includes: For each associated business region, the average delivery time of each order in that associated business region is determined based on the information in each order whose delivery location is in that associated business region, and this average delivery time is used as the delivery cost between that associated business region and the business region.

3. The method as described in claim 1, characterized in that, Based on the delivery probability between this business area and each associated business area, establish the delivery relationship between each associated business area and this business area, specifically including: For each associated business area, the total delivery cost between the business area and the associated business area is determined based on the delivery probability between the business area and the associated business area, and the delivery cost between the business area and the associated business area. Based on the sum of the total delivery costs between the business area and each related business area, and the delivery difficulty of each related business area, establish the delivery relationship between the business area and each related business area.

4. The method as described in claim 1, characterized in that, Before dividing the business areas based on the delivery difficulty of each area, the specific steps included: For each business region, determine whether the delivery difficulty of that business region is less than a specified threshold; Based on the delivery difficulty of each business area, the business areas are divided into several regions, specifically including: For each business region, a score is determined based on the delivery cost between the business region and its related business regions, as well as the delivery difficulty between the related business regions. Based on the scores between this business area and each associated business area, a designated associated business area is determined; this business area is then merged with the designated associated business area to form a new business area.

5. The method as described in claim 1, characterized in that, Based on the delivery difficulty of each business area, the business areas are divided into sub-areas, specifically including: For each business region, determine whether the delivery difficulty in that region exceeds a specified threshold; Based on the delivery difficulty of each business area, the business areas are divided into several regions, specifically including: For each business region, identify the sub-business regions included in that business region; For each sub-business area, identify the related sub-business areas within that business area, and designate them as the related sub-business areas of that sub-business area. The scores of the sub-business area and its related sub-business areas are determined based on the delivery costs between the sub-business area and its related business areas, as well as the delivery difficulty of the sub-business area. Based on the scores of the sub-business area and each associated sub-business area, a designated sub-business area is determined; and the designated sub-business area is then separated from the business area.

6. A business area division device, characterized in that, include: The delivery relationship establishment module is used to obtain all orders with pickup locations in each business area, and to designate the business areas corresponding to the delivery locations of the obtained orders as associated business areas; determine the number of orders obtained within a specified period as a first quantity, and for each associated business area, determine the number of orders with delivery locations in the associated business area from the orders within the specified period as a second quantity; and determine the delivery probability of delivery from the business area to the associated business area within the specified period based on the first quantity and the second quantity. For each associated business area, based on the obtained order information, the number of orders delivered from that business area to that associated business area within a specified period is determined by each delivery capacity, and this number is used as the third quantity. Based on the third quantity and the delivery probability between that business area and that associated business area within the specified period, the delivery efficiency between that business area and that associated business area is determined. Based on the sum of the delivery efficiencies between that business area and each associated business area, and the delivery difficulty of each associated business area, the delivery relationship between each associated business area and that business area is established. The business area division module is used to determine the delivery difficulty of each business area based on the delivery relationship between each business area and its corresponding associated areas; and to divide each business area according to the delivery difficulty of each business area.

7. A computer-readable storage medium, characterized in that, The storage medium stores a computer program, which, when executed by a processor, implements the method described in any one of claims 1 to 5.

8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the program, it implements the method described in any one of claims 1 to 5.

Images