A quality management method for agricultural product supply chain based on big data

Determining the optimal transportation route and combining transportation through big data management methods solves the problem of corruption and deterioration in the agricultural product supply chain, and achieving efficient and low-cost agricultural product transportation and storage, ensuring the quality of products received by consumers.

CN115965256BActive Publication Date: 2024-11-05BEIJING LUXI HEALTH TECHNOLOGY CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202211240442.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-10-11
Publication Date
2024-11-05
Estimated Expiration
2042-10-11

AI Technical Summary

Technical Problem

The existing technology lacks effective agricultural product supply chain quality management methods, which leads to agricultural products being easily corrupted and deteriorated during transportation and storage, affecting consumer experience.

Method used

Based on big data, the quality management method of agricultural product supply chain, determines the logistics transfer center that meets environmental requirements, generates the optimal transportation route, and merges transportation and supplements of damaged products in the logistics transfer center, monitors the order status and transportation environment in real time, and predicts losses. Adjust the transportation route to avoid corruption.

Benefits of technology

The optimal transportation route for agricultural products is achieved, the transportation costs and time are reduced, while the consumers are prevented from receiving corrupt and deteriorating agricultural products, and the quality management efficiency of the supply chain is improved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115965256B_ABST
    Figure CN115965256B_ABST
Patent Text Reader

Abstract

The present invention belongs to the technical field of agricultural product supply chain, and specifically relates to a method for agricultural product supply chain quality management based on big data, comprising: generating sales orders for agricultural products; determining from all logistics transfer centers several logistics transfer centers that can meet the environmental requirements for transportation and storage of agricultural products in the sales order, and calculating the optimal transportation route of the sales order in combination with the shipping place and the receiving place of the sales order; at the logistics transfer center, according to each optimal transportation route of different sales orders, merging and transporting different sales orders that are the same as the next logistics transfer center on each optimal transportation route, and finally transporting the agricultural products corresponding to the sales order to the logistics transfer center closest to the receiving place. The present invention can realize the quality management of the agricultural product supply chain and prevent consumers from receiving corrupted and spoiled agricultural products.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the technical field of agricultural product supply chain, and specifically relates to an agricultural product supply chain quality management method based on big data. Background Art

[0002] The agricultural product supply chain refers to the chain of activities in the entire process from the merchant to the consumer, including agricultural product planting, agricultural product sales, agricultural product transportation, agricultural product storage, etc. Because agricultural products themselves are prone to spoilage, the transportation and storage of agricultural products need to meet certain conditions. For example, the temperature range required for transporting most types of fruits is between 0°C and 4°C, while the temperature range required for transporting bananas is relatively high, preferably kept between 12°C and 14°C. When managing the agricultural product supply chain, the quality of agricultural products should be guaranteed as much as possible to prevent consumers from receiving spoiled agricultural products. However, the prior art lacks such a method for managing the agricultural product supply chain. Therefore, the present invention provides a quality management method for an agricultural product supply chain based on big data. Summary of the invention

[0003] The present invention determines the logistics transfer center that can meet the environmental requirements of agricultural products according to the environmental requirements, and generates the optimal transportation route for the sales order of agricultural products based on the considerations of transportation cost and transportation time. At each logistics transfer center, the same sales order of the next logistics transfer center is consolidated for transportation, and damaged agricultural products are replenished in time at the logistics transfer center, so that consumers will not receive corrupted and spoiled agricultural products.

[0004] In order to achieve the above-mentioned purpose of the invention, a method for agricultural product supply chain quality management based on big data is provided as follows, which mainly includes the following steps:

[0005] Generate a sales order for agricultural products, and obtain the place of shipment and the place of receipt in the sales order, and obtain the environmental requirements for transportation and storage of the agricultural products in the sales order, including the temperature environment and the humidity environment. The sales order also includes the quantity of the agricultural products and the order status;

[0006] Determine from all the logistics transfer centers a number of logistics transfer centers that can meet the environmental requirements for transportation and storage of the agricultural products in the sales order, and calculate the optimal transportation route of the sales order in combination with the shipping place and the receiving place, and also transport the agricultural products corresponding to the sales order to the nearest next logistics transfer center on the optimal transportation route;

[0007] At the next logistics transfer center, the agricultural products corresponding to the sales order are temporarily stored, and according to the optimal transportation routes of different sales orders, the same different sales orders are combined and transported at the next logistics transfer center of the next logistics transfer center, and this step is repeated at the next logistics transfer center of the next logistics transfer center until the agricultural products corresponding to the sales order are transported to the logistics transfer center closest to the delivery place.

[0008] As a preferred technical solution of the present invention, during the transportation of the agricultural products corresponding to the sales order, the order status in the sales order is monitored in real time. When the sales order is rejected, the agricultural products continue to be transported to the next nearest logistics transfer center on the optimal transportation route of the sales order for short-term storage. After the preset conditions are met, the agricultural products corresponding to the sales order are transported back to the shipping place for long-term storage and resale. The preset conditions include storing the agricultural products for a specified number of days and the sum of the quantities of the agricultural products in the sales order with the same shipping place that was rejected reaches a specified number.

[0009] As a preferred technical solution of the present invention, during the transportation of the agricultural products corresponding to the sales order, the temperature and humidity in the agricultural products transportation environment are monitored, and the loss amount of the agricultural products corresponding to the sales order is predicted based on the temperature and humidity in the agricultural products transportation environment and the quantity of the agricultural products in the sales order.

[0010] As a preferred technical solution of the present invention, during the transportation of the agricultural products corresponding to the sales order, based on the predicted loss amount of the agricultural products corresponding to the sales order, it is determined whether the sum of the quantity of the agricultural products stored in the nearest next logistics transfer center on the optimal transportation route of the sales order and the quantity of the agricultural products in other returned sales orders with the same shipping place as the sales order satisfies the requirement of being greater than the loss amount of the agricultural products. If so, the agricultural products continue to be transported to the nearest next logistics transfer center on the optimal transportation route of the sales order, and the lost agricultural products are replenished. If not, the agricultural products are transported to the nearest logistics transfer center that can replenish the agricultural products, and the new optimal transportation route of the sales order from the current logistics transfer center to the destination is recalculated.

[0011] As a preferred technical solution of the present invention, calculating the optimal transportation route of the sales order includes the following steps:

[0012] Obtain the geographical coordinates of the starting point and the end point of the optimal transportation route, and determine the geographical search range of the optimal transportation route;

[0013] Several logistics transfer centers that meet the environmental requirements for transportation and storage of agricultural products in the sales order are respectively regarded as different nodes, and it is determined whether the number of first-category nodes determined by forward search is less than or equal to the number of first-category nodes determined by backward search. If so, a forward search is continued, otherwise, a backward search is continued;

[0014] After performing a forward search, determine whether there are the same nodes in the second category as in the backward search. If so, use the same nodes as in the connection nodes. If not, jump to the step of comparing the number of first category nodes in the forward search and the backward search. After performing a backward search, determine whether there are the same nodes in the second category as in the forward search. If so, use the same nodes as in the connection nodes. If not, jump to the step of comparing the number of first category nodes in the forward search and the backward search.

[0015] For different connection nodes, the routes where the different connection nodes are located are determined respectively, and the sum of the node costs of the different connection nodes in the forward search and the node costs of the different connection nodes in the backward search is calculated to determine the route corresponding to the minimum sum of the node costs. At the same time, it is judged whether the minimum sum of the node costs satisfies the condition of being less than or equal to the sum of the minimum node cost of the second type of nodes in the forward search and the minimum node cost of the second type of nodes in the backward search. If so, the route corresponding to the minimum sum of the node costs is used as the optimal transportation route. If not, jump to the step of comparing the number of first type nodes in the forward search and the backward search.

[0016] As a preferred technical solution of the present invention, the process of a forward search includes the following steps:

[0017] Select a second-class node with the lowest node cost from all current second-class nodes, and register this second-class node as a first-class node;

[0018] Determine whether the first-class node is within the geographical search range of the optimal transportation route. If not, discard the first-class node and jump to the step of comparing the number of first-class nodes in the forward search and the backward search. If yes, proceed to the next step.

[0019] Determine whether the level of the rear link of the first-class node is greater than the level of the rear link after the rear link minus the preset level number. If not, discard the first-class node and jump to the step of comparing the number of first-class nodes in the forward search and the backward search. If yes, the first-class node is registered as a valid first-class node, and the node cost of the valid first-class node is registered as the valid node cost.

[0020] Determine different second-class nodes that can be directly connected to this valid first-class node, and respectively calculate the cost of the rear connections of different second-class nodes plus the cumulative value of the valid node cost. When the different second-class nodes are searched for the first time, register the cumulative value as the node cost of the different second-class nodes. When the different second-class nodes are not searched for the first time, determine whether the cumulative value is less than the node cost of the different second-class nodes registered in history. If so, update the cumulative value to the node cost of the different second-class nodes. If not, register the rear nodes of the different second-class nodes registered in history as valid first-class nodes.

[0021] As a preferred technical solution of the present invention, whether the first type of node is within the geographical search range of the optimal transportation route is determined by the following formula f(x, y):

[0022]

[0023] Among them, the geographical search range is in the shape of an ellipse with the geographical coordinates of the starting point and the end point as the foci respectively, x, y are the geographical coordinates of the first type of node, x0, y0 are the center coordinates of the ellipse, a is the major axis of the ellipse, b is the minor axis of the ellipse, θ=arcsin(y2-y1 / d), y2, y1 are the Y coordinate values ​​of the geographical coordinates of the end point and the starting point respectively, and d is the focal length of the ellipse.

[0024] As a preferred technical solution of the present invention, when f(x, y)≥0, it is determined that the first type of node is within the geographical search range of the optimal transportation route; when f(x, y)<0, it is determined that the first type of node is not within the geographical search range of the optimal transportation route.

[0025] Compared with the prior art, the beneficial effects of the present invention are at least as follows:

[0026] The present invention first generates a sales order for agricultural products, and then determines from all logistics transfer centers several logistics transfer centers that can meet the environmental requirements for transportation and storage of agricultural products in the sales order, and calculates the optimal transportation route of the sales order in combination with the place of shipment and the place of receipt of the sales order. Finally, at the logistics transfer center, according to the optimal transportation routes of different sales orders, different sales orders with the same next logistics transfer center on each optimal transportation route are combined for transportation, and finally the agricultural products corresponding to the sales order are transported to the logistics transfer center closest to the place of receipt. The present invention solves the problem that it is difficult to effectively manage the quality of the agricultural product supply chain in the prior art. Through the present invention, not only can the sales order of agricultural products be transported according to the optimal transportation route with the least transportation time and cost, but also consumers can be prevented from finally receiving spoiled agricultural products. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] Figure 1 The present invention is a flowchart of the steps of a method for agricultural product supply chain quality management based on big data. DETAILED DESCRIPTION

[0028] In order to make the purpose, technical solution and advantages of 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 intended to limit the present invention.

[0029] It is understood that the terms "first", "second", etc. used in this application may be used herein to describe various elements, but unless otherwise specified, these elements are not limited by these terms. These terms are only used to distinguish a first element from another element. For example, without departing from the scope of this application, a first xx script may be referred to as a second xx script, and similarly, a second xx script may be referred to as a first xx script.

[0030] The present invention aims at the quality management problem of agricultural product supply chain to prevent consumers from receiving spoiled agricultural products. Figure 1 The agricultural product supply chain quality management method based on big data is mainly implemented by executing the following steps:

[0031] Step 1: Generate a sales order for agricultural products, obtain the place of shipment and the place of receipt in the sales order, and obtain the environmental requirements for transportation and storage of the agricultural products in the sales order, including the temperature environment and the humidity environment. The sales order also includes the quantity of agricultural products and the order status;

[0032] Step 2: Determine from all the logistics transfer centers a number of logistics transfer centers that can meet the environmental requirements for transportation and storage of the agricultural products in the sales order, and calculate the optimal transportation route of the sales order in combination with the shipping place and the receiving place, and also transport the agricultural products corresponding to the sales order to the nearest next logistics transfer center on the optimal transportation route;

[0033] Step 3: temporarily store the agricultural products corresponding to the sales order at the next logistics transfer center, and merge and transport the same different sales orders at the next logistics transfer center of the next logistics transfer center according to the optimal transportation routes of the different sales orders, and repeat the process of this step at the next logistics transfer center of the next logistics transfer center until the agricultural products corresponding to the sales order are transported to the logistics transfer center closest to the delivery place;

[0034] Specifically, the above step 1 generates a sales order for agricultural products, which includes the type of agricultural products, the quantity of agricultural products, the environmental requirements of agricultural products, the place of shipment, the place of receipt, the order status, etc., wherein the order status includes pending shipment, in transit, returned, etc. The above step 2 searches for logistics transfer centers that can meet the environmental requirements of agricultural products for transportation and storage. These logistics transfer centers can store agricultural products for a short period of time and ensure that agricultural products will not spoil. At the same time, the optimal transportation route is calculated between these logistics transfer centers. That is to say, transporting agricultural products through the optimal transportation route can reduce the transportation time and transportation cost of agricultural products. The above step 3 stores agricultural products of different sales orders in the same logistics transfer center, reallocates logistics for different sales orders, and uniformly transports agricultural products of the same sales order to the next logistics transfer center to solve the problem of greatly increased transportation costs caused by separate transportation of different sales orders.

[0035] Furthermore, during the transportation of the agricultural products corresponding to the sales order, the order status of the sales order is monitored in real time. When the sales order is rejected, the agricultural products are continuously transported to the nearest next logistics transfer center on the optimal transportation route of the sales order for short-term storage. After the preset conditions are met, the agricultural products corresponding to the sales order are transported back to the place of shipment for long-term storage and resale. The preset conditions include that the agricultural products have been stored for a specified number of days and the sum of the quantities of the agricultural products in the sales order with the same place of shipment that has been rejected reaches a specified number.

[0036] Specifically, considering that a sales order may be returned during transportation, that is, before the consumer receives the agricultural products, at this time, directly transporting the agricultural products of a sales order back to the place of shipment will cost a considerable transportation cost. Therefore, the present invention continues to transport the agricultural products of a returned sales order to the next nearest logistics transfer center on the optimal transportation route, and temporarily stores the agricultural products in this logistics transfer center to ensure the quality of the agricultural products. When the number of storage days meets certain conditions, or when the sum of the quantities of agricultural products of the returned sales orders with the same place of shipment meets certain quantity requirements, the agricultural products of the corresponding sales orders will be transported back to the place of shipment together. This can reduce the transportation cost of the returned sales orders. Other uses of the agricultural products of these returned sales orders will be described below.

[0037] Furthermore, during the transportation of the agricultural products corresponding to the sales order, the temperature and humidity in the agricultural product transportation environment are monitored, and the loss amount of the agricultural products corresponding to the sales order is predicted based on the temperature and humidity in the agricultural product transportation environment and the quantity of the agricultural products in the sales order;

[0038] Furthermore, during the transportation of the agricultural products corresponding to the above-mentioned sales order, based on the predicted loss amount of the agricultural products corresponding to the above-mentioned sales order, it is determined whether the sum of the quantity of the agricultural products stored in the nearest next logistics transfer center on the optimal transportation route of the above-mentioned sales order and the quantity of the agricultural products in other returned sales orders whose shipping places are the same as the above-mentioned sales order satisfies the requirement of being greater than the loss amount of the agricultural products. If so, the agricultural products are continuously transported to the nearest next logistics transfer center on the optimal transportation route of the above-mentioned sales order, and the lost agricultural products are replenished. If not, the agricultural products are transported to the nearest logistics transfer center that can replenish the agricultural products, and a new optimal transportation route of the above-mentioned sales order from the current logistics transfer center to the destination is recalculated.

[0039] Specifically, considering that when transporting agricultural products of sales orders, agricultural products often have strict requirements on the transportation environment, such as temperature, humidity, etc., and it is generally difficult to accurately and real-time guarantee the transportation environment conditions during transportation, the agricultural products of sales orders may still be corrupted and deteriorated during transportation. In order to solve this problem and prevent consumers from finally receiving corrupted and deteriorated agricultural products, which affects the consumer experience, the temperature, humidity and other conditions of the transportation environment can be monitored during the transportation of agricultural products of sales orders, and based on the historical accumulated experience big data, specifically including the historical transportation environment data, historical transportation volume, historical loss volume, etc. of agricultural products, a machine learning model for predicting the loss of agricultural products according to the transportation environment and quantity of agricultural products is trained. Through this machine learning model, the loss of agricultural products can be predicted during transportation. If the agricultural products of the above-mentioned returned sales order can be used to supplement the loss of agricultural products at the next logistics transfer center on the optimal transportation route, consumers will not receive problematic agricultural products, and the quality of the agricultural products sold can be guaranteed. However, when the quantity of agricultural products of the above-mentioned returned sales order stored in the next logistics transfer center on the optimal transportation route is insufficient, the agricultural products need to be first transported to a logistics transfer center that can be replenished, and then the optimal transportation route is replanned.

[0040] Furthermore, calculating the optimal transportation route of the above sales order includes the following steps:

[0041] The first step is to obtain the geographical coordinates of the starting point and the end point of the optimal transportation route and determine the geographical search range of the optimal transportation route;

[0042] Step 2: Consider several logistics transfer centers that meet the environmental requirements for transportation and storage of agricultural products in the above sales order as different nodes, and determine whether the number of first-category nodes determined by forward search is less than or equal to the number of first-category nodes determined by backward search. If so, continue to perform a forward search, otherwise, continue to perform a backward search;

[0043] Step 3: After performing a forward search, determine whether there are the same nodes in the second category as those in the backward search. If so, use the same nodes as the connecting nodes. If not, jump to the step of comparing the number of first category nodes in the forward search and the backward search. After performing a backward search, determine whether there are the same nodes in the second category as those in the forward search. If so, use the same nodes as the connecting nodes. If not, jump to the step of comparing the number of first category nodes in the forward search and the backward search.

[0044] Step 4: for different connection nodes, respectively determine the routes where the different connection nodes are located, and calculate the sum of the node costs of the different connection nodes in the forward search and the node costs of the different connection nodes in the backward search, determine the route corresponding to the minimum sum of the node costs, and at the same time determine whether the minimum sum of the node costs satisfies the condition that it is less than or equal to the sum of the minimum node cost of the second type of nodes in the forward search and the minimum node cost of the second type of nodes in the backward search. If so, take the route corresponding to the minimum sum of the node costs as the optimal transportation route. If not, jump to the step of comparing the number of the first type of nodes in the forward search and the backward search.

[0045] Specifically, the present invention aims to minimize the transportation time and transportation cost of agricultural products for transportation sales orders, and therefore proposes the above-mentioned first step to the above-mentioned fourth step to achieve this purpose. First, the geographical search range of the optimal transportation route is determined. This is done to narrow the geographical range for calculating the optimal transportation route. For example, a geographical range that is far away from the starting point and the end point is not suitable for generating the optimal transportation route. Secondly, a two-way search for the optimal route is carried out from the starting point and the end point respectively. The present invention regards the process of searching for the optimal route from the starting point to the end point as a forward search, and the direction close to the end point is the forward direction. The process of searching for the optimal route from the end point to the starting point is regarded as a backward search, and the direction close to the starting point is the backward direction. The number of first-class nodes in the forward search and the backward search are compared, so as to select the next step to continue. Different searches are performed, so that the forward search and backward search can be carried out in a balanced manner. The meaning of the first type of node will be described below. Secondly, each time a forward search or a backward search is completed, it will be determined whether there are the same nodes in the two. When the same nodes exist, it means that a route from the starting point to the end point has been generated at this time. Finally, the route where each connecting node is located is determined, and the route with the lowest cost is determined. The route must be less than or equal to the sum of the smallest node cost in the second type of node in the forward search and the smallest node cost in the second type of node in the backward search before the route is determined as the optimal transportation route. The second type of node refers to the node that is currently active. For example, the second type of node at the starting point is all the nodes that can be directly connected to it.

[0046] Furthermore, the above forward search process includes the following steps:

[0047] The first step is to select a second-class node with the lowest node cost from all the current second-class nodes, and register this second-class node as a first-class node;

[0048] Step 2: Determine whether the first-class node is within the geographical search range of the optimal transportation route. If not, discard the first-class node and jump to the step of comparing the number of first-class nodes in the forward search and the backward search. If yes, proceed to the next step.

[0049] Step 3: determine whether the level of the rear link of the first-class node is greater than the level of the rear link after the rear link minus the preset level number. If not, discard the first-class node and jump to the step of comparing the number of first-class nodes in the forward search and the backward search. If yes, the first-class node is registered as a valid first-class node, and the node cost of the valid first-class node is registered as the valid node cost.

[0050] Step 4: determine different second-class nodes that can be directly connected to the valid first-class node, respectively calculate the cost of the rear connection of the different second-class nodes plus the cumulative value of the above-mentioned valid node cost, when the different second-class nodes are searched for the first time, register the above-mentioned cumulative value as the node cost of the different second-class nodes, when the different second-class nodes are not searched for the first time, determine whether the above-mentioned cumulative value is less than the node cost of the different second-class nodes registered in history, if so, update the above-mentioned cumulative value to the node cost of the different second-class nodes, if not, register the rear node of the different second-class nodes as the valid first-class nodes;

[0051] Specifically, the processing steps of forward search and backward search are the same, except that the directions of searching for the optimal route are different. Therefore, the processing steps of forward search are taken as an example to explain in detail, and the processing steps of backward search are not repeated. First, a second-class node with the lowest node cost is selected from all current second-class nodes, and it is used as the first-class node, where the node cost refers to the sum of the costs of the backward links leading to the node, and the cost of a single backward link is the sum of the cost of storing agricultural products in the logistics transfer center corresponding to the forward node of the backward link, and the time cost of transporting the agricultural products to its forward node through the road corresponding to the backward link. Secondly, it is determined whether this first-class node is within the above-mentioned geographical search range of the optimal transportation route. If not, the node is discarded. Once again, when this first-class node is within the above-mentioned geographical search range of the optimal transportation route, it is continued to be determined whether the level of the rear link of this first-class node is greater than the level of the rear link behind this rear link minus the preset level number. If not, the node is discarded. If it is If the node is not found, the node is registered as a valid first-class node, and its node cost is registered as a valid node cost. The level of the rear link refers to the level of the road corresponding to the rear link. For example, the level can be set according to the road conditions. The better the road conditions, the higher the level. The levels can also be set in the order of national roads, provincial roads, county roads, and township roads. The rear links with levels that are too different from the rear links are not selected, so as to ensure safe and fast transportation of agricultural products. Finally, the different second-class nodes of this valid first-class node are determined, and their node costs are calculated respectively. If the different second-class nodes are searched for the first time, the node cost is updated directly using the calculation result. If it is not searched for the first time, the calculation result is compared with the node cost registered historically. If it is less than, the node cost is updated directly using the calculation result. Otherwise, the rear node of the second-class node registered historically is registered as a valid first-class node. Through the above-mentioned first step to the above-mentioned fourth step, the lowest transportation cost of the sales order can be achieved, while ensuring the shortest transportation time.

[0052] Furthermore, the following formula f(x, y) is used to determine whether the first type of node is within the geographical search range of the optimal transportation route:

[0053]

[0054] The geographic search range is in the form of an ellipse with the geographic coordinates of the starting point and the end point as the foci, x and y are the geographic coordinates of the first type of node, x0 and y0 are the center coordinates of the ellipse, a is the major axis of the ellipse, b is the minor axis of the ellipse, θ=arcsin(y2-y1 / d), y2 and y1 are the Y coordinate values ​​of the geographic coordinates of the end point and the starting point, respectively, and d is the focal length of the ellipse;

[0055] Further, when f(x,y)≥0 holds, it is determined that the first type of node is within the geographical search range of the optimal transportation route, and when f(x,y)<0 holds, it is determined that the first type of node is not within the geographical search range of the optimal transportation route;

[0056] Specifically, the geographical search range of the above-mentioned optimal transportation route is set to an ellipse with the geographical coordinates of the starting point and the geographical coordinates of the end point as the foci respectively. By adjusting the ratio of the major axis and the minor axis of the ellipse, the shape of the ellipse can be controlled to change, and then the geographical search range of the optimal transportation route is appropriately changed. By calculating the optimal transportation route in different geographical search ranges, the optimal transportation route with the least transportation time and cost can be finally obtained.

[0057] It should be understood that, although each step in the flow chart of each embodiment of the present invention is shown in sequence according to the indication of the arrow, these steps are not necessarily performed in sequence according to the order indicated by the arrow. Unless there is a clear explanation in this article, the execution of these steps does not have a strict order restriction, and these steps can be performed in other orders. Moreover, at least a portion of the steps in each embodiment may include a plurality of sub-steps or a plurality of stages, and these sub-steps or stages are not necessarily performed at the same time, but can be performed at different times, and the execution order of these sub-steps or stages is not necessarily performed in sequence, but can be performed in turn or alternately with at least a portion of other steps or sub-steps or stages of other steps.

[0058] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program. The above-mentioned program can be stored in a non-volatile computer-readable storage medium. When the program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided in this application can include non-volatile and / or volatile memory. Non-volatile memory may include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM) or flash memory. Volatile memory may include random access memory (RAM) or external cache memory. As an illustration and not limitation, RAM is available in various forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).

[0059] The technical features of the above-mentioned embodiments can be combined arbitrarily. In order to make the description concise, not all possible combinations of the technical features in the above-mentioned embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0060] The above-mentioned embodiments only express several implementation methods of the present invention, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the patent of the present invention. It should be pointed out that, for ordinary technicians in this field, several variations and improvements can be made without departing from the concept of the present invention, and these all belong to the protection scope of the present invention. Therefore, the protection scope of the patent of the present invention shall be subject to the attached claims.

[0061] The above are only preferred embodiments of the present invention and are 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 method for agricultural product supply chain quality management based on big data, characterized in that: The steps include: Generate a sales order for agricultural products, and obtain the place of shipment and the place of receipt in the sales order, and obtain the environmental requirements for transportation and storage of the agricultural products in the sales order, including the temperature environment and the humidity environment. The sales order also includes the quantity of the agricultural products and the order status; Determine from all the logistics transfer centers a number of logistics transfer centers that can meet the environmental requirements for transportation and storage of the agricultural products in the sales order, and calculate the optimal transportation route of the sales order in combination with the shipping place and the receiving place, and also transport the agricultural products corresponding to the sales order to the nearest next logistics transfer center on the optimal transportation route; At the next logistics transfer center, the agricultural products corresponding to the sales order are temporarily stored, and according to the optimal transportation routes of different sales orders, the same different sales orders at the next logistics transfer center of the next logistics transfer center are combined for transportation, and the processing of this step is repeated at the next logistics transfer center of the next logistics transfer center until the agricultural products corresponding to the sales order are transported to the logistics transfer center closest to the receiving place; Calculating the optimal transportation route for the sales order includes the following steps: Obtain the geographical coordinates of the starting point and the end point of the optimal transportation route, and determine the geographical search range of the optimal transportation route; Several logistics transfer centers that meet the environmental requirements for transportation and storage of agricultural products in the sales order are respectively regarded as different nodes, and it is determined whether the number of first-category nodes determined by forward search is less than or equal to the number of first-category nodes determined by backward search. If so, a forward search is continued, otherwise, a backward search is continued; After performing a forward search, determine whether there are the same nodes in the second category as in the backward search. If so, use the same nodes as in the connection nodes. If not, jump to the step of comparing the number of first category nodes in the forward search and the backward search. After performing a backward search, determine whether there are the same nodes in the second category as in the forward search. If so, use the same nodes as in the connection nodes. If not, jump to the step of comparing the number of first category nodes in the forward search and the backward search. For different connection nodes, respectively determine the routes where the different connection nodes are located, and calculate the sum of the node costs of the different connection nodes in the forward search and the node costs of the different connection nodes in the backward search, determine the route corresponding to the minimum sum of the node costs, and at the same time judge whether the minimum sum of the node costs satisfies less than or equal to the sum of the minimum node cost of the second type of nodes in the forward search and the minimum node cost of the second type of nodes in the backward search. If so, take the route corresponding to the minimum sum of the node costs as the optimal transportation route. If not, jump to the step of comparing the number of the first type of nodes in the forward search and the backward search. The process of a forward search comprises the following steps: Select a second-class node with the lowest node cost from all current second-class nodes, and register this second-class node as a first-class node; Determine whether the first-class node is within the geographical search range of the optimal transportation route. If not, discard the first-class node and jump to the step of comparing the number of first-class nodes in the forward search and the backward search. If yes, proceed to the next step. Determine whether the level of the rear link of the first-class node is greater than the level of the rear link after the rear link minus the preset level number. If not, discard the first-class node and jump to the step of comparing the number of first-class nodes in the forward search and the backward search. If yes, the first-class node is registered as a valid first-class node, and the node cost of the valid first-class node is registered as the valid node cost. Determine different second-class nodes that can be directly connected to the valid first-class node, respectively calculate the cost of the rear connection of the different second-class nodes plus the cumulative value of the valid node cost, when the different second-class nodes are searched for the first time, register the cumulative value as the node cost of the different second-class nodes, when the different second-class nodes are not searched for the first time, determine whether the cumulative value is less than the node cost of the different second-class nodes registered in history, if so, update the cumulative value to the node cost of the different second-class nodes, if not, register the rear node of the different second-class nodes registered in history as the valid first-class node; Through the following formula Determine whether the first type of node is within the geographical search range of the optimal transportation route: , The geographic search range is shaped like an ellipse with the geographic coordinates of the starting point and the geographic coordinates of the end point as the foci respectively. is the geographic coordinates of the first type of nodes, is the center coordinate of the ellipse, a is the major axis of the ellipse, b is the minor axis of the ellipse, , are the Y coordinate values ​​of the geographical coordinates of the end point and the start point respectively, and d is the focal length of the ellipse; The ratio of the major axis a and the minor axis b of the ellipse is adjusted to control the shape of the ellipse to change, so as to change the geographical search range of the optimal transportation route, and calculate the optimal transportation route in different geographical search ranges; The second type of nodes refers to nodes that are currently active.

2. The agricultural product supply chain quality management method based on big data according to claim 1 is characterized in that: During the transportation of the agricultural products corresponding to the sales order, the order status of the sales order is monitored in real time. When the sales order is rejected, the agricultural products are transported to the next nearest logistics transfer center on the optimal transportation route of the sales order for short-term storage. After the preset conditions are met, the agricultural products corresponding to the sales order are transported back to the place of shipment for long-term storage and resale. The preset conditions include storing the agricultural products for a specified number of days and the sum of the quantities of the agricultural products in the sales order with the same place of shipment that was rejected reaches a specified number.

3. The agricultural product supply chain quality management method based on big data according to claim 1 is characterized in that: During the transportation of the agricultural products corresponding to the sales order, the temperature and humidity in the agricultural product transportation environment are monitored, and the loss amount of the agricultural products corresponding to the sales order is predicted based on the temperature and humidity in the agricultural product transportation environment and the quantity of the agricultural products in the sales order.

4. A method for agricultural product supply chain quality management based on big data according to claim 2 or 3, characterized in that: During the transportation of the agricultural products corresponding to the sales order, based on the predicted loss amount of the agricultural products corresponding to the sales order, determine whether the sum of the quantity of the agricultural products stored in the nearest next logistics transfer center on the optimal transportation route of the sales order and the quantity of the agricultural products in other returned sales orders with the same shipping place as the sales order satisfies the requirement of being greater than the loss amount of the agricultural products. If so, continue to transport the agricultural products to the nearest next logistics transfer center on the optimal transportation route of the sales order, and replenish the lost agricultural products. If not, transport the agricultural products to the nearest logistics transfer center that can replenish the agricultural products, and recalculate the new optimal transportation route of the sales order from the current logistics transfer center to the destination.

5. The agricultural product supply chain quality management method based on big data according to claim 1 is characterized in that: when When it is established, the first type of node is determined to be within the geographical search range of the optimal transportation route. When it is established, it is determined that the first type of node is not within the geographical search range of the optimal transportation route.