Logistics transportation order combination distribution method

Abstract

The invention discloses a logistics transportation order combination distribution method. The method comprises the following steps: S1, obtaining a cargo order table, a transportation route direction table and a transportation vehicle table; s2, according to the cargo order table, obtaining related data including a receiving address of each order, according to the receiving address of each order and the transport route direction table, determining a transport direction to which the receiving address of each order belongs, and according to the transport vehicle table, obtaining related data of each vehicle; s3, classifying each order according to the related data of each order to obtain a plurality of order combinations; s4, allocating orders in all order combinations to vehicles in the transport vehicle table by adopting a heuristic algorithm and a preset allocation rule to obtain a plurality of transport order combinations; and S5, combining and optimizing the transportation order combination, and calculating the total transportation mileage and the total transportation cost of the optimized transportation order combination. The logistics transportation mileage and cost can be effectively saved.

Description

Technical Field

[0001] The invention belongs to the technical field of logistics and transportation, and in particular relates to a logistics and transportation order combination allocation method. Background Art

[0002] In today's globalized economic environment, the efficient operation of the logistics industry, as an important support for economic development, is of vital importance. The reasonable combination and allocation of logistics transportation orders directly affects the operating costs, service quality and market competitiveness of logistics companies.

[0003] At present, there are many problems in the distribution of logistics and transportation orders. On the one hand, the size, load capacity, fuel consumption, etc. of different models vary greatly. If the order distribution is not considered in terms of model restrictions, it may lead to vehicle overload, space waste, or unsuitability for transporting specific goods. On the other hand, some goods themselves also have load requirements, such as specifying vehicle types and not being able to stack. At present, some logistics and transportation companies also have some pain points. First, the business rules are complex, and there is a lack of professional software systems to support the scheduling department to schedule orders. The manual scheduling is intensive and often takes a long time. Secondly, with the limited capabilities of dispatchers, it is difficult to optimize the distribution of logistics and transportation orders, improve transportation efficiency, and reduce transportation costs. Finally, unreasonable logistics and transportation orders may lead to imbalances in driver salaries and uneven driver workloads, affecting the long-term development of the company.

[0004] In view of the above problems, although many logistics order grouping methods have been proposed successively, the existing technical solutions either only consider the merging of orders and ignore the differences of vehicles, or only dispatch vehicles of different models and ignore the differences of orders. In order to overcome these problems, the present invention aims at the problem of dispatching order grouping in the logistics and transportation industry, and proposes a logistics transportation order combination allocation method that considers vehicle model restrictions and cargo carrying requirements. Summary of the invention

[0005] In view of the above deficiencies in the prior art, the present invention provides a method for combining and allocating logistics transport orders. By considering vehicle type restrictions and cargo carrying requirements for combining and allocating logistics transport orders, it is possible to fully utilize vehicle resources, improve transport efficiency, and reduce transport costs, which is of great significance for promoting the sustainable development of the logistics industry.

[0006] The method for combining and allocating logistics transport orders of the present invention comprises the following steps: Step S1: Obtain the cargo order table, transportation route direction table, and transportation vehicle table; Step S2: According to the cargo order table, the data of the delivery address, cargo weight, vehicle type requirement, cargo carrying method, number of cargo carrying units, and cargo stacking requirements of each order are obtained; according to the delivery address of each order and the transportation route direction table, the transportation direction to which the delivery address of each order belongs is determined; according to the transportation vehicle table, the data of the vehicle type, maximum load weight, and maximum capacity of each vehicle are obtained; Step S3: Classify each order according to the transportation direction, vehicle type requirement, cargo carrying method, and cargo stacking requirement of the delivery address of each order to obtain a plurality of order combinations; Step S4: using a heuristic algorithm and a preset allocation rule, allocating the orders in all order combinations to the vehicles in the transport vehicle table to obtain a number of transport order combinations; Step S5: Combine and optimize the transport order combination, and calculate the total transport mileage and total transport cost of the optimized transport order combination. Furthermore, the step S2 includes the following steps: Step S21: using a regular expression and keyword matching method, extracting data of the delivery address, cargo weight, vehicle type requirement, cargo carrying method, cargo carrying unit quantity, and cargo stacking requirement of each order from the cargo order table; Step S22: using an external API interface to parse the data of the delivery address of each order into corresponding longitude and latitude coordinates; Step S23: Compare the longitude and latitude coordinates corresponding to the delivery address of each order with the transportation route direction table to determine the transportation direction to which the delivery address of each order belongs.

[0007] Furthermore, the step S23 includes the following steps: Step S231: obtaining the longitude and latitude coordinates of the departure point, destination, and intermediate reference points of each transport direction in the transport route direction table; Step S232: Calculate the distance between the delivery address of each order and the reference points or destinations of all transportation directions in the transportation route direction table one by one. The specific calculation formula is: in, is the radius of the earth, taken as 6371 kilometers, The latitude coordinates of the reference point or destination for each transport direction. is the latitude coordinate of the delivery address for each order, The longitude coordinates of the reference point or destination for each transport direction. The longitude coordinates of the delivery address for each order; Step S233: By comparing the calculation results, the en route reference point or destination that is shortest from the delivery address of each order is obtained, and each order is classified into the transportation direction to which the en route reference point or destination belongs, that is, the transportation direction to which the delivery address of each order belongs is determined.

[0008] Furthermore, the step S3 includes the following steps: Step S31: Extract and define order features: Order features include the shipping direction, vehicle type requirements, cargo loading method, and cargo stacking requirements of the delivery address of each order, which are marked as , , , ,in =1, 2, ... n, Expressed as The order number; Step S32: classify each order according to the transportation direction, vehicle type requirement, cargo carrying method, and cargo stacking requirement of the delivery address of each order, and construct a dictionary based on the classification results; The keys of the dictionary are the classification categories including transportation direction, vehicle type requirements, cargo loading methods, and cargo stacking requirements, marked as , the value of the dictionary is a set of all orders contained in the corresponding category.

[0009] Furthermore, the heuristic algorithm includes a greedy algorithm and a backtracking optimization method, and the use of the heuristic algorithm and the preset allocation rule to allocate the orders in all order combinations to the vehicles in the transport vehicle table specifically includes: allocating the orders in each order combination to the vehicles in the transport vehicle table in order from the largest to the smallest number of cargo carrying units; The preset allocation rules include: the total weight of the goods of several orders assigned to each vehicle is less than or equal to the maximum load weight of the vehicle, the total volume of the goods of several orders assigned to each vehicle is less than or equal to the maximum capacity of the vehicle, the transportation direction of several orders assigned to each vehicle is consistent, the vehicle model requirements of several orders assigned to each vehicle are consistent, the cargo carrying method of several orders assigned to each vehicle is consistent, the cargo stacking requirements of several orders assigned to each vehicle are consistent, and the number of orders assigned to each vehicle does not exceed a preset value; wherein, the volume of the goods of each order can be calculated based on the cargo carrying method and the number of cargo carrying units.

[0010] Furthermore, the step S5 comprises the following steps: Step S51: Merging all transport order combinations with the same road section in the transport direction. If the combined transport order combination satisfies the preset allocation rule except the transport direction, the merger is successful. Step S52: sorting the transport order combinations according to the remaining load of each vehicle in all transport order combinations from large to small, and selecting the transport order combinations whose remaining load is greater than zero as the first set; sorting the transport order combinations according to the total weight of the goods in all transport order combinations from small to large, and selecting the transport order combinations whose total weight of the goods is less than or equal to the maximum remaining load in the first set as the second set; Merge the transport order combinations in the first set with the transport order combinations in the second set, the transport order combinations with vehicle type requirements and the transport order combinations without vehicle type requirements, that is, try to merge the orders in the transport order combinations in the second set and assign them to the vehicles in the transport order combinations in the first set. If the transport order combinations in the first set after merging meet the preset allocation rules except the vehicle type requirements, then the merging is successful. Step S53: adjusting the order of the multiple orders in each transport order combination in ascending order according to the distance between the delivery addresses of the multiple orders in each transport order combination and the departure point of the transport vehicle; Step S54: Calculate the total transportation mileage and total transportation cost of all transportation vehicles based on the combined, optimized and sorted transportation order combination, and perform analysis and optimization based on the calculation results.

[0011] The beneficial effects of the present invention are: 1. Considering the multi-dimensional matching of vehicle type restrictions and cargo carrying requirements: The present invention introduces the vehicle type requirements, cargo carrying methods, stacking capacity and other characteristics in the order for multi-dimensional classification, so that each order can be reasonably classified according to its specific requirements. This multi-dimensional classification method can effectively solve the problem of mismatch between different vehicle types and cargo characteristics in logistics transportation, and avoid the waste of transportation capacity and cost increase caused by incompatibility between vehicles and cargo.

[0012] 2. Order grouping optimization based on heuristic algorithm: This invention adopts heuristic algorithm and backtracking optimization algorithm to group orders, and can find a near-optimal order combination solution in a short time. Through fast calculation and local optimization, it can improve the loading efficiency of vehicles, minimize the empty load rate, and reduce transportation costs. At the same time, the algorithm design is simple and the calculation speed is fast, which is suitable for real-time processing of large-scale orders.

[0013] 3. Flexible handling of various cargo characteristics and logistics requirements: The present invention introduces preset allocation rules for order assembly, and can dynamically adjust the allocation combination plan according to the carrying method and stacking requirements of different cargoes. This enables the system to flexibly handle different types of cargoes, support diverse logistics requirements, and enhance the adaptability of the allocation combination plan. Compared with the traditional single-standard allocation combination method, the present invention can handle more complex logistics environments and improve the practicality and scalability of the allocation combination plan. BRIEF DESCRIPTION OF THE DRAWINGS

[0014] Figure 1 It is a schematic diagram of the process of the present invention; Figure 2 is an example of a transportation route direction table of the present invention; Figure 3 This is an example of the operation requirements in the goods order form of the present invention; Figure 4 This is an example of an order combination obtained after the present invention classifies orders; Figure 5 An example of a transport order combination of the present invention; Figure 6 The figure is a comparison chart of the total mileage calculated after the combined allocation of logistics transport orders using the present invention and the existing manual method in one month. DETAILED DESCRIPTION

[0015] In order to make the technical means, creative features, objectives and effects achieved by the present invention easy to understand, the present invention is further explained below in conjunction with specific implementation methods.

[0016] In the description of the present invention, it should be noted that the terms "upper", "lower", "inner", "outer", "front end", "rear end", "two ends", "one end", "the other end" and the like indicate positions or positional relationships based on the positions or positional relationships shown in the drawings, and are only for the convenience of describing the present invention and simplifying the description, and do not indicate or imply 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 limiting the present invention. In addition, the terms "first" and "second" are used for descriptive purposes only and cannot be understood as indicating or implying relative importance.

[0017] In the description of the present invention, it should be noted that, unless otherwise clearly specified and limited, the terms "installed", "provided with", "connected", etc. should be understood in a broad sense. For example, "connected" 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 a direct connection, or it can be indirectly connected through an intermediate medium, or it can be the internal communication of two components. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.

[0018] like Figure 1 As shown, a logistics transport order combination allocation method of the present invention comprises the following steps: Step S1: Obtain the cargo order table, transportation route direction table, and transportation vehicle table; Specifically, the cargo order table, the transportation route direction table, and the transportation vehicle table are in tabular form.

[0019] Among them, the cargo order form records the delivery address, cargo loading method, cargo stacking requirements, vehicle model requirements, and the number of cargo loading units.

[0020] The delivery address is expressed as a province plus a city, such as "Wuhan, Hubei". Cargo carrying methods include long pallets, pallets, square pallets, cartons, etc. The number of cargo carrying units is related to the cargo carrying method. If the cargo is carried by long pallets, pallets, square pallets, etc., the number of cargo carrying units is the number of pallets, such as "one pallet" and "two pallets"; if the cargo is carried by cartons, the number of cargo carrying units is the number of boxes, such as "one box" and "two boxes". Because pallets and cartons are generally customized, the total volume occupied by the cargo can be calculated by the cargo carrying method and the number of cargo carrying units. Cargo stacking requirements include stackable and non-stackable. Vehicle model requirements include large trucks, container trucks, flatbed trucks, as well as "prohibition of the use of high-rail high and low-plate trucks", "no use of containers", "usable containers", etc. Some cargoes have relatively loose vehicle requirements, and any vehicle type is acceptable.

[0021] Specifically, Figure 3 As shown, the original cargo order form generally summarizes and records the relevant requirements for cargo transportation in the "operation requirements" field, including cargo carrying methods, cargo stacking requirements, vehicle type requirements, etc. In addition, some special operation requirements and related notes during transportation may also be recorded, such as delivery deadlines, attention to waterproofing, etc. In some embodiments, these special operation requirements can also be used as one of the criteria for order classification and allocation.

[0022] like Figure 2As shown, the transportation route direction table is preset based on historical data, and multiple transportation destinations are recorded in the form of a combination of provinces or cities or provinces and cities, which are mostly provinces and cities with frequent transportation. Different transportation destinations represent different transportation directions, and the longitude and latitude of the departure place, destination, and preset reference points on the way are recorded. The reference points on the way are generally selected from key locations such as city centers, transportation hubs, and transportation hubs during transportation. At the same time, as many as possible are recorded to shorten the distance between the reference points on the way and the order delivery address as much as possible, thereby facilitating transshipment and reducing the total transportation mileage and total cost. When the vehicle transportation destinations are different, the sections passed through may be the same or have an inclusive relationship (such as passing through the same toll gate or highway section), so orders with different transportation directions but the same transportation section can be merged later.

[0023] The transport vehicle table records the types of vehicles that can be assigned, their maximum load, and their maximum capacity (i.e., the maximum volume of cargo that the vehicle can carry). The maximum load and capacity may change according to the cargo stacking requirements, because after stacking is prohibited, the vehicle's load and capacity for cargo are also reduced. When the existing vehicles that can be assigned cannot meet the transportation needs of the order, new vehicles need to be added according to the orders that have not yet been assigned, so that additional vehicles can be dispatched according to these new vehicle information.

[0024] Step S2: According to the cargo order table, the data of the delivery address, cargo weight, vehicle type requirements, cargo loading method, number of cargo loading units, and cargo stacking requirements of each order are obtained; according to the delivery address and transportation route direction table of each order, the transportation direction to which the delivery address of each order belongs is determined; according to the transportation vehicle table, the data of the vehicle type, maximum load weight, and maximum capacity of each vehicle are obtained; Specifically, step S2 includes the following steps: Step S21: using a regular expression and keyword matching method, extracting the data of the delivery address, cargo weight, vehicle type requirement, cargo carrying method, cargo carrying unit quantity, and cargo stacking requirement of each order from the cargo order table; After obtaining the cargo order table, transportation route direction table, and transportation vehicle table, regular expressions and keyword matching can be used to quickly obtain key information such as the delivery address, cargo weight, vehicle model requirements, cargo loading method, number of cargo loading units, cargo stacking requirements, departure points, destinations, and reference points along the way for each transportation direction in the transportation route direction table, and the vehicle model, maximum load weight, and maximum capacity of each vehicle in the transportation vehicle table from the fields recorded in the cargo order table, transportation route direction table, and transportation vehicle table.

[0025] Step S22: using an external API interface to parse the data of the delivery address of each order into corresponding longitude and latitude coordinates; Step S23: Compare the longitude and latitude coordinates corresponding to the delivery address of each order with the transportation route direction table to determine the transportation direction to which the delivery address of each order belongs.

[0026] Specifically, step S23 includes the following steps: Step S231: Obtain the longitude and latitude coordinates of the departure point, destination, and intermediate reference points of each transport direction in the transport route direction table; Step S232: Calculate the distance between the delivery address of each order and the reference points or destinations of all transportation directions in the transportation route direction table one by one. The specific calculation formula is: in, is the radius of the earth, taken as 6371 kilometers, The latitude coordinates of the reference point or destination for each transport direction. is the latitude coordinate of the delivery address for each order, The longitude coordinates of the reference point or destination for each transport direction. The longitude coordinates of the delivery address for each order; Specifically, the above calculation formula assumes that the surface of the earth is a sphere, and uses the great circle distance formula to calculate the distance between two points.

[0027] Step S233: By comparing the calculation results, the en route reference point or destination that is shortest from the delivery address of each order is obtained, and each order is classified into the transportation direction to which the en route reference point or destination belongs, that is, the transportation direction to which the delivery address of each order belongs is determined.

[0028] Specifically, the distance between the delivery address of each order and the reference points or destinations of all transportation directions in the transportation route direction table is calculated, and then all the calculation results are compared to find the nearest reference point or destination to the delivery address of each order, which can be expressed as: in, It is a collection of preset route tables.

[0029] By using the API interface of the external map platform / software, the delivery address of each order is converted into corresponding longitude and latitude data, and then compared with the longitude and latitude of the departure place, destination, and reference points on the way in the preset transportation route direction table based on the longitude and latitude data. If the route direction of the delivery address of each order is closest to a certain reference point or destination on the way in a certain transportation direction in the transportation route direction table, the order can be classified into that route direction.

[0030] After collecting the above data, by deleting irrelevant fields in the cargo order table and supplementing the fields including "transportation direction", "latitude and longitude of departure place", "latitude and longitude of destination", "mileage", etc., a new concise and clear cargo order table can be created based on the cargo order table.

[0031] like Figure 4 As shown, step S3: classify each order according to the transportation direction, vehicle type requirement, cargo carrying method, and cargo stacking requirement of the delivery address of each order to obtain a plurality of order combinations; Specifically, step S3 includes the following steps: Step S31: Extract and define order features: Order features include the shipping direction, vehicle type requirements, cargo loading method, and cargo stacking requirements of the delivery address of each order, which are marked as , , , ,in =1, 2, ... n, Expressed as The order number; Step S32: classify each order according to the transportation direction, vehicle type requirement, cargo carrying method, and cargo stacking requirement of the delivery address of each order, and construct a dictionary based on the classification results; The keys of the dictionary are the categories including transportation direction, vehicle type requirements, cargo loading methods, and cargo stacking requirements, marked as , the dictionary value is a collection of all orders contained in the corresponding category.

[0032] Specifically, in this embodiment, the four classification criteria of the transport direction, vehicle type requirements, cargo loading method, and cargo stacking requirements of the delivery address of each order are selected to classify the orders. In other embodiments, the classification criteria may be added or modified, such as adding a delivery deadline requirement. By classifying the orders, it is convenient to subsequently assign different orders to transport vehicles. By creating a data structure such as a dictionary, it is convenient to quickly process the classified data.

[0033] Among them, the dictionary formed by all orders after classification, that is, the grouping dictionary, can be expressed as: Each category may include one or more orders. Specifically, when classifying, first create a new category based on the first order. If the second order is the same as the first order according to the classification criteria, the second order will be classified into the category of the first order. If they are not the same, continue to create a new category, and so on. Traverse and classify all orders until all orders are classified, then you can get several classified order combinations, each order combination includes one or more orders.

[0034] In terms of data structure, a classification key is constructed for each order. , if the category key already exists in the grouping dictionary, the order is added to the corresponding grouping list; if the key does not exist, a new category key is created.

[0035] Among them, since some orders have no vehicle model requirements, no vehicle model requirements can also be regarded as a classification criterion to classify orders with no vehicle model requirements and the same other conditions into one category.

[0036] like Figure 5 As shown, step S4: using a heuristic algorithm and a preset allocation rule, the orders in all order combinations are allocated to the vehicles in the transport vehicle table to obtain a number of transport order combinations; Specifically, heuristic algorithms include greedy algorithms and backtracking optimization methods. Greedy algorithms are a hierarchical processing method that takes the best or optimal (i.e., most favorable) choice at each step, hoping to lead to the best or optimal result in the world. It is usually used to solve optimization problems, especially those that can be decomposed into a series of local choices. For certain types of problems, it can not only find solutions quickly, but also often find the optimal solution.

[0037] In this case, the idea of ​​using the greedy algorithm is to prioritize placing orders with larger weight or larger volume into transportation vehicles with sufficient capacity, so as to minimize transportation costs and maximize vehicle utilization. Specifically, in this implementation, the allocation of orders in all order combinations to vehicles in the transportation vehicle table can be regarded as a multi-dimensional bin packing problem (MDBPP), whose goal is to place a set of orders Make reasonable combinations to load the most orders into vehicles with limited capacity and load capacity, minimizing the number of vehicles used and the total transportation cost.

[0038] Backtracking optimization is a method of solving problems by trying all possible candidate solutions. It is usually used to solve combinatorial optimization problems. The core idea is to gradually build a solution to the problem while checking whether the candidate solution meets the constraints of the problem. If not, backtrack (cancel the previous choice) and try the next candidate solution. Backtracking optimization is conducive to dealing with more complex and larger-scale problems, and can provide strong support for solving combinatorial optimization problems. In this case, the backtracking optimization method is to assign the order to the vehicle in the transport vehicle table, and then determine whether the vehicle meets the conditions for transporting the order according to the preset allocation rules.

[0039] Specifically, using a heuristic algorithm and a preset allocation rule to allocate the orders in all order combinations to the vehicles in the transport vehicle table specifically includes: allocating the orders in each order combination to the vehicles in the transport vehicle table in order from the largest to the smallest number of cargo carrying units; The preset allocation rules include: the total weight of the goods of several orders assigned to each vehicle is less than or equal to the maximum load weight of the vehicle, the total volume of the goods of several orders assigned to each vehicle is less than or equal to the maximum capacity of the vehicle, the transportation direction of the several orders assigned to each vehicle is consistent, the vehicle model requirements of the several orders assigned to each vehicle are consistent, the cargo carrying method of the several orders assigned to each vehicle is consistent, the cargo stacking requirements of the several orders assigned to each vehicle are consistent, and the number of orders assigned to each vehicle does not exceed the preset value.

[0040] Among them, the preset allocation rules include that the number of orders assigned to each vehicle does not exceed the preset value (such as 3), which is to limit the number of orders transported by each vehicle, so as to avoid each vehicle transporting too many orders and delaying the transportation time limit, and to ensure the quality of transportation services. The volume of the goods for each order can be calculated based on the cargo carrying method and the number of cargo carrying units. Because pallets and cartons are generally customized and the volume they occupy is fixed, after knowing the cargo carrying method and the number of cargo carrying units, the volume of the pallet or carton multiplied by the number of cargo carrying units can be calculated to calculate the total volume occupied by the goods of an order.

[0041] The specific allocation process is as follows: assuming that the first order is successfully allocated to the first transport vehicle according to the above preset allocation rules, a transport vehicle combination is created, and the remaining capacity and remaining load of the vehicle are updated at the same time, and the cargo carrying method and cargo stacking requirements in the transport vehicle combination are restricted. The subsequent second order is also traversed from the first transport vehicle. If it also meets the preset allocation rules, the second order is also added to the transport vehicle combination, and then the remaining capacity and remaining load of the vehicle are updated. And so on, until all orders are allocated. Among them, if the load or capacity or the number of orders allocated to a transport vehicle has reached the upper limit, the transport vehicle will be removed from the traversal list.

[0042] When all vehicles in the transport vehicle table have been allocated or cannot meet the requirements of the existing order goods, new vehicles are added according to the orders to be allocated, thereby creating a new transport order combination. At the same time, the data of these newly added vehicles are added to the transport vehicle table to facilitate the subsequent dispatch of transport vehicles based on these data. The model, load capacity and capacity of the newly added vehicles are formulated based on the template data formed based on historical data.

[0043] Step S5: Merge and optimize the transport order combination, and calculate the total transport mileage and total transport cost of the optimized transport order combination.

[0044] Specifically, step S5 includes the following steps: Step S51: Merge all transport order combinations that have the same road section in the transport direction. If the combined transport order combination satisfies the preset allocation rules except the transport direction, the merger is successful. Specifically, having the same road section in the transport direction means that the road section passed by the vehicle transport route in one transport order combination and the road section passed by the vehicle transport route in another transport order combination are exactly the same (for example, passing through the same toll gate or highway section) or the former completely contains the latter or the latter completely contains the former.

[0045] Step S52: sorting the transport order combinations according to the remaining load of each vehicle in all transport order combinations from large to small, and selecting the transport order combinations whose remaining load is greater than zero as the first set; sorting the transport order combinations according to the total weight of the goods in all transport order combinations from small to large, and selecting the transport order combinations whose total weight of the goods is less than or equal to the maximum remaining load in the first set as the second set; Merge the transport order combinations in the first set with the transport order combinations in the second set, including the transport order combinations with vehicle type requirements and the transport order combinations without vehicle type requirements, that is, try to merge the orders in the transport order combinations in the second set and assign them to the vehicles in the transport order combinations in the first set. If the transport order combinations in the first set after merging meet the preset allocation rules except the vehicle type requirements, the merging is successful. Specifically, the essence of this step is mainly to merge the transport order combinations with vehicle type requirements and those without vehicle type requirements, and to merge the transport order combinations with vehicle type requirements through the transport order combinations without vehicle type requirements, and then they become transport orders with vehicle type requirements.

[0046] By sorting and screening the transport order combinations, the amount of calculation can be reduced, which is convenient for the subsequent merging of transport order combinations. After sorting, the transport order combinations that do not meet the conditions, such as the remaining load is zero and the total weight of the goods is greater than the maximum remaining load, are eliminated, which is conducive to improving the merging efficiency and avoiding unnecessary merging. Then, all transport order combinations are traversed to maximize the use of the capacity and load of all vehicles as much as possible. The sorting method can also be to sort the transport order combinations in order from large to small according to the remaining capacity of each vehicle in all transport order combinations.

[0047] In addition, when all orders in a vehicle of a transport order combination are merged into vehicles of other transport order combinations, the transport order combination needs to be deleted.

[0048] In other embodiments, attempts may be made to merge transport order groups with stacking requirements and those without stacking requirements, such as placing goods with stacking requirements on one side of the vehicle and goods without stacking requirements on the other side of the vehicle.

[0049] Step S53: adjusting the order of the multiple orders in each transport order combination in ascending order according to the distance between the delivery addresses of the multiple orders in each transport order combination and the departure point of the transport vehicle; Specifically, by adjusting the transport order of each order in each transport order combination, it is possible to facilitate transport vehicles to transport the ordered goods according to the adjusted order, thereby saving transport mileage and transport costs.

[0050] Step S54: Calculate the total transportation mileage and total transportation cost of all transportation vehicles based on the combined, optimized and sorted transportation order combination, and perform analysis and optimization based on the calculation results.

[0051] Specifically, after the merge optimization, the transportation path of each transportation order combination is evaluated, and the transportation mileage and total transportation cost of the combination are calculated. The total transportation cost includes tolls, fuel consumption and other expenses, which can be directly or indirectly related to the transportation mileage. That is, the smaller the transportation mileage, the lower the total transportation cost.

[0052] By calculating the total transportation mileage and total transportation cost of all transport vehicles in the optimized transport order combination, and then comparing these data with the total transportation mileage and total transportation cost obtained by the traditional method of order allocation combination, it can be found out to what extent the optimized transport order combination can save transportation mileage and transportation cost. In addition, further analysis and adjustment can be made based on the optimization results to achieve continuous improvement of the logistics transport order combination.

[0053] like Figure 6As shown, the horizontal axis is the date, the vertical axis is the total transportation mileage, the triangle line represents the total logistics transportation mileage diagram of allocating orders every day within a month using the existing manual order allocation method, and the dotted line represents the total logistics transportation mileage diagram of allocating orders every day within a month using the logistics transportation order combination allocation method of the present invention. It can be clearly seen that the dotted line is always below the triangle line, so it is easy to conclude that the logistics transportation order combination allocation method of the present invention can effectively save the total logistics transportation mileage compared to the existing manual order allocation method, thereby effectively saving logistics transportation costs.

[0054] The above shows and describes the basic principles and main features of the present invention and the advantages of the present invention. It should be understood by those skilled in the art that the present invention is not limited to the above embodiments. The above embodiments and descriptions are only for explaining the principles of the present invention. Without departing from the spirit and scope of the present invention, the present invention may have various changes and improvements, which fall within the scope of the present invention to be protected. The scope of protection of the present invention is defined by the attached claims and their equivalents.

Claims

1. A logistics transport order combination allocation method, characterized in that: The following steps are involved: Step S1: Obtain the cargo order table, transportation route direction table, and transportation vehicle table; Step S2: According to the cargo order table, the data of the delivery address, cargo weight, vehicle type requirement, cargo carrying method, number of cargo carrying units, and cargo stacking requirements of each order are obtained; according to the delivery address of each order and the transportation route direction table, the transportation direction to which the delivery address of each order belongs is determined; according to the transportation vehicle table, the data of the vehicle type, maximum load weight, and maximum capacity of each vehicle are obtained; Step S3: Classify each order according to the transportation direction, vehicle type requirement, cargo carrying method, and cargo stacking requirement of the delivery address of each order to obtain a plurality of order combinations; Step S4: using a heuristic algorithm and a preset allocation rule, allocating the orders in all order combinations to the vehicles in the transport vehicle table to obtain a number of transport order combinations; Step S5: Combine and optimize the transport order combination, and calculate the total transport mileage and total transport cost of the optimized transport order combination.

2. A logistics transport order combination allocation method according to claim 1, characterized in that: The step S2 comprises the following steps: Step S21: using a regular expression and keyword matching method, extracting data of the delivery address, cargo weight, vehicle type requirement, cargo carrying method, cargo carrying unit quantity, and cargo stacking requirement of each order from the cargo order table; Step S22: using an external API interface to parse the data of the delivery address of each order into corresponding longitude and latitude coordinates; Step S23: Compare the longitude and latitude coordinates corresponding to the delivery address of each order with the transportation route direction table to determine the transportation direction to which the delivery address of each order belongs.

3. A logistics transport order combination allocation method according to claim 1, characterized in that: The step S23 comprises the following steps: Step S231: obtaining the longitude and latitude coordinates of the departure point, destination, and intermediate reference points of each transport direction in the transport route direction table; Step S232: Calculate the distance between the delivery address of each order and the reference points or destinations of all transportation directions in the transportation route direction table one by one. The specific calculation formula is: in, is the radius of the earth, taken as 6371 kilometers, The latitude coordinates of the reference point or destination for each transport direction. is the latitude coordinate of the delivery address for each order, The longitude coordinates of the reference point or destination for each transport direction. The longitude coordinates of the delivery address for each order; Step S233: By comparing the calculation results, the en route reference point or destination that is shortest from the delivery address of each order is obtained, and each order is classified into the transportation direction to which the en route reference point or destination belongs, that is, the transportation direction to which the delivery address of each order belongs is determined.

4. A logistics transport order combination allocation method according to claim 1, characterized in that: The step S3 comprises the following steps: Step S31: Extract and define order features: Order features include the shipping direction, vehicle type requirements, cargo loading method, and cargo stacking requirements of the delivery address of each order, which are marked as , , , ,in =1, 2, ... n, Expressed as The order number; Step S32: classify each order according to the transportation direction, vehicle type requirement, cargo carrying method, and cargo stacking requirement of the delivery address of each order, and construct a dictionary based on the classification results; The keys of the dictionary are the classification categories including transportation direction, vehicle type requirements, cargo loading methods, and cargo stacking requirements, marked as , the value of the dictionary is a set of all orders contained in the corresponding category.

5. A logistics transport order combination allocation method according to any one of claims 1 to 4, characterized in that: The heuristic algorithm includes a greedy algorithm and a backtracking optimization method. The use of the heuristic algorithm and the preset allocation rule to allocate the orders in all order combinations to the vehicles in the transport vehicle table specifically includes: allocating the orders in each order combination to the vehicles in the transport vehicle table in order from the largest to the smallest number of cargo carrying units; The preset allocation rules include: the total weight of the goods of several orders assigned to each vehicle is less than or equal to the maximum load weight of the vehicle, the total volume of the goods of several orders assigned to each vehicle is less than or equal to the maximum capacity of the vehicle, the transportation direction of several orders assigned to each vehicle is consistent, the vehicle model requirements of several orders assigned to each vehicle are consistent, the cargo carrying method of several orders assigned to each vehicle is consistent, the cargo stacking requirements of several orders assigned to each vehicle are consistent, and the number of orders assigned to each vehicle does not exceed a preset value; wherein, the volume of the goods of each order can be calculated based on the cargo carrying method and the number of cargo carrying units.

6. A logistics transport order combination allocation method according to claim 5, characterized in that: The step S5 comprises the following steps: Step S51: Merging all transport order combinations with the same road section in the transport direction. If the combined transport order combination satisfies the preset allocation rule except the transport direction, the merger is successful. Step S52: sorting the transport order combinations according to the remaining load of each vehicle in all transport order combinations from large to small, and selecting the transport order combinations whose remaining load is greater than zero as the first set; sorting the transport order combinations according to the total weight of the goods in all transport order combinations from small to large, and selecting the transport order combinations whose total weight of the goods is less than or equal to the maximum remaining load in the first set as the second set; Merge the transport order combinations in the first set with the transport order combinations in the second set, the transport order combinations with vehicle type requirements and the transport order combinations without vehicle type requirements, that is, try to merge the orders in the transport order combinations in the second set and assign them to the vehicles in the transport order combinations in the first set. If the transport order combinations in the first set after merging meet the preset allocation rules except the vehicle type requirements, then the merging is successful. Step S53: adjusting the order of the multiple orders in each transport order combination in ascending order according to the distance between the delivery addresses of the multiple orders in each transport order combination and the departure point of the transport vehicle; Step S54: Calculate the total transportation mileage and total transportation cost of all transportation vehicles based on the combined, optimized and sorted transportation order combination, and perform analysis and optimization based on the calculation results.

Images