Logistics transportation scheme determination method and device

Abstract

The invention relates to the technical field of logistics, and provides a logistics transportation scheme determination method and device. The method comprises the following steps: splitting a logistics order according to the number of required carriages to obtain a plurality of waybills; generating a plurality of transportation schemes of each waybill according to the transportation route of the carrier; calculating the minimum value of the total transportation cost of optional transportation schemes in the plurality of transportation schemes under the constraint of the transportation scheme quantity, the loading resources of each warehouse and the transportation resources of each carrier in each warehouse; and determining the transportation scheme corresponding to the minimum value as the transportation scheme of the goods in the logistics order. According to the logistics transportation scheme determination method and device provided by the invention, mathematical modeling is carried out under the constraint of an actual business scene, the total transportation cost is calculated by adopting an automatic algorithm, and the transportation scheme is determined according to the minimum total cost, so that on one hand, compared with a manual method, the accuracy and efficiency are improved; the method can be suitable for various actual business scenes such as road transportation and highway-railway combined transportation.

Description

Technical Field

[0001] The present application relates to the field of logistics technology, and in particular to a method and device for determining a logistics transportation plan. Background Art

[0002] Logistics and transportation planning is the process in which dispatchers formulate the best logistics and transportation route plan based on various factors of a batch of orders or goods to minimize the total transportation cost.

[0003] The current logistics transportation modes are mainly divided into road transportation and road-rail combined transportation. However, because there are too many factors to consider in scheduling and the plans are too complex, the traditional method of formulating transportation plans by manpower is difficult to give the most accurate transportation plan in a short time, and the traditional automated programming solution method is not suitable for the road-rail combined transportation mode. Therefore, the current logistics transportation plan determination method has low accuracy and efficiency, and a narrow scope of application. Summary of the invention

[0004] The embodiments of the present application provide a method and device for determining a logistics transportation plan, which is used to solve the problem that the traditional method of formulating transportation plans manually is difficult to provide the most accurate transportation plan in a short period of time, and the traditional automated programming solution method is not suitable for the mode of combined road and rail transport. Therefore, the current method for determining logistics transportation plans has low accuracy and efficiency and a narrow scope of application. Technical problems.

[0005] In a first aspect, an embodiment of the present application provides a method for determining a logistics transportation plan, comprising: The logistics order is split according to the required number of trucks and boxes to obtain multiple waiting orders; Generate multiple transportation plans for each shipping order based on the carrier's transportation routes; Under the constraints of the number of transportation schemes, the loading resources of each warehouse, and the transportation resources of each carrier at each warehouse, calculating the minimum value of the total transportation cost of the optional transportation schemes among the multiple transportation schemes; The transportation plan corresponding to the minimum value is determined as the transportation plan for the goods in the logistics order.

[0006] In one embodiment, the calculating the total transportation cost of the optional transportation options among the multiple transportation options includes: Calculate the transportation costs of each optional transportation plan for any waiting order according to the transportation routes corresponding to each optional transportation plan for the waiting order; The transportation costs of each optional transportation plan for each shipping order are added up to obtain the total transportation costs of the optional transportation plans among the multiple transportation plans.

[0007] In one embodiment, the optional transportation scheme is determined based on the following method: If, among the multiple transportation plans, the cargo inventory of the warehouse corresponding to any transportation plan is greater than the demand for the same type of cargo in the corresponding shipping order, and the estimated arrival time of any transportation plan is not later than the required delivery time of the corresponding shipping order, then any transportation plan is determined to be an optional transportation plan.

[0008] In one embodiment, the calculating of the transportation costs of each optional transportation scheme of any waiting waybill according to the transportation routes corresponding to each optional transportation scheme of any waiting waybill includes: If any optional transportation plan of any of the waiting waybills is a road transport route plan, the transportation cost of the road transport route plan is calculated.

[0009] In one embodiment, the calculating of the transportation cost of the truck transportation route plan includes: The transportation cost of the road transport route plan is obtained according to the cargo tonnage of any of the waybills to be shipped, the road transport navigation mileage of the road transport route plan and the road transport ton-kilometer freight rate of the road transport route plan.

[0010] In one embodiment, the calculating of the transportation costs of each optional transportation scheme of any waiting waybill according to the transportation routes corresponding to each optional transportation scheme of any waiting waybill includes: If any optional transportation plan of any of the shipping orders is a road-rail combined transport route plan, the transportation cost of the road-rail combined transport route plan is calculated.

[0011] In one embodiment, the calculating of the transportation cost of the road-rail combined transport route plan includes: The transportation cost of the road-rail transport route plan is obtained based on the cargo tonnage of any of the waybills, the railway freight rate per ton of the road-rail transport route plan, the road navigation mileage of the road-rail transport route plan, the road ton-kilometer freight rate of the road-rail transport route plan and the road-rail transfer fee of the road-rail transport route plan.

[0012] In a second aspect, an embodiment of the present application provides a logistics transportation plan determination device, including: The order splitting module is used to split the logistics order according to the required number of trucks and boxes to obtain multiple waiting orders; The transport plan generation module is used to generate multiple transport plans for each shipping order according to the transport routes of the carrier; A total transportation cost minimization module is used to calculate the minimum value of the total transportation cost of the optional transportation plans among the multiple transportation plans under the constraints of the number of transportation plans, the loading resources of each warehouse and the transportation resources of each carrier at each warehouse; The transportation plan determination module is used to: determine the transportation plan corresponding to the minimum value as the transportation plan for the goods in the logistics order.

[0013] In a third aspect, an embodiment of the present application provides an electronic device, comprising a processor and a memory storing a computer program, wherein when the processor executes the program, the steps of the method for determining a logistics transportation plan described in the first aspect are implemented.

[0014] In a fourth aspect, an embodiment of the present application provides a computer program product, including a computer program, which, when executed by a processor, implements the steps of the method for determining a logistics transportation plan described in the first aspect.

[0015] The method and device for determining a logistics transportation plan provided in the present application splits the logistics order according to the required number of carriages to obtain multiple waiting orders, generates multiple transportation plans for each waiting order according to the carrier's transportation route, and calculates the minimum total transportation cost of the optional transportation plans in multiple transportation plans under the constraints of the number of transportation plans, the loading resources of each warehouse, and the transportation resources of each carrier in each warehouse, and determines the transportation plan corresponding to the minimum value as the transportation plan for the goods in the logistics order. The method of the present application is to perform mathematical modeling under the constraints of actual business scenarios, and use an automated algorithm to calculate the total transportation cost, and determine the transportation plan based on the minimum total cost. On the one hand, it improves the accuracy and efficiency compared to manual methods, and on the other hand, it can be applied to a variety of actual business scenarios such as road transportation and road-rail combined transportation. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] In order to more clearly illustrate the technical solutions in the present application or the prior art, a brief introduction will be given below to the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0017] Figure 1 This is one of the flow charts of the method for determining a logistics transportation plan provided in an embodiment of the present application; Figure 2 This is the second flow chart of the method for determining a logistics transportation plan provided in an embodiment of the present application; Figure 3 It is a structural schematic diagram of a device for determining a logistics transportation plan provided in an embodiment of the present application; FIG. 4 is a schematic diagram of the structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0018] In order to make the purpose, technical solutions and advantages of this application clearer, the technical solutions in this application will be clearly and completely described below in conjunction with the drawings in the embodiments of this application. Obviously, the described embodiments are part of the embodiments of this application, not all of them. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0019] It should be noted that in the description of the embodiments of the present application, the terms "include", "comprise" or any other variant thereof are intended to cover non-exclusive inclusion, so that the process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "including one..." do not exclude the existence of other identical elements in the process, method, article or device including the elements. The orientation or position relationship indicated by the terms "upper", "lower" and the like is based on the orientation or position relationship shown in the drawings, which is only for the convenience of describing the present application and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as a limitation on the present application. Unless otherwise clearly specified and limited, the terms "installed", "connected" and "connected" should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be directly connected, or indirectly connected through an intermediate medium, or it can be a connection between the two elements. For those skilled in the art, the specific meanings of the above terms in this application can be understood according to specific circumstances.

[0020] The terms "first", "second", etc. in this application are used to distinguish similar objects, and are not used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present application can be implemented in an order other than those illustrated or described here, and the objects distinguished by "first", "second", etc. are generally of one type, and the number of objects is not limited. For example, the first object can be one or more. In addition, "and / or" represents at least one of the connected objects, and the character " / " generally indicates that the objects associated with each other are in an "or" relationship.

[0021] Figure 1 This is one of the flow charts of the method for determining a logistics transportation plan provided in the embodiment of the present application. Figure 1 , the embodiment of the present application provides a method for determining a logistics transportation plan, which may include: 101. Split the logistics order according to the required number of trucks and boxes to obtain multiple waiting orders; 102. Generate multiple transportation plans for each shipping order based on the carrier's transportation routes; 103. Under the constraints of the number of transportation plans, the loading resources of each warehouse, and the transportation resources of each carrier at each warehouse, calculate the minimum value of the total transportation cost of the optional transportation plans among multiple transportation plans; 104. The transportation plan corresponding to the minimum value is determined as the transportation plan for the goods in the logistics order.

[0022] In the logistics and transportation of bulk industries, the ordered goods are delivered from the warehouse to the customer's designated delivery location in full truckloads. The dispatchers of the cargo owner companies need to formulate a combination of transportation plans with better transportation costs for the orders to be dispatched based on the remaining inventory of the category of goods in each warehouse at that time, the number of truckloads that can be loaded in the warehouse, the available vehicle models and freight rates of the carriers that can support the warehouse and the route, the railway routes and freight rates, the railway post-truck transshipment price, the transportation time and other factors.

[0023] In step 101, assuming that each vehicle has one box, the number of boxes is the number of vehicles. For example, if the required number of boxes for the logistics order is 3, the logistics order can be split into 3 waiting orders, each of which is transported by a full vehicle. The actual quantity of each waiting order is the ratio of the total quantity of the logistics order to the number of boxes. Apart from this, the other information of each waiting order is exactly the same as the original logistics order.

[0024] In step 102, the carrier must have a route to the destination of the shipping order.

[0025] The basic business in this scenario is: Warehouses in different locations, At least one of the shipping location and the receiving location has different waiting orders. As long as the warehouse can meet the cargo categories and corresponding cargo volume requirements of the waiting order, it can be used as an optional warehouse for the waiting order. The optional warehouse shipment must be transported by a carrier. Each optional warehouse has The routes and freight rates that different carriers can send are different, and some carriers have rail transportation capabilities. Whether it is truck transportation or rail transportation, the route pricing rules are clear. Therefore, our scheduling goal is to select optional warehouses and delivery carriers for the waiting orders to minimize the total transportation cost of each waiting order. According to the above hierarchical relationship, the maximum number of transportation plans for each waiting order is Among them, , , can be set according to actual conditions and are not limited here. In this embodiment, Set to a positive integer less than or equal to 10. Set to a positive integer less than or equal to 1000. Set to a positive integer less than or equal to 10.

[0026] In step 103, the above scheduling objectives can be converted into a batch of waiting orders, each waiting order has a different number of transportation plans, and the execution of each transportation plan has a certain transportation freight. When the transportation is executed, it is necessary to consume 1 loading resource of the corresponding optional warehouse, consume 1 car box inventory of the corresponding goods in the optional warehouse, and consume 1 transportation resource of the corresponding carrier in the optional warehouse. For each waiting order, select the optional transportation plan from its multiple transportation plans, and then select a transportation plan from the optional transportation plans. Under the upper limit constraints of the loading resources of each warehouse and the transportation resources of each carrier in each warehouse, solve how to select the transportation plan for this batch of waiting orders so that the total transportation cost is minimized. Among them, each variable can be restricted to an integer, and integer programming is used to ensure the optimal solution under the current data complexity.

[0027] From the above, we can see that the algorithm model can be expressed as: 1. Waiting order: , indicating the A shipping order; 2. Warehouse: , indicating the warehouses; 3. Carrier: , indicating the a carrier; 4. Transportation plan: For The transportation plan of a waiting order can be represented by a binary express; 5. Loading resources: The maximum loading resource of a warehouse is ; 6. Transportation resources: The carrier in The available transportation resources for a warehouse are , the transportation cost is .

[0028] 7. Decision variables: For the Shipping orders and their corresponding transportation plans , define the binary variable , whose values ​​are: , indicating the Transport plan for waiting orders ; , indicating the No transport plan is adopted for the shipping order .

[0029] The objective function is: ; in, The total shipping cost for the optional shipping options.

[0030] Constraints: 1. Each shipping order can only choose one transportation plan and can be transported at most once, that is: ; 2. Loading resource restrictions at each warehouse, namely: ; 3. The transportation resource restrictions of each carrier at each warehouse, namely: ; 4. Other constraint extensions.

[0031] In a 4-core 8G server, for less than 1,000 shipping orders, 10 warehouses, and less than 10 carriers in each warehouse, the algorithm response time is less than 0.5 seconds, and the transportation plan determination efficiency is relatively high.

[0032] The method for determining a logistics transportation plan provided in this embodiment is to split the logistics order according to the required number of carriages to obtain multiple waiting orders, generate multiple transportation plans for each waiting order according to the carrier's transportation route, and calculate the minimum value of the total transportation cost of the optional transportation plans in the multiple transportation plans under the constraints of the number of transportation plans, the loading resources of each warehouse, and the transportation resources of each carrier in each warehouse, and determine the transportation plan corresponding to the minimum value as the transportation plan for the goods in the logistics order. The method of this embodiment is to perform mathematical modeling under the constraints of the actual business scenario, and use an automated algorithm to calculate the total transportation cost, and determine the transportation plan according to the minimum total cost. On the one hand, compared with the manual method, it improves the accuracy and efficiency, and on the other hand, it can be applied to various actual business scenarios such as road transportation and road-rail combined transportation.

[0033] Figure 2 This is the second flow chart of the method for determining a logistics transportation plan provided in the embodiment of the present application. Figure 2 In one embodiment, calculating the total transportation cost of the optional transportation options among multiple transportation options may include: 201. Calculate the transportation costs of each optional transportation scheme for any shipping order according to the transportation routes corresponding to each optional transportation scheme for the shipping order; 202. The transportation costs of each optional transportation plan for each shipping order are added up to obtain the total transportation costs of the optional transportation plans among the multiple transportation plans.

[0034] The input information in the algorithm can be as follows: The shipping order information may include order number, consignee, delivery address, cargo name, cargo demand (tons), required number of trucks (full truck), and required delivery time; Warehouse information may include warehouse name, warehouse address, and cargo inventory (full truckload); The carrier information may include the carrier name and the carrier's transportation resources at each warehouse; The freight rate information of the public transport routes supported by the carrier at each warehouse may include the name of the carrier, the name of the warehouse, the name of the route, and the ton-kilometer freight rate (yuan); The railway route freight rate information supported by the carrier at each warehouse may include the carrier name, warehouse name, railway destination station, railway destination station address, railway freight rate per ton (yuan), road-rail transshipment fee (yuan), railway time consumption (days), and post-haul road freight rate per ton-kilometer (yuan); Wherein, step 201 may be specifically as follows: 201a. If any of the optional transport options for the waybill is a road transport route option, calculate the transport cost of the road transport route option, for example: The transportation cost of the road transport route is obtained based on the cargo tonnage of the road transport order, the road transport navigation mileage of the road transport route plan, and the road transport ton-kilometer freight rate of the road transport route plan. , as shown in the following formula: ; in, is the cargo tonnage of the shipping order. is the navigation mileage of the bus route plan. It is the ton-kilometer freight rate for this road transport route plan.

[0035] 201b. If any of the optional transport options of the waybill is a road-rail combined transport route, calculate the transport cost of the road-rail combined transport route, for example: The transportation cost of the road-rail combined transport route is obtained according to the cargo tonnage of the shipping order, the railway freight rate per ton of the road-rail combined transport route, the road-rail combined transport route navigation mileage, the road-rail combined transport route ton-kilometer freight rate and the road-rail transshipment fee of the road-rail combined transport route. , as shown in the following formula: ; in, is the cargo tonnage of the shipping order. is the railway freight rate per ton for this road-rail combined transport route plan, It is the road navigation mileage of the combined road and rail transport route plan. is the ton-kilometer freight rate for the combined road-rail transport route. It is the road-rail transfer fee of this road-rail combined transport route plan.

[0036] It should be noted that the navigation distance between the railway station and the destination shall not exceed 500 kilometers.

[0037] This embodiment calculates respectively according to the characteristics of different transportation routes to obtain accurate transportation costs for each transportation route, which helps to obtain accurate total transportation costs by subsequent aggregation.

[0038] In one embodiment, the optional transportation scheme can be determined based on the following method: If, among multiple transportation plans, the inventory of goods in the warehouse corresponding to any transportation plan is greater than the demand for the same goods in the corresponding waiting order, and the estimated arrival time of the transportation plan is not later than the required delivery time of the corresponding waiting order, then the transportation plan is determined to be an optional transportation plan, that is, The corresponding transportation plan.

[0039] If the transportation plan is a road transport route plan, the estimated arrival time can be calculated according to the following formula: : ; in, is the current date, is the time taken for the auto navigation, in days and rounded up. is the loading time, which can be set according to the actual situation and is not limited here. In this embodiment, it can be set to 0.5 days.

[0040] If the transport plan is a road-rail combined transport route plan, the estimated arrival time can be calculated according to the following formula : ; in, is the current date, Railway transportation takes time. It is the road-rail transfer that takes time. is the time taken for the subsequent vehicle navigation, in days and rounded up. It can be set according to actual conditions and is not limited here. In this embodiment, it can be set to 0.5 days.

[0041] This embodiment uses constraint conditions to screen optional transportation solutions, which can greatly reduce the optional transportation solutions for each shipping order, thereby greatly reducing the complexity of the solution.

[0042] The following is a description of a logistics transportation plan determination device provided in an embodiment of the present application. The logistics transportation plan determination device described below and the logistics transportation plan determination method described above can be referenced to each other.

[0043] Figure 3 Schematic diagram of the structure of the logistics transportation plan determination device provided in the embodiment of the present application. Figure 3 , the embodiment of the present application provides a logistics transportation plan determination device, which may include: The order splitting module 301 is used to split the logistics order according to the required number of trucks and boxes to obtain multiple waiting orders; The transport plan generation module 302 is used to generate multiple transport plans for each shipping order according to the transport routes of the carrier; The total transportation cost minimization module 303 is used to calculate the minimum value of the total transportation cost of the optional transportation solutions among the multiple transportation solutions under the constraints of the number of transportation solutions, the loading resources of each warehouse and the transportation resources of each carrier at each warehouse; The transportation plan determination module 304 is used to determine the transportation plan corresponding to the minimum value as the transportation plan for the goods in the logistics order.

[0044] The logistics transportation plan determination device provided in this embodiment splits the logistics order according to the required number of carriages to obtain multiple waiting orders, generates multiple transportation plans for each waiting order according to the carrier's transportation route, and calculates the minimum value of the total transportation cost of the optional transportation plans in the multiple transportation plans under the constraints of the number of transportation plans, the loading resources of each warehouse, and the transportation resources of each carrier in each warehouse, and determines the transportation plan corresponding to the minimum value as the transportation plan for the goods in the logistics order. The method of this embodiment is to perform mathematical modeling under the constraints of the actual business scenario, and use an automated algorithm to calculate the total transportation cost, and determine the transportation plan according to the minimum total cost. On the one hand, it improves the accuracy and efficiency compared with the manual method, and on the other hand, it can be applied to various actual business scenarios such as road transportation and road-rail combined transportation.

[0045] In one embodiment, the total transportation cost minimization module 303 is specifically used to: Calculate the transportation costs of each optional transportation plan for any waiting order according to the transportation routes corresponding to each optional transportation plan for the waiting order; The transportation costs of each optional transportation plan for each shipping order are added up to obtain the total transportation costs of the optional transportation plans among the multiple transportation plans.

[0046] In one embodiment, it further includes an optional transportation solution determination module (not shown in the figure) for: If, among the multiple transportation plans, the cargo inventory of the warehouse corresponding to any transportation plan is greater than the demand for the same type of cargo in the corresponding shipping order, and the estimated arrival time of any transportation plan is not later than the required delivery time of the corresponding shipping order, then any transportation plan is determined to be an optional transportation plan.

[0047] In one embodiment, the total transportation cost minimization module 303 is specifically used to: If any optional transportation plan of any of the waiting waybills is a road transport route plan, the transportation cost of the road transport route plan is calculated.

[0048] In one embodiment, the total transportation cost minimization module 303 is specifically used to: The transportation cost of the road transport route plan is obtained according to the cargo tonnage of any of the waybills to be shipped, the road transport navigation mileage of the road transport route plan and the road transport ton-kilometer freight rate of the road transport route plan.

[0049] In one embodiment, the total transportation cost minimization module 303 is specifically used to: If any optional transportation plan of any of the shipping orders is a road-rail combined transport route plan, the transportation cost of the road-rail combined transport route plan is calculated.

[0050] In one embodiment, the total transportation cost minimization module 303 is specifically used to: The transportation cost of the road-rail transport route plan is obtained based on the cargo tonnage of any of the waybills, the railway freight rate per ton of the road-rail transport route plan, the road navigation mileage of the road-rail transport route plan, the road ton-kilometer freight rate of the road-rail transport route plan and the road-rail transfer fee of the road-rail transport route plan.

[0051] FIG4 is a schematic diagram of the structure of an electronic device provided in an embodiment of the present application. Figure 4 As shown, the electronic device may include: a processor 410, a communication interface 420, a memory 430 and a communication bus 440, wherein the processor 410, the communication interface 420 and the memory 430 communicate with each other through the communication bus 440. The processor 410 may call a computer program in the memory 430 to execute the steps of the method for determining a logistics transportation plan, for example, including: The logistics order is split according to the required number of trucks and boxes to obtain multiple waiting orders; Generate multiple transportation plans for each shipping order based on the carrier's transportation routes; Under the constraints of the number of transportation schemes, the loading resources of each warehouse, and the transportation resources of each carrier at each warehouse, calculating the minimum value of the total transportation cost of the optional transportation schemes among the multiple transportation schemes; The transportation plan corresponding to the minimum value is determined as the transportation plan for the goods in the logistics order.

[0052] In addition, the logic instructions in the above-mentioned memory 430 can be implemented in the form of a software functional unit and can be stored in a computer-readable storage medium when it is sold or used as an independent product. Based on this understanding, the technical solution of the present application can be essentially or partly embodied in the form of a software product that contributes to the prior art. The computer software product is stored in a storage medium, including several instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk, etc. Various media that can store program codes.

[0053] On the other hand, an embodiment of the present application further provides a computer program product, the computer program product including a computer program, the computer program can be stored on a non-transitory computer-readable storage medium, and when the computer program is executed by a processor, the computer can perform the steps of the method for determining a logistics transportation plan provided in the above embodiments, for example, including: The logistics order is split according to the required number of trucks and boxes to obtain multiple waiting orders; Generate multiple transportation plans for each shipping order based on the carrier's transportation routes; Under the constraints of the number of transportation schemes, the loading resources of each warehouse, and the transportation resources of each carrier at each warehouse, calculating the minimum value of the total transportation cost of the optional transportation schemes among the multiple transportation schemes; The transportation plan corresponding to the minimum value is determined as the transportation plan for the goods in the logistics order.

[0054] On the other hand, an embodiment of the present application further provides a non-transitory computer-readable storage medium on which a computer program is stored, wherein the computer program is used to enable a processor to execute the steps of the method for determining a logistics transportation plan provided in the above embodiments, for example, including: The logistics order is split according to the required number of trucks and boxes to obtain multiple waiting orders; Generate multiple transportation plans for each shipping order based on the carrier's transportation routes; Under the constraints of the number of transportation schemes, the loading resources of each warehouse, and the transportation resources of each carrier at each warehouse, calculating the minimum value of the total transportation cost of the optional transportation schemes among the multiple transportation schemes; The transportation plan corresponding to the minimum value is determined as the transportation plan for the goods in the logistics order.

[0055] The non-transitory computer-readable storage medium can be any available medium or data storage device that can be accessed by the processor, including but not limited to magnetic storage (such as floppy disks, hard disks, magnetic tapes, magneto-optical disks (MO), etc.), optical storage (such as CD, DVD, BD, HVD, etc.), and semiconductor storage (such as ROM, EPROM, EEPROM, non-volatile memory (NAND FLASH), solid-state drive (SSD)), etc.

[0056] The device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of this embodiment. Ordinary technicians in this field can understand and implement it without paying creative labor.

[0057] Through the description of the above implementation methods, those skilled in the art can clearly understand that each implementation method can be implemented by means of software plus a necessary general hardware platform, and of course, can also be implemented by hardware. Based on this understanding, the above technical solution is essentially or the part that contributes to the prior art can be embodied in the form of a software product, and the computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, a disk, an optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or some parts of the embodiments.

[0058] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present application, rather than to limit it. Although the present application has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present application.

Claims

1. A method for determining a logistics transportation plan, characterized in that: include: The logistics order is split according to the required number of trucks and boxes to obtain multiple waiting orders; Generate multiple transportation plans for each shipping order based on the carrier's transportation routes; Under the constraints of the number of transportation schemes, the loading resources of each warehouse, and the transportation resources of each carrier at each warehouse, calculating the minimum value of the total transportation cost of the optional transportation schemes among the multiple transportation schemes; The transportation plan corresponding to the minimum value is determined as the transportation plan for the goods in the logistics order.

2. The method for determining a logistics transportation plan according to claim 1, characterized in that: The calculating the total transportation costs of the optional transportation options among the multiple transportation options includes: Calculate the transportation costs of each optional transportation plan for any waiting order according to the transportation routes corresponding to each optional transportation plan for the waiting order; The transportation costs of each optional transportation plan for each shipping order are added up to obtain the total transportation costs of the optional transportation plans among the multiple transportation plans.

3. The method for determining a logistics transportation plan according to claim 1, characterized in that: The optional transportation options are determined based on the following methods: If, among the multiple transportation plans, the cargo inventory of the warehouse corresponding to any transportation plan is greater than the demand for the same type of cargo in the corresponding shipping order, and the estimated arrival time of any transportation plan is not later than the required delivery time of the corresponding shipping order, then any transportation plan is determined to be an optional transportation plan.

4. The method for determining a logistics transportation plan according to claim 2, characterized in that: The calculating, according to the transport routes corresponding to the optional transport solutions of any waiting transport order, the transport costs of each optional transport solution of any waiting transport order comprises: If any optional transportation plan of any of the waiting waybills is a road transport route plan, the transportation cost of the road transport route plan is calculated.

5. The method for determining a logistics transportation plan according to claim 4, characterized in that: The calculation of the transportation cost of the truck transport route plan includes: The transportation cost of the road transport route plan is obtained according to the cargo tonnage of any of the waybills to be shipped, the road transport navigation mileage of the road transport route plan and the road transport ton-kilometer freight rate of the road transport route plan.

6. The method for determining a logistics transportation plan according to claim 2, characterized in that: The calculating, according to the transport routes corresponding to the optional transport solutions of any waiting transport order, the transport costs of each optional transport solution of any waiting transport order comprises: If any optional transportation plan of any of the shipping orders is a road-rail combined transport route plan, the transportation cost of the road-rail combined transport route plan is calculated.

7. The method for determining a logistics transportation plan according to claim 6, characterized in that: The calculation of the transportation cost of the road-rail combined transport route plan includes: The transportation cost of the road-rail transport route plan is obtained based on the cargo tonnage of any of the waybills, the railway freight rate per ton of the road-rail transport route plan, the road navigation mileage of the road-rail transport route plan, the road ton-kilometer freight rate of the road-rail transport route plan and the road-rail transfer fee of the road-rail transport route plan.

8. A device for determining a logistics transportation plan, characterized in that: include: The order splitting module is used to split the logistics order according to the required number of trucks and boxes to obtain multiple waiting orders; The transport plan generation module is used to generate multiple transport plans for each shipping order according to the transport routes of the carrier; A total transportation cost minimization module is used to calculate the minimum value of the total transportation cost of the optional transportation plans among the multiple transportation plans under the constraints of the number of transportation plans, the loading resources of each warehouse and the transportation resources of each carrier at each warehouse; The transportation plan determination module is used to: determine the transportation plan corresponding to the minimum value as the transportation plan for the goods in the logistics order.

9. An electronic device comprising a processor and a memory storing a computer program, characterized in that: When the processor executes the computer program, the steps of the method for determining a logistics transportation plan according to any one of claims 1 to 7 are implemented.

10. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the method for determining a logistics transportation plan according to any one of claims 1 to 7 are implemented.

Images