A method for combined allocation of logistics transportation orders

Abstract

The present invention discloses a method for combined allocation of logistics transportation orders, including the following steps: Step S1: Obtain a goods order form, a transportation route direction form, and a transportation vehicle form; Step S2: According to the goods order form, obtain the relevant data of each order including the receiving address. According to the receiving address of each order and the transportation route direction form, determine the transportation direction to which the receiving address of each order belongs. According to the transportation vehicle form, obtain the relevant data of each vehicle; Step S3: Classify each order according to the relevant data of each order to obtain several order combinations; Step S4: Use a heuristic algorithm and a preset allocation rule to allocate the orders in all order combinations to the vehicles in the transportation vehicle form to obtain several transportation order combinations; Step S5: Merge and optimize the transportation order combinations, and calculate the total transportation mileage and total transportation cost of the optimized transportation order combinations. The present invention can effectively save the logistics transportation mileage and cost.

Description

Technical Field

[0001] The present invention belongs to the technical field of logistics transportation, and particularly relates to a method for combined allocation of logistics transportation orders. Background Art

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

[0003] Currently, there are many problems in the allocation of logistics transportation orders. On the one hand, the sizes, load capacities, fuel consumptions, etc. of different vehicle types vary greatly. If the order allocation is carried out without considering vehicle type restrictions, it may lead to situations such as vehicle overloading, space waste or being unsuitable for transporting specific goods. On the other hand, some goods themselves also have bearing requirements, such as specifying vehicle types and not being able to be stacked. Currently, some logistics transportation enterprises themselves also have some pain points. First, the business rules are complex, lacking professional software system support for the dispatching department to arrange orders, and the manual order arrangement intensity is high, often taking a long time. Second, when the capabilities of dispatchers are limited, it is difficult to optimize the allocation of logistics transportation orders, improve transportation efficiency and reduce transportation costs. Finally, unreasonable logistics transportation order consolidation may bring about unbalanced driver salaries and uneven driver workloads, affecting the long-term development of the enterprise.

[0004] In view of the above problems, although many logistics order consolidation methods have been successively proposed, the existing technical solutions either only consider the combination of orders while ignoring the differences between vehicles, or only dispatch vehicles of different types while ignoring the differences between orders. In order to overcome these problems, the present invention proposes a method for combined allocation of logistics transportation orders considering vehicle type restrictions and cargo bearing requirements for the dispatching and order consolidation problems in the logistics transportation industry. Summary of the Invention

[0005] Based on the above deficiencies of the prior art, the present invention provides a method for combined allocation of logistics transportation orders. By considering vehicle type restrictions and cargo bearing requirements for combined allocation of logistics transportation orders, it can make full use of vehicle resources, improve transportation efficiency and reduce transportation costs, which is of great significance for promoting the sustainable development of the logistics industry.

[0006] The method for combined allocation of logistics transportation orders described in the present invention includes the following steps:

[0007] Step S1: Obtain a cargo order form, a transportation route direction form, and a transportation vehicle form;

[0008] Step S2: According to the goods order form, obtain the data of the receiving address, goods weight, vehicle type requirement, goods loading method, number of goods loading units, and goods stacking requirement for each order. According to the receiving address of each order and the transportation route direction table, determine the transportation direction to which the receiving address of each order belongs. According to the transportation vehicle table, obtain the data of the vehicle type, maximum load capacity, and maximum capacity of each vehicle;

[0009] Step S3: Classify each order according to the transportation direction, vehicle type requirement, goods loading method, and goods stacking requirement to which the receiving address of each order belongs, and obtain several order combinations;

[0010] Step S4: Use a heuristic algorithm and a preset allocation rule to allocate the orders in all order combinations to the vehicles in the transportation vehicle table, and obtain several transportation order combinations;

[0011] Step S5: Merge and optimize the transportation order combinations, and calculate the total transportation mileage and total transportation cost of the optimized transportation order combinations.

[0012] Furthermore, step S2 includes the following steps:

[0013] Step S21: Use the method of regular expression and keyword matching to extract the data of the receiving address, goods weight, vehicle type requirement, goods loading method, number of goods loading units, and goods stacking requirement for each order from the goods order form;

[0014] Step S22: Use an external API interface to parse the data of the receiving address of each order into corresponding longitude and latitude coordinates;

[0015] Step S23: Compare the longitude and latitude coordinates corresponding to the receiving address of each order with the transportation route direction table to determine the transportation direction to which the receiving address of each order belongs.

[0016] Furthermore, step S23 includes the following steps:

[0017] Step S231: Obtain the longitude and latitude coordinates of the departure place, destination, and reference points on the way of each transportation direction in the transportation route direction table;

[0018] Step S232: Calculate the distance between the receiving address of each order and the reference points on the way or the destination of all transportation directions in the transportation route direction table one by one. The specific calculation formula is:

[0019]

[0020] where, is the radius of the earth, taken as 6371 kilometers, The latitude coordinates of the reference points or destinations on the way for each transportation direction The latitude coordinates of the receiving address for each order The longitude coordinates of the reference points or destinations on the way for each transportation direction The longitude coordinates of the receiving address for each order;

[0021] Step S233: By comparing the calculation results, obtain the reference point or destination on the way that is the shortest distance from the receiving address of each order, and classify each order into the transportation direction to which the reference point or destination belongs, that is, determine the transportation direction to which the receiving address of each order belongs.

[0022] Furthermore, the step S3 includes the following steps:

[0023] Step S31: Order feature extraction and definition: Order features include the transportation direction to which the receiving address of each order belongs, vehicle type requirements, cargo loading method, and cargo stacking requirements, which are respectively marked as , , , , where = 1, 2... n, represents the number of the th order;

[0024] Step S32: Classify each order according to the transportation direction to which the receiving address of each order belongs, vehicle type requirements, cargo loading method, and cargo stacking requirements, and construct a dictionary according to the classification results;

[0025] Among them, the keys of the dictionary are classification categories including transportation direction, vehicle type requirements, cargo loading method, and cargo stacking requirements, marked as , and the values of the dictionary are sets of all orders included in the corresponding categories.

[0026] Furthermore, the heuristic algorithm includes a greedy algorithm and a backtracking optimization method. The specific steps of allocating the orders in all order combinations to the vehicles in the vehicle transportation table by using the heuristic algorithm and the preset allocation rules are as follows: Allocate the orders in each order combination to the vehicles in the vehicle transportation table in descending order of the number of cargo loading units;

[0027] 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 capacity 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 directions of several orders assigned to each vehicle are the same; the vehicle type requirements of several orders assigned to each vehicle are the same; the goods loading methods of several orders assigned to each vehicle are the same; the goods stacking requirements of several orders assigned to each vehicle are the same; 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 according to the goods loading method and the number of goods loading units.

[0028] Furthermore, step S5 includes the following steps:

[0029] Step S51: Combine the transportation order combinations with the same road sections in the transportation directions. If the combined transportation order combination meets the preset allocation rules in other conditions except the transportation direction, it indicates that the combination is successful.

[0030] Step S52: Sort the transportation order combinations in descending order according to the remaining load capacity of each vehicle in all transportation order combinations, and select the transportation order combinations with a remaining load capacity greater than zero as the first set; sort the transportation order combinations in ascending order according to the total weight of the goods in all transportation order combinations, and select the transportation order combinations with a total weight of the goods less than or equal to the maximum remaining load capacity in the first set as the second set;

[0031] Combine the transportation order combinations with vehicle type requirements and those without vehicle type requirements in the first set and the second set of transportation order combinations, that is, try to combine and allocate the orders in the transportation order combinations in the second set to the vehicles in the transportation order combinations in the first set. If the combined transportation order combinations in the first set meet the preset allocation rules in other conditions except the vehicle type requirements, it indicates that the combination is successful.

[0032] Step S53: Adjust the sorting of several orders in each transportation order combination in ascending order according to the distance between the delivery addresses of several orders in each transportation order combination and the departure point of the transportation vehicle.

[0033] Step S54: Calculate the total transportation mileage and total transportation cost of all transportation vehicles according to the combined, optimized, and sorted transportation order combinations, and perform analysis and optimization according to the calculation results.

[0034] The beneficial effects of the present invention are:

[0035] 1. Multi-dimensional matching considering vehicle type restrictions and cargo loading requirements: The present invention classifies orders multi-dimensionally by introducing features such as vehicle type requirements, cargo loading methods, and stacking capabilities in the order, enabling each order to 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, avoiding waste of transportation capacity and cost increase caused by incompatibility between vehicles and cargo.

[0036] 2. Order consolidation optimization based on heuristic algorithms: The present invention uses heuristic algorithms and backtracking optimization algorithms for order consolidation combination, and can find a nearly optimal order combination plan in a short time. Through rapid calculation and local optimization, it can improve the loading efficiency of vehicles, minimize the empty load rate to the greatest extent, reduce transportation costs. At the same time, the algorithm design is simple and the calculation speed is fast, making it suitable for real-time processing of large-scale orders.

[0037] 3. Flexible handling of various cargo characteristics and logistics requirements: The present invention conducts order consolidation by introducing preset allocation rules, and can dynamically adjust the allocation combination plan according to the loading methods, stacking requirements, etc. of different cargos. This enables the system to handle different types of cargos flexibly, 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, improving the practicality and scalability of the allocation combination plan. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] Figure 1 is a schematic flowchart of the present invention;

[0039] Figure 2 is an example of the transportation route direction table of the present invention;

[0040] Figure 3 is an example of the operation requirements in the cargo order form of the present invention;

[0041] Figure 4 is an example of the order combination obtained after classifying orders according to the present invention;

[0042] Figure 5 is an example of the transportation order combination of the present invention;

[0043] Figure 6 is a comparison chart of the total mileage calculated after using the present invention and the existing manual method for logistics transportation order combination allocation within one month. DETAILED DESCRIPTION OF THE INVENTION

[0044] To make the technical means, creative features, achieved purposes, and functions of the present invention easy to understand, the present invention will be further described below in conjunction with specific embodiments.

[0045] In the description of the present invention, it should be noted that the orientation or positional relationship indicated by the terms "upper", "lower", "inner", "outer", "front end", "rear end", "both ends", "one end", "the other end", etc. is based on the orientation or positional relationship shown in the drawings. It is only for the convenience of describing the present invention 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 should not be construed as a limitation on the present invention. In addition, the terms "first" and "second" are only used for descriptive purposes and cannot be construed as indicating or implying relative importance.

[0046] In the description of the present invention, it should be noted that unless otherwise clearly specified and defined, 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 directly connected or indirectly connected through an intermediate medium, and it can be the communication inside two elements. For those of ordinary skill in the art, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.

[0047] As Figure 1 shown, a method for combined allocation of logistics transportation orders of the present invention includes the following steps:

[0048] Step S1: Obtain a goods order form, a transportation route direction form, and a transportation vehicle form;

[0049] Specifically, the goods order form, the transportation route direction form, and the transportation vehicle form are in tabular form.

[0050] Among them, the goods order form records the receiving address, the goods loading method, the goods stacking requirement, the vehicle type requirement, and the number of goods loading units.

[0051] The receiving address is expressed as a province plus a city, such as "Wuhan, Hubei". The goods loading methods include long pallets, trays, square pallets, cartons, etc. The number of goods loading units is related to the goods loading method. If the goods are loaded in the ways of long pallets, trays, square pallets, etc., the number of goods loading units is the number of pallets, such as "one pallet", "two pallets"; if the goods are loaded in cartons, the number of goods loading units is the number of cartons, such as "one carton", "two cartons". Since pallets and cartons are generally customized, the total volume occupied by the goods can be calculated through the goods loading method and the number of goods loading units. The goods stacking requirements include stackable and non-stackable. The vehicle type requirements include large trucks, container trucks, flatbed trucks, and "prohibiting the use of high-sided high-low deck trucks", "not using containers", "using containers available", etc. For some goods, the vehicle requirements are relatively loose and any vehicle type can be used.

[0052] Specifically, as Figure 3As shown, the original goods order form generally summarizes and records the relevant requirements for goods transportation in the "operation requirements" field, including requirements such as the goods loading method, goods stacking requirements, vehicle type requirements, etc. In addition, it may also record some special operation requirements and relevant remarks during transportation, such as the delivery deadline, pay 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.

[0053] As Figure 2 shown, the transportation route direction form is preset according to historical data, and records multiple transportation destinations in the form of a combination of provinces or cities or provinces and cities, mostly provinces and cities with frequent transportation, and represents different transportation directions with different transportation destinations. At the same time, it records the departure place, destination, and the longitude and latitude of the preset reference points on the way. The reference points on the way are generally selected at relatively key locations such as the city center, transportation hub stations, and transportation hub stations passed during transportation, and as many as possible are recorded, so as to shorten the distance between the reference points on the way and the order receiving address as much as possible in the future, so as to facilitate transshipment and reduce the total transportation mileage and total cost. When the transportation destinations of vehicles are different, the sections passed may be the same or have an inclusion 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.

[0054] The transportation vehicle form records the vehicle types, maximum load capacities, and maximum capacities (i.e., the maximum volume of goods that the vehicle can load) of the existing assignable vehicles. Among them, the maximum load capacity and maximum capacity may change according to the goods stacking requirements, because after stacking is prohibited, the vehicle's load capacity and capacity for goods are also reduced. When the existing assignable vehicles cannot meet the transportation requirements of the order, new vehicles need to be added according to the unallocated orders, so as to dispatch vehicles according to the information of these new vehicles.

[0055] Step S2: According to the goods order form, obtain the data of the receiving address, goods weight, vehicle type requirements, goods loading method, number of goods loading units, and goods stacking requirements of each order. According to the receiving address of each order and the transportation route direction form, determine the transportation direction to which the receiving address of each order belongs. According to the transportation vehicle form, obtain the data of the vehicle type, maximum load capacity, and maximum capacity of each vehicle;

[0056] Specifically, step S2 includes the following steps:

[0057] Step S21: Use the method of regular expression and keyword matching to extract the data of the receiving address, goods weight, vehicle type requirements, goods loading method, number of goods loading units, and goods stacking requirements of each order from the goods order form;

[0058] After obtaining the tables of the goods order form, the transportation route direction form, and the transportation vehicle form, through regular expressions and keyword matching, it is possible to quickly obtain from the fields recorded in the tables of the goods order form, the transportation route direction form, and the transportation vehicle form the key information including the receiving address, the weight of the goods, the vehicle type requirements, the goods loading method, the number of goods loading units, the goods stacking requirements, the departure place, the destination, and the reference points on the way for each transportation direction in the transportation route direction form, and the vehicle type, the maximum load capacity, and the maximum capacity of each vehicle in the transportation vehicle form.

[0059] Step S22: Use an external API interface to parse the data of the receiving address of each order into corresponding longitude and latitude coordinates;

[0060] Step S23: Compare the longitude and latitude coordinates corresponding to the receiving address of each order with the transportation route direction form to determine the transportation direction to which the receiving address of each order belongs.

[0061] Specifically, step S23 includes the following steps:

[0062] Step S231: Obtain the longitude and latitude coordinates of the departure place, the destination, and the reference points on the way for each transportation direction in the transportation route direction form;

[0063] Step S232: Calculate the distance between the receiving address of each order and the reference points on the way or the destination of all transportation directions in the transportation route direction form one by one. The specific calculation formula is:

[0064]

[0065] Among them, is the radius of the earth, taken as 6371 kilometers, is the latitude coordinate of the reference point on the way or the destination of each transportation direction, is the latitude coordinate of the receiving address of each order, is the longitude coordinate of the reference point on the way or the destination of each transportation direction, is the longitude coordinate of the receiving address of each order;

[0066] Specifically, in the above calculation formula, it is assumed that the earth's surface is a sphere, and the great circle distance formula is used to calculate the distance between two points.

[0067] Step S233: By comparing the calculation results, obtain the reference point on the way or the destination with the shortest distance to the receiving address of each order, and classify each order into the transportation direction to which the reference point on the way or the destination belongs, that is, determine the transportation direction to which the receiving address of each order belongs.

[0068] Specifically, by traversing and calculating the distances between the receiving addresses of each order and all the reference points or destinations on the transportation route directions in the transportation route direction table, and then comparing the magnitudes of all the calculation results, the reference point or destination closest to the receiving address of each order can be found, which can be expressed as:

[0069]

[0070] Among them, is a preset set of route tables.

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

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

[0073] As Figure 4 shown, step S3: Classify each order according to the transportation direction, vehicle type requirements, goods loading method, and goods stacking requirements to which the receiving address of each order belongs, and obtain several order combinations;

[0074] Specifically, step S3 includes the following steps:

[0075] Step S31: Order feature extraction and definition: Order features include the transportation direction, vehicle type requirements, goods loading method, and goods stacking requirements to which the receiving address of each order belongs, which are respectively marked as 、 、 、 Among them = 1, 2... n, represents the number of the th order;

[0076] Step S32: Classify each order according to the transportation direction, vehicle type requirements, goods loading method, and goods stacking requirements to which the receiving address of each order belongs, and construct a dictionary according to the classification results;

[0077] Among them, the keys of the dictionary are classification categories including transportation direction, vehicle type requirements, cargo loading method, and cargo stacking requirements, marked as , and the values of the dictionary are sets of all orders included in the corresponding categories.

[0078] Specifically, in this embodiment, four classification criteria, namely the transportation direction, vehicle type requirements, cargo loading method, and cargo stacking requirements of the delivery address of each order, are emphasized to classify the orders. In other embodiments, the classification criteria can also be added or modified, such as adding delivery deadline requirements. By classifying the orders, it is convenient to subsequently allocate different orders to transportation vehicles. By creating a data structure such as a dictionary, it is convenient for subsequent rapid processing of the classified data.

[0079] Among them, the dictionary formed by all orders after classification, that is, the grouped dictionary, can be expressed as:

[0080]

[0081] Each classification may include one or more orders. Specifically, during classification, first, a new classification is created based on the first order. Subsequently, if the second order is the same as the first order according to the classification criteria, the second order is classified under the classification of the first order; if not, a new classification is created. By analogy, all orders are traversed and classified until all orders are classified, and several classified order combinations can be obtained. Each order combination includes one or more orders.

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

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

[0084] For example Figure 5 As shown, step S4: Using a heuristic algorithm and a preset allocation rule, allocate the orders in all order combinations to the vehicles in the transportation vehicle table to obtain several transportation order combinations;

[0085] Specifically, the heuristic algorithm includes a greedy algorithm and a backtracking optimization method. The greedy algorithm is a hierarchical processing method, which means that in each step of selection, the best or optimal (i.e., the most favorable) choice is made, hoping to lead to a globally best or optimal result. It is usually used to solve optimization problems, especially those that can be decomposed into a series of local selections. For certain specific types of problems, it can not only quickly find a solution but often find the optimal solution.

[0086] In this case, the idea of using the greedy algorithm is to give priority to placing orders with larger weights or larger occupied volumes into transportation vehicles with sufficient capacity, in order to minimize the transportation cost and maximize the vehicle utilization rate. Specifically, in this embodiment, the allocation of orders in all order combinations to the vehicles in the transportation vehicle table can be regarded as a multi-dimensional bin packing problem (MDBPP), and its goal is to reasonably combine a group of orders so as to load the most orders into vehicles with limited capacity and load weight, and minimize the number of vehicles used and the total transportation cost.

[0087] The backtracking optimization method 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 construct the solution of the problem while checking whether the candidate solution meets the constraints of the problem. If not, backtrack (undo the previous selection) and try the next candidate solution. The backtracking optimization method is beneficial for 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 manifested as, after allocating an order to a vehicle in the transportation vehicle table, judging whether the vehicle meets the conditions for transporting the order according to the preset allocation rules.

[0088] Specifically, adopting the heuristic algorithm and the preset allocation rules, the allocation of orders in all order combinations to the vehicles in the transportation vehicle table specifically includes: allocating the orders in each order combination to the vehicles in the transportation vehicle table in descending order of the number of cargo carrying units;

[0089] The preset allocation rules include: the total weight of the goods of several orders allocated 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 allocated to each vehicle is less than or equal to the maximum capacity of the vehicle, the transportation directions of several orders allocated to each vehicle are the same, the vehicle type requirements of several orders allocated to each vehicle are the same, the cargo loading methods of several orders allocated to each vehicle are the same, the cargo stacking requirements of several orders allocated to each vehicle are the same, and the number of orders allocated to each vehicle does not exceed the preset value.

[0090] Among them, the preset allocation rule includes that the number of orders assigned to each vehicle does not exceed a preset value (such as 3). This is to limit the number of orders transported by each vehicle, thereby avoiding delays in the transportation time limit due to each vehicle transporting too many orders and ensuring the quality of transportation services. The volume of the goods for each order can be calculated based on the goods loading method and the number of goods loading units. Since pallets and cartons are generally customized and their occupied volume is fixed, after knowing the goods loading method and the number of goods loading units, multiplying the volume of the pallet or carton by the number of goods loading units can calculate the total volume occupied by the goods of an order.

[0091] The specific allocation process is as follows. Assume that after successfully allocating the first order to the first transport vehicle according to the above preset allocation rule, a transport vehicle combination is created, and at the same time, the remaining capacity and remaining load of this vehicle are updated, and the goods loading method and goods stacking requirements in this transport vehicle combination are restricted. Subsequently, the second order also starts traversing from the first transport vehicle. If it also meets the preset allocation rule, the second order is also added to the transport vehicle combination, and then the remaining capacity and remaining load of this vehicle are continuously updated. And so on until all orders are allocated. Among them, if the load, capacity, or the number of orders assigned to a certain transport vehicle has reached the upper limit, this transport vehicle is removed from the traversal list.

[0092] When all the vehicles in the transport vehicle list have been allocated or none of them can 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 list to facilitate the subsequent dispatch of transport vehicles based on this data. The vehicle models, load capacities, and capacities of the newly added vehicles are determined with reference to the template data formed based on historical data.

[0093] 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.

[0094] Specifically, step S5 includes the following steps:

[0095] Step S51: Merge those transport order combinations in all transport order combinations that have the same sections in the transport direction. If the merged transport order combination meets the preset allocation rule in all other conditions except the transport direction, it indicates a successful merge;

[0096] Specifically, having the same sections in the transport direction means that the sections passed by the vehicle transport routes in one transport order combination and the sections passed by the vehicle transport routes in another transport order combination have a relationship of being exactly the same (such as passing through the same toll gate or highway section), or the former completely contains the latter, or the latter completely contains the former.

[0097] Step S52: Sort the transportation order combinations in descending order according to the remaining load capacity of each vehicle in all transportation order combinations, and select the transportation order combinations with a remaining load capacity greater than zero as the first set; sort the transportation order combinations in ascending order according to the total weight of the goods in all transportation order combinations, and select the transportation order combinations with a total weight of goods less than or equal to the maximum remaining load capacity in the first set as the second set;

[0098] Merge the transportation order combinations with vehicle type requirements and those without vehicle type requirements in the transportation order combinations of the first set and the second set, that is, try to merge the orders in the transportation order combinations of the second set and allocate them to the vehicles in the transportation order combinations of the first set. If the transportation order combinations of the first set meet the preset allocation rules in all other conditions except for the vehicle type requirements after the merger, it indicates that the merger is successful;

[0099] Specifically, the essence of this step is mainly to merge the transportation order combinations with vehicle type requirements and those without vehicle type requirements, and compatibly merge the transportation order combinations with vehicle type requirements through the transportation order combinations without vehicle type requirements, and then they become transportation orders with vehicle type requirements.

[0100] By sorting and screening the transportation order combinations, the calculation amount can be reduced, which is convenient for the subsequent merger of transportation order combinations. Among them, after sorting, the transportation order combinations that do not meet the conditions, such as those with a remaining load capacity of zero and a total weight of goods greater than the maximum remaining load capacity, are excluded, which is beneficial to improving the merger efficiency and avoiding unnecessary mergers. Then, all transportation order combinations are traversed to maximize the utilization of the capacity and load capacity of all vehicles. The sorting method can also be to sort the transportation order combinations in descending order according to the remaining capacity of each vehicle in all transportation order combinations.

[0101] In addition, when all the orders in the vehicle of a certain transportation order combination are merged into the vehicles of other transportation order combinations, then this transportation order combination needs to be deleted.

[0102] In other embodiments, it is also possible to try to merge the transportation order combinations with stacking requirements and those without stacking requirements. For example, place the goods with stacking requirements on one side of the vehicle, and place the goods without stacking requirements on the other side of the vehicle.

[0103] Step S53: Adjust the sorting of several orders in each transportation order combination in ascending order according to the distance between the delivery addresses of several orders in each transportation order combination and the departure point of the transportation vehicle;

[0104] Specifically, by adjusting the transportation order of each order in each transportation order combination, it is convenient for the transportation vehicle to transport the order goods according to the adjusted order, thereby saving the transportation mileage and transportation cost.

[0105] Step S54: Calculate the total transportation mileage and total transportation cost of all transportation vehicles according to the merged, optimized, and sorted transportation order combinations, and perform analysis and optimization based on the calculation results.

[0106] Specifically, after merging and optimization, evaluate the transportation route of each transportation order combination, calculate the transportation mileage and total transportation cost of the combination. The total transportation cost includes tolls, fuel consumption and other expenses, all of which can be directly or indirectly related to the transportation mileage, that is, the smaller the transportation mileage, the lower the total transportation cost.

[0107] By calculating the total transportation mileage and total transportation cost of all transportation vehicles in the optimized transportation order combination, and then comparing these data with the total transportation mileage and total transportation cost obtained by using the traditional method for order allocation and combination previously, it can be obtained to what extent the optimized transportation order combination can save the transportation mileage and transportation cost. In addition, it is also possible to further analyze and adjust according to the optimization results to continuously improve the logistics transportation order combination.

[0108] As Figure 6 shown, where the abscissa is the date and the ordinate is the total transportation mileage. The triangular line represents the total logistics transportation mileage graph of the order allocation using the existing manual order consolidation and allocation method every day in a month, and the dot line represents the total logistics transportation mileage graph of the order allocation using the logistics transportation order combination allocation method of the present invention every day in a month. It can be clearly seen that the dot line is always below the triangular 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 with the existing manual order consolidation method, thereby effectively saving the logistics transportation cost.

[0109] The above shows and describes the basic principles, main features and advantages of the present invention. Those skilled in the art of this industry should understand that the present invention is not limited by the above embodiments. What is described in the above embodiments and the specification only illustrates the principles of the present invention. Without departing from the spirit and scope of the present invention, the present invention will have various changes and improvements, and these changes and improvements all fall within the scope of the present invention claimed. The scope of protection claimed by the present invention is defined by the appended claims and their equivalents.

Claims

1. A method for combined allocation of logistics transportation orders, characterized in that, It includes the following steps: Step S1: Obtain the goods order form, transportation route direction form, and transportation vehicle form; Step S2: According to the goods order form, obtain the data of the receiving address, goods weight, vehicle type requirement, goods loading method, number of goods loading units, and goods stacking requirement for each order. According to the receiving address of each order and the transportation route direction form, determine the transportation direction to which the receiving address of each order belongs. According to the transportation vehicle form, obtain the data of the vehicle type, maximum load capacity, and maximum capacity of each vehicle; Step S3: Classify each order according to the transportation direction, vehicle type requirement, goods loading method, and goods stacking requirement to which the receiving address of each order belongs, and obtain several order combinations; The step S3 includes the following steps: Step S31: Order feature extraction and definition: Order features include the transportation direction to which the delivery address of each order belongs, vehicle type requirements, cargo loading method, and cargo stacking requirements, which are respectively marked as , , , , where = 1, 2... n, represents the number of the th order; Step S32: Classify each order according to the transportation direction, vehicle type requirement, goods loading method, and goods stacking requirement to which the receiving address of each order belongs, and construct a dictionary according to the classification result; Among them, the keys of the dictionary are classification categories including transportation direction, vehicle type requirements, cargo loading method, and cargo stacking requirements, marked as The values of the dictionary are sets of all orders included in the corresponding categories; Step S4: Use a heuristic algorithm and a preset allocation rule to allocate the orders in all order combinations to the vehicles in the transportation vehicle form, and obtain several transportation order combinations; The heuristic algorithm includes a greedy algorithm and a backtracking optimization method. The specific process of using the heuristic algorithm and the preset allocation rule to allocate the orders in all order combinations to the vehicles in the transportation vehicle form is as follows: Allocate the orders in each order combination to the vehicles in the transportation vehicle form in descending order of the number of goods loading units; The preset allocation rule includes: The total weight of the goods of several orders allocated to each vehicle is less than or equal to the maximum load capacity of the vehicle, the total volume of the goods of several orders allocated to each vehicle is less than or equal to the maximum capacity of the vehicle, the transportation directions of several orders allocated to each vehicle are the same, the vehicle type requirements of several orders allocated to each vehicle are the same, the goods loading methods of several orders allocated to each vehicle are the same, the goods stacking requirements of several orders allocated to each vehicle are the same, and the number of orders allocated to each vehicle does not exceed a preset value; Among them, the volume of the goods of each order can be calculated according to the goods loading method and the number of goods loading units; Step S5: Merge and optimize the transportation order combinations, and calculate the total transportation mileage and total transportation cost of the optimized transportation order combinations.

2. The method for combined allocation of logistics transportation orders according to claim 1, wherein, The step S2 includes the following steps: Step S21: Use the method of regular expression and keyword matching to extract the data of the receiving address, goods weight, vehicle type requirement, goods loading method, number of goods loading units, and goods stacking requirement for each order from the goods order form; Step S22: Use an external API interface to parse the data of the receiving address of each order into corresponding longitude and latitude coordinates; Step S23: Compare the longitude and latitude coordinates corresponding to the receiving address of each order with the transportation route direction form to determine the transportation direction to which the receiving address of each order belongs.

3. The method for combined allocation of logistics transportation orders according to claim 1, characterized in that The step S23 includes the following steps: Step S231: Obtain the longitude and latitude coordinates of the departure place, destination, and reference points on the way of each transportation direction in the transportation route direction form; Step S232: Calculate the distances between the receiving address of each order and all the reference points or destinations on the transportation route directions in the transportation route direction table one by one. The specific calculation formula is as follows: Among them, is the radius of the earth, taken as 6,371 kilometers, is the latitude coordinate of the reference point or destination on the way in each transportation direction, is the latitude coordinate of the receiving address of each order, is the longitude coordinate of the reference point or destination on the way in each transportation direction, is the longitude coordinate of the receiving address of each order; Step S233: By comparing the calculation results, obtain the reference point or destination on the way that is the shortest distance from the receiving address of each order, and classify each order into the transportation direction to which the reference point or destination belongs, that is, determine the transportation direction to which the receiving address of each order belongs.

4. A method for combined allocation of logistics transportation orders according to claim 1, characterized in that Step S5 includes the following steps: Step S51: Combine the transportation order combinations with the same road sections in the transportation directions. If the combined transportation order combinations meet the preset allocation rules in other conditions except the transportation directions, it indicates that the combination is successful; Step S52: Sort the transportation order combinations in descending order according to the remaining load capacity of each vehicle in all the transportation order combinations, and select the transportation order combinations with the remaining load capacity greater than zero as the first set; sort the transportation order combinations in ascending order according to the total weight of the goods in all the transportation order combinations, and select the transportation order combinations with the total weight of the goods less than or equal to the maximum remaining load capacity in the first set as the second set; Combine the transportation order combinations with vehicle type requirements and those without vehicle type requirements in the first set of transportation order combinations and the second set of transportation order combinations, that is, try to combine and allocate the orders in the transportation order combinations in the second set to the vehicles in the transportation order combinations in the first set. If the combined transportation order combinations in the first set meet the preset allocation rules in other conditions except the vehicle type requirements, it indicates that the combination is successful; Step S53: Adjust the sorting of several orders in each transportation order combination in ascending order according to the distances between the delivery addresses of several orders in each transportation order combination and the departure point of the transportation vehicle; Step S54: Calculate the total transportation mileage and total transportation cost of all the transportation vehicles according to the combined, optimized and sorted transportation order combinations, and conduct analysis and optimization according to the calculation results.

Images