Store delivery route planning method, device, equipment and storage medium

By setting a central distribution point and generating radial circles and radial lines using closed curves, regionally related groupings are formed, solving the problem of low efficiency in store delivery route planning in existing technologies and achieving efficient logistics delivery route planning.

CN113919595BActive Publication Date: 2024-11-26HANGZHOU PINPIANYI NETWORK TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202111383752.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-11-22
Publication Date
2024-11-26
Estimated Expiration
2041-11-22

AI Technical Summary

Technical Problem

Existing technologies lack efficient methods for planning store delivery routes, especially for route planning between delivery stations.

Method used

By obtaining the store's address information, setting the central delivery point and closed curve, generating radial circles and radial lines, forming regional association groups, generating the main delivery area based on order information, and finally planning the actual delivery route.

Benefits of technology

It enables efficient store delivery route planning, reduces logistics and delivery costs, and increases procurement flexibility.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN113919595B_ABST
    Figure CN113919595B_ABST
Patent Text Reader

Abstract

The present application discloses a method, device, equipment and storage medium for store distribution path planning, wherein the method includes: obtaining address information of all stores in a specified store set; setting a central distribution point and a closed curve according to the address information of all stores in the specified store set; generating several radiating circles according to the central distribution point and the standard distribution distance; generating the number of several distribution points according to the central distribution point and the closed curve; generating several radiating lines according to the central distribution point and the number of distribution points; obtaining the geographical association grouping of stores according to the radiating circles and the radiating lines; forming an order association grouping according to the order information of the stores in the geographical association grouping; generating a main distribution area according to the terminal stores in the order association grouping; generating an actual distribution route according to the main distribution area. The present application is beneficial in that it provides a store distribution path planning method, device, equipment and storage medium that can efficiently realize logistics distribution.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of computer technology, and in particular to a store delivery route planning method, device, equipment and storage medium. Background Art

[0002] like Figure 1 As shown, in the related technology, orders from multiple stores are aggregated through an Internet platform, and then unified procurement and logistics pickup are carried out from suppliers, and then the carrier vehicles deliver to the corresponding stores according to the purchase orders, so as to reduce the warehousing costs of stores such as convenience stores and improve procurement flexibility.

[0003] There is currently no efficient method for store delivery route planning, especially for indirect delivery through delivery stations. Summary of the invention

[0004] The content of this application is used to introduce concepts in a brief form, which will be described in detail in the detailed implementation section below. The content of this application is not intended to identify the key features or essential features of the technical solution claimed for protection, nor is it intended to limit the scope of the technical solution claimed for protection.

[0005] Some embodiments of the present application propose a store delivery route planning method, device, electronic device and computer storage medium to solve the technical problems mentioned in the above background technology section.

[0006] As a first aspect of the present application, some embodiments of the present application provide a store delivery path planning method, including: obtaining address information of all stores in a specified store set; setting a central delivery point and a closed curve according to the address information of all stores in the specified store set; generating a number of radial circles according to the central delivery point and the standard delivery distance; generating the number of delivery points according to the central delivery point and the closed curve; generating a number of radial lines according to the central delivery point and the number of delivery points; obtaining the regional association grouping of the stores according to the radial circles and the radial lines; forming an order association group according to the order information of the stores in the regional association group; generating a main delivery area according to the terminal stores in the order association group; and generating an actual delivery route according to the main delivery area.

[0007] As a second aspect of the present application, some embodiments of the present application provide a store delivery path planning device, including: an acquisition module, used to acquire the address information of all stores in a specified store set; a setting module, used to set a central delivery point and a closed curve according to the address information of all stores in the specified store set; a first generation module, used to generate a number of radial circles according to the central delivery point and the standard delivery distance; a second generation module, used to generate the number of delivery points according to the central delivery point and the closed curve; a third generation module, used to generate a number of radial lines according to the central delivery point and the number of delivery points; an association module, used to acquire the regional association grouping of the store according to the radial circle and the radial line; a grouping module, used to form an order association group according to the order information of the store in the regional association group; a fourth generation module, used to generate a main delivery area according to the terminal store in the order association group; a route module, used to generate an actual delivery route according to the main delivery area.

[0008] As the third aspect of the present application, some embodiments of the present application provide an electronic device, comprising: one or more processors; a storage device on which one or more programs are stored, and when the one or more programs are executed by one or more processors, the one or more processors implement the method described in any implementation manner of the above-mentioned first aspect.

[0009] As a fourth aspect of the present application, some embodiments of the present application provide a computer storage medium on which a computer program is stored, wherein when the program is executed by a processor, the method described in any implementation manner of the above-mentioned first aspect is implemented.

[0010] The beneficial effect of the present application is to provide a store distribution path planning method, device, equipment and storage medium that can efficiently realize logistics distribution. BRIEF DESCRIPTION OF THE DRAWINGS

[0011] The drawings constituting a part of this application are used to provide a further understanding of this application, so that other features, purposes and advantages of this application become more obvious. The illustrative embodiment drawings and their descriptions of this application are used to explain this application and do not constitute an improper limitation on this application.

[0012] In addition, throughout the drawings, the same or similar reference numerals represent the same or similar elements. It should be understood that the drawings are schematic and that the components and elements are not necessarily drawn to scale.

[0013] In the attached picture:

[0014] Figure 1 is a flow chart of a store delivery route planning method according to an embodiment of the present application;

[0015] Figure 2is a structural diagram of a store delivery path planning device according to an embodiment of the present application;

[0016] Figure 3 is a schematic structural diagram of an electronic device according to an embodiment of the present application;

[0017] Figure 4 It is a schematic diagram of a closed curve, a radial circle, etc. in a store delivery path planning method according to an embodiment of the present application;

[0018] Figure 5 It is a schematic diagram of the main delivery area in the store delivery path planning method according to an embodiment of the present application.

[0019] Meaning of the reference numerals in the figures:

[0020] f, radial line; B, interval distribution point; A, central distribution point; sp, store coordinate point; GY, supplier location; B, distribution point; Q, starting point, Z, end point; L1, set distance L1;

[0021] 100, e-commerce system; 101, store terminal; 102, warehouse terminal; 103, driver terminal; 104, server;

[0022] 800, electronic device; 801, processing device; 802, ROM; 803, RAM; 804, bus; 805, I / O interface; 806, input device; 807, output device; 808, storage device; 809, communication device. DETAILED DESCRIPTION

[0023] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as being limited to the embodiments set forth herein. On the contrary, these embodiments are provided to provide a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not intended to limit the scope of protection of the present disclosure.

[0024] It should also be noted that, for ease of description, only the parts related to the invention are shown in the drawings. In the absence of conflict, the embodiments and features in the embodiments of the present disclosure can be combined with each other.

[0025] It should be noted that the concepts such as "first" and "second" mentioned in the present disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence of the functions performed by these devices, modules or units.

[0026] It should be noted that the modifications of "one" and "plurality" mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated in the context, it should be understood as "one or more".

[0027] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only used for illustrative purposes and are not used to limit the scope of these messages or information.

[0028] The present disclosure will be described in detail below with reference to the accompanying drawings and in conjunction with embodiments.

[0029] As shown in Reference 1, a store delivery path planning method of an embodiment of the present application includes the following steps: obtaining address information of all stores in a specified store set; setting a central delivery point and a closed curve according to the address information of all stores in the specified store set; generating a number of radial circles according to the central delivery point and the standard delivery distance; generating the number of delivery points according to the central delivery point and the closed curve; generating a number of radial lines according to the central delivery point and the number of delivery points; obtaining the regional association grouping of the stores according to the radial circles and the radial lines; forming an order association grouping according to the order information of the stores in the regional association grouping; generating a main delivery area according to the terminal stores in the order association grouping; and generating an actual delivery route according to the main delivery area.

[0030] For a more specific solution, refer to Figure 4 and Figure 3 As shown, the application method specifically includes:

[0031] S01 obtains address information of all stores in a specified store set.

[0032] The coordinate positions of the specified store set in a two-dimensional coordinate system are generated according to the address information of all stores in the specified store set, thereby generating a dot matrix of coordinate points of the specified store set in the two-dimensional coordinate system, wherein one coordinate point corresponds to one store.

[0033] Connect the outermost coordinate points in the dot matrix of the specified store set to form a closed curve in a two-dimensional coordinate system.

[0034] Select the first and second coordinate points on the closed curve that are the farthest apart.

[0035] The first coordinate point and the second coordinate point are connected to generate a first connecting line.

[0036] Select the third coordinate point and the fourth coordinate point which are the farthest apart from the first coordinate point and the second coordinate point on the closed curve.

[0037] The third coordinate point and the fourth coordinate point are connected to generate a second line.

[0038] The intersection of the first link and the second link is set as the central delivery point.

[0039] Set up a central distribution station at the central distribution point with the central distribution point as the center of the circle in the two-dimensional coordinate system. Generate several radial circles for the radius so that the largest radial circle contains all coordinate points of the dot matrix of all specified store sets, where N is a positive integer in an odd arithmetic progression and D is a preset standard delivery distance.

[0040] Calculate the number of distribution points G for a specified set of stores, where, , It represents the integer part of β, and S is the area of ​​the shape enclosed by the closed curve.

[0041] Generate F radial lines extending radially to the maximum radiation circle based on the central distribution point, where: , so that each radial line has the same arc interval, and Y is the distance between the central delivery point and the farthest coordinate point on the closed curve.

[0042] As a preferred solution, each radial line can be set at most A distribution point can be directly set up when the geographical conditions (for example, it is not a road, intersection or river) and business conditions (for example, it is a rentable space, rather than a place that cannot be arranged such as a school) are met. Alternatively, the distribution point can be used as the target point to find the nearest suitable location to set up a distribution station.

[0043] Generate the central distribution area with the central distribution point as the first center.

[0044] Several interval delivery points are generated on the radial line, and the distance between the interval delivery points is the standard delivery distance D.

[0045] An interval delivery station is set up at the interval delivery point, with the interval delivery point as the center and the standard delivery distance D as the diameter to generate several interval delivery areas.

[0046] The fan-shaped area between the two radiating circles and the two radiating lines is defined as a regional association area, and the stores whose coordinate points are located in the same regional association area are divided into a regional association group.

[0047] Query the order information of stores in a region-related group.

[0048] Compare the order information of two stores. If the number of goods from the same supplier in the two order information is greater than a preset value, the two stores are grouped into one order-related group until all stores in the region-related group are compared. Stores that fail to be grouped into order-related groups constitute order discrete groups. In order to avoid too many stores in order discrete groups, which may result in a low coverage rate of the subsequent main distribution area, as a preferred solution, the following method is used to group the stores first to form the designated store set of this application.

[0049] Specifically, the method for grouping stores includes the following steps:

[0050] S101: Acquire historical data of purchase orders of store terminals.

[0051] S102: Calculate the average order value of the store terminal based on the historical data of purchase orders.

[0052] S103: Generate array points corresponding to the store terminal in a three-dimensional coordinate system, wherein the first dimension coordinate values ​​and the second dimension coordinate values ​​of the array points of the store terminal in the three-dimensional coordinate system correspond to the two-dimensional coordinate values ​​of the store terminal in the plane map, and the third dimension coordinate values ​​of the array points of the store terminal in the three-dimensional coordinate system correspond to the average order value of the store terminal.

[0053] S104: Perform K-Means clustering operation on the lattice points in the three-dimensional coordinates.

[0054] S105: According to the result of K-Means clustering operation on the array points, the store terminals corresponding to the clustered array points are divided into a store group. In this way, a set of stores in a clustered store group is formed as a designated store set of this application, which can greatly improve the probability of successfully realizing order-related grouping.

[0055] More specifically, the historical orders referred to here are the purchase orders of the store. The average order value is used as the third dimension to establish a three-dimensional coordinate system. The other two dimensions are used to establish a two-dimensional coordinate system based on the geographical location. The coordinate values ​​of the store in the two-dimensional coordinate system are combined with the average order value of the third dimension to form this three-dimensional coordinate system. For example, assume that the coordinate axes of the three-dimensional coordinate system are X, Y, and Z, where the coordinates of the store on the X and Y axes are divided into the location coordinates of the store on the plane map, and the Z-axis coordinates are the average order value of the store. Among them, the average order value is the average value of the order values ​​of all purchase orders of the store during the observation period. Obtain the coordinate values ​​of the store in the above three-dimensional coordinate system. The location coordinates can be obtained through maps and positioning data, and the average order value is obtained by calculating historical data. As a preferred option, the observation period is quarterly or annual. Such a longer time period can reflect the characteristics of the store more stably.

[0056] A store group is essentially a collection of stores. From the perspective of data representation, it can be expressed as the store ID. Of course, it can also be expressed as the name of the store, but the text itself is not suitable for data processing. It is preferred to use the store's unique store ID code, or the store user's unique account ID. The functions of these two are the same.

[0057] Get the store farthest from the central distribution station in a discrete group of orders and define this store as the terminal store.

[0058] Obtain the geographically associated area where the terminal store is located and the interval delivery stations located in the geographically associated area.

[0059] The main delivery route is generated based on the connections between supplier locations, interval delivery stations and terminal stores.

[0060] A main delivery area is generated according to the main delivery path. The main delivery area is an area between translation paths on both sides of the main delivery path that are less than or equal to a set distance L1 from the main delivery path.

[0061] The delivery routes based on actual roads are generated by taking the stores in the main delivery area as the preferred delivery addresses and taking the stores outside the main delivery area as the secondary delivery addresses.

[0062] Specifically, within the main distribution area, the distribution point is used as the starting point and the terminal store is used as the end point, and all stores in the main distribution area are connected in a way with the shortest actual road distance to form a distribution route. At this time, a neural network model can also be used to generate the corresponding distribution route.

[0063] Then, connect to the stores in the secondary distribution area, prioritize the store outside the primary distribution area with the shortest actual road to the terminal store as the next waypoint, and then use the waypoint to find the next store with the closest actual road until all the stores in the secondary distribution area are exhausted.

[0064] Specifically, refer to Figure 5 As shown, for example, the actual route from starting point Q to Z may be particularly winding rather than a straight line.

[0065] The above solution takes into account both the store location and the distribution point settings, while also taking into account the actual order situation.

[0066] As shown in Reference 2, a store delivery path planning device of an embodiment of the present application includes: an acquisition module, which is used to acquire the address information of all stores in a specified store set; a setting module, which is used to set a central delivery point and a closed curve according to the address information of all stores in the specified store set; a first generation module, which is used to generate a number of radial circles according to the central delivery point and the standard delivery distance; a second generation module, which is used to generate the number of delivery points according to the central delivery point and the closed curve; a third generation module, which is used to generate a number of radial lines according to the central delivery point and the number of delivery points; an association module, which is used to acquire the regional association grouping of the store according to the radial circle and the radial line; a grouping module, which is used to form an order association group according to the order information of the store in the regional association group; a fourth generation module, which is used to generate a main delivery area according to the terminal store in the order association group; a route module, which is used to generate an actual delivery route according to the main delivery area.

[0067] Reference Figure 3 As shown, the electronic device 800 may include a processing device (e.g., a central processing unit, a graphics processing unit, etc.) 801, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 802 or a program loaded from a storage device 808 into a random access memory (RAM) 803. In the RAM 803, various programs and data required for the operation of the electronic device 800 are also stored. The processing device 801, the ROM 802, and the RAM 803 are connected to each other via a bus 804. An input / output (I / O) interface 805 is also connected to the bus 804.

[0068] Typically, the following devices may be connected to the I / O interface 805: an input device 806 including, for example, a touch screen, a touch pad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; an output device 807 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; a storage device 808 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 809. The communication device 809 may allow the electronic device 800 to communicate with other devices wirelessly or by wire to exchange data.

[0069] Although Figure 3 The electronic device 800 is shown with various devices, but it should be understood that it is not required to implement or possess all the devices shown. More or fewer devices may be implemented or possessed instead.

[0070] Figure 3 Each block shown in the figure may represent one device, or may represent multiple devices as required.

[0071] In particular, according to some embodiments of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. For example, some embodiments of the present disclosure include a computer program product, which includes a computer program carried on a computer storage medium, and the computer program contains program code for executing the method shown in the flowchart. In some such embodiments, the computer program can be downloaded and installed from the network through the communication device 809, or installed from the storage device 808, or installed from the ROM 802. When the computer program is executed by the processing device 801, the above-mentioned functions defined in the method of some embodiments of the present disclosure are executed.

[0072] It should be noted that the computer storage medium described above in some embodiments of the present disclosure 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.

[0073] In some embodiments of the present disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program that may be used by or in combination with an instruction execution system, device, or device. In some embodiments of the present disclosure, 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. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. A computer-readable signal medium may also be any computer storage medium other than a computer-readable storage medium, which may send, propagate, or transmit a program for use by or in combination with an instruction execution system, device, or device. The program code contained on the computer storage medium may be transmitted using any suitable medium, including but not limited to: wires, optical cables, RF (radio frequency), etc., or any suitable combination of the above.

[0074] In some embodiments, the client and the server may communicate using any currently known or future developed network protocol such as HTTP (HyperTextTransferProtocol), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), an internet (e.g., the Internet), and a peer-to-peer network (e.g., an adhoc peer-to-peer network), as well as any currently known or future developed network.

[0075] The computer storage medium may be included in the electronic device, or may exist independently without being installed in the electronic device. The computer storage medium carries one or more programs. When the one or more programs are executed by the electronic device, the electronic device: obtains the address information of all stores in a specified store set; sets a central distribution point and a closed curve according to the address information of all stores in the specified store set; generates several radial circles according to the central distribution point and the standard distribution distance; generates the number of distribution points according to the central distribution point and the closed curve; generates several radial lines according to the central distribution point and the number of distribution points; obtains the regional association group of the store according to the radial circle and the radial line; forms an order association group according to the order information of the store in the regional association group; generates a main distribution area according to the terminal store in the order association group; generates an actual distribution route according to the main distribution area.

[0076] Computer program code for performing the operations of some embodiments of the present disclosure may be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., through the Internet using an Internet service provider).

[0077] The flowcharts and block diagrams in the accompanying drawings illustrate the possible architecture, functions and operations of the systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each box in the flowchart or block diagram may represent a module, a program segment, or a part of a code, which contains one or more executable instructions for implementing a specified logical function.

[0078] It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures.

[0079] For example, two boxes shown in succession may actually be executed substantially in parallel, and they may sometimes be executed in the reverse order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flow chart, and the combination of boxes in the block diagram and / or flow chart, can be implemented by a dedicated hardware-based system that performs the specified function or operation, or can be implemented by a combination of dedicated hardware and computer instructions.

[0080] The units described in some embodiments of the present disclosure may be implemented by software or hardware. The units described may also be arranged in a processor, and the names of these units do not constitute limitations on the units themselves in some cases.

[0081] The functions described above herein may be performed at least in part by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), and the like.

[0082] The above descriptions are only some preferred embodiments of the present disclosure and an explanation of the technical principles used. Those skilled in the art should understand that the scope of the invention involved in the embodiments of the present disclosure is not limited to the technical solutions formed by a specific combination of the above technical features, but should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the above inventive concept. For example, the above features are replaced with (but not limited to) technical features with similar functions disclosed in the embodiments of the present disclosure.

Claims

1. A store delivery route planning method, include: Get the address information of all stores in a specified store set; Setting a central distribution point and a closed curve according to the address information of all stores in the designated store set; Generate a number of radial circles according to the central delivery point and the standard delivery distance; Generate the number of delivery points according to the central delivery point and the closed curve; Generate a number of radial lines according to the number of the central delivery point and the delivery points; Acquire the regional association group of the store according to the radial circle and the radial line; forming an order association group according to the order information of the stores in the region association group; generating a primary delivery area according to the terminal stores in the order-related group; Generate actual delivery routes based on primary delivery areas; The step of setting a central distribution point and a closed curve according to the address information of all stores in the designated store set includes: Generating coordinate positions of the designated store set in a two-dimensional coordinate system according to address information of all stores in the designated store set, thereby generating a dot matrix of coordinate points of the designated store set in the two-dimensional coordinate system, wherein one coordinate point corresponds to one store; Connecting the outermost coordinate points in the dot matrix of the designated store set to form a closed curve in the two-dimensional coordinate system; Wherein, the step of setting a central distribution point and a closed curve according to the address information of all stores in the designated store set further includes: Selecting the first coordinate point and the second coordinate point which are the farthest from each other on the closed curve; Connecting the first coordinate point and the second coordinate point to generate a first connecting line; Selecting a third coordinate point and a fourth coordinate point which are the farthest apart from the first coordinate point and the second coordinate point on the closed curve; Connecting the third coordinate point and the fourth coordinate point to generate a second connecting line; The intersection of the first connecting line and the second connecting line is set as a central delivery point; The step of generating a plurality of radial circles according to the central delivery point and the standard delivery distance includes: A central distribution station is set at the central distribution point with the central distribution point as the center of the circle in the two-dimensional coordinate system. Generate a number of radial circles for the radius so that the largest radial circle contains all coordinate points of the dot matrix of all the designated store sets, where N is a positive integer in an odd arithmetic progression, and D is a preset standard delivery distance; The number of distribution points generated according to the central distribution point and the closed curve includes: Calculate the number of delivery points G for the specified store set, where, , represents the integer part of β, and S is the area of ​​the shape enclosed by the closed curve Among them, a number of radial lines are generated according to the number of the central distribution point and the distribution points, including: Based on the central delivery point as the center, F radial lines extending radially to the maximum radiation circle are generated, wherein: , so that each of the radial lines has the same arc interval, and Y is the distance between the central delivery point and the farthest coordinate point on the closed curve; The step of obtaining the regional association grouping of the stores according to the radiation circles and the radiation lines includes: Generate a central distribution area with the central distribution point as the first center; Generate a number of spaced delivery points on the radial line, where the distance between the spaced delivery points is a standard delivery distance D; An interval delivery station is set at the interval delivery point, with the interval delivery point as the center and the standard delivery distance D as the diameter to generate a number of interval delivery areas; The fan-shaped area between the two radial circles and the two radial lines is defined as a regional association area, and the stores whose coordinate points are located in the same regional association area are divided into a regional association group; The forming of the order association group according to the order information of the stores in the region association group includes: Querying order information of the store in the region-related group; Comparing the order information of the two stores, if the quantity of goods from the same supplier in the two order information is greater than a preset value, the two stores are grouped into one order association group until all the stores in the region association group are compared, and the stores that cannot be grouped into the order association group constitute an order discrete group; The generating a primary delivery area according to the terminal stores in the order association group includes: Obtaining the store farthest from the central distribution station in the discrete order group, and defining the store as a terminal store; Acquire the geographically associated area where the terminal store is located and the interval delivery stations located in the geographically associated area; Generate a main delivery route based on the connections between the supplier locations, the interval delivery stations and the terminal stores; Generate a main delivery area according to the main delivery path, the main delivery area being an area between translation paths on both sides of the main delivery path that are less than or equal to a set distance L1 from the main delivery path; The generating of the actual delivery route according to the main delivery area includes: A delivery route based on actual roads is generated by using the stores in the primary delivery area as addresses for preferred delivery and the stores outside the primary delivery area as addresses for secondary delivery.

2. An electronic device, include: one or more processors; a storage device having one or more programs stored thereon; When the one or more programs are executed by the one or more processors, the processors implement the method as claimed in claim 1.

3. A computer storage medium having a computer program stored thereon, in, When the computer program is executed by a processor, the method according to claim 1 is implemented.