A method of controlling the transport of goods and a computer control program

By comparing the economic costs of reshipment and replacement, the optimal solution was selected to optimize cargo transportation, solving the problem of warehouse accumulation caused by incorrect shipments, improving cargo handling efficiency, and reducing economic costs.

CN115660550BActive Publication Date: 2026-06-02HANGZHOU TIANXIANG DONGJIEYUN EXPRESS CO LTD

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
HANGZHOU TIANXIANG DONGJIEYUN EXPRESS CO LTD
Filing Date
2022-10-25
Publication Date
2026-06-02

AI Technical Summary

Technical Problem

When distributors receive incorrect goods during transportation, existing technology has failed to effectively address the problem of goods piling up in nearby warehouses, and the economic cost of resending goods is high.

Method used

By comparing the economic costs of resending goods and resending goods, the optimal solution is selected. The wrongly sent goods are stored in nearby warehouses or resent to the correct location. PDA detection devices and servers are used for information matching and route planning to generate transportation signals to optimize cargo handling.

Benefits of technology

It shortens the time it takes for distributors to receive goods, reduces the accumulation of goods in factories and warehouses, and lowers economic costs.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115660550B_ABST
    Figure CN115660550B_ABST
Patent Text Reader

Abstract

The application relates to the field of logistics transportation, in particular to a control method and a computer control program for goods transportation, which comprises the following steps: obtaining goods information and current position information; determining corresponding preset order information from a preset first database according to the current position information; judging whether the goods information matches the preset order information, if the goods information does not match the preset order information; obtaining a goods adjustment economic cost according to the current position information and destination position information; obtaining a re-shipment economic cost according to factory position information, destination position information and specific warehouse position information; judging the size of the goods adjustment economic cost and the re-shipment economic cost; if the goods adjustment economic cost is smaller than the re-shipment economic cost, a first transportation signal is generated and sent out; if the goods adjustment economic cost is larger than the re-shipment economic cost, a first storage signal and a second transportation signal are generated and sent out. The application has the effect of improving the fast selection of the optimal scheme when goods are sent in error.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This application relates to the field of logistics and transportation, and in particular to a method for controlling the transportation of goods and a computer control program. Background Technology

[0002] When factories ship goods to distributors, they typically attach an NFC chip to the shipping box and then input the corresponding product information into the NFC chip for recording. The goods are then packaged and shipped to different distributors, who are often located in different places. When shipping to multiple distributors on the same day, and if multiple distributors require large quantities of goods, multiple transport vehicles are waiting to load the boxes. This requires manual handling of the goods to the appropriate transport vehicles. During this handling process, goods destined for location A might be placed in a vehicle destined for location B.

[0003] When the distributor receives the goods, they use a PDA to scan the NFC chip on the shipping box. The PDA then retrieves the goods information from the NFC chip. Simultaneously, the host computer connected to the PDA sends the corresponding goods' location information to the factory's internal server. The server then determines that the goods were delivered to the wrong distributor. Based on this situation, the factory will consider reshipping the goods.

[0004] This approach prioritizes replenishing the goods needed by the distributors, while storing incorrectly shipped goods in a nearby warehouse. However, this approach is flawed. If the location of the distributor's store corresponding to the incorrectly shipped goods is close to the current distributor's store, storing the incorrectly shipped goods in a nearby warehouse would lead to an accumulation of those goods in the warehouse. Summary of the Invention

[0005] In order to select the optimal solution to reduce economic costs when cargo transportation is misdirected, this application provides a cargo transportation control method and a computer control program.

[0006] Firstly, this application provides a method for controlling cargo transportation, which adopts the following technical solution:

[0007] A method for controlling cargo transportation includes the following steps:

[0008] Obtain cargo information and current location information;

[0009] Based on the current location information, the corresponding preset order information is determined from a preset first database, wherein the first database stores multiple preset order information, and each preset order information corresponds to different location information;

[0010] Determine whether the goods information matches the preset order information; if the goods information does not match the preset order information.

[0011] Based on the cargo information, destination location information, factory location information, and specific warehouse location information are obtained, wherein the specific warehouse location information represents the cargo storage location.

[0012] The economic cost of goods relocation is determined based on current and destination location information; the economic cost of reshipment is determined based on factory location information, destination location information, and specific warehouse location information.

[0013] Determine the magnitude of the economic cost of transferring goods and the economic cost of re-issuing them;

[0014] If the economic cost of adjusting the goods is less than the economic cost of resending, a first transportation route is generated based on the destination location information and the current location information, and a first transportation signal is generated and issued based on the first transportation route.

[0015] If the economic cost of transferring goods is greater than the economic cost of resupplying, a first warehousing route is obtained based on the current location information and the specific warehouse location information. A first warehousing signal is generated and issued based on the first warehousing route. At the same time, a second transportation route is obtained based on the factory location information and the destination location information. A second transportation signal is generated and issued based on the second transportation route.

[0016] The economic cost of reissue includes reissue transportation cost and warehousing cost. The specific steps for obtaining the economic cost of reissue based on factory location information, destination location information, and specific warehouse location information are as follows:

[0017] The storage distance is obtained based on the current location information and the warehouse location information, and the storage cost is obtained based on the storage distance.

[0018] The reshipment distance is obtained based on the factory location information and the destination location information, and the reshipment transportation cost is obtained based on the reshipment distance.

[0019] The economic cost of reissue is the sum of the warehousing cost and the reissue transportation cost.

[0020] In some embodiments, the cargo information includes the type of goods and the required quantity, and the steps for obtaining the reshipment transportation cost based on the reshipment distance are as follows:

[0021] Based on the product type, obtain the corresponding product's inventory information, and determine the relationship between the inventory information and the required quantity.

[0022] If the inventory information exceeds the demand quantity, the transportation cost is obtained based on the factory location information and the destination location information, and the transportation cost is used as the cost of reshipment transportation.

[0023] If the inventory is less than the demand, the production time cost is obtained based on the product type and the demand, and the production transportation cost is obtained based on the factory location and the destination location. The sum of the production time cost and the production transportation cost is used as the supplementary transportation cost.

[0024] In some embodiments, the production time cost is obtained based on the type of goods and the quantity demanded, and the specific steps are as follows:

[0025] The replenishment quantity is determined based on the demand quantity and inventory information;

[0026] Based on the product type, obtain the historical production quantity and historical production time; based on the historical production quantity and historical production time, obtain the unit production time.

[0027] The production time cost is obtained based on the single-piece production time and the replenishment quantity.

[0028] In some embodiments, obtaining specific warehouse location information based on the cargo information includes the following steps:

[0029] Based on the current location information, multiple candidate warehouses are obtained from a preset second database, which stores the multiple candidate warehouses and the demand for all goods.

[0030] Based on the cargo information and the demand for all cargo, the demand for each warehouse is obtained, and the demand level of each warehouse is determined.

[0031] Based on the demand level of each warehouse, the warehouse corresponding to the maximum demand level is obtained, and the corresponding warehouse location information is obtained based on the corresponding warehouse. The corresponding warehouse location information is used as the specific warehouse location information.

[0032] In some embodiments, obtaining the demand for the goods for each candidate warehouse based on the goods information and a preset second database includes the following steps:

[0033] The system sequentially obtains all historical demand quantities for each candidate warehouse from a preset second database, and then retrieves the historical demand quantity from all historical demand quantities for the corresponding candidate warehouse based on the product information. The preset second database stores the historical demand quantities corresponding to all warehouses.

[0034] Generate the corresponding first demand value based on the obtained historical demand.

[0035] The demand score is obtained by adding the first demand values ​​of the same candidate warehouse.

[0036] In some embodiments, obtaining the demand for the goods for each candidate warehouse based on the goods information and a preset second database includes the following steps:

[0037] The system sequentially obtains all historical replenishment intervals and replenishment times of each candidate warehouse from a preset second database. Then, based on the product information, it obtains the historical replenishment intervals and replenishment times of the corresponding product from all historical replenishment intervals and replenishment times of the candidate warehouse. The preset database stores the historical replenishment intervals and replenishment times corresponding to all warehouses.

[0038] Get the current time;

[0039] The demand time is obtained by subtracting the historical replenishment interval from the most recent replenishment time. The demand value is obtained based on the demand time, and the demand values ​​corresponding to the same warehouse are added together to obtain the corresponding demand level.

[0040] Subtracting the most recent replenishment time from the current time gives the time interval. Subtracting the time interval from the historical replenishment interval gives the time difference. The corresponding second demand value is generated based on the time difference, where the second demand value is inversely proportional to the time difference.

[0041] The demand level is obtained by adding the second demand values ​​of the same candidate warehouse.

[0042] Secondly, the computer control program provided in this application adopts the following technical solution:

[0043] A computer control program that stores a control method for transporting goods that can be loaded by a server and executed.

[0044] The cargo transportation control method and computer control program provided in this application can, after discovering that the wrong goods have been sent, compare the economic costs of repositioning and reshipment, and select the priority option according to different situations. This can shorten the time for distributors to receive goods, and at the same time, prioritize the wrong goods. By considering the surrounding warehouses based on the current location information, the most cost-effective warehouse can be selected to store the wrong goods, thereby improving the factory's handling of goods and reducing the accumulation of goods in the factory and warehouse. Attached Figure Description

[0045] Figure 1 This is a flowchart of the control method for cargo transportation.

[0046] Figure 2 This is a flowchart of the steps involved in obtaining the economic cost of reissue.

[0047] Figure 3 This is a flowchart of the steps for obtaining supplementary transportation costs. Detailed Implementation

[0048] To better understand the purpose, technical solutions, and advantages of this application, it has been described and illustrated below with reference to the accompanying drawings and embodiments. However, those skilled in the art should understand that this application can be implemented without these details. In some cases, to avoid unnecessary descriptions that obscure various aspects of this application, well-known methods, processes, and systems already described at a higher level will not be elaborated upon. It will be apparent to those skilled in the art that various modifications can be made to the embodiments disclosed in this application, and the general principles defined in this application can be applied to other embodiments and application scenarios without departing from the principles and scope of this application. Therefore, this application is not limited to the illustrated embodiments, but conforms to the broadest scope consistent with the scope of protection claimed in this application.

[0049] This application discloses a method for controlling cargo transportation.

[0050] A method for controlling cargo transportation is applied to a logistics transportation control system, which includes PDA detection devices, NFC chips, and a server. Multiple PDA detection devices are installed in various distributors' stores, and the NFC chips are attached to the packaging boxes of the goods to be transported. Cargo transportation requires transport vehicles, and each vehicle can transport multiple goods at a time. If a single distributor requires a large quantity of goods, the transport vehicle can transport only the goods needed by that distributor in a single trip; if a single distributor requires a small quantity of goods, the transport vehicle can transport the goods needed by multiple distributors in a single trip.

[0051] The server plans routes based on the orders provided by the distributors and integrates order data belonging to the same route into order sets. Transport vehicles then need to transport the corresponding goods according to the planned routes.

[0052] During transportation, whenever a transport vehicle arrives at a dealer's store and is considered to be handing over goods corresponding to that store to the store's staff, the staff will scan the NFC chip of the corresponding goods using a PDA detection device. This enables the back-end host connected to the PDA detection device to obtain the goods information of this transport. At the same time, the back-end host will send the location information corresponding to the current store and the detected goods information to the factory server.

[0053] The server determines whether the shipment has been mishandled based on the location information and the detected cargo information, and performs corresponding follow-up actions based on different judgment results.

[0054] Reference Figure 1A method for controlling the transportation of goods, comprising the following steps:

[0055] S100, obtain cargo information and current location information.

[0056] The cargo information includes the cargo name, quantity, and destination location, and is recorded in the NFC chip. This cargo information can be manually entered into the NFC chip based on order information provided by the distributor, or it can be automatically entered into the NFC chip using order information.

[0057] The current location information represents the location of the dealer store where the detected goods have arrived. This current location information is pre-stored in the backend host. When the PDA detection device receives the goods information, the backend host sends the current goods information to the server. At the same time, the backend host also sends the stored location information as the current location information to the server. Therefore, the location information and goods information received by the server are in a one-to-one correspondence.

[0058] S200: Determine the corresponding preset order information from the preset first database based on the current location information.

[0059] The first database stores multiple preset order information entries, each corresponding to a different location. These preset order information entries are automatically generated when a distributor places an order. After the order information is generated, the server binds the location information of the distributor who placed the order to the preset order information and stores it in the first database for subsequent information comparison and data retrieval.

[0060] The corresponding preset order information is determined from the preset first database based on the current location information. This is done by matching the current location information with the same location information from the first database. The preset order information corresponding to the matched location information is the preset order information that needs to be determined.

[0061] After obtaining the corresponding preset order information, the following steps are also included:

[0062] S300, determine whether the goods information matches the preset order information.

[0063] Determining whether the goods information matches the preset order information involves matching the goods information with the information of each type of goods in the preset order information in turn.

[0064] If the preset order information contains information that matches the goods information, then the goods information matches the preset order information.

[0065] If the preset order information does not contain information that matches the goods information, the goods information does not match the preset order information.

[0066] When the goods information matches the preset order information, the server indicates that the corresponding goods information has been received.

[0067] S400 If the cargo information does not match the preset order information, obtain the destination location information, factory location information, and specific warehouse location information based on the cargo information.

[0068] Among them, the destination location information represents the store location information of the corresponding distributor to which the goods are to be sent, the factory location information is the dispatch location information of the goods, and the specific warehouse location information represents the storage location of the goods.

[0069] Based on the cargo information, the system retrieves destination location information, factory location information, and specific warehouse location information. Cargo information includes all current cargo details. This cargo information is obtained by scanning the NFC chip on the cargo packaging using a PDA detection device. Based on this cargo information, the system retrieves the corresponding destination and factory location information from a first database. Specific warehouse location information is then retrieved based on the cargo information and current location information. If an error is detected in the shipment, the system retrieves the specific warehouse location information using the destination and factory location information, and then sends the incorrectly shipped cargo to its storage location.

[0070] Destination location information, factory location information, and specific warehouse location information are all pre-entered into a first database and stored, and this information is also entered into the NFC chip on the shipping box. Specific warehouse location information is stored in a second database; this information is used to store the warehouse location of incorrectly shipped goods. When the number of incorrectly shipped goods is large, returning them to the factory would be costly. In this case, it is necessary to store the incorrectly shipped goods in a nearby specific warehouse. Therefore, the server needs to obtain the specific warehouse location information to quickly locate the warehouse and reduce the cost of handling incorrectly shipped goods.

[0071] The S500 calculates the economic cost of goods transfer based on current and destination location information; and calculates the economic cost of reshipment based on factory, destination, and specific warehouse location information.

[0072] Among them, destination location information is the destination to which the goods are to be sent, the economic cost of repositioning refers to the economic cost required to send the wrongly sent goods to their correct location, and the economic cost of resending refers to the economic cost of resending the goods from the factory to the destination.

[0073] When reshipping goods to the corresponding distributor at the destination, it is necessary to transfer goods from the factory to the destination, and it is also necessary to store the wrongly shipped goods. Therefore, the warehousing cost of the shipped goods and the transportation cost of the reshipment will be included as part of the economic cost of reshipment. That is, the economic cost of reshipment includes warehousing cost and reshipment transportation cost.

[0074] Specifically, the economic cost of reissue is determined based on factory location information, destination location information, and specific warehouse location information, with reference to... Figure 2 The specific steps are as follows:

[0075] S510 obtains the storage distance based on the current location information and the warehouse location information, and obtains the storage cost based on the storage distance.

[0076] S520 calculates the reshipment distance based on factory and destination location information, and then calculates the reshipment transportation cost based on the reshipment distance.

[0077] S530 uses the sum of warehousing costs and reissue transportation costs as the economic cost of reissue.

[0078] Storage distance is the distance between the current location and the warehouse location. It is the distance that needs to be transported when storing goods. Storage costs are obtained based on storage distance. Storage costs include vehicle transportation costs, transportation personnel costs, and other additional costs along the way, such as the cost of vehicle maintenance during transportation.

[0079] The reshipment distance is the distance from the factory location to the destination location. The reshipment transportation cost is based on this distance and mainly includes expenses incurred during transportation, such as the cost of transport vehicles and personnel. Both warehousing costs and reshipment transportation costs are derived from the unit price of transportation based on historical transportation distances and total transportation costs.

[0080] The economic cost of reshipment is the sum of warehousing costs and reshipment transportation costs, representing the total cost required under Mode 2. For example, based on historical information, the unit price for transportation is 10 yuan / meter. Therefore, when the warehousing distance for this shipment is 100m and the reshipment distance is 200m, the warehousing cost is 1000 yuan, the reshipment transportation cost is 2000 yuan, and the economic cost of reshipment is 3000 yuan.

[0081] Reference Figure 3 In another embodiment, to make the calculation of the economic cost of reshipment more accurate, when reshipping at the factory, it is also necessary to consider whether there is sufficient stock of goods within the factory. Therefore, the transportation cost of reshipment is obtained based on the reshipment distance, and the specific steps are as follows:

[0082] S540: Obtain the inventory information of the corresponding product based on the product type, and determine the quantity difference between the inventory information and the required quantity.

[0083] Goods information includes the type of goods and the quantity required; inventory information is the stock of the goods in the factory; and demand is the quantity of goods needed to be sent to the destination.

[0084] S550: If the inventory information is greater than the demand quantity, the transportation cost is obtained based on the factory location information and the destination location information, and the transportation cost is used as the supplementary transportation cost.

[0085] S560: If the inventory information is less than the demand quantity, the production time cost is obtained based on the product type and the demand quantity, and the production transportation cost is obtained based on the factory location information and the destination location information. The sum of the production time cost and the production transportation cost is used as the supplementary transportation cost.

[0086] When inventory exceeds demand, only transportation costs need to be considered as replacement transportation costs. When reordering from the factory, if there is no inventory, production needs to be restarted. Therefore, to more accurately determine the economic cost of replacement, when the factory has no inventory, additional production costs must be incurred. Production time costs are determined based on the type of goods and the quantity demanded.

[0087] In one embodiment, the specific steps for obtaining production time cost are as follows:

[0088] S561 determines the replenishment quantity based on demand and inventory information.

[0089] S562, obtain the historical production quantity and historical production time based on the product type, and obtain the single-piece production time based on the historical production quantity and historical production time.

[0090] S563, production time cost is obtained based on the production time of a single unit and the quantity of supplies.

[0091] The replenishment quantity is the number of goods the factory still needs to produce, calculated by subtracting inventory information from the demand quantity. Historical production quantities and times are stored in a second database. Based on the product type, the historical production quantity and time for the corresponding product are retrieved from the second database. Dividing the historical production quantity by the historical production time yields the time required to produce a single product, which is then used as the unit production time. Multiplying the unit production time by the replenishment quantity gives the production time cost required to produce that replenishment quantity of goods.

[0092] For example, suppose the destination requires 5,000 units of the goods, while the factory's inventory information shows only 3,000 units. Calculations show the factory needs to produce 2,000 units. Historically, the production time for 10,000 units of this goods was 5 days. Therefore, the production time per unit is 2,000 units per day. Since the factory needs 1 day to produce based on the replenishment quantity, the production time cost for this goods is 1 day.

[0093] S600 determines the economic cost of adjusting and reissuing goods.

[0094] After the server obtains the economic costs of restocking and resending, in order to better determine the appropriate processing mode, whether to choose mode one or mode two, it compares the economic costs of restocking and resending to decide which mode to choose.

[0095] S700: If the economic cost of repositioning goods is less than the economic cost of reshipment, a first transportation route is generated based on the destination location information and the current location information, and a first transportation signal is generated and issued based on the first transportation route.

[0096] The first transportation route is the path that goods will take from their current location to their destination during transportation. Once the server generates the first transportation route, it sends a first transportation signal to the backend host corresponding to the current location. Upon receiving the first transportation signal, the backend host will instruct staff to resend the incorrectly shipped goods according to the first transportation route.

[0097] S800: If the economic cost of transferring goods is greater than the economic cost of resupplying, the first storage route is obtained based on the current location information and the specific warehouse location information. The first storage signal is generated and issued based on the first storage route. At the same time, the second transportation route is obtained based on the factory location information and the destination location information. The second transportation signal is generated and issued based on the second transportation route.

[0098] If the economic cost of adjusting the shipment exceeds the economic cost of reshipment, and reshipment is initiated from the factory, then consideration must be given to warehousing the incorrectly shipped goods and sending a new batch of goods from the factory to the destination. The first warehousing route primarily involves transporting the incorrectly shipped goods to a designated warehouse location. The second transport route is the route taken by the factory to reship the goods to the destination. The first warehousing signal is sent by the server to the backend host at the current location to remind the current transport personnel to execute the second transport route. The second transport signal is a processing signal sent by the server to the factory, enabling the factory to make synchronous judgments, thereby reducing delays in transportation and improving the efficiency of receiving goods for distributors.

[0099] It should be noted that there are multiple candidate warehouses near the current location. Through server calculation, the candidate warehouse with the lowest warehousing economic cost is selected as the specific warehouse. The location of the specific warehouse is then stored as specific warehouse location information in the second database, so that the server can quickly obtain this information later.

[0100] In another embodiment, the incorrectly shipped goods are stored. The demand for these goods varies among potential warehouses near the current location. Since each potential warehouse has multiple distributors nearby, the sum of the demand from each distributor is taken as the demand for that warehouse. Suppose one of the potential warehouses has a low demand for the goods; storing the incorrectly shipped goods in that warehouse would lead to an accumulation of these goods. Therefore, obtaining specific warehouse location information based on the goods information includes the following steps:

[0101] S410: Based on the current location information, retrieve multiple candidate warehouses and all demand levels from the preset second database;

[0102] S420: Based on the cargo information and the demand for all cargo, obtain the demand for each warehouse and determine the demand level of each warehouse;

[0103] S430: Based on the demand level of each warehouse, obtain the warehouse corresponding to the maximum demand level, obtain the corresponding warehouse location information based on the corresponding warehouse, and use the corresponding warehouse location information as the specific warehouse location information.

[0104] The candidate warehouses are selected based on the current location information of the goods, encompassing multiple warehouses in the vicinity. A pre-set second database stores these candidate warehouses along with their respective demand scores. The total demand score represents the demand for each type of goods from multiple distributors near the warehouses, as stored in the second database. The demand score for a warehouse is the sum of the demand scores for each type of goods from the distributors associated with that warehouse.

[0105] Based on the current location information, multiple candidate warehouses are obtained from the preset second database. Considering obtaining the current location based on the current location information, and using the current location as the center, some warehouses that are closer to the current location are selected as candidate warehouses.

[0106] Based on the aforementioned cargo information and the demand for all cargoes, the demand for each warehouse is obtained. First, the demand for the corresponding cargo is obtained from the cargo information; this demand is the total demand for that cargo from all distributors. Then, multiple distributors are retrieved from the second database based on the candidate warehouses. Each distributor's demand for the corresponding cargo is then selected from the demand for that cargo. It should be noted that there is a one-to-one correspondence between each distributor and its corresponding cargo demand. Finally, the demand for that cargo from each warehouse's corresponding distributors is summed to obtain the demand for that cargo for each warehouse.

[0107] Based on the demand level of each warehouse, the warehouse corresponding to the highest demand level is obtained. All candidate warehouses are then sorted by their demand levels, and the warehouse with the highest demand level among the candidate warehouses is selected as the corresponding warehouse. In another embodiment, to enable the server to make a better selection, the historical demand level of each warehouse is used for prediction. During use, corresponding order information is obtained through the goods information, thereby obtaining the corresponding demand level for that warehouse.

[0108] Based on cargo information and a pre-set second database, the demand for the cargo in each candidate warehouse is obtained, including the following steps:

[0109] S421, sequentially obtain all historical demand quantities of the corresponding candidate warehouse from the preset second database for each candidate warehouse.

[0110] S422, then obtain the historical demand from all historical demand from the corresponding candidate warehouses based on the product information. The preset second database stores the historical demand corresponding to all warehouses.

[0111] S423, Generate the corresponding first demand value based on the obtained historical demand.

[0112] S424, sum the first demand values ​​of the same candidate warehouse to obtain the demand degree.

[0113] Historical demand refers to the demand for goods from distributors corresponding to each warehouse. This demand is obtained from a second database. The pre-set second database primarily stores historical data for all goods, including the historical demand for each warehouse. The initial demand value for each candidate warehouse is proportional to its corresponding historical demand. The initial demand value is usually manually assigned; each distributor has a corresponding initial demand value for the same goods. The initial demand values ​​of multiple distributors corresponding to a candidate warehouse are then summed to determine the demand level for that warehouse, representing the degree of demand for that goods in that warehouse.

[0114] In this embodiment, it is assumed that there are distributors 1, 2, 3, 4, and 5, and candidate warehouses a, b, and c. Distributors 1 and 2 pick up goods from candidate warehouse a, distributor 3 picks up goods from candidate warehouse b, and distributors 4 and 5 pick up goods from candidate warehouse c. The historical demand of the five distributors 1, 2, 3, 4, and 5 is 1000, 1800, 2000, 2800, and 2000, respectively. At this time, the five distributors 1, 2, 3, 4, and 5 are assigned different first demand values, which are 40, 50, 70, 80, and 45, respectively. After processing, the server obtains the first demand values ​​of the three candidate warehouses a, b, and c as 90, 70, and 125, respectively. Thus, it can be seen that the first demand value of each candidate warehouse is proportional to its corresponding historical demand.

[0115] In another embodiment, for multiple candidate warehouses, although the historical demand for a certain warehouse is very high, it is assumed that the distributor corresponding to that warehouse has recently purchased a batch of the same goods. Therefore, the impact of the historical demand on that warehouse is not so great. In this case, it is possible to obtain another way to calculate the demand for the same goods for each warehouse by determining whether the distributors among the multiple candidate warehouses have a history of purchasing new goods.

[0116] Based on cargo information and a pre-set second database, the demand for the cargo in each candidate warehouse is obtained, including the following steps:

[0117] S425, sequentially obtain all historical replenishment intervals and replenishment times of each candidate warehouse from the preset second database.

[0118] S426, then based on the product information, retrieve the historical replenishment interval and replenishment time of the corresponding product from all historical replenishment intervals and replenishment times of the corresponding candidate warehouses. The preset database stores the historical replenishment intervals and replenishment times corresponding to all warehouses.

[0119] S427, Get the current time.

[0120] S428, the time interval is obtained by subtracting the most recent replenishment time from the current time, the time difference is obtained by subtracting the time interval from the historical replenishment interval, and the corresponding second demand value is generated based on the time difference. The second demand value is inversely proportional to the time difference.

[0121] S429, add the second demand values ​​of the same candidate warehouse to obtain the demand degree.

[0122] In this embodiment, the second demand value is generated based on the time difference in the demand for goods by each distributor. The time difference is used to determine whether distributors near the warehouse have recently replenished their stock and whether their demand for the goods is high. The calculation method for the demand level is the same as that for the first demand value: the second demand value for each distributor is calculated, and then the second demand values ​​of each distributor for the same candidate warehouse are accumulated. The accumulated value is used as the demand level for the candidate warehouse. Finally, the demand levels of each warehouse are compared to obtain the specific warehouse location information.

[0123] For example, suppose there are distributors 1, 2, and 3, and candidate warehouses a, b, and c. Distributor 1 picks up goods from candidate warehouse a, distributor 2 from candidate warehouse b, and distributor 3 from candidate warehouse c. The second demand value for distributor 1 in candidate warehouse a is calculated by obtaining a time interval of 3 days from a second database. The current date is October 19, 2021, and the last replenishment date was October 17, 2021. Therefore, distributor 1's time difference is 2 days. Similarly, distributor 2's time difference is 4 days, and distributor 3's time difference is 5 days. Because distributor 1's time difference is 2 days, distributor 1's demand for the goods will be high. A corresponding second demand value is assigned to each distributor based on their time difference: distributor 1's second demand value is 80, distributor 2's is 50, and distributor 3's is 40. This second demand value is used as the demand level for the corresponding candidate warehouse. When multiple distributors correspond to the same candidate warehouse, the second demand values ​​of all distributors in the same candidate warehouse are simply summed to obtain the demand level for that candidate warehouse.

[0124] When a server detects that goods have been sent to the wrong destination during goods transportation, it will process the information in its database and issue a corresponding processing order. Two modes are available: Mode 1 is to send the incorrectly sent goods to the correct location and then retrieve the goods from a nearby warehouse. Mode 2 is to store the incorrectly sent goods and then resend them from the factory to the destination. The optimal choice between these two modes is primarily determined by their economic costs. If, upon discovering the error, the goods are in stock at a nearby warehouse, the database will generate and issue a signal to execute Mode 1. If the nearest warehouse does not have stock, the goods must be shipped from the factory, in which case the database will generate and issue a signal to execute Mode 2. If the warehouse has stock and the volume of goods is large, the optimal mode must be considered. Therefore, the best solution is selected by calculating the economic costs of both modes.

[0125] This application also discloses a computer control program, on which the computer control program is stored, and when the computer control program is executed by the server, it implements the above-mentioned cargo transportation control method.

Claims

1. A method for controlling cargo transportation, characterized in that, Includes the following steps: Obtain cargo information and current location information; Based on the current location information, the corresponding preset order information is determined from a preset first database, wherein the first database stores multiple preset order information, and each preset order information corresponds to different location information; Determine whether the goods information matches the preset order information; if the goods information does not match the preset order information. Based on the cargo information, destination location information, factory location information, and specific warehouse location information are obtained, wherein the specific warehouse location information represents the cargo storage location. The economic cost of goods transfer is obtained based on the current location information and the destination location information; the economic cost of re-issuance is obtained based on the factory location information, the destination location information, and the specific warehouse location information; Determine the magnitude of the economic cost of the goods transfer and the economic cost of the reissue; If the economic cost of the relocation is less than the economic cost of the replacement, a first transportation route is generated based on the destination location information and the current location information, and a first transportation signal is generated and issued based on the first transportation route. If the economic cost of the transfer is greater than the economic cost of the reissue, a first storage route is obtained based on the current location information and the specific warehouse location information, a first storage signal is generated and issued based on the first storage route, and a second transportation route is obtained based on the factory location information and the destination location information, and a second transportation signal is generated and issued based on the second transportation route. The economic cost of reissue includes reissue transportation cost and warehousing cost. The specific steps for obtaining the economic cost of reissue based on the factory location information, destination location information, and specific warehouse location information are as follows: The storage distance is obtained based on the current location information and the warehouse location information, and the storage cost is obtained based on the storage distance. The re-shipment distance is obtained based on the factory location information and the destination location information, and the re-shipment transportation cost is obtained based on the re-shipment distance. The economic cost of reissue is the sum of the warehousing cost and the reissue transportation cost. Obtaining the specific warehouse location information based on the cargo information includes the following steps: Based on the current location information, multiple candidate warehouses are obtained from a preset second database. The preset second database stores multiple candidate warehouses and the demand for all goods. Based on the cargo information and the demand for all cargo, the demand for each warehouse is obtained, and the demand level of each warehouse is determined. Based on the demand level of each warehouse, the warehouse corresponding to the maximum demand level is obtained, and the corresponding warehouse location information is obtained based on the corresponding warehouse. The corresponding warehouse location information is used as the specific warehouse location information.

2. The method for controlling cargo transportation according to claim 1, characterized in that: The cargo information includes the type of goods and the required quantity. The specific steps for obtaining the reshipment transportation cost based on the reshipment distance are as follows: Based on the product type, obtain the corresponding product inventory information and determine the quantity difference between the inventory information and the required quantity; If the inventory information is greater than the demand quantity, then the transportation cost is obtained based on the factory location information and the destination location information, and the transportation cost is used as the supplementary transportation cost. If the inventory information is less than the required quantity, then the production time cost is obtained based on the product type and the required quantity, and the production transportation cost is obtained based on the factory location information and the destination location information. The sum of the production time cost and the production transportation cost is used as the supplementary transportation cost.

3. The method for controlling cargo transportation according to claim 2, characterized in that: The production time cost is then obtained based on the type of goods and the required quantity, and the specific steps are as follows: The replenishment quantity is determined based on the demand quantity and inventory information; Based on the product type, obtain the historical production quantity and historical production time, and based on the historical production quantity and historical production time, obtain the unit production time. The production time cost is obtained based on the single-piece production time and the replenishment quantity.

4. The method for controlling cargo transportation according to claim 1, characterized in that, The process of obtaining the demand for the goods for each candidate warehouse based on the goods information and a preset second database includes the following steps: The system sequentially obtains all historical demand quantities for each candidate warehouse from a preset second database, and then retrieves the historical demand quantity from all historical demand quantities for each candidate warehouse based on the product information. The preset second database stores the historical demand quantities corresponding to all warehouses. Generate the corresponding first demand value based on the obtained historical demand. The demand score is obtained by adding the first demand values ​​of the same candidate warehouse.

5. The method for controlling cargo transportation according to claim 1, characterized in that, The process of obtaining the demand for the goods for each candidate warehouse based on the goods information and a preset second database includes the following steps: The system sequentially obtains all historical replenishment intervals and replenishment times of each candidate warehouse from a preset second database. Then, based on the product information, it obtains the historical replenishment intervals and replenishment times of the corresponding product from all historical replenishment intervals and replenishment times of the candidate warehouse. The preset second database stores the historical replenishment intervals and replenishment times corresponding to all warehouses. Get the current time; Subtracting the historical replenishment interval from the most recent replenishment time yields the demand time. Based on the demand time, the demand value is obtained. The demand values ​​corresponding to the same warehouse are added together to obtain the corresponding demand level. Subtracting the most recent replenishment time from the current time gives the time interval. Subtracting the time interval from the historical replenishment interval gives the time difference. The corresponding second demand value is generated based on the time difference, where the second demand value is inversely proportional to the time difference. The demand level is obtained by adding the second demand values ​​of the same candidate warehouse.

6. A computer control program, characterized in that: When the computer control program is executed by the server, it implements the cargo transportation control method according to any one of claims 1 to 5.