A method and device for dynamically dividing distribution areas

By calculating the delivery capacity and total tasks of unmanned delivery stations, and using map technology to dynamically adjust the delivery area, the problem that the fixed delivery area cannot adapt to order changes is solved, and efficient delivery task allocation and load balancing are achieved.

CN110135665BActive Publication Date: 2024-12-03BEIJING JINGDONG SHANGKE INFORMATION TECH CO LTD +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN201810105900.0
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2018-02-02
Publication Date
2024-12-03
Estimated Expiration
2038-02-02

AI Technical Summary

Technical Problem

The existing unmanned delivery stations deliver in a fixed delivery area and cannot be dynamically adjusted according to actual conditions, resulting in an increase in the delivery density when the order volume increases, and the task load and delivery capacity are inconsistent, resulting in a reduction in delivery delay and efficiency.

Method used

By calculating the distribution capacity and total tasks of the distribution station, the initial division is used using the Tyson polygon map or probability map to determine the load balancing of the distribution station, dynamically adjust the distribution area, ensure the virtual location and area division of the distribution station, and realize load balancing.

Benefits of technology

Dynamic distribution area allocation based on time period and distribution density changes is realized, distribution efficiency is improved, task load and distribution capacity are balanced, and distribution delays and resource waste are avoided.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN110135665B_ABST
    Figure CN110135665B_ABST
Patent Text Reader

Abstract

The present invention discloses a method and device for dynamically dividing distribution areas, and relates to the field of computer technology. A specific implementation of the method includes: initially dividing the distribution areas of distribution stations to calculate the distribution capacity and total distribution tasks of the distribution stations; calculating the load of each distribution station according to the distribution capacity and total distribution tasks; determining the load balance of each distribution station to obtain the distribution area of ​​the distribution station. This implementation can realize the dynamic allocation of distribution areas of distribution stations.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of computer technology, and in particular to a method and device for dynamically dividing distribution areas. Background Art

[0002] For large-scale unmanned vehicle delivery application scenarios, when the number of vehicles and the location of distribution stations are certain, it is necessary to continuously optimize the distribution area of ​​the distribution station based on information such as the building environment, delivery volume, and vehicle driving capacity, so as to achieve the optimization of the entire unmanned delivery system and achieve consistency in the task load of each distribution station to achieve a reasonable allocation of delivery tasks.

[0003] In the process of implementing the present invention, the inventors found that there are at least the following problems in the prior art:

[0004] The existing unmanned delivery stations with fixed delivery capabilities deliver in fixed delivery areas. The delivery areas have been divided before delivery, and the delivery stations cannot change the delivery areas later.

[0005] If the order volume in a distribution area of ​​a distribution station increases significantly during a certain period of time, the distribution density increases, and the task load is not coordinated with the distribution capacity of the distribution station in the area. At the same time, each distribution station cannot divide the distribution area according to the actual situation, there will be problems such as delivery delays, reduced delivery efficiency, and reduced user experience. Summary of the invention

[0006] In view of this, an embodiment of the present invention provides a method and device for dynamically dividing a delivery area, which can realize the dynamic allocation of the delivery area of ​​a delivery station.

[0007] To achieve the above-mentioned purpose, according to one aspect of an embodiment of the present invention, a method for dynamically dividing distribution areas is provided, including initially dividing the distribution areas of distribution stations to calculate the distribution capacity and the total number of distribution tasks of the distribution stations; calculating the load of each distribution station based on the distribution capacity and the total number of distribution tasks; and determining the load balance of each distribution station to obtain the distribution area of ​​the distribution station.

[0008] Optionally, the delivery area of ​​the delivery station is initially divided by using a Thiessen polygon graph.

[0009] Optionally, the total amount of delivery tasks of the delivery station is calculated using the probability map.

[0010] Optionally, the total amount of delivery tasks of the delivery station is calculated, including:

[0011] The total amount of delivery tasks of delivery station i is expressed as:

[0012]

[0013] in,

[0014]

[0015] Among them, r represents the set of areas covered by the distribution station, that is, all points within the range of V(Pi); and r i Represents the hotspot locations of distribution obtained based on historical distribution information; m is the number of hotspot locations in the distribution range;

[0016] Define the set {Ta1, Ta2, …, Tan} as the total amount of delivery tasks for delivery station i, where

[0017] T ai =taSk(i).

[0018] Optionally, the load of each distribution station is calculated based on the distribution capacity and the total distribution tasks.

[0019] include:

[0020] The load of distribution station i is defined as:

[0021]

[0022] Among them, C ai =F(L i ,S i ,T i ), L, S, and T represent the loading capacity, running speed, and endurance of the delivery vehicle, respectively.

[0023] Optionally, determining the load balance of each distribution station to obtain a distribution area of ​​the distribution station includes:

[0024] The load balance of each distribution station is determined to calculate the virtual position of the distribution station; and the distribution area of ​​the distribution station is obtained according to the virtual position of the distribution station.

[0025] Optionally, calculating a virtual location of a delivery station, including:

[0026] Virtual location of the distribution station i , obtained by the following formula:

[0027]

[0028] in:

[0029] At the same time, k i >0, ki is the feedback control gain, is the vector representing the input direction, a ij represents the coupling degree between distribution areas i and j; R ai and R ajThey represent the load of the i-th distribution station and the load of the j-th distribution station respectively.

[0030] In addition, according to one aspect of an embodiment of the present invention, a device for dynamically dividing distribution areas is provided, including an initialization module for initially dividing the distribution areas of distribution stations to calculate the distribution capacity and the total amount of distribution tasks of the distribution stations; a load calculation module for calculating the load of each distribution station based on the distribution capacity and the total amount of distribution tasks; and an adjustment module for determining the load balance of each distribution station to obtain the distribution area of ​​the distribution station.

[0031] Optionally, the initialization module performs an initial division of the delivery area of ​​the delivery station through a Thiessen polygon graph.

[0032] Optionally, the initialization module calculates the total amount of delivery tasks of the delivery station using a probability map.

[0033] Optionally, the initialization module calculates the total amount of delivery tasks of the delivery station, including:

[0034] The total amount of delivery tasks of delivery station i is expressed as:

[0035]

[0036] in,

[0037]

[0038] Among them, r represents the set of areas covered by the distribution station, that is, all points within the range of V(Pi); and r i Represents the hotspot locations of distribution obtained based on historical distribution information; m is the number of hotspot locations in the distribution range;

[0039] Define the set {Ta1, Ta2, …, Tan} as the total amount of delivery tasks for delivery station i, where

[0040] T ai =task(i).

[0041] Optionally, the load calculation module calculates the load of each distribution station according to the distribution capacity and the total amount of distribution tasks, including:

[0042] The load of distribution station i is defined as:

[0043]

[0044] Among them, C ai =F(L i , S i , T i ), L, S, and T represent the loading capacity, running speed, and endurance of the delivery vehicle, respectively.

[0045] Optionally, the adjustment module determines the load balance of each delivery station to obtain a delivery area of ​​the delivery station, including:

[0046] Determine the load balance of each distribution station to calculate the virtual location of the distribution station;

[0047] According to the virtual position of the delivery station, the delivery area of ​​the delivery station is obtained.

[0048] Optionally, the adjustment module calculates the virtual position of the distribution station, including:

[0049] Virtual location of the distribution station i , obtained by the following formula:

[0050]

[0051] in:

[0052] At the same time, k i >0, ki is the feedback control gain, is the vector representing the input direction, a ij represents the coupling degree between distribution areas i and j; R ai and R aj They represent the load of the i-th distribution station and the load of the j-th distribution station respectively.

[0053] According to another aspect of an embodiment of the present invention, there is further provided an electronic device, including:

[0054] one or more processors;

[0055] a storage device for storing one or more programs,

[0056] When the one or more programs are executed by the one or more processors, the one or more processors implement the method described in any of the above embodiments of dynamically dividing the delivery areas.

[0057] According to another aspect of the embodiments of the present invention, a computer-readable medium is provided, on which a computer program is stored. When the program is executed by a processor, the method described in any of the above embodiments of dynamically dividing the delivery areas is implemented.

[0058] An embodiment of the above invention has the following advantages or beneficial effects: according to the total delivery volume in a preset time period and the changes in the delivery density in each area, the delivery areas of each delivery station are reasonably allocated, so as to achieve a balance between the task load of each delivery station and its delivery capacity and achieve the highest delivery efficiency.

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

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

[0061] Figure 1 is a schematic diagram of the main process of the method for dynamically dividing the delivery area according to an embodiment of the present invention;

[0062] Figure 2 is a schematic diagram of the main process of the method for dynamically dividing the delivery area according to a reference embodiment of the present invention;

[0063] Figure 3 is a schematic diagram of main modules of a device for dynamically dividing a delivery area according to an embodiment of the present invention;

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

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

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

[0067] Figure 1 is a method for dynamically dividing the delivery area according to an embodiment of the present invention, such as Figure 1 As shown, the method for dynamically dividing the distribution area includes:

[0068] Step S101, initially dividing the distribution area of ​​the distribution station to calculate the distribution capacity and total distribution task volume of the distribution station.

[0069] Preferably, the distribution area of ​​the distribution station is initially divided by a Thiessen polygon diagram. Among them, the Thiessen polygon diagram is also called a Voronoi diagram or a Dirichlet diagram, which is composed of a set of continuous polygons composed of perpendicular bisectors of straight lines connecting two adjacent points. N points that are distinct on the plane are divided into planes according to the nearest neighbor principle; each point is associated with its nearest neighbor area.

[0070] In addition, the probability map can be used to calculate the total amount of delivery tasks at the distribution station.

[0071] Furthermore, when calculating the total amount of delivery tasks of the delivery station, the total amount of delivery tasks of the delivery station i can be expressed as:

[0072]

[0073] in,

[0074]

[0075] Among them, r represents the set of areas covered by the distribution station, that is, all points within the range of V(Pi); and r i Represents the hotspot locations of distribution obtained based on historical distribution information; m is the number of hotspot locations in the distribution range;

[0076] Define the set {Ta1, Ta2, …, Tan} as the total amount of delivery tasks for delivery station i, where

[0077] T ai =task(i).

[0078] Step S102, calculating the load of each distribution station according to the distribution capacity and the total amount of distribution tasks.

[0079] In an embodiment, the load of delivery station i may be defined as:

[0080]

[0081] Among them, C ai =F(L i ,S i ,T i ), L, S, and T represent the loading capacity, running speed, and endurance of the delivery vehicle, respectively.

[0082] Step S103, determine the load balance of each distribution station to obtain the distribution area of ​​the distribution station. The specific implementation process includes:

[0083] The load balance of each distribution station is determined to calculate the virtual position of the distribution station; and the distribution area of ​​the distribution station is obtained according to the virtual position of the distribution station.

[0084] Furthermore, when calculating the virtual position of the distribution station, the virtual position of the distribution station can be set as p i , obtained by the following formula:

[0085]

[0086] in:

[0087] At the same time, k i >0ki is the feedback control gain, is the vector representing the input direction, a ij represents the coupling degree between distribution areas i and j; R ai and R aj They represent the load of the i-th distribution station and the load of the j-th distribution station respectively.

[0088] It is worth noting that the load balancing of each distribution station refers to R a1 =R a2 =……=R ai , for example, R ai =R aj That is to say, according to the load balancing conditions of each distribution station, u i , and then obtain the virtual location p of the distribution station i , thereby calculating the corresponding delivery area.

[0089] According to the various embodiments above, it can be seen that the method of dynamically dividing the distribution area, according to the dynamic division scheme of the distribution area provided by this patent, can flexibly arrange delivery tasks for the delivery vehicle according to the environment, order quantity, delivery vehicle status, etc., thereby optimizing the distribution process of the entire large area, so that the task distribution of each distribution site is balanced, avoiding the difficulty in completing the delivery task or the waste of distribution resources due to uneven site tasks.

[0090] Figure 2 : is a schematic diagram of the main process of a method for dynamically dividing a delivery area according to a reference embodiment of the present invention. The method for dynamically dividing a delivery area may include:

[0091] Step S201, initially dividing the delivery area of ​​each delivery station.

[0092] In an embodiment, the initial division of the distribution area of ​​the distribution station can be achieved by partitioning through the Voronoi diagram (also called Thiessen polygon or Dirichlet diagram, which is composed of a set of continuous polygons composed of perpendicular bisectors of straight lines connecting two adjacent points. N points that are different on a plane are divided into planes according to the nearest neighbor principle; each point is associated with its nearest neighbor area.), that is, the following conditions are met:

[0093]

[0094] Among them, V(Pi) is a set about P, ​​and the condition that needs to be satisfied is that the distance between point P within the range of S and Pi is less than or equal to the distance between point P and Pj.

[0095] V(Pi) is the point set consisting of the locations closest to Pi distribution stations.

[0096] V(P)={V(p1), V(p2), LV(p n )}

[0097] It can represent the delivery areas of different delivery stations, and Pi is the location of the i-th delivery station.

[0098] Step S202, calculating the delivery capacity of the delivery station according to the delivery capacity of the delivery vehicle.

[0099] In the embodiment, the delivery vehicle referred to in the present invention refers to a device that can autonomously complete delivery tasks through an automatic driving system. Its core indicators include: loading capacity, running speed, endurance time, etc. The above factors constitute the delivery capacity of the delivery vehicle. The delivery capacity of the i-th delivery station can be expressed as:

[0100] C ai =F(L i ,S i ,T i )

[0101] Among them, L, S, and T represent loading capacity, running speed, and endurance respectively. Since the L, S, and T parameters of the distribution vehicle are closely related to the design of the distribution vehicle, they can be regarded as a relatively fixed constant {Ca1, Ca2, …, Can} in the distribution process, which represent the distribution capacity of the 1st to nth distribution stations respectively.

[0102] It is worth noting that more than one delivery vehicle may be arranged at the delivery station, and in this embodiment, one delivery vehicle is used for illustration.

[0103] Step S203, using the concept of probability map, calculate the total amount of delivery tasks of the delivery station.

[0104] In an embodiment, the delivery task involved in the present invention represents the delivery order quantity of a certain area. The popular delivery area (such as a residence, an office building, etc.) can be abstracted as a mass point, and the initial order quantity is obtained according to statistical information. The delivery order quantity of a certain point is preset to change in an inverse relationship with other locations. Using the concept of probability map, the total delivery task quantity of delivery station i (the integral of the order quantity at each point location) can be expressed as:

[0105]

[0106] in,

[0107]

[0108] Among them, r represents the set of areas covered by the distribution station, that is, all points within the range of V(Pi), and r iIt represents the hotspot location of delivery, which can be obtained based on historical delivery information; m is the number of hotspot locations in a certain delivery range.

[0109] Define the set {Ta1, Ta2, …, Tan} as the total amount of delivery tasks for delivery station i, where

[0110] T ai =task(i).

[0111] Step S204, calculating the load of the distribution station according to the distribution capacity and the total amount of distribution tasks.

[0112] According to the above description, the task load of the distribution station is not only related to the regional scope, but also to the vehicle delivery capacity of the distribution station, the number of hot spots in the scope and other factors. The load of distribution station i is defined as:

[0113]

[0114] Therefore, the goal of the distribution area division involved in the present invention is the consistency of task load. According to the above formula, the total amount of distribution tasks T ai It is related to the location of the distribution station. Therefore, according to the division method of the task area, the distribution area can be adjusted by adjusting the virtual distribution station location Pi. It is assumed that the value of Pi satisfies the first-order dynamic model, that is, in:

[0115]

[0116] Among them, k i >0, ki is the feedback control gain, is the vector representing the input direction,

[0117]

[0118] a ij It represents the coupling degree between distribution areas i and j, which can be derived based on the shared boundary:

[0119]

[0120] It should be noted that the actual distribution station location does not change, and the change in pi is only a virtual location defined to achieve the update of the distribution area. After the pi location changes, Tai also changes accordingly, thereby changing the task load and achieving the optimization of the distribution area.

[0121] That is to say, as long as the virtual distribution station position pi is fine-tuned within the initial distribution area, it will not have a significant impact on the real distribution station. In addition, the optimization of the distribution area is also an adjustment of the area boundary in actual application, which will not cause major changes. The purpose of the present invention is to optimize the distribution area without optimizing the real distribution station position.

[0122] Step S205, determining whether the loads of the distribution stations are balanced (ie, consistent), if so, executing the distribution task, otherwise updating the virtual position of the distribution station and returning to step 201.

[0123] In the embodiment, it is determined whether the load balance of each distribution station is consistent (ie, R a1 =R a2 =……=R ai ) process includes:

[0124] Define the following class of Lyapunov functions,

[0125]

[0126] According to the Lagrangian method, when the above Lyapunov function reaches a minimum value, the task allocation reaches consistency. Therefore,

[0127]

[0128] because The following will mainly introduce The calculation method of is, because,

[0129]

[0130] therefore

[0131]

[0132] According to T ai From the definition of

[0133]

[0134] Also because And since the threat probability distribution function threat(r) does not depend on the position of Pk, it can be seen that the first term on the right side of the above formula is always equal to 0, which can be expressed as:

[0135]

[0136] Therefore, we can get:

[0137]

[0138] According to nT (γ ij )=-n T (γ ji ), can be simplified to:

[0139]

[0140] Combined with the definition of Ui, we can see that the derivative of the Lyapunov-like function is

[0141]

[0142] Since V(P) is continuously differentiable and V(P) is less than or equal to 0, according to the LaSalle invariance theorem, the system state values ​​that make V(P) equal to 0 will converge to the maximum invariant set S of the system, that is, P∈S. In addition, when V(P) is equal to 0, we can get

[0143]

[0144] Since the graph related to the Laplacian matrix involved in the present invention is strongly connected, it can be known that

[0145] Ra1=Ra2=……=R ai , that is, the task load of each distribution site can achieve consistency.

[0146] In other words, the above process can prove that the virtual distribution station location obtained by the following formula and the distribution area determined thereby can achieve load consistency for the distribution tasks of each distribution station.

[0147]

[0148] Figure 3 is a device for dynamically dividing distribution areas according to an embodiment of the present invention, such as Figure 3 As shown, the device 300 for dynamically dividing the distribution area includes an initialization module 301 for initially dividing the distribution area of ​​the distribution station to calculate the distribution capacity and the total amount of distribution tasks of the distribution station. The load calculation module 302 calculates the load of each distribution station according to the distribution capacity and the total amount of distribution tasks. Then, the adjustment module 303 determines the load balance of each distribution station to obtain the distribution area of ​​the distribution station.

[0149] Preferably, the initialization module 301 performs initial division of the distribution area of ​​the distribution station through a Thiessen polygon diagram. The Thiessen polygon diagram is also called a Voronoi diagram or a Dirichlet diagram, which is composed of a set of continuous polygons composed of perpendicular bisectors of straight lines connecting two adjacent points. N points that are distinct on a plane are divided into planes according to the nearest neighbor principle; each point is associated with its nearest neighbor area.

[0150] In addition, the initialization module 301 can use the probability map to calculate the total amount of delivery tasks of the delivery station.

[0151] Furthermore, when the initialization module 301 calculates the total amount of delivery tasks of the delivery station, the total amount of delivery tasks of the delivery station i can be expressed as:

[0152]

[0153] in,

[0154]

[0155] Among them, r represents the set of areas covered by the distribution station, that is, all points within the range of V(Pi); and r i Represents the hotspot locations of distribution obtained based on historical distribution information; m is the number of hotspot locations in the distribution range;

[0156] Define the set {Ta1, Ta2, …, Tan} as the total amount of delivery tasks for delivery station i, where

[0157] T ai =task(i).

[0158] As another preferred embodiment, the load calculation module 302 may define the load of the distribution station i as:

[0159]

[0160] Among them, C ai =F(L i ,S i ,T i ), L, S, and T represent the loading capacity, running speed, and endurance of the delivery vehicle, respectively.

[0161] Furthermore, when determining the load balance of each distribution station to obtain the distribution area of ​​the distribution station, the adjustment module 303 can determine the load balance of each distribution station to calculate the virtual position of the distribution station; and obtain the distribution area of ​​the distribution station according to the virtual position of the distribution station.

[0162] Furthermore, when calculating the virtual position of the distribution station, the virtual position of the distribution station can be set as p i , obtained by the following formula:

[0163]

[0164] in:

[0165] At the same time, k i >0, ki is the feedback control gain, is the vector representing the input direction, a ij represents the coupling degree between distribution areas i and j; R ai and R aj They represent the load of the i-th distribution station and the load of the j-th distribution station respectively.

[0166] It is worth noting that the load balancing of each distribution station refers to R a1 =R a2 =……=R ai For example, R ai =R aj That is to say, according to the load balancing conditions of each distribution station, u i , and then obtain the virtual location p of the distribution station i , thereby calculating the corresponding delivery area.

[0167] It should be noted that the specific implementation content of the device for dynamically dividing the delivery area in the present invention has been described in detail in the method for dynamically dividing the delivery area described above, so the repeated content will not be described here.

[0168] Figure 4 An exemplary system architecture 400 to which the method for dynamically dividing delivery areas or the apparatus for dynamically dividing delivery areas according to an embodiment of the present invention can be applied is shown. Figure 4 An exemplary system architecture 400 is shown to which the method for dynamically dividing delivery areas or the apparatus for dynamically dividing delivery areas according to the embodiments of the present invention may be applied.

[0169] like Figure 4 As shown, system architecture 400 may include terminal devices 401, 402, 403, network 404 and server 405. Network 404 is used to provide a medium for communication links between terminal devices 401, 402, 403 and server 405. Network 404 may include various connection types, such as wired, wireless communication links or optical fiber cables, etc.

[0170] Users can use terminal devices 401, 402, 403 to interact with server 405 through network 404 to receive or send messages, etc. Various communication client applications can be installed on terminal devices 401, 402, 403, such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social platform software, etc. (only as examples).

[0171] The terminal devices 401 , 402 , and 403 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop computers, and desktop computers.

[0172] The server 405 may be a server that provides various services, such as a backend management server (only an example) that provides support for shopping websites browsed by users using the terminal devices 401, 402, and 403. The backend management server may analyze and process the received data such as product information query requests, and feed back the processing results (such as target push information, product information - only an example) to the terminal device.

[0173] It should be noted that the method for dynamically dividing the delivery areas provided in the embodiment of the present invention is generally executed by the server 405 , and accordingly, the device for dynamically dividing the delivery areas is generally set in the server 405 .

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

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

[0176] like Figure 5 As shown, the computer system 500 includes a central processing unit (CPU) 501, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 502 or a program loaded from a storage part 508 into a random access memory (RAM) 503. In the RAM 503, various programs and data required for the operation of the system 500 are also stored. The CPU 501, the ROM 502, and the RAM 503 are connected to each other via a bus 504. An input / output (I / O) interface 505 is also connected to the bus 504.

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

[0178] In particular, according to the embodiments disclosed in the present invention, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present invention include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication part 509, and / or installed from the removable medium 511. When the computer program is executed by the central processing unit (CPU) 501, the above-mentioned functions defined in the system of the present invention are executed.

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

[0180] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present invention. In this regard, each box in the flow chart or block diagram can represent a module, a program segment, or a part of a code, and the above-mentioned module, program segment, or a part of a code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flow chart, and the combination of the boxes in the block diagram or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0181] The modules involved in the embodiments of the present invention may be implemented by software or hardware. The modules described may also be set in a processor. For example, it may be described as follows: a processor includes an initialization module, a load calculation module, and an adjustment module. The names of these modules do not, in some cases, constitute limitations on the modules themselves.

[0182] As another aspect, the present invention also provides a computer-readable medium, which may be included in the device described in the above embodiment; or may exist independently without being assembled into the device. The above computer-readable medium carries one or more programs, and when the above one or more programs are executed by a device, the device includes: initially dividing the distribution area of ​​the distribution station to calculate the distribution capacity and total distribution task of the distribution station; calculating the load of each distribution station according to the distribution capacity and total distribution task; determining the load balance of each distribution station to obtain the distribution area of ​​the distribution station.

[0183] According to the technical solution of the embodiment of the present invention, dynamic allocation of distribution areas of distribution stations can be achieved.

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

Claims

1. A method for dynamically dividing the distribution area, It is characterized in that include: Initially divide the distribution area of ​​the distribution station to calculate the distribution capacity and total distribution task of the distribution station; Calculate the load of each distribution station based on the distribution capacity and total distribution tasks; Determine the load balance of each distribution station to calculate the virtual position of the distribution station; obtain the distribution area of ​​the distribution station based on the virtual position of the distribution station, the actual position of the distribution station does not change, dynamically change the total amount of distribution tasks according to the change of the virtual position, change the load according to the changed total amount of distribution tasks, and optimize the distribution area of ​​the distribution station according to the changed load, wherein optimizing the distribution area of ​​the distribution station is to adjust the boundary of the distribution area of ​​the distribution station.

2. The method according to claim 1, It is characterized in that The distribution area of ​​the distribution station is initially divided through the Thiessen polygon graph.

3. The method according to claim 1, It is characterized in that Using the probability map, calculate the total amount of delivery tasks for the distribution station.

4. The method according to claim 3, It is characterized in that Calculate the total amount of delivery tasks of the distribution station, including: The total amount of delivery tasks of delivery station i is expressed as: in, Among them, r represents the set of areas covered by the distribution station, that is, all points within the range of V(Pi); and r i Represents the hotspot locations of distribution obtained based on historical distribution information; m is the number of hotspot locations in the distribution range; Define the set {Ta1, Ta2, …, Tan} as the total amount of delivery tasks for delivery station i, where T ai =task(i)。 5. The method according to claim 4, It is characterized in that Calculate the load of each distribution station based on the distribution capacity and total distribution tasks, including: The load of distribution station i is defined as: Among them, C ai =F(L i , S i , T i ), L, S, and T represent the loading capacity, running speed, and endurance of the delivery vehicle, respectively.

6. The method according to claim 1, It is characterized in that Calculate the virtual location of the delivery station, including: Virtual location of the distribution station i , obtained by the following formula: in: At the same time, k i >0, ki is the feedback control gain, is the vector representing the input direction, a ij represents the coupling degree between distribution areas i and j; R ai and R aj They represent the load of the i-th distribution station and the load of the j-th distribution station respectively; Ni represents the set of areas adjacent to area i.

7. A device for dynamically dividing the distribution area, It is characterized in that include: The initialization module is used to initially divide the distribution area of ​​the distribution station to calculate the distribution capacity and total distribution task of the distribution station; The load calculation module is used to calculate the load of each distribution station based on the distribution capacity and the total distribution tasks; The adjustment module is used to determine the load balance of each distribution station to calculate the virtual position of the distribution station; obtain the distribution area of ​​the distribution station according to the virtual position of the distribution station, the actual position of the distribution station does not change, the total amount of distribution tasks is dynamically changed according to the change of the virtual position, the load is changed according to the changed total amount of distribution tasks, and the distribution area of ​​the distribution station is optimized according to the changed load, wherein optimizing the distribution area of ​​the distribution station is to adjust the boundary of the distribution area of ​​the distribution station.

8. The device according to claim 7, It is characterized in that The initialization module performs initial division of the distribution area of ​​the distribution station through a Thiessen polygon graph.

9. The device according to claim 7, It is characterized in that The initialization module calculates the total amount of delivery tasks of the delivery station using the probability map.

10. The device according to claim 9, It is characterized in that The initialization module calculates the total amount of delivery tasks of the delivery station, including: The total amount of delivery tasks of delivery station i is expressed as: in, Among them, r represents the set of areas covered by the distribution station, that is, all points within the range of V(Pi); and r i Represents the hotspot locations of distribution obtained based on historical distribution information; m is the number of hotspot locations in the distribution range; Define the set {Ta1, Ta2, …, Tan} as the total amount of delivery tasks for delivery station i, where T ai =task(i)。 11. The device according to claim 10, It is characterized in that The load calculation module calculates the load of each distribution station according to the distribution capacity and the total amount of distribution tasks, including: The load of distribution station i is defined as: Among them, C ai =F(L i , S i , T i ), L, S, and T represent the loading capacity, running speed, and endurance of the delivery vehicle, respectively.

12. The device according to claim 7, It is characterized in that The adjustment module calculates the virtual position of the distribution station, including: Virtual location of the distribution station i , obtained by the following formula: in: At the same time, k i >0, ki is the feedback control gain, is the vector representing the input direction, a ij represents the coupling degree between distribution areas i and j; R ai and R aj They represent the load of the i-th distribution station and the load of the j-th distribution station respectively; Ni represents the set of areas adjacent to area i.

13. An electronic device, It is characterized in that include: one or more processors; a storage device for storing one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1 to 6.

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