A multi-cost accounting management method and system for intelligent logistics

Abstract

The present invention relates to the technical field of logistics cost accounting, and specifically discloses a multi-cost accounting management method and system for intelligent logistics, the method comprising: for each delivery path, segmenting the delivery path according to the delivery place, querying the cargo information of the goods to be delivered at the corresponding delivery place for each delivery path, and determining the load parameters of the delivery path; receiving auxiliary delivery requests containing auxiliary starting points, auxiliary end points and cargo information in real time, screening the auxiliary delivery requests according to the delivery paths containing the load parameters, and determining the negative cost; inserting the negative cost into a preset cost accounting rule, screening all delivery paths, and obtaining the best delivery path. On the basis of generating a delivery path, the present invention provides same-city delivery services based on the delivery path, takes the obtained income as the negative cost, introduces a correction process based on the negative cost on the original cost accounting rule, and further optimizes the cost reduction process.

Description

Technical Field

[0001] The present invention relates to the technical field of logistics cost accounting, and in particular to a multi-cost accounting management method and system for intelligent logistics. Background Art

[0002] Intelligent Logistics refers to a logistics model that uses modern information technology, intelligent technology and automated equipment to optimize management and control the logistics system to improve logistics efficiency, reduce costs and improve service quality. Intelligent logistics integrates emerging technologies such as the Internet of Things, artificial intelligence, big data, cloud computing, 5G, and robots to achieve automatic collection, transmission, analysis and decision-making of logistics information.

[0003] In the context of extremely perfect navigation services, existing intelligent logistics is essentially a path selection process based on evaluation algorithms. With the help of navigation services, a large number of paths are obtained, and then the paths are screened based on cost rules to select the best path. This method can select the path with the lowest cost from the existing paths and optimize the cost. However, there is still room for improvement in the optimization efforts. How to further improve the cost optimization capability is the technical problem that the technical solution of the present invention wants to solve. Summary of the invention

[0004] The purpose of the present invention is to provide a multi-cost accounting management method and system for intelligent logistics to solve the problems raised in the above background technology.

[0005] To achieve the above object, the present invention provides the following technical solutions:

[0006] A multi-cost accounting management method for intelligent logistics, the method comprising:

[0007] Query the destinations of all goods to be delivered, select the logistics center as the starting point in the map, and obtain a preset number of delivery paths passing through all the destinations; wherein the delivery path is a set of coordinates with time tags;

[0008] For each delivery route, the delivery route is segmented according to the delivery destination. For each delivery route segment, the cargo information of the cargo to be delivered at the corresponding delivery destination is queried to determine the load parameters of the delivery route segment; the load parameters include the time range and the load capacity;

[0009] Receive auxiliary delivery requests containing auxiliary starting points, auxiliary end points and cargo information in real time, screen the auxiliary delivery requests according to the delivery paths containing carrying parameters, and determine the negative cost;

[0010] Insert the negative cost into the preset cost accounting rules, screen all delivery paths, and obtain the best delivery path.

[0011] As a further solution of the present invention: for each delivery path, the delivery path is segmented according to the delivery destination, and for each delivery path segment, the cargo information of the cargo to be delivered at the corresponding delivery destination is queried, and the step of determining the load parameters of the delivery path segment includes:

[0012] For each delivery path, the delivery location is used as a node to segment the delivery path, and several delivery paths with the delivery location as the starting point and the end point are obtained;

[0013] Read each delivery route in sequence, and query the load information at the beginning of each delivery route and the unloading information at the end of each route; wherein the unloading information is the cargo information of the cargo to be delivered with the end of the route as the destination, and the cargo information at least includes the packaging volume and the total weight; the beginning of the route and the end of the route are both the receiving places;

[0014] The load information at the beginning of the next delivery path is calculated according to the load information at the beginning of the path and the unloading information at the end of the path; wherein the load information at the starting point of the initial delivery path is a preset value;

[0015] The load parameters of each delivery path segment are determined according to the load information at the beginning of the segment.

[0016] As a further solution of the present invention: the step of receiving in real time an auxiliary delivery request containing auxiliary starting point, auxiliary end point and cargo information, screening the auxiliary delivery request according to the delivery path containing the carrying parameter, and determining the negative cost comprises:

[0017] Open the information acquisition port, and receive auxiliary distribution requests containing the starting point, end point and cargo information in real time based on the information acquisition port;

[0018] Compare the cargo information with the load parameters of each delivery route to determine the matching route segment;

[0019] determining the best auxiliary path based on the matched path segments, and calculating the cost of the best auxiliary path;

[0020] Get quotes for assisted delivery requests and calculate the benefit based on the quotes and costs as a negative cost.

[0021] As a further solution of the present invention: the step of determining the best auxiliary path based on the matching path segments and calculating the cost of the best auxiliary path includes:

[0022] Read the auxiliary start point and the auxiliary end point to determine the path in the map, which is called the additional path;

[0023] Calculate the replacement distance between the additional path and each matching path segment;

[0024] Query the minimum replacement distance, determine the best auxiliary path, and simultaneously calculate the cost of the best auxiliary path.

[0025] As a further solution of the present invention: the steps of querying the minimum replacement distance, determining the best auxiliary path, and synchronously calculating the cost of the best auxiliary path include:

[0026] Query the shortest path between the auxiliary starting point and the matching path segment in the map, take the other end point in the shortest path as the bifurcation point, and take its distance as the first shortest distance;

[0027] Query the shortest path between the auxiliary end point and the matching path segment in the map, use the other end point in the shortest path as the merging point, and use its distance as the second shortest distance;

[0028] According to the first shortest distance and the second shortest distance, matching path segments are selected to construct a path of bifurcation point-extra path-merging point, which is called the best auxiliary path;

[0029] The path length difference between the optimal auxiliary path and the matching path segment is calculated, and the cost is determined according to the path length difference.

[0030] As a further solution of the present invention: the step of inserting the negative cost into the preset cost accounting rule, screening all the delivery paths, and obtaining the best delivery path includes:

[0031] Obtaining parameters of each delivery path under preset indicators and creating an evaluation matrix; each row of the evaluation matrix corresponds to a delivery path, and each column of the evaluation matrix corresponds to an indicator;

[0032] Calculate the total score of each delivery route based on the evaluation matrix;

[0033] Adjusting all total scores based on the negative cost, and selecting the best delivery path according to the adjusted total scores;

[0034] The calculation process of the total score is: ; ; ; In the formula, Indicates The total score corresponding to the delivery routes; For the The distance between the delivery path and the minimum value, For the The distance between the delivery paths and the maximum value; For the The maximum value of the index, For the The minimum value of the indicator, represents the parameters after forward transformation; Indicates The weight corresponding to each indicator; is the total number of indicators; Indicates the preset offset, Indicates negative cost.

[0035] The technical solution of the present invention also provides a multi-cost accounting management system for intelligent logistics, the system comprising:

[0036] A delivery path generation module is used to query the delivery locations of all goods to be delivered, select a logistics center as a starting point in the map, and obtain a preset number of delivery paths passing through all delivery locations; wherein the delivery path is a set of coordinates with time tags;

[0037] A load parameter determination module is used to segment each delivery path according to the delivery destination, query the cargo information of the cargo to be delivered at the corresponding delivery destination for each delivery path, and determine the load parameters of the delivery path; the load parameters include time range and load capacity;

[0038] The negative cost calculation module is used to receive auxiliary delivery requests containing auxiliary starting points, auxiliary end points and cargo information in real time, screen the auxiliary delivery requests according to the delivery paths containing carrying parameters, and determine the negative cost;

[0039] The distribution path screening module is used to insert negative costs into the preset cost accounting rules, screen all distribution paths, and obtain the best distribution path.

[0040] As a further solution of the present invention: the bearer parameter determination module includes:

[0041] A path segmentation unit is used to segment each delivery path with the delivery location as a node to obtain a number of delivery paths with the delivery location as the starting point and the end point;

[0042] The information query unit is used to read each delivery route in sequence, and query the load information at the beginning of each delivery route and the unloading information at the end of each delivery route; wherein the unloading information is the cargo information of the cargo to be delivered with the end of the segment as the destination, and the cargo information at least includes the packaging volume and the total weight; the beginning of the segment and the end of the segment are both the receiving places;

[0043] A load calculation unit, used to calculate the load information at the beginning of the next delivery path according to the load information at the beginning of the segment and the unloading information at the end of the segment; wherein the load information at the starting point of the initial delivery path is a preset value;

[0044] The parameter generating unit is used to determine the load parameters of each delivery path according to the load information at the beginning of the delivery path.

[0045] As a further solution of the present invention: the negative cost calculation module includes:

[0046] A request receiving unit, used for opening an information acquisition port, and receiving an auxiliary distribution request containing a starting point, a destination and cargo information in real time based on the information acquisition port;

[0047] A comparison unit, used to compare the cargo information with the load parameters of each delivery route segment to determine the matching route segment;

[0048] an optimal path determination unit, configured to determine an optimal auxiliary path based on the matching path segments and calculate a cost of the optimal auxiliary path;

[0049] The computation execution unit is used to obtain the quotation of the auxiliary delivery request and calculate the benefit based on the quotation and the cost as the negative cost.

[0050] As a further solution of the present invention: the optimal path determination unit includes:

[0051] A reading subunit is used to read the auxiliary starting point and the auxiliary end point to determine a path in the map, which is called an additional path;

[0052] A merging subunit, which is used to calculate the replacement distance between the additional path and each matching path segment;

[0053] The calculation subunit is used to query the minimum replacement distance, determine the best auxiliary path, and simultaneously calculate the cost of the best auxiliary path.

[0054] Compared with the prior art, the beneficial effects of the present invention are: on the basis of generating a distribution path, the present invention provides same-city distribution services based on the distribution path, takes the obtained revenue as a negative cost, introduces a correction process based on negative costs on the original cost accounting rules, and further optimizes the cost reduction process. BRIEF DESCRIPTION OF THE DRAWINGS

[0055] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings in the following description are only some embodiments of the present invention.

[0056] Figure 1 The flowchart of the multi-cost accounting management method for intelligent logistics.

[0057] Figure 2 This is the first sub-process flowchart of the multi-cost accounting management method for intelligent logistics.

[0058] Figure 3 This is the second sub-process flowchart of the multi-cost accounting management method for intelligent logistics.

[0059] Figure 4 This is the third sub-process flowchart of the multi-cost accounting management method for intelligent logistics.

[0060] Figure 5 This is a structural block diagram of the multi-cost accounting management system for intelligent logistics. DETAILED DESCRIPTION

[0061] In order to make the technical problems, technical solutions and beneficial effects to be solved by the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not used to limit the present invention.

[0062] Figure 1 The flowchart of the multi-cost accounting management method of intelligent logistics is shown in the following figure. In an embodiment of the present invention, a multi-cost accounting management method of intelligent logistics includes:

[0063] Step S100: querying the destinations of all goods to be delivered, selecting a logistics center as a starting point in the map, and obtaining a preset number of delivery paths passing through all destinations; wherein the delivery path is a set of coordinates with a time tag;

[0064] The application scenario of this application is the same-city distribution scenario, where the goods are loaded by the shipping center and distributed to various regions. During the loading process, the goods are combined and loaded according to the receiving locations of each item to be delivered, so that one vehicle can deliver goods to one area as much as possible. Therefore, the receiving location of the goods to be delivered is known data and easy to obtain. After obtaining the receiving location, the logistics center (that is, the shipping center) is queried on the map. Taking the logistics center as the starting point and each receiving location as a passing point, a delivery path passing through all the receiving locations can be created. The delivery path is essentially a collection of coordinates containing time tags, which are a collection of coordinates indicating when and where.

[0065] It should be noted that the delivery tasks faced by this application are all delivery tasks that do not have time requirements (not time-limited tasks such as one-day delivery).

[0066] Step S200: for each delivery path, the delivery path is segmented according to the destination, and for each delivery path segment, the cargo information of the cargo to be delivered at the corresponding destination is queried to determine the load parameters of the delivery path segment; the load parameters include a time range and a load capacity;

[0067] There are many delivery routes generated based on maps, some of which are good and some are bad. In navigation services, the ones with the shortest distance and time are generally selected as the displayed navigation. They appear to be only one or two, but in fact they are the result of screening a large number of delivery routes. For this application, the screening process needs to be updated, so the data to be processed are multiple generated delivery routes.

[0068] For each delivery path, its starting point is the logistics center. Since the delivery path passes through all the delivery locations, the delivery path can be divided into multiple path segments based on the delivery locations. For each path segment, the delivery location at the starting point of the path segment is the unloading location. The amount of unloading determines the amount of carrying capacity. Combined with the time label of this delivery path segment, the carrying parameter can be obtained. The carrying parameter represents how much goods can be carried within a certain time range.

[0069] Specifically, the carrying capacity of the first segment in the delivery path is zero because it is fully loaded at this time. Then, each time a delivery location is passed, the carrying capacity will increase by a certain amount. The increased amount is the unloading amount of the delivery location passed, and so on. The carrying capacity of each segment can be obtained.

[0070] Step S300: receiving in real time an auxiliary delivery request containing an auxiliary starting point, an auxiliary end point and cargo information, screening the auxiliary delivery request according to a delivery path containing a carrying parameter, and determining a negative cost;

[0071] The actual meaning of the auxiliary delivery request is a request for goods delivery that needs to be delivered within the city. This type of delivery is generally same-day delivery, which is similar to the existing same-city delivery. However, the difference is that same-city delivery is a takeout service and the orders are accepted by the order taker. This application is to accept orders during the logistics process, which can be understood as a "tailwind order". Although this may require more distance, a certain amount of compensation can be obtained, and there is a high probability of profit, which is called negative cost.

[0072] It is worth mentioning that the assisted delivery requests received are also unlimited-time delivery requests. If there are time requirements, there are other special services, such as one-on-one services such as errands.

[0073] Step S400: inserting negative cost into the preset cost accounting rule, screening all delivery paths, and obtaining the best delivery path;

[0074] By screening all delivery paths, the best delivery path can be obtained for delivering goods. This application introduces the parameter of negative cost on the existing cost accounting rules, which can obtain a lower-cost delivery path and optimize the delivery process. When there are many delivery tasks, this optimization can bring about a great cost reduction effect.

[0075] Regarding cost accounting rules, the most common parameters include transportation costs and labor costs. Transportation costs are generally related to oil prices. A more suitable algorithm is to calculate the cost based on the product of fuel consumption and distance. Fuel consumption can be roughly estimated based on urban road conditions. It is only necessary to test the fuel consumption under different road conditions in advance. In actual applications, query the urban road conditions corresponding to the distribution path at each location to determine the fuel consumption of each segment in the distribution path, and then accumulate (similar to integration) to get the transportation cost; labor costs are mainly the time costs of labor. If overtime occurs, additional compensation needs to be provided, which is also a cost.

[0076] Figure 2 The first sub-flow chart of the multi-cost accounting management method of intelligent logistics, wherein for each delivery path, the delivery path is segmented according to the delivery destination, and for each delivery path, the cargo information of the cargo to be delivered at the corresponding delivery destination is queried, and the steps of determining the load parameters of the delivery path segment include:

[0077] Step S201: for each delivery path, the delivery location is used as a node, and the delivery path is segmented to obtain a plurality of delivery paths with the delivery location as the starting point and the end point;

[0078] Step S202: read each delivery route in sequence, and query the load information at the beginning of each delivery route and the unloading information at the end of each route; wherein the unloading information is the cargo information of the cargo to be delivered with the end of the route as the destination, and the cargo information at least includes the packaging volume and the total weight; the beginning of the route and the end of the route are both the receiving places;

[0079] Step S203: Calculate the load information at the beginning of the next delivery path according to the load information at the beginning of the path and the unloading information at the end of the path; wherein the load information at the starting point of the initial delivery path is a preset value;

[0080] Step S204: Determine the load parameters of each delivery path segment according to the load information at the beginning of the segment.

[0081] In an example of the technical solution of the present invention, the process of determining the load parameters is specifically limited. Each delivery path actually passes through multiple delivery locations. With the delivery locations as nodes, the distribution path can be divided into multiple sections. The starting point and end point of each section are both delivery locations (the starting point of the first section is the logistics center); each section of the distribution path is analyzed in sequence. For the first section, the loading quantity at the beginning is obtained, and then the quantity of goods with the first delivery location as the destination is obtained. The loading quantity is subtracted from the quantity of goods to obtain the load capacity of the next section, which can be understood as the loading quantity of the second section; and so on, the loading quantity of each section can be obtained; steps S202 to S204 are another expression of the above process, in which the loading quantity is limited to the packaging volume and the total weight; the load information at the starting point of the initial section of the distribution path is the loading quantity of the delivery vehicle at the logistics center.

[0082] Figure 3 The second sub-flow diagram of the multi-cost accounting management method for intelligent logistics, wherein the steps of receiving in real time an auxiliary distribution request containing auxiliary starting point, auxiliary end point and cargo information, screening the auxiliary distribution request according to the distribution path containing the carrying parameter, and determining the negative cost include:

[0083] Step S301: Opening an information acquisition port, and receiving an auxiliary delivery request containing a starting point, a destination, and cargo information in real time based on the information acquisition port;

[0084] Step S302: Compare the cargo information with the load parameters of each delivery route segment to determine the matching route segment;

[0085] Step S303: determining the best auxiliary path based on the matching path segments, and calculating the cost of the best auxiliary path;

[0086] Step S304: Obtain a quotation for the auxiliary delivery request, and calculate the revenue based on the quotation and the cost as a negative cost.

[0087] The request obtained by the above-mentioned information acquisition port is an additional request, another request independent of the logistics process. In actual scenarios, this request can be compared to the "same-city delivery" service, that is, within the same city, the goods need to be sent from one place to another. This application is equivalent to receiving these requests on the basis of normal logistics distribution work, and obtaining a certain amount of remuneration on the premise of being on the way, which is called negative cost.

[0088] The auxiliary delivery request obtained includes the starting point, the end point and the cargo information. The cargo information naturally also includes the packaging volume and the total weight. By comparing the cargo information with the carrying parameters of each delivery path segment, the path segment with surplus capacity to carry the auxiliary delivery request can be determined, which is called the matching path segment. Under normal circumstances, a batch of goods will be dropped off every time a delivery address is passed, and the carrying capacity is increased, that is, when a matching path segment appears, the subsequent path segments are basically matching path segments. The actual meaning of the matching path segment is that when the delivery vehicle is delivering, there is surplus capacity at the matching path segment to respond to same-city delivery requests.

[0089] Based on the matching path segments and the start and end points of the auxiliary delivery request, a path can be determined, called the best auxiliary path. By calculating how much more detour the best auxiliary path takes (most likely a detour), the cost can be calculated. Combined with the quotation of the auxiliary delivery request, the value obtained by subtracting the cost from the quotation is actually the profit, which is called negative cost.

[0090] Furthermore, the step of determining the best auxiliary path based on the matching path segments and calculating the cost of the best auxiliary path includes:

[0091] Read the auxiliary start point and the auxiliary end point to determine the path in the map, which is called the additional path;

[0092] Calculate the replacement distance between the additional path and each matching path segment;

[0093] Query the minimum replacement distance, determine the best auxiliary path, and simultaneously calculate the cost of the best auxiliary path.

[0094] The above content provides a solution for determining the best auxiliary path. The auxiliary starting point and auxiliary end point are read to determine the path in the map, which is called the additional path. Then, each matching path segment is compared with the additional path to calculate how much additional distance will be generated after the matching path segment is replaced by the additional path, which is called the replacement distance. The minimum distance is selected from the replacement distances corresponding to all matching path segments to determine the best auxiliary path and calculate the cost simultaneously.

[0095] The steps of querying the minimum replacement distance, determining the best auxiliary path, and simultaneously calculating the cost of the best auxiliary path include:

[0096] Query the shortest path between the auxiliary starting point and the matching path segment in the map, take the other end point in the shortest path as the bifurcation point, and take its distance as the first shortest distance;

[0097] Query the shortest path between the auxiliary end point and the matching path segment in the map, use the other end point in the shortest path as the merging point, and use its distance as the second shortest distance;

[0098] According to the first shortest distance and the second shortest distance, matching path segments are selected to construct a path of bifurcation point-extra path-merging point, which is called the best auxiliary path;

[0099] The path length difference between the optimal auxiliary path and the matching path segment is calculated, and the cost is determined according to the path length difference.

[0100] The above content limits the process of replacing the matching path segment with the additional path. In layman's terms, the matching path segment is the movement path of the delivery vehicle itself. Now there is an additional path. It is necessary to select a position on the movement path, start moving from this position to the starting point of the additional path, and then merge into the original movement path at the end point of the additional path. In this process, there is a shortest path from selecting a position on the movement path to moving to the starting point of the additional path. There is also a shortest path in the process of merging into the original movement path at the end point of the additional path. By counting these two shortest paths and the additional path, the path of bifurcation point-extra path-merge point is obtained, which is called the optimal auxiliary path.

[0101] The difference in path length between the best auxiliary path and the original matching path segment is calculated, which is actually the distance. The cost can be calculated based on the distance. In the prior art, the cost is calculated in the same way, that is, how much cost is consumed per 100 kilometers.

[0102] It is worth mentioning that since the branching points and merging points corresponding to the additional paths are in the same path segment, they will not affect the two delivery locations before and after the path segment.

[0103] Figure 4 The third sub-process flowchart of the multi-cost accounting management method for intelligent logistics is shown in FIG. 1 , wherein the steps of inserting negative costs into preset cost accounting rules, screening all distribution paths, and obtaining the best distribution path include:

[0104] Step S401: Obtain parameters of each delivery path under preset indicators and create an evaluation matrix; each row of the evaluation matrix corresponds to a delivery path, and each column of the evaluation matrix corresponds to an indicator;

[0105] Step S402: Calculate the total score of each delivery route based on the evaluation matrix;

[0106] Step S403: adjusting all total scores based on the negative cost, and selecting the best delivery path according to the adjusted total scores.

[0107] The above content describes the screening process of the delivery path, obtains the parameters of each delivery path under the preset indicators, and creates an evaluation matrix. Each row in the matrix represents the parameters of a delivery path under the preset indicators, and each column represents the parameters of all delivery paths corresponding to the same indicator; the total score of each delivery path is calculated based on the evaluation matrix, and the delivery path can be screened according to the total score.

[0108] In the technical solution of the present invention, since negative costs are introduced, the total score can be adjusted by negative costs. Negative costs are actually a positive indicator. The larger the negative costs are, the larger the scaling factor of the total score is.

[0109] The calculation process of the total score is: ; ; ; In the formula, Indicates The total score corresponding to the delivery routes; For the The distance between the delivery path and the minimum value, For the The distance between the delivery paths and the maximum value; For the The maximum value of the index, For the The minimum value of the indicator, represents the parameters after forward transformation; Indicates The weight corresponding to each indicator; is the total number of indicators; is the correction factor, Indicates the preset offset, Indicates negative cost.

[0110] The above content actually introduces a correction term based on the matrix evaluation process. This correction term directly acts on the original evaluation results, and its weight itself is higher than other indicators. In the correction term, In fact, it is an independent variable, and its value is ,like No more than , the preset total score (lower) is used directly. In this range, The larger it is, the larger the correction item is, the higher the total score after correction is, and the easier it is to be selected.

[0111] It is worth mentioning that the various indicators in the cost accounting rules can be conventional indicators, including warehousing, transportation, labor, fuel costs, electricity costs, and maintenance losses. The meaning of positive conversion is to convert all indicators into positive indicators, so that the lower the cost of the distribution path, the higher the total score.

[0112] In addition, regarding the above-mentioned negative cost, it is the sum of all negative costs on a delivery path, that is, when the same delivery path receives multiple auxiliary delivery requests, multiple negative costs can be obtained.

[0113] Figure 5 1 is a structural block diagram of a multi-cost accounting management system for intelligent logistics. In an embodiment of the present invention, a multi-cost accounting management system for intelligent logistics, the system 10 includes:

[0114] The distribution path generation module 11 is used to query the destinations of all goods to be distributed, select the logistics center as the starting point in the map, and obtain a preset number of distribution paths passing through all the destinations; wherein the distribution path is a set of coordinates with time tags;

[0115] The load parameter determination module 12 is used to segment each delivery path according to the delivery destination, query the cargo information of the cargo to be delivered at the corresponding delivery destination for each delivery path, and determine the load parameters of the delivery path; the load parameters include time range and load capacity;

[0116] The negative cost calculation module 13 is used to receive in real time the auxiliary delivery request containing the auxiliary starting point, the auxiliary end point and the cargo information, screen the auxiliary delivery request according to the delivery path containing the carrying parameters, and determine the negative cost;

[0117] The delivery path screening module 14 is used to insert negative costs into preset cost accounting rules, screen all delivery paths, and obtain the best delivery path.

[0118] Further, the bearer parameter determination module 12 includes:

[0119] A path segmentation unit is used to segment each delivery path with the delivery location as a node to obtain a number of delivery paths with the delivery location as the starting point and the end point;

[0120] The information query unit is used to read each delivery route in sequence, and query the load information at the beginning of each delivery route and the unloading information at the end of each delivery route; wherein the unloading information is the cargo information of the cargo to be delivered with the end of the segment as the destination, and the cargo information at least includes the packaging volume and the total weight; the beginning of the segment and the end of the segment are both the receiving places;

[0121] A load calculation unit, used to calculate the load information at the beginning of the next delivery path according to the load information at the beginning of the segment and the unloading information at the end of the segment; wherein the load information at the starting point of the initial delivery path is a preset value;

[0122] The parameter generating unit is used to determine the load parameters of each delivery path according to the load information at the beginning of the delivery path.

[0123] Specifically, the negative cost calculation module 13 includes:

[0124] A request receiving unit, used for opening an information acquisition port, and receiving an auxiliary distribution request containing a starting point, a destination and cargo information in real time based on the information acquisition port;

[0125] A comparison unit, used to compare the cargo information with the load parameters of each delivery route segment to determine the matching route segment;

[0126] an optimal path determination unit, configured to determine an optimal auxiliary path based on the matching path segments and calculate a cost of the optimal auxiliary path;

[0127] The computation execution unit is used to obtain the quotation of the auxiliary delivery request and calculate the benefit based on the quotation and the cost as the negative cost.

[0128] In the above content, the optimal path determination unit includes:

[0129] A reading subunit is used to read the auxiliary starting point and the auxiliary end point to determine a path in the map, which is called an additional path;

[0130] A merging subunit, which is used to calculate the replacement distance between the additional path and each matching path segment;

[0131] The calculation subunit is used to query the minimum replacement distance, determine the best auxiliary path, and simultaneously calculate the cost of the best auxiliary path.

[0132] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the protection scope of the present invention.

Claims

1. A multi-cost accounting management method for intelligent logistics, characterized in that: The method comprises: Query the destinations of all goods to be delivered, select the logistics center as the starting point in the map, and obtain a preset number of delivery paths passing through all the destinations; wherein the delivery path is a set of coordinates with time tags; For each delivery route, the delivery route is segmented according to the delivery destination. For each delivery route segment, the cargo information of the cargo to be delivered at the corresponding delivery destination is queried to determine the load parameters of the delivery route segment; the load parameters include the time range and the load capacity; Receive auxiliary delivery requests containing auxiliary starting points, auxiliary end points and cargo information in real time, screen the auxiliary delivery requests according to the delivery paths containing carrying parameters, and determine the negative cost; Insert negative costs into the preset cost accounting rules, screen all delivery routes, and obtain the best delivery route; The step of receiving in real time an auxiliary delivery request containing an auxiliary starting point, an auxiliary end point and cargo information, screening the auxiliary delivery request according to a delivery path containing a carrying parameter, and determining a negative cost comprises: Open the information acquisition port, and receive auxiliary distribution requests containing the starting point, end point and cargo information in real time based on the information acquisition port; Compare the cargo information with the load parameters of each delivery route to determine the matching route segment; determining the best auxiliary path based on the matched path segments, and calculating the cost of the best auxiliary path; Get quotes for auxiliary delivery requests, and calculate the revenue based on the quotes and costs as negative costs; The steps of inserting negative costs into preset cost accounting rules, screening all delivery paths, and obtaining the best delivery path include: Obtaining parameters of each delivery path under preset indicators and creating an evaluation matrix; each row of the evaluation matrix corresponds to a delivery path, and each column of the evaluation matrix corresponds to an indicator; Calculate the total score of each delivery route based on the evaluation matrix; Adjusting all total scores based on the negative cost, and selecting the best delivery path according to the adjusted total scores; The calculation process of the total score is: ; ; ; In the formula, Indicates The total score corresponding to the delivery routes; For the The distance between the delivery path and the minimum value, For the The distance between the delivery paths and the maximum value; For the The maximum value of the index, For the The minimum value of the indicator, represents the parameters after forward transformation; Indicates The weight corresponding to each indicator; is the total number of indicators; Indicates the preset offset, Indicates negative cost.

2. The multi-cost accounting management method for intelligent logistics according to claim 1 is characterized in that: The step of dividing each delivery path into sections according to the destination, querying the cargo information of the cargo to be delivered at the destination for each delivery path, and determining the load parameters of the delivery path includes: For each delivery path, the delivery location is used as a node to segment the delivery path, and several delivery paths with the delivery location as the starting point and the end point are obtained; Read each delivery route in sequence, and query the load information at the beginning of each delivery route and the unloading information at the end of each route; wherein the unloading information is the cargo information of the cargo to be delivered with the end of the route as the destination, and the cargo information at least includes the packaging volume and the total weight; the beginning of the route and the end of the route are both the receiving places; The load information at the beginning of the next delivery path is calculated according to the load information at the beginning of the path and the unloading information at the end of the path; wherein the load information at the starting point of the initial delivery path is a preset value; The load parameters of each delivery path segment are determined according to the load information at the beginning of the segment.

3. The multi-cost accounting management method for intelligent logistics according to claim 1 is characterized in that: The steps of determining the best auxiliary path based on the matching path segments and calculating the cost of the best auxiliary path include: Read the auxiliary start point and the auxiliary end point to determine the path in the map, which is called the additional path; Calculate the replacement distance between the additional path and each matching path segment; Query the minimum replacement distance, determine the best auxiliary path, and simultaneously calculate the cost of the best auxiliary path.

4. The multi-cost accounting management method for intelligent logistics according to claim 3 is characterized in that: The steps of querying the minimum replacement distance, determining the best auxiliary path, and synchronously calculating the cost of the best auxiliary path include: Query the shortest path between the auxiliary starting point and the matching path segment in the map, take the other end point in the shortest path as the bifurcation point, and take its distance as the first shortest distance; Query the shortest path between the auxiliary end point and the matching path segment in the map, use the other end point in the shortest path as the merging point, and use its distance as the second shortest distance; According to the first shortest distance and the second shortest distance, matching path segments are selected to construct a path of bifurcation point-extra path-merging point, which is called the best auxiliary path; The path length difference between the optimal auxiliary path and the matching path segment is calculated, and the cost is determined according to the path length difference.

5. A multi-cost accounting management system for intelligent logistics, characterized in that: The system comprises: A delivery path generation module is used to query the delivery locations of all goods to be delivered, select a logistics center as a starting point in the map, and obtain a preset number of delivery paths passing through all delivery locations; wherein the delivery path is a set of coordinates with time tags; A load parameter determination module is used to segment each delivery path according to the delivery destination, query the cargo information of the cargo to be delivered at the corresponding delivery destination for each delivery path, and determine the load parameters of the delivery path; the load parameters include time range and load capacity; The negative cost calculation module is used to receive auxiliary delivery requests containing auxiliary starting points, auxiliary end points and cargo information in real time, screen the auxiliary delivery requests according to the delivery paths containing carrying parameters, and determine the negative cost; The delivery path screening module is used to insert negative costs into the preset cost accounting rules, screen all delivery paths, and obtain the best delivery path; The negative cost calculation module includes: A request receiving unit, used for opening an information acquisition port, and receiving an auxiliary distribution request containing a starting point, a destination and cargo information in real time based on the information acquisition port; A comparison unit, used to compare the cargo information with the load parameters of each delivery route segment to determine the matching route segment; an optimal path determination unit, configured to determine an optimal auxiliary path based on the matching path segments and calculate a cost of the optimal auxiliary path; A calculation execution unit, used to obtain quotations for auxiliary delivery requests, and calculate the benefits based on the quotations and costs as negative costs; The negative cost is inserted into the preset cost accounting rules, all the delivery paths are screened, and the content of obtaining the best delivery path includes: Obtaining parameters of each delivery path under preset indicators and creating an evaluation matrix; each row of the evaluation matrix corresponds to a delivery path, and each column of the evaluation matrix corresponds to an indicator; Calculate the total score of each delivery route based on the evaluation matrix; Adjusting all total scores based on the negative cost, and selecting the best delivery path according to the adjusted total scores; The calculation process of the total score is: ; ; ; In the formula, Indicates The total score corresponding to the delivery routes; For the The distance between the delivery path and the minimum value, For the The distance between the delivery paths and the maximum value; For the The maximum value of the index, For the The minimum value of the indicator, represents the parameters after forward transformation; Indicates The weight corresponding to each indicator; is the total number of indicators; Indicates the preset offset, Indicates negative cost.

6. The multi-cost accounting management system for intelligent logistics according to claim 5 is characterized in that: The bearer parameter determination module includes: A path segmentation unit is used to segment each delivery path with the delivery location as a node to obtain a number of delivery paths with the delivery location as the starting point and the end point; The information query unit is used to read each delivery route in sequence, and query the load information at the beginning of each delivery route and the unloading information at the end of each delivery route; wherein the unloading information is the cargo information of the cargo to be delivered with the end of the segment as the destination, and the cargo information at least includes the packaging volume and the total weight; the beginning of the segment and the end of the segment are both the receiving places; A load calculation unit, used to calculate the load information at the beginning of the next delivery path according to the load information at the beginning of the segment and the unloading information at the end of the segment; wherein the load information at the starting point of the initial delivery path is a preset value; The parameter generating unit is used to determine the load parameters of each delivery path according to the load information at the beginning of the delivery path.

7. The multi-cost accounting management system for intelligent logistics according to claim 6 is characterized in that: The optimal path determination unit comprises: A reading subunit is used to read the auxiliary starting point and the auxiliary end point to determine a path in the map, which is called an additional path; A merging subunit, which is used to calculate the replacement distance between the additional path and each matching path segment; The calculation subunit is used to query the minimum replacement distance, determine the best auxiliary path, and simultaneously calculate the cost of the best auxiliary path.

Images