Logistics distribution path selection method, device, equipment and storage medium
By obtaining and screening drug delivery information and determining the optimal delivery route and outlets, the problems of inability to independently calculate costs and path complexity during logistics and distribution are solved, and distribution efficiency and benefits are improved.
Patent Information
- Application Number
- CN202111007660.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2021-08-30
- Publication Date
- 2024-12-06
- Estimated Expiration
- 2041-08-30
AI Technical Summary
During the logistics distribution process, the distribution costs cannot be independently calculated, resulting in cost savings that may lead to increased other costs, and the complexity of the distribution path is increased. It is difficult for traditional manual routes to meet business needs, resulting in high vacancy rates and high vacancy rates for vehicle scheduling, reducing benefits .
By obtaining drug delivery information, determining delivery and receiving outlets, collecting outlet information within the preset distance range, filtering candidate transfer outlets, generating distribution sections, performing route matching and screening, determining the optimal route, and calculating settlement information through business information , optimize delivery paths and costs.
It improves the efficiency of drug logistics distribution, reduces the concealment of distribution costs, optimizes vehicle scheduling, reduces vacancy and vacancy rates, and improves overall benefits.
Smart Images

Figure CN113705901B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of artificial intelligence, and in particular to a logistics distribution path selection method, device, equipment and storage medium. Background Art
[0002] With the rapid development of the Internet, e-commerce business has grown rapidly, providing a broad market space for the development of the express delivery industry. At present, the domestic express delivery industry is developing rapidly, and a competitive landscape with three major foreign express delivery giants, state-owned express delivery companies and private express delivery companies has been formed, which has greatly improved the convenience of users' online shopping.
[0003] However, the distribution costs incurred during the logistics distribution process are not independently calculated, so they are somewhat hidden. Moreover, it is a collection of a series of activities. If you want to save the cost of some items, it may lead to an increase in other costs. In addition, on the distribution route, as the number of distribution outlets increases, the distribution network becomes more and more complex, and the complexity of arranging distribution routes becomes higher and higher. The traditional manual arrangement of distribution routes is difficult to meet business needs. In reality, objective conditions such as the large number of dispersed customers and complex urban roads have led to the problem of very high vacancy and empty driving rates in the dispatch of distribution vehicles, which reduces efficiency. Summary of the invention
[0004] The main purpose of the present invention is to solve the technical problem of low efficiency in drug logistics distribution.
[0005] The first aspect of the present invention provides a method for selecting a logistics distribution path, comprising: obtaining drug distribution information, the drug distribution information including drug warehouse location information and delivery location information; determining the corresponding shipping outlet through the drug warehouse location information, and determining the corresponding delivery outlet through the delivery location information; collecting information from outlets within a preset distance range around the shipping outlet and the delivery outlet respectively to obtain multiple outlet location information; screening outlets through the multiple outlet location information to obtain at least one candidate transit outlet, and generating multiple distribution sections through the location information of the shipping outlet, the at least one candidate transit outlet and the delivery outlet; performing route matching on the multiple distribution sections to generate multiple transport routes and screening the multiple transport routes to obtain the optimal route among the multiple transport routes; performing information scanning on the optimal route among the multiple transport routes to determine the business information of the shipping outlet, at least one target transit outlet and the delivery outlet contained in the optimal route among the multiple transport routes, and determining the corresponding settlement information through the business information.
[0006] Optionally, in a first implementation method of the first aspect of the present invention, the information collection of the outlets within a preset distance range around the shipping outlet and the receiving outlet respectively to obtain multiple outlet location information includes: reading a preset outlet distance range description file, and determining a first preset distance range corresponding to the shipping outlet and a second preset distance range corresponding to the receiving outlet respectively through the outlet distance range description file; performing a first transit position screening through the first preset distance range and the location information of the shipping outlet to determine multiple first outlet location information; performing a second transit position screening through the second preset distance range and the location information of the receiving outlet to determine multiple second outlet location information, and using the multiple first outlet location information and the multiple second outlet location information as the multiple outlet location information.
[0007] Optionally, in a second implementation of the first aspect of the present invention, the screening of outlets by using the location information of the multiple outlets to obtain at least one candidate transit outlet, and generating multiple delivery sections by using the location information of the shipping outlet, the at least one candidate transit outlet, and the receiving outlet include:
[0008] The location information of the multiple outlets is counted to obtain a corresponding outlet information file; the outlet information file is matched with the drug information identifier in the drug delivery information to determine at least one candidate transit outlet that matches the drug information identifier; and a road segment is generated using the location coordinates of the at least one candidate transit outlet to obtain multiple delivery road segments.
[0009] Optionally, in a third implementation method of the first aspect of the present invention, the route matching of the multiple distribution sections, generating multiple transportation routes and screening the multiple transportation routes to obtain the optimal route among the multiple transportation routes includes: route planning of the multiple distribution sections to generate multiple transportation routes; calculating the transportation time of the multiple transportation routes to obtain a theoretical transportation time for each transportation route; calculating the estimated time of the multiple transportation routes based on the theoretical transportation time of each transportation route and a preset logistics path model to obtain the estimated time of each transportation route and screening out the route with the shortest estimated time as the optimal route to obtain the optimal route among the multiple transportation routes.
[0010] Optionally, in a fourth implementation of the first aspect of the present invention, after calculating the delivery time of the multiple delivery routes to obtain the theoretical delivery time of each delivery route, and before calculating the estimated time of the multiple delivery routes through the theoretical delivery time of each delivery route and the preset logistics path model, it also includes: mapping the multiple delivery routes to obtain a corresponding directed graph; assigning weights to multiple line segments in the directed graph through the theoretical delivery time of each delivery route and the preset selection factor weights to obtain a corresponding directed weighted graph, and marking each node distributed on the directed weighted graph to obtain a corresponding node set; defining the interaction logic and interaction positions between different paths through the multiple nodes in the node set, determining the corresponding multiple interaction logics and multiple interaction positions, and constructing a model through the multiple logics and the multiple interaction positions to obtain a corresponding logistics path model.
[0011] Optionally, in a fifth implementation of the first aspect of the present invention, the estimated time of the multiple delivery routes is calculated through the theoretical delivery time of each delivery route and the preset logistics path model to obtain the estimated time of each delivery route and screen out the route with the shortest estimated time as the optimal route, and obtaining the optimal route among the multiple delivery routes includes: determining a target path model between a drug delivery delivery point and a delivery point through a preset logistics path model, the target path model including weights of multiple selection factors between nodes with forks as nodes, the selection factors including the urgency of object delivery, road congestion, and path distance; calculating the comprehensive weights between multiple nodes in the target path model to obtain multiple comprehensive weights; replacing the weight of the theoretical delivery time of each of the delivery routes in the target path model with the multiple comprehensive weights and performing an estimated time calculation to obtain the estimated time of each delivery route; performing a minimum value analysis on the estimated time of each of the delivery routes to obtain the route with the shortest estimated time as the optimal route, and obtaining the optimal route among the multiple delivery routes.
[0012] Optionally, in a sixth implementation method of the first aspect of the present invention, the information scanning of the optimal route among the multiple transportation routes, determining the business information of the shipping outlets, at least one target transit outlet and the receiving outlets contained in the optimal route among the multiple transportation routes, and determining the corresponding settlement information through the business information includes: analyzing the optimal route among the multiple transportation routes to determine the business information of the corresponding shipping outlets, at least one target transit outlet and the receiving outlets; calculating the sum of transit prices and the sum of transportation prices of the optimal route through the business information, and adding the sum of transit prices and the transportation prices together to obtain the target price sum as the settlement information, to obtain the corresponding settlement information.
[0013] A second aspect of the present invention provides a logistics distribution path selection device, comprising:
[0014] An acquisition module, used to acquire drug delivery information, wherein the drug delivery information includes drug warehouse location information and delivery location information;
[0015] A determination module, used to determine the corresponding delivery outlet through the location information of the drug warehouse, and to determine the corresponding delivery outlet through the location information of the delivery location;
[0016] A collection module, used to collect information about outlets within a preset distance range around the shipping outlet and the receiving outlet, respectively, to obtain location information of multiple outlets;
[0017] A screening module, configured to screen outlets according to the location information of the plurality of outlets, obtain at least one candidate transit outlet, and generate a plurality of delivery sections according to the location information of the shipping outlet, the at least one candidate transit outlet and the receiving outlet;
[0018] A matching module, used for performing route matching on the multiple delivery sections, generating multiple delivery routes and screening the multiple delivery routes to obtain the optimal route among the multiple delivery routes;
[0019] The scanning module is used to scan the information of the optimal route among the multiple delivery routes, determine the business information of the shipping outlet, at least one target transit outlet and the receiving outlet contained in the optimal route among the multiple delivery routes, and determine the corresponding settlement information through the business information.
[0020] Optionally, in a first implementation method of the second aspect of the present invention, the acquisition module is specifically used to: read a preset outlet distance range description file, and determine a first preset distance range corresponding to the shipping outlet and a second preset distance range corresponding to the receiving outlet through the outlet distance range description file; perform a first transit position screening through the first preset distance range and the location information of the shipping outlet to determine multiple first outlet location information; perform a second transit position screening through the second preset distance range and the location information of the receiving outlet to determine multiple second outlet location information, and use the multiple first outlet location information and the multiple second outlet location information as the multiple outlet location information.
[0021] Optionally, in a second implementation method of the second aspect of the present invention, the screening module is specifically used to: count the location information of the multiple outlets to obtain corresponding outlet information files; match the outlet information file with the drug information identifier in the drug delivery information to determine at least one candidate transit outlet that matches the drug information identifier; generate road sections through the location coordinates of the at least one candidate transit outlet to obtain multiple delivery sections.
[0022] Optionally, in a third implementation of the second aspect of the present invention, the matching module also includes: a generation unit, used to perform route planning for the multiple distribution sections and generate multiple delivery routes; a calculation unit, used to calculate the delivery time for the multiple delivery routes and obtain the theoretical delivery time for each delivery route; a screening unit, used to calculate the estimated time of the multiple delivery routes through the theoretical delivery time of each delivery route and a preset logistics path model, obtain the estimated time for each delivery route and screen out the route with the shortest estimated time as the optimal route, thereby obtaining the optimal route among the multiple delivery routes.
[0023] Optionally, in a fourth implementation of the second aspect of the present invention, the matching module also includes: a mapping unit, used to map the multiple transport routes to obtain a corresponding directed graph; an assignment unit, used to assign weights to multiple line segments in the directed graph according to the theoretical transport time of each of the transport routes and the preset selection factor weights to obtain a corresponding directed weighted graph, and mark each node distributed on the directed weighted graph to obtain a corresponding node set; a construction unit, used to define the interaction logic and interaction positions between different paths through multiple nodes in the node set, determine the corresponding multiple interaction logics and multiple interaction positions, and construct a model through the multiple logics and the multiple interaction positions to obtain a corresponding logistics path model.
[0024] Optionally, in a fifth implementation of the second aspect of the present invention, the screening unit is specifically used to: determine a target path model between a drug delivery shipping point and a receiving point through a preset logistics path model, the target path model including weights of multiple selection factors between nodes with forks in the road as nodes, the selection factors including the urgency of object delivery, road congestion, and path distance; calculate the comprehensive weights between multiple nodes in the target path model to obtain multiple comprehensive weights; replace the weight of the theoretical delivery time of each of the delivery routes in the target path model with the multiple comprehensive weights and perform an estimated time calculation to obtain an estimated time for each delivery route; perform a minimum value analysis on the estimated time of each of the delivery routes to obtain a route with the shortest estimated time and use it as the optimal route to obtain the optimal route among the multiple delivery routes.
[0025] Optionally, in a sixth implementation method of the second aspect of the present invention, the scanning module is specifically used to: analyze the optimal route among the multiple delivery routes, determine the business information of the corresponding shipping outlet, at least one target transit outlet and the receiving outlet; calculate the sum of transit prices and the sum of transportation prices of the optimal route through the business information, and add the sum of transit prices and the transportation prices together to obtain the target price sum and use it as settlement information to obtain corresponding settlement information.
[0026] The third aspect of the present invention provides a logistics distribution path selection device, comprising: a memory and at least one processor, wherein the memory stores instructions; the at least one processor calls the instructions in the memory so that the logistics distribution path selection device executes the above-mentioned logistics distribution path selection method.
[0027] A fourth aspect of the present invention provides a computer-readable storage medium, in which instructions are stored, which, when executed on a computer, enable the computer to execute the above-mentioned logistics distribution path selection method.
[0028] In the technical solution provided by the present invention, drug distribution information is obtained, and the drug distribution information includes drug warehouse location information and delivery address location information; the corresponding shipping outlet is determined through the drug warehouse location information, and the corresponding delivery address is determined through the delivery address location information; information is collected from outlets within a preset distance range around the shipping outlet and the delivery address respectively to obtain multiple outlet location information; outlets are screened through the multiple outlet location information to obtain at least one candidate transit outlet, and multiple distribution sections are generated through the location information of the shipping outlet, the at least one candidate transit outlet and the delivery address; route matching is performed on the multiple distribution sections to generate multiple transportation routes and the multiple transportation routes are screened to obtain the optimal route among the multiple transportation routes; information scanning is performed on the optimal route among the multiple transportation routes to determine the business information of the shipping outlet, at least one target transit outlet and the delivery address included in the optimal route among the multiple transportation routes, and corresponding settlement information is determined through the business information. In an embodiment of the present invention, after the server determines the shipping outlet and the receiving outlet, it obtains the outlet information of each outlet within a preset distance range of the two, wherein the preset distance range can be a circular area with the line segment connecting the shipping outlet and the receiving outlet as the diameter, or an elliptical area with the shipping outlet and the receiving outlet as the focus, and the outlet information includes the quotation information and location information of the outlet. The quotation information of the outlet is used to facilitate the screening of low-cost outlets or relatively sound service outlets, and can also be used for later cost calculation, and the location information is used to facilitate the later determination of the delivery route. BRIEF DESCRIPTION OF THE DRAWINGS
[0029] Figure 1 A schematic diagram of an embodiment of a method for selecting a logistics distribution path in an embodiment of the present invention;
[0030] Figure 2 A schematic diagram of another embodiment of the method for selecting a logistics distribution path in an embodiment of the present invention;
[0031] Figure 3 A schematic diagram of an embodiment of a logistics distribution path selection device in an embodiment of the present invention;
[0032] Figure 4 It is a schematic diagram of another embodiment of the logistics distribution path selection device in the embodiment of the present invention;
[0033] Figure 5 It is a schematic diagram of an embodiment of a logistics distribution path selection device in an embodiment of the present invention. DETAILED DESCRIPTION
[0034] Embodiments of the present invention provide a method, device, equipment and storage medium for selecting a logistics distribution path. The terms "first", "second", "third", "fourth", etc. (if any) in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments described herein can be implemented in an order other than that illustrated or described herein. In addition, the terms "including" or "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.
[0035] The embodiments of the present application can acquire and process relevant data based on artificial intelligence technology. Among them, artificial intelligence (AI) is the theory, method, technology and application system that uses digital computers or machines controlled by digital computers to simulate, extend and expand human intelligence, perceive the environment, acquire knowledge and use knowledge to obtain the best results. Basic artificial intelligence technologies generally include technologies such as sensors, dedicated artificial intelligence chips, cloud computing, distributed storage, big data processing technology, operation / interaction systems, mechatronics, etc. Artificial intelligence software technology mainly includes computer vision technology, robotics technology, biometrics technology, speech processing technology, natural language processing technology, and machine learning / deep learning.
[0036] For ease of understanding, the specific process of the embodiment of the present invention is described below. Figure 1 , an embodiment of the method for selecting a logistics distribution path in an embodiment of the present invention includes:
[0037] 101. Obtain drug delivery information, including drug warehouse location information and delivery location information;
[0038] It is understandable that the execution subject of the present invention may be a logistics distribution path selection device or a server, which is not limited here. The embodiment of the present invention is described by taking the server as the execution subject as an example.
[0039] It should be noted that drug delivery information includes the location information of the shipping place, the location information of the receiving place, and the drug parameter information. The drug parameters include the volume, quality, type, etc. of the delivered drugs, so as to select the appropriate delivery method according to the drug type, volume, quality, etc., and facilitate the freight calculation of the goods. The location information of the shipping place and the receiving place are generally provided by the manufacturer, and the drug parameter information can be provided by the manufacturer or obtained by measurement in the acceptance link of the logistics point of delivery. Specifically, the server obtains the drug delivery information to facilitate the subsequent collection of network information.
[0040] 102. Determine the corresponding delivery outlet through the location information of the drug warehouse, and determine the corresponding delivery outlet through the location information of the delivery location;
[0041] Specifically, the server selects and records the shipping outlet according to the location information of the drug warehouse, and selects and records the receiving outlet according to the location information of the receiving place. The shipping outlet and the receiving outlet are preferably the outlets closest to the shipping place and the receiving place, respectively, so as to facilitate the delivery of goods.
[0042] 103. Collect information about outlets within a preset distance range around the delivery outlet and the receiving outlet respectively to obtain location information of multiple outlets;
[0043] Specifically, after the server determines the shipping outlet and the receiving outlet, it obtains the outlet information of each outlet within the preset distance range of the two outlets, wherein the preset distance range can be a circular area with the line segment connecting the shipping outlet and the receiving outlet as the diameter, or an elliptical area with the shipping outlet and the receiving outlet as the focus. The outlet information includes the quotation information and location information of the outlet. It should be emphasized that in order to further ensure the privacy and security of the above outlet location information, the above outlet location information can also be stored in a node of a blockchain.
[0044] 104. Screening outlets according to the location information of multiple outlets to obtain at least one candidate transit outlet, and generating multiple delivery sections according to the location information of the shipping outlet, at least one candidate transit outlet, and the receiving outlet;
[0045] Specifically, the server selects the transit outlets according to the outlet information, and generates the corresponding delivery route according to the location information of the shipping outlet, each transit outlet and the receiving outlet, i.e., the coordinate point. When selecting the transit outlets, outlets with too high prices or business types that do not meet the current drug delivery requirements can be screened out based on the information about the quotation and supported business types in the outlet information, and the selected outlets are the candidate transit outlets, and different delivery routes may include the same transit outlet.
[0046] 105. Perform route matching on multiple delivery sections, generate multiple delivery routes, and screen the multiple delivery routes to obtain the optimal route among the multiple delivery routes;
[0047] It should be noted that the server generally arranges multiple delivery routes according to the combination of each delivery section, so it is necessary to screen out the shortest route corresponding to the estimated time based on the estimated time of each delivery route. This shortest route is the optimal route. The screening of the shortest route requires the use of the Dijkstra algorithm, which is a typical single-source time shortest path algorithm. It can calculate the shortest time path from one node to all other nodes, which requires reference to the point spacing of each node. Therefore, using the estimated time as the reference for the point spacing, the Dijkstra algorithm can be used to calculate the shortest route and obtain the optimal route among the multiple delivery routes.
[0048] 106. Scan the information of the optimal route among the multiple delivery routes, determine the business information of the shipping outlet, at least one target transit outlet and the receiving outlet included in the optimal route among the multiple delivery routes, and determine the corresponding settlement information through the business information.
[0049] Specifically, the server obtains the quotation business information of the shipping outlets, each transit outlets, receiving outlets and each logistics company, and then calculates the sum of the transit prices of the optimal route based on the product parameters and the business information of each target transit outlet, shipping outlet and receiving outlet. At the same time, the server calculates the sum of the transportation prices of each transportation section corresponding to the optimal route based on the drug parameter information and business information, and calculates the sum of the transit prices and the sum of the transportation prices of all transportation routes to obtain the total delivery freight and the corresponding settlement information.
[0050] In an embodiment of the present invention, after the server determines the shipping outlet and the receiving outlet, the outlet information of each outlet within a preset distance range of the two is obtained, wherein the preset distance range can be a circular area with the line segment connecting the shipping outlet and the receiving outlet as the diameter, or an elliptical area with the shipping outlet and the receiving outlet as the focus, and the outlet information includes the quotation information and location information of the outlet, the quotation information of the outlet is used to facilitate the screening of outlets with low cost or relatively sound services, and can also be used for later cost accounting, and the location information is used to facilitate the later determination of the delivery route, the server obtains the quotation business information of the shipping outlet, each transit outlet, the receiving outlet and each logistics company, and then the server calculates the sum of the transit prices of the optimal route based on the product parameters and the business information of each target transit outlet, the shipping outlet, and the receiving outlet, and at the same time calculates the sum of the transportation prices of each transportation section corresponding to the optimal route based on the drug parameter information and the business information, and calculates the sum of the transit prices and the sum of the transportation prices of all transportation routes to obtain the total delivery freight, and obtains the corresponding settlement information, which can solve the problem that the delivery costs incurred during the delivery process cannot be independently accounted for.
[0051] See also Figure 2 Another embodiment of the method for selecting a logistics distribution path in the embodiment of the present invention includes:
[0052] 201. Obtaining drug distribution information, which includes drug warehouse location information and delivery location information;
[0053] Specifically, in this embodiment, the specific implementation of step 201 is similar to the above step 101 and will not be repeated here.
[0054] 202. Determine the corresponding delivery outlet through the drug warehouse location information, and determine the corresponding delivery outlet through the delivery location information;
[0055] Specifically, in this embodiment, the specific implementation of step 202 is similar to the above step 102, and will not be repeated here.
[0056] 203. Read a preset network point distance range description file, and determine a first preset distance range corresponding to a shipping network point and a second preset distance range corresponding to a receiving network point respectively through the network point distance range description file;
[0057] It should be noted that the preset network point distance range description file refers to a file used to describe the distance range of surrounding network points with transportation advantages and convenient facilities near a certain network point. Specifically, the server reads the preset network point distance range description file, and determines the first preset distance range corresponding to the shipping network point and the second preset distance range corresponding to the receiving network point through the network point distance range description file.
[0058] 204. Screening a first transit location by using a first preset distance range and location information of a delivery outlet to determine location information of a plurality of first outlets;
[0059] Specifically, the server screens the first transit location through the first preset distance range and the location information of the shipping outlet, and determines the location information of multiple first outlets.
[0060] 205. Screen the second transfer location by using the second preset distance range and the location information of the receiving outlet, determine multiple second outlet location information, and use the multiple first outlet location information and the multiple second outlet location information as multiple outlet location information;
[0061] Specifically, the server performs a second transfer location screening through the second preset distance range and the location information of the receiving outlets to determine multiple second outlet location information. For example, the server searches for those within a range of 3 kilometers, and the search results may be more than 3 kilometers, so they are filtered again. If there is no strict requirement for accuracy, it can be skipped. The subsequent server sorts the distance from near to far. Finally, the server uses the multiple first outlet location information and the multiple second outlet location information as the multiple outlet location information.
[0062] 206. Screening outlets according to the location information of multiple outlets to obtain at least one candidate transit outlet, and generating multiple delivery sections according to the location information of the shipping outlet, at least one candidate transit outlet, and the receiving outlet;
[0063] Specifically, the server collects statistics on the location information of the multiple outlets to obtain corresponding outlet information files; the server matches the outlet information files with the drug information identifier in the drug delivery information to determine at least one candidate transit outlet that matches the drug information identifier; the server generates road sections using the location coordinates of the at least one candidate transit outlet to obtain multiple delivery road sections.
[0064] Among them, it should be noted that the drug information identifier refers to the identification information related to the drug information to be delivered, and its main purpose is to determine whether there are any logistics outlets that do not meet the conditions. Since some drugs need to be refrigerated, it is necessary to exclude logistics outlets that cannot be refrigerated, and select logistics outlets with refrigerated conditions for transit transportation. The server counts the location information of the multiple outlets to obtain the corresponding outlet information file; the server matches the outlet information file with the drug information identifier in the drug delivery information, and determines at least one candidate transit outlet that matches the drug information identifier; the road section is generated through the location coordinates of the at least one candidate transit outlet to obtain multiple delivery sections.
[0065] 207. Perform route matching on multiple delivery sections, generate multiple delivery routes, and screen the multiple delivery routes to obtain the optimal route among the multiple delivery routes;
[0066] Specifically, the server performs route planning for the multiple distribution sections to generate multiple delivery routes; the server calculates the delivery time for the multiple delivery routes to obtain a theoretical delivery time for each delivery route; the server calculates the estimated time for the multiple delivery routes through the theoretical delivery time of each delivery route and a preset logistics path model to obtain the estimated time for each delivery route and selects the route with the shortest estimated time as the optimal route, thereby obtaining the optimal route among the multiple delivery routes.
[0067] It should be noted that the estimated time of each transport section is equal to the product of its theoretical transport time and the weight score. The faster the transport speed of the transport section in the fastest delivery mode, the shorter the estimated time. In the lowest cost mode, it is necessary to add the value of the estimated time according to the quotation of the transit point. In the embodiment of the present invention, each section is assigned a value by combining the theoretical transport time with the cost as a reference. The server calculates the estimated time of the multiple transport routes through the theoretical transport time of each transport route and the preset logistics path model, obtains the estimated time of each transport route, and selects the route with the shortest estimated time as the optimal route, thereby determining the optimal route among the multiple transport routes.
[0068] Optionally, after the server calculates the delivery time for the multiple delivery routes to obtain the theoretical delivery time for each delivery route, and before the server calculates the estimated time for the multiple delivery routes by using the theoretical delivery time for each delivery route and a preset logistics path model, it may also include: the server maps the multiple delivery routes to obtain a corresponding directed graph; the server assigns weights to multiple line segments in the directed graph by using the theoretical delivery time for each of the delivery routes and preset selection factor weights to obtain a corresponding directed weighted graph, and marks each node distributed on the directed weighted graph to obtain a corresponding node set; the server defines the interaction logic and interaction positions between different paths by using multiple nodes in the node set, determines the corresponding multiple interaction logics and multiple interaction positions, and constructs a model by using the multiple logics and the multiple interaction positions to obtain a corresponding logistics path model.
[0069] Among them, the server uniformly maps each delivery route into a directed graph, binds the logistics equipment to the corresponding delivery route, and uniformly maps various types of logistics equipment into an actuator set. Then the server uniformly maps each node distributed on the delivery route into a node set. Each node includes a material interaction point between different actuators on different paths, and defines the interaction logic and interaction position between different actuators on different paths through these multiple nodes, and then the server constructs the logistics path network model.
[0070] Optionally, the estimated time of the multiple delivery routes is calculated through the theoretical delivery time of each delivery route and the preset logistics path model to obtain the estimated time of each delivery route and screen out the route with the shortest estimated time as the optimal route. Obtaining the optimal route among the multiple delivery routes may include: the server determines the target path model between the drug distribution delivery point and the receiving point through the preset logistics path model, the target path model includes the weights of multiple selection factors between nodes with forks as nodes, the selection factors include the urgency of object delivery, road congestion, and path distance; the server calculates the comprehensive weights between the multiple nodes in the target path model to obtain multiple comprehensive weights; the server replaces the weight of the theoretical delivery time of each of the delivery routes in the target path model with the multiple comprehensive weights and performs an estimated time calculation to obtain the estimated time of each delivery route; the server performs a minimum value analysis on the estimated time of each of the delivery routes to obtain the route with the shortest estimated time as the optimal route, and obtains the optimal route among the multiple delivery routes.
[0071] It should be noted that, for example, the comprehensive weight between any two nodes A and B is calculated by the following formula, F=W1×F1+W2×F2+…+Wn×Fn, wherein F represents the comprehensive weight, n represents the total number of selection factors, F1, F2,… and Fn are the weights of the various factors between node A and node B respectively, W1, W2,… and Wn are the weights corresponding to F1, F2,… and Fn respectively, and the server replaces the weight of the theoretical delivery time of each of the delivery routes in the target path model with the multiple comprehensive weights and performs an estimated time calculation to obtain the estimated time of each delivery route; then the server performs a minimum value analysis on the estimated time of each of the delivery routes, obtains the route with the shortest estimated time and uses it as the optimal route, thereby obtaining the optimal route among the multiple delivery routes.
[0072] 208. Scan the information of the optimal route among the multiple transportation routes, determine the business information of the shipping outlet, at least one target transit outlet and the receiving outlet included in the optimal route among the multiple transportation routes, and determine the corresponding settlement information through the business information.
[0073] Specifically, the server analyzes the optimal route among the multiple delivery routes, and determines the business information of the corresponding shipping outlet, at least one target transit outlet and the receiving outlet; the server calculates the sum of transit prices and the sum of transportation prices of the optimal route through the business information, and adds the sum of transit prices and the transportation prices together to obtain the target price sum as settlement information, thereby obtaining corresponding settlement information.
[0074] Among them, the server allocates the cost of each logistics link according to the business information of the shipping outlets, each transit outlet, receiving outlets and each logistics company, that is, according to the quotation, loading and unloading fees and other additional costs, so as to realize the unified calculation of freight. If the settlement mode of the proportional mode is adopted, the server allocates the percentage according to the business information of the shipping outlets, each transit outlet, receiving outlets and each logistics company. The total freight is calculated according to the goods transportation information. After the total freight is withdrawn, the settlement information is generated according to the total freight and the corresponding percentages of the shipping outlets, each transit outlet, receiving outlets and each logistics company. In the embodiment of the present invention, the server analyzes the optimal route among the multiple transportation routes, determines the business information of the corresponding shipping outlets, at least one target transit outlet and receiving outlets; the server further calculates the sum of the transit price and the sum of the transportation price of the optimal route through the business information, and adds the sum of the transit price and the transportation price to obtain the target price sum as the settlement information, and obtains the corresponding settlement information.
[0075] In an embodiment of the present invention, the server replaces the weight of the theoretical delivery time of each of the delivery routes in the target path model with the multiple comprehensive weights and performs an estimated time calculation to obtain the estimated time of each delivery route; then the server performs a minimum value analysis on the estimated time of each of the delivery routes, obtains the route with the shortest estimated time and uses it as the optimal route, obtains the optimal route among the multiple delivery routes, and performs weight calculation based on various selection factors such as the urgency of object delivery, road congestion, and path distance, so as to more accurately judge the route situation, so that the route with the shortest estimated time is more in line with the actual situation, and the optimal route is determined more accurately and efficiently.
[0076] See also Figure 3 , an embodiment of the logistics distribution path selection device in the embodiment of the present invention includes:
[0077] The acquisition module 301 is used to acquire drug delivery information, wherein the drug delivery information includes drug warehouse location information and delivery location information;
[0078] A determination module 302 is used to determine a corresponding delivery outlet through the drug warehouse location information, and to determine a corresponding delivery outlet through the delivery location information;
[0079] The collection module 303 is used to collect information about outlets within a preset distance range around the shipping outlet and the receiving outlet respectively, and obtain location information of multiple outlets;
[0080] A screening module 304 is used to screen outlets according to the location information of the plurality of outlets to obtain at least one candidate transit outlet, and generate a plurality of delivery sections according to the location information of the shipping outlet, the at least one candidate transit outlet and the receiving outlet;
[0081] A matching module 305 is used to perform route matching on the multiple delivery sections, generate multiple delivery routes, and screen the multiple delivery routes to obtain the optimal route among the multiple delivery routes;
[0082] The scanning module 306 is used to scan the information of the optimal route among the multiple delivery routes, determine the business information of the shipping outlet, at least one target transit outlet and the receiving outlet included in the optimal route among the multiple delivery routes, and determine the corresponding settlement information through the business information.
[0083] See also Figure 4 Another embodiment of the logistics distribution path selection device in the embodiment of the present invention includes:
[0084] The acquisition module 301 is used to acquire drug delivery information, wherein the drug delivery information includes drug warehouse location information and delivery location information;
[0085] A determination module 302 is used to determine a corresponding delivery outlet through the drug warehouse location information, and to determine a corresponding delivery outlet through the delivery location information;
[0086] The collection module 303 is used to collect information about outlets within a preset distance range around the shipping outlet and the receiving outlet respectively, and obtain location information of multiple outlets;
[0087] A screening module 304 is used to screen outlets according to the location information of the plurality of outlets to obtain at least one candidate transit outlet, and generate a plurality of delivery sections according to the location information of the shipping outlet, the at least one candidate transit outlet and the receiving outlet;
[0088] A matching module 305 is used to perform route matching on the multiple delivery sections, generate multiple delivery routes, and screen the multiple delivery routes to obtain the optimal route among the multiple delivery routes;
[0089] The scanning module 306 is used to scan the information of the optimal route among the multiple delivery routes, determine the business information of the shipping outlet, at least one target transit outlet and the receiving outlet included in the optimal route among the multiple delivery routes, and determine the corresponding settlement information through the business information.
[0090] Optionally, the acquisition module 303 is specifically used to: read a preset outlet distance range description file, and determine a first preset distance range corresponding to the shipping outlet and a second preset distance range corresponding to the receiving outlet through the outlet distance range description file; perform a first transit position screening through the first preset distance range and the location information of the shipping outlet to determine multiple first outlet location information; perform a second transit position screening through the second preset distance range and the location information of the receiving outlet to determine multiple second outlet location information, and use the multiple first outlet location information and the multiple second outlet location information as the multiple outlet location information.
[0091] Optionally, the screening module 304 is specifically used to: count the location information of the multiple outlets to obtain corresponding outlet information files; match the outlet information files with the drug information identifier in the drug delivery information to determine at least one candidate transit outlet that matches the drug information identifier; generate road sections using the location coordinates of the at least one candidate transit outlet to obtain multiple delivery road sections.
[0092] Optionally, the matching module 305 further includes:
[0093] A generating unit 3051 is used to perform route planning on the plurality of delivery sections to generate a plurality of delivery routes;
[0094] A calculation unit 3052 is used to calculate the delivery time of the multiple delivery routes to obtain a theoretical delivery time of each delivery route;
[0095] The screening unit 3053 is used to calculate the estimated time of the multiple transport routes through the theoretical transport time of each transport route and the preset logistics path model, obtain the estimated time of each transport route and screen out the route with the shortest estimated time as the optimal route, thereby obtaining the optimal route among the multiple transport routes.
[0096] Optionally, the matching module 305 further includes:
[0097] A mapping unit 3054, configured to map the plurality of transport routes to obtain a corresponding directed graph;
[0098] The assignment unit 3055 is used to assign weights to the multiple line segments in the directed graph according to the theoretical delivery time of each of the delivery routes and the preset selection factor weights to obtain a corresponding directed weighted graph, and mark each node distributed on the directed weighted graph to obtain a corresponding node set;
[0099] The construction unit 3056 is used to define the interaction logic and interaction positions between different paths through the multiple nodes in the node set, determine the corresponding multiple interaction logics and multiple interaction positions, and construct a model through the multiple logics and the multiple interaction positions to obtain a corresponding logistics path model.
[0100] Optionally, the screening unit 3053 is specifically used to: determine a target path model between a drug delivery shipping point and a receiving point through a preset logistics path model, the target path model including weights of multiple selection factors between nodes with forks in the road as nodes, the selection factors including the urgency of object delivery, road congestion, and path distance; calculate the comprehensive weights between multiple nodes in the target path model to obtain multiple comprehensive weights; replace the weight of the theoretical delivery time of each of the delivery routes in the target path model with the multiple comprehensive weights and perform an estimated time calculation to obtain the estimated time of each delivery route; perform a minimum value analysis on the estimated time of each of the delivery routes to obtain a route with the shortest estimated time and use it as the optimal route to obtain the optimal route among the multiple delivery routes.
[0101] Optionally, the scanning module 306 is specifically used to: analyze the optimal route among the multiple delivery routes, determine the business information of the corresponding shipping outlet, at least one target transit outlet and the receiving outlet; calculate the sum of transit prices and the sum of transportation prices of the optimal route through the business information, and add the sum of transit prices and the transportation prices together to obtain the target price sum as settlement information to obtain corresponding settlement information.
[0102] Figure 5: is a structural schematic diagram of a logistics distribution path selection device provided by an embodiment of the present invention. The logistics distribution path selection device 500 may have relatively large differences due to different configurations or performances, and may include one or more processors (central processing units, CPU) 510 (for example, one or more processors) and a memory 520, and one or more storage media 530 (for example, one or more massive storage devices) storing application programs 533 or data 532. Among them, the memory 520 and the storage medium 530 can be short-term storage or permanent storage. The program stored in the storage medium 530 may include one or more modules (not shown in the figure), and each module may include a series of instruction operations in the logistics distribution path selection device 500. Furthermore, the processor 510 can be configured to communicate with the storage medium 530 to execute a series of instruction operations in the storage medium 530 on the logistics distribution path selection device 500.
[0103] The logistics distribution path selection device 500 may also include one or more power supplies 540, one or more wired or wireless network interfaces 550, one or more input and output interfaces 560, and / or one or more operating systems 531, such as Windows Serve, Mac OS, Uni, Linu, FreeBSD, etc. Those skilled in the art will appreciate that Figure 5 The structure of the logistics distribution path selection equipment shown does not constitute a limitation of the logistics distribution path selection equipment, and may include more or fewer components than shown in the figure, or a combination of certain components, or a different arrangement of components.
[0104] The present invention also provides a logistics distribution path selection device, which includes a memory and a processor, wherein the memory stores computer-readable instructions, and when the computer-readable instructions are executed by the processor, the processor executes the steps of the logistics distribution path selection method in the above-mentioned embodiments.
[0105] The present invention also provides a computer-readable storage medium, which may be a non-volatile computer-readable storage medium or a volatile computer-readable storage medium. Instructions are stored in the computer-readable storage medium. When the instructions are executed on a computer, the computer executes the steps of the logistics distribution path selection method.
[0106] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product. The computer software product is stored in a storage medium, including a number of instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), disk or optical disk and other media that can store program codes.
[0107] The blockchain referred to in this invention is a new application mode of computer technologies such as distributed data storage, point-to-point transmission, consensus mechanism, encryption algorithm, etc. Blockchain is essentially a decentralized database, a string of data blocks generated by cryptographic methods. Each data block contains a batch of network transaction information, which is used to verify the validity of its information (anti-counterfeiting) and generate the next block. Blockchain can include the underlying blockchain platform, platform product service layer, and application service layer.
Claims
1. A logistics distribution path selection method, characterized in that: The logistics distribution path selection method comprises: Obtaining drug delivery information, the drug delivery information including drug warehouse location information and delivery location information; Determine the corresponding delivery outlet through the location information of the drug warehouse, and determine the corresponding delivery outlet through the location information of the delivery location; Collecting information about outlets within a preset distance range around the shipping outlet and the receiving outlet respectively to obtain location information of multiple outlets; Screening outlets according to the location information of the plurality of outlets to obtain at least one candidate transit outlet, and generating a plurality of delivery sections according to the location information of the shipping outlet, the at least one candidate transit outlet and the receiving outlet; Performing route matching on the multiple delivery sections, generating multiple delivery routes, and screening the multiple delivery routes to obtain the optimal route among the multiple delivery routes; Scanning information on the optimal route among the multiple delivery routes, determining business information of a shipping outlet, at least one target transit outlet, and a receiving outlet included in the optimal route among the multiple delivery routes, and determining corresponding settlement information through the business information; The performing route matching on the multiple delivery sections, generating multiple delivery routes and screening the multiple delivery routes to obtain the optimal route among the multiple delivery routes comprises: Performing route planning on the multiple delivery sections to generate multiple delivery routes; Calculating the delivery time for the multiple delivery routes to obtain a theoretical delivery time for each delivery route; Calculating the estimated time of the multiple delivery routes by using the theoretical delivery time of each delivery route and the preset logistics path model, obtaining the estimated time of each delivery route, and selecting the route with the shortest estimated time as the optimal route, thereby obtaining the optimal route among the multiple delivery routes; After calculating the delivery time of the multiple delivery routes to obtain the theoretical delivery time of each delivery route, and before calculating the estimated time of the multiple delivery routes by using the theoretical delivery time of each delivery route and the preset logistics path model, the method further includes: Mapping the multiple transport routes to obtain a corresponding directed graph; Assigning weights to the multiple line segments in the directed graph according to the theoretical delivery time of each of the delivery routes and the preset selection factor weights to obtain a corresponding directed weighted graph, and marking each node distributed on the directed weighted graph to obtain a corresponding node set; Defining the interaction logic and interaction positions between different paths through the multiple nodes in the node set, determining the corresponding multiple interaction logics and multiple interaction positions, and constructing a model through the multiple logics and the multiple interaction positions to obtain a corresponding logistics path model; The estimated time of the multiple delivery routes is calculated by using the theoretical delivery time of each delivery route and the preset logistics path model to obtain the estimated time of each delivery route and select the route with the shortest estimated time as the optimal route. The optimal route among the multiple delivery routes includes: Determine the target path model between the drug delivery delivery outlet and the delivery delivery outlet through the preset logistics path model, the target path model includes the weights of multiple selection factors between nodes with forks as nodes, and the selection factors include the urgency of object delivery, road congestion, and path distance; Calculating comprehensive weights between multiple nodes in the target path model to obtain multiple comprehensive weights; Replacing the weight of the theoretical delivery time of each of the delivery routes in the target path model with the multiple comprehensive weights and performing estimated time calculation to obtain an estimated time for each delivery route; A minimum value analysis is performed on the estimated time of each of the transport routes to obtain a route with the shortest estimated time and use it as the optimal route, thereby obtaining the optimal route among the multiple transport routes.
2. The method for selecting a logistics distribution path according to claim 1, characterized in that: The collecting of information from outlets within a preset distance range around the delivery outlet and the delivery outlet respectively to obtain location information of multiple outlets includes: Reading a preset network point distance range description file, and determining a first preset distance range corresponding to the shipping network point and a second preset distance range corresponding to the receiving network point respectively through the network point distance range description file; Screening the first transit location by using the first preset distance range and the location information of the shipping outlet to determine the location information of multiple first outlets; The second transit location is screened by the second preset distance range and the location information of the receiving outlet, a plurality of second outlet location information is determined, and the plurality of first outlet location information and the plurality of second outlet location information are used as the plurality of outlet location information.
3. The method for selecting a logistics distribution path according to claim 1, characterized in that: The step of screening outlets by using the location information of the plurality of outlets to obtain at least one candidate transit outlet, and generating a plurality of delivery sections by using the location information of the delivery outlet, the at least one candidate transit outlet, and the delivery outlet includes: Performing statistics on the location information of the plurality of network points to obtain corresponding network point information files; Matching the network point information file with the drug information identifier in the drug delivery information to determine at least one candidate transit network point that matches the drug information identifier; The road segment is generated by using the location coordinates of the at least one candidate transfer network point to obtain a plurality of delivery road segments.
4. The method for selecting a logistics distribution path according to any one of claims 1 to 3, characterized in that: The step of scanning the optimal route among the multiple transport routes, determining the business information of the shipping outlet, multiple target transfer outlets and the receiving outlet included in the optimal route among the multiple transport routes, and determining the corresponding settlement information through the business information includes: Analyze the optimal route among the multiple delivery routes to determine the business information of the corresponding shipping outlet, multiple target transit outlets and receiving outlets; The sum of the transit prices and the sum of the transportation prices of the optimal route are calculated through the business information, and the sum of the transit prices and the transportation prices are added together to obtain the sum of the target prices and used as settlement information to obtain corresponding settlement information.
5. A logistics distribution path selection device, characterized in that: The logistics distribution path selection device comprises: An acquisition module, used to acquire drug delivery information, wherein the drug delivery information includes drug warehouse location information and delivery location information; A determination module, used to determine the corresponding delivery outlet through the location information of the drug warehouse, and to determine the corresponding delivery outlet through the location information of the delivery location; A collection module, used to collect information about outlets within a preset distance range around the shipping outlet and the receiving outlet, respectively, to obtain location information of multiple outlets; A screening module, configured to screen outlets according to the location information of the plurality of outlets, obtain at least one candidate transit outlet, and generate a plurality of delivery sections according to the location information of the shipping outlet, the at least one candidate transit outlet and the receiving outlet; A matching module, used for performing route matching on the multiple delivery sections, generating multiple delivery routes and screening the multiple delivery routes to obtain the optimal route among the multiple delivery routes; a scanning module, configured to scan information of the optimal route among the multiple transport routes, determine business information of a shipping outlet, at least one target transit outlet, and a receiving outlet included in the optimal route among the multiple transport routes, and determine corresponding settlement information through the business information; The matching module is further used to perform route planning for the multiple delivery sections to generate multiple delivery routes; calculate the delivery time for the multiple delivery routes to obtain the theoretical delivery time of each delivery route; calculate the estimated time of the multiple delivery routes by using the theoretical delivery time of each delivery route and a preset logistics path model to obtain the estimated time of each delivery route and select the route with the shortest estimated time as the optimal route to obtain the optimal route among the multiple delivery routes; The matching module is also used to map the multiple transport routes to obtain a corresponding directed graph; assign weights to multiple line segments in the directed graph according to the theoretical transport time of each transport route and the preset selection factor weight to obtain a corresponding directed weighted graph, and mark each node distributed on the directed weighted graph to obtain a corresponding node set; define the interaction logic and interaction position between different paths through multiple nodes in the node set, determine the corresponding multiple interaction logics and multiple interaction positions, and construct a model through the multiple logics and the multiple interaction positions to obtain a corresponding logistics path model; The matching module is also used to determine a target path model between a drug delivery delivery point and a delivery point through a preset logistics path model, wherein the target path model includes weights of multiple selection factors between nodes with forks as nodes, and the selection factors include the urgency of object delivery, road congestion, and path distance; calculate the comprehensive weights between multiple nodes in the target path model to obtain multiple comprehensive weights; replace the weight of the theoretical delivery time of each of the delivery routes in the target path model with the multiple comprehensive weights and perform an estimated time calculation to obtain an estimated time for each delivery route; perform a minimum value analysis on the estimated time of each of the delivery routes to obtain a route with the shortest estimated time and use it as the optimal route to obtain the optimal route among the multiple delivery routes.
6. A logistics distribution path selection device, characterized in that: The logistics distribution path selection device includes: a memory and at least one processor, wherein the memory stores instructions; The at least one processor calls the instructions in the memory so that the logistics distribution path selection device executes the logistics distribution path selection method as described in any one of claims 1-4.
7. A computer-readable storage medium having instructions stored thereon, characterized in that: When the instructions are executed by the processor, the logistics distribution path selection method as described in any one of claims 1-4 is implemented.
Citation Information
Patent Citations
Logistic network load query method and system
CN104156836A
Logistics distribution path optimization method, apparatus and device
CN107977739A
Logistics management method based on goods data analysis
CN108681860A
Path planning method and device, electronic equipment and storage medium thereof
CN111553626A
Logistics distribution route screening and freight accounting method and system, terminal and medium
CN112183852A
