Order processing method, apparatus, computing device, and medium

CN116187660BActive Publication Date: 2026-10-27HANGZHOU NETEASE ZAIGU TECH CO LTD
View PDF 3 Cites 0 Cited by

Patent Information

Application Number
CN202211626171.6
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-12-15
Publication Date
2026-10-27
Estimated Expiration
2042-12-15

AI Technical Summary

Technical Problem

[0004]在货物运输行业,往往会出现存在多个仓库,每个仓库每天会持续产生将货物运输到其他多个仓库的运输需求,不同运输需求所需运输货物的质量、体积、路程等有所不同,且仓库内可提供多种不同车型和成本报价的车辆来提供物流运输服务,仅凭人工分配的方式难以应对物流运输服务的复杂业务场景,因此,亟需一种订单处理方法,以基于运输需求和车辆资源确定来自动从多个可选的运输方案中进行最终运输方案的确定,从而可以提高运输方案的确定效率

Benefits of technology

[0053]本公开通过基于多个待处理订单的订单信息,将多个待处理订单划分到需在最近批次进行运输的订单所组成的第一订单集合、以及可以在任意批次进行运输均可的订单所组成的第二订单集合中,从而确定满足第一订单集合和第二订单集合的运输需求的多个备选车辆集合,进而从多个备选车辆集合中确定目标车辆集合,并为目标车辆集合所包括的多个车辆分配待处理订单,以实现运输方案的自动确定,从而可以提高运输方案的确定效率。

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN116187660B_ABST
    Figure CN116187660B_ABST
Patent Text Reader

Abstract

Embodiments of the present disclosure provide an order processing method, device, computing equipment and medium. The present disclosure divides a plurality of to-be-processed orders into a first order set composed of orders that need to be transported in the nearest batch and a second order set composed of orders that can be transported in any batch based on order information of the plurality of to-be-processed orders, determines a plurality of candidate vehicle sets that meet the transportation requirements of the first order set and the second order set, and then determines a target vehicle set from the plurality of candidate vehicle sets and allocates to-be-processed orders to a plurality of vehicles included in the target vehicle set, so as to automatically determine a transportation scheme, thereby improving the determination efficiency of the transportation scheme.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The embodiments of this disclosure relate to the field of data processing technology, and more specifically, the embodiments of this disclosure relate to an order processing method, apparatus, computing device, and medium. Background Technology

[0002] This section is intended to provide background or context for the embodiments of this disclosure as set forth in the claims. The description herein is not intended to be a prior art simply because it is included in this section.

[0003] Thanks to the rapid development of the e-commerce industry in recent years, the freight transportation industry, which is at the forefront of the e-commerce industry chain, has also developed rapidly. The freight transportation volume has increased year by year, and the requirements for the speed and quality of freight transportation have also continued to improve.

[0004] In the freight transportation industry, there are often multiple warehouses, each generating a continuous daily demand to transport goods to other warehouses. These different demands require varying qualities, volumes, and distances of goods, and the warehouses offer a variety of vehicles with different models and cost quotes to provide logistics services. Manual allocation alone is insufficient to handle the complex business scenarios of logistics transportation services. Therefore, there is an urgent need for an order processing method that can automatically determine the final transportation plan from multiple available options based on transportation demand and vehicle resources, thereby improving the efficiency of transportation plan determination. Summary of the Invention

[0005] In view of the deficiencies in the related technologies, the embodiments of this disclosure provide at least one order processing method, apparatus, computing device and medium.

[0006] In a first aspect of this disclosure, an order processing method is provided, the method comprising:

[0007] When multiple pending orders are obtained, the orders included in the first order set and the orders included in the second order set are determined. The first order set is the set of orders that need to be shipped in the most recent batch, and the second order set is the set of orders that can be shipped in any batch.

[0008] Identify multiple alternative vehicle sets that can meet the transportation needs of the first order set and the second order set, each alternative vehicle set including at least one vehicle to be assigned;

[0009] The target vehicle set is determined from multiple alternative vehicle sets, and pending orders are assigned to multiple vehicles included in the target vehicle set. The vehicles included in the target vehicle set are used to provide transportation services for multiple pending orders.

[0010] In some embodiments of this disclosure, determining a plurality of alternative vehicle sets that satisfy the transportation needs of a first order set and a second order set includes:

[0011] Obtain multiple initial vehicle sets, each containing one vehicle to be assigned;

[0012] Based on the first cargo information corresponding to the first order set and the second cargo information corresponding to the second order set, vehicles to be assigned are added to each initial vehicle set to obtain multiple candidate vehicle sets. The first cargo information is used to indicate the total cargo volume and / or total cargo weight of the orders included in the first order set, and the second cargo information is used to indicate the total cargo volume and / or total cargo weight of the orders included in the second order set.

[0013] In some embodiments of this disclosure, based on the first cargo information corresponding to the first order set and the second cargo information corresponding to the second order set, vehicles to be allocated are added to each initial vehicle set to obtain multiple candidate vehicle sets, including:

[0014] For any initial vehicle set, if the loading information of the vehicles to be assigned in the initial vehicle set cannot meet the first cargo information and the second cargo information, then add vehicles to be assigned to the initial vehicle set until the loading information of the target vehicle in the initial vehicle set after adding vehicles to be assigned meets the first cargo information and the second cargo information, and obtain the candidate vehicle set corresponding to the initial vehicle set. The target vehicle is the vehicle with the largest loading volume or loading weight in the vehicle set.

[0015] For any initial vehicle set, if the loading information of the vehicles to be allocated in the initial vehicle set already satisfies the first cargo information and the second cargo information, then the initial vehicle set is used as the candidate vehicle set corresponding to the initial vehicle set.

[0016] The loading information is used to indicate the vehicle's loading volume and / or loading weight.

[0017] In some embodiments of this disclosure, after adding vehicles to be allocated to each initial vehicle set based on the first cargo information corresponding to the first order set and the second cargo information corresponding to the second order set, to obtain multiple candidate vehicle sets, the method further includes:

[0018] For any set of candidate vehicles, if the loading information of the vehicle to be assigned in the set of candidate vehicles cannot meet the first cargo information, then the set of candidate vehicles whose loading information cannot meet the first cargo information is deleted from the multiple sets of candidate vehicles. The loading information is used to indicate the loading volume and / or loading weight of the vehicle.

[0019] In some embodiments of this disclosure, determining a target vehicle set from a plurality of candidate vehicle sets and assigning pending orders to the plurality of vehicles included in the target vehicle set includes:

[0020] For any set of candidate vehicles, based on pre-set target relationship data, the values ​​of target relationship data for multiple candidate transportation schemes corresponding to the set of candidate vehicles are determined. The candidate transportation scheme is used to indicate the pending orders to be transported by each vehicle in the set of candidate vehicles. The target relationship data is used to indicate the target cargo information when the same vehicle in the set of candidate vehicles transports different pending orders. The target cargo information is used to indicate the total volume and / or total weight of the cargo in the pending orders transported by the vehicle.

[0021] For any set of candidate vehicles, based on the values ​​of the target relationship data of multiple candidate transportation schemes, orders to be processed are assigned to multiple vehicles included in the set of candidate vehicles to obtain the target transportation scheme corresponding to the set of candidate vehicles.

[0022] Based on the cost information of the target transportation plan corresponding to each candidate vehicle set, the target vehicle set is determined from multiple candidate vehicle sets, and pending orders are assigned to multiple vehicles included in the target vehicle set according to the target transportation plan corresponding to the target vehicle set.

[0023] In some embodiments of this disclosure, before determining the target vehicle set from multiple candidate vehicle sets based on the cost information of the target transportation scheme corresponding to each candidate vehicle set, the method further includes:

[0024] For any set of candidate vehicles, the cost information of the target transportation plan corresponding to each set of candidate vehicles is determined based on the vehicle models of the vehicles included in the set, the cargo information of each order to be processed, and the origin and destination of transportation.

[0025] In some embodiments of this disclosure, when multiple pending orders are obtained, determining the orders included in the first order set and the orders included in the second order set includes:

[0026] Based on at least one of the following: order information of multiple pending orders, vehicle information of multiple pending vehicles, route information of transportation routes, warehouse information of shipping warehouses, and business constraint information, determine a first set of orders consisting of orders that need to be transported in the most recent batch among the multiple pending orders, and a third set of orders consisting of orders that need to be transported in a non-most recent batch among the multiple pending orders.

[0027] Based on multiple pending orders, the first order set, and the third order set, the second order set is determined.

[0028] In a second aspect of this disclosure, an order processing apparatus is provided, the apparatus comprising:

[0029] The first determining module is used to determine the orders included in the first order set and the orders included in the second order set when multiple orders to be processed are obtained. The first order set is a set of orders that need to be shipped in the most recent batch, and the second order set is a set of orders that can be shipped in any batch.

[0030] The second determining module is used to determine multiple alternative vehicle sets that meet the transportation needs of the first order set and the second order set, each alternative vehicle set including at least one vehicle to be allocated;

[0031] The allocation module is used to determine the target vehicle set from multiple candidate vehicle sets and to allocate pending orders to multiple vehicles included in the target vehicle set. The vehicles included in the target vehicle set are used to provide transportation services for multiple pending orders.

[0032] In some embodiments of this disclosure, the second determining module, when determining a plurality of alternative vehicle sets that satisfy the transportation needs of the first order set and the second order set, is used to:

[0033] Obtain multiple initial vehicle sets, each containing one vehicle to be assigned;

[0034] Based on the first cargo information corresponding to the first order set and the second cargo information corresponding to the second order set, vehicles to be assigned are added to each initial vehicle set to obtain multiple candidate vehicle sets. The first cargo information is used to indicate the total cargo volume and / or total cargo weight of the orders included in the first order set, and the second cargo information is used to indicate the total cargo volume and / or total cargo weight of the orders included in the second order set.

[0035] In some embodiments of this disclosure, the second determining module, when adding vehicles to be allocated to each initial vehicle set based on the first cargo information corresponding to the first order set and the second cargo information corresponding to the second order set to obtain multiple candidate vehicle sets, is configured to:

[0036] For any initial vehicle set, if the loading information of the vehicles to be assigned in the initial vehicle set cannot meet the first cargo information and the second cargo information, then add vehicles to be assigned to the initial vehicle set until the loading information of the target vehicle in the initial vehicle set after adding vehicles to be assigned meets the first cargo information and the second cargo information, and obtain the candidate vehicle set corresponding to the initial vehicle set. The target vehicle is the vehicle with the largest loading volume or loading weight in the vehicle set.

[0037] For any initial vehicle set, if the loading information of the vehicles to be allocated in the initial vehicle set already satisfies the first cargo information and the second cargo information, then the initial vehicle set is used as the candidate vehicle set corresponding to the initial vehicle set.

[0038] The loading information is used to indicate the vehicle's loading volume and / or loading weight.

[0039] In some embodiments of this disclosure, the device further includes:

[0040] The deletion module is used to delete, for any set of candidate vehicles, the set of candidate vehicles whose loading information cannot meet the first cargo information from multiple sets of candidate vehicles. The loading information is used to indicate the loading volume and / or loading weight of the vehicle.

[0041] In some embodiments of this disclosure, the allocation module, when determining a target vehicle set from a plurality of candidate vehicle sets and allocating pending orders to the plurality of vehicles included in the target vehicle set, is configured to:

[0042] For any set of candidate vehicles, based on pre-set target relationship data, the values ​​of target relationship data for multiple candidate transportation schemes corresponding to the set of candidate vehicles are determined. The candidate transportation scheme is used to indicate the pending orders to be transported by each vehicle in the set of candidate vehicles. The target relationship data is used to indicate the target cargo information when the same vehicle in the set of candidate vehicles transports different pending orders. The target cargo information is used to indicate the total volume and / or total weight of the cargo in the pending orders transported by the vehicle.

[0043] For any set of candidate vehicles, based on the values ​​of the target relationship data of multiple candidate transportation schemes, orders to be processed are assigned to multiple vehicles included in the set of candidate vehicles to obtain the target transportation scheme corresponding to the set of candidate vehicles.

[0044] Based on the cost information of the target transportation plan corresponding to each candidate vehicle set, the target vehicle set is determined from multiple candidate vehicle sets, and pending orders are assigned to multiple vehicles included in the target vehicle set according to the target transportation plan corresponding to the target vehicle set.

[0045] In some embodiments of this disclosure, the device further includes:

[0046] The third determining module is used to determine the cost information of the target transportation plan corresponding to each candidate vehicle set based on the vehicle models of the vehicles included in the candidate vehicle set and the cargo information and transportation origin and destination of each order to be processed.

[0047] In some embodiments of this disclosure, the first determining module, when determining the orders included in the first order set and the orders included in the second order set when multiple orders to be processed are obtained, is configured to:

[0048] Based on at least one of the following: order information of multiple pending orders, vehicle information of multiple pending vehicles, route information of transportation routes, warehouse information of shipping warehouses, and business constraint information, determine a first set of orders consisting of orders that need to be transported in the most recent batch among the multiple pending orders, and a third set of orders consisting of orders that need to be transported in a non-most recent batch among the multiple pending orders.

[0049] Based on multiple pending orders, the first order set, and the third order set, the second order set is determined.

[0050] In a third aspect of the present disclosure, a computing device is provided, the computing device including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to perform the operations performed by the order processing method provided in the first aspect and any embodiment of the first aspect.

[0051] In a fourth aspect of this disclosure, a computer-readable storage medium is provided, on which a program is stored, the program being executed by a processor of the order processing method provided in the first aspect and any embodiment thereof.

[0052] In a fifth aspect of this disclosure, a computer program product is provided, including a computer program that, when executed by a processor, performs the operations performed by the order processing method provided in the first aspect and any embodiment thereof.

[0053] This disclosure, based on order information of multiple pending orders, divides these orders into a first order set consisting of orders that need to be transported in the most recent batch, and a second order set consisting of orders that can be transported in any batch. This determines multiple sets of alternative vehicles that meet the transportation needs of the first and second order sets. Then, a target vehicle set is determined from the multiple sets of alternative vehicles, and pending orders are assigned to the multiple vehicles included in the target vehicle set. This achieves automatic determination of the transportation plan, thereby improving the efficiency of transportation plan determination. Attached Figure Description

[0054] The above and other objects, features, and advantages of this disclosure will become readily apparent from the following detailed description of exemplary embodiments, taken in conjunction with the accompanying drawings. Several embodiments of this disclosure are illustrated in the drawings by way of example and not limitation, in which:

[0055] Figure 1 This is a flowchart illustrating an order processing method according to an embodiment of the present disclosure;

[0056] Figure 2 This is a block diagram illustrating an order processing apparatus according to an embodiment of the present disclosure;

[0057] Figure 3 This is a schematic diagram illustrating a computer-readable storage medium according to an embodiment of the present disclosure;

[0058] Figure 4 This is a schematic diagram of the structure of a computing device according to an embodiment of the present disclosure;

[0059] In the accompanying drawings, the same or corresponding reference numerals indicate the same or corresponding parts. Detailed Implementation

[0060] The principles and spirit of this disclosure will now be described with reference to several exemplary embodiments. It should be understood that these embodiments are given merely to enable those skilled in the art to better understand and implement this disclosure, and are not intended to limit the scope of this disclosure in any way. Rather, these embodiments are provided to make this disclosure more thorough and complete, and to fully convey the scope of this disclosure to those skilled in the art.

[0061] Those skilled in the art will recognize that embodiments of this disclosure can be implemented as a system, apparatus, device, method, or computer program product. Therefore, this disclosure can be specifically implemented in the following forms: entirely hardware, entirely software (including firmware, resident software, microcode, etc.), or a combination of hardware and software.

[0062] According to the embodiments of this disclosure, an order processing method is proposed so that vehicles can be automatically allocated to multiple pending orders through the order processing method provided by this disclosure, so as to provide transportation services for multiple pending orders through the allocated vehicles, so that the allocated vehicles can not only meet the transportation needs of multiple pending orders, but also ensure that the allocated vehicles have the highest cost performance, thereby meeting the transportation needs of various transportation scenarios in the freight transportation industry.

[0063] The above order processing method can be executed by a computing device. Optionally, the computing device can be a terminal device, such as a desktop computer, portable computer, laptop computer, tablet computer, smartphone, smartwatch, etc. Alternatively, the computing device can be a server, such as a single server, multiple servers, server cluster, cloud computing platform, etc. This disclosure does not limit the type of computing device.

[0064] It should be noted that the above application scenarios are shown only to facilitate understanding of the spirit and principles of this disclosure. The implementation of this disclosure is not limited in any way; on the contrary, the implementation of this disclosure can be applied to any applicable scenario.

[0065] Next, refer to Figure 1 This describes an order processing method provided according to exemplary embodiments of the present disclosure.

[0066] See Figure 1 , Figure 1 This is a flowchart illustrating an order processing method according to an embodiment of the present disclosure, such as... Figure 1 As shown, the method includes:

[0067] S101. Based on the order information of multiple pending orders, determine the orders included in the first order set and the orders included in the second order set. The first order set is a set of orders that need to be shipped in the most recent batch, and the second order set is a set of orders that can be shipped in any batch.

[0068] By dividing multiple pending orders into a first order set and a second order set based on their order information, vehicles can be allocated based on the demand for delivery batches according to the first and second order sets.

[0069] S102. Determine multiple alternative vehicle sets that meet the transportation needs of the first order set and the second order set, wherein each alternative vehicle set includes at least one vehicle to be allocated.

[0070] It should be noted that the candidate vehicle set satisfies the transportation needs of both the first and second order sets. That is, the total volume and / or total weight of the cargo indicated by the total loading information of the vehicles included in the candidate vehicle set is greater than or equal to the total volume and / or total weight of the cargo in the orders included in the first and second order sets. The total loading information indicates the total volume and / or total weight of cargo that the vehicles included in the candidate vehicle set can carry.

[0071] S103. Determine the target vehicle set from multiple alternative vehicle sets, and assign pending orders to the multiple vehicles included in the target vehicle set. The vehicles included in the target vehicle set are used to provide transportation services for the multiple pending orders.

[0072] This disclosure, based on order information of multiple pending orders, divides these orders into a first order set consisting of orders that need to be transported in the most recent batch, and a second order set consisting of orders that can be transported in any batch. This determines multiple sets of alternative vehicles that meet the transportation needs of the first and second order sets. Then, a target vehicle set is determined from the multiple sets of alternative vehicles, and pending orders are assigned to the multiple vehicles included in the target vehicle set. This achieves automatic determination of the transportation plan, thereby improving the efficiency of transportation plan determination.

[0073] After introducing the basic principles of this disclosure, various non-limiting embodiments of this disclosure will be described in detail below.

[0074] It should be noted that, in order to ensure that the solution provided in this disclosure can be executed smoothly, the attribute information of various data entities can be extracted in advance, so that multiple pending orders can be assigned to at least one vehicle for transportation based on the extracted information.

[0075] Optionally, the data entities involved in this disclosure may include pending orders, vehicles, transportation routes, and shipping locations (such as shipping warehouses), etc., wherein the attribute information of pending orders may be called order information, the attribute information of vehicles may be called vehicle information, the attribute information of transportation routes may be called route information, and the attribute information of shipping warehouses may be called warehouse information.

[0076] The attribute information of different data entities will be introduced separately below.

[0077] First, let's introduce the attribute information of the orders to be processed (i.e., the order information):

[0078] When an order is generated, the computing device can record various information about it, and then extract the order information based on the recorded information. Optionally, the extracted order information can be stored in a database associated with the computing device, so that the order information can be retrieved directly from the database later.

[0079] Optionally, the order information may include an order identifier (ID), the volume of the goods included in the order (hereinafter referred to as order volume), the weight of the goods included in the order (hereinafter referred to as cargo weight), the order shipping origin (such as the starting warehouse), the order shipping destination (such as the destination warehouse), the order generation time, and the expected delivery time, etc. This disclosure does not limit the content included in the order information.

[0080] In one possible implementation, the target database can store order information in tabular form. For example, order information can be stored in the target database in the form shown in Table 1 below:

[0081] Table 1

[0082]

[0083] The following section introduces the vehicle's attribute information (i.e., vehicle information):

[0084] After a vehicle is requisitioned by a logistics company, the computing device can record various types of vehicle information. Furthermore, upon receiving pending orders, it can refine the recorded information based on these orders, thereby enabling the extraction of vehicle information. Optionally, the extracted vehicle information can be stored in a database associated with the computing device, allowing for direct retrieval of vehicle information from this database later.

[0085] Optionally, vehicle information may include the vehicle transportation origin (such as the starting warehouse), vehicle transportation destination (such as the destination warehouse), vehicle model, maximum vehicle loading volume (also known as the upper limit of vehicle loading volume), maximum vehicle loading weight (also known as the upper limit of vehicle loading weight), and vehicle cost, etc., determined based on the order to be processed. This disclosure does not limit the content included in the vehicle information.

[0086] In one possible implementation, the target database can store vehicle information in tabular form. For example, vehicle information can be stored in the target database in the form shown in Table 2 below:

[0087] Table 2

[0088]

[0089] The following describes the attribute information of the transportation route (i.e., the route information):

[0090] Once an order is generated, its origin and destination are determined, allowing the transportation route to be calculated. The computing device then obtains various information about the determined route and can extract the route information based on this information. Optionally, the extracted route information can be stored in a database associated with the computing device, so that the route information can be retrieved directly from the database later.

[0091] Optionally, the route information may include the origin (e.g., the starting warehouse), the destination (e.g., the destination warehouse), and the time taken for the transportation route determined based on the order to be processed, etc. This disclosure does not limit the content included in the route information.

[0092] In one possible implementation, the target database can store route information in tabular form. For example, route information can be stored in the target database in the form shown in Table 3 below:

[0093] Table 3

[0094] A B 24 A C 12 A D 36

[0095] Finally, the attribute information of the shipping warehouse (i.e., warehouse information) will be introduced:

[0096] Once an order is generated, the origin of each order's shipping route is determined. The computing device can then use the warehouse indicated by the origin as the shipping warehouse and extract warehouse information based on various details about the shipping warehouse. Optionally, the extracted warehouse information can be stored in a database associated with the computing device so that it can be retrieved directly from the database later.

[0097] Optionally, warehouse information may include the date of shipment, warehouse name, warehouse departure time, limit on the number of vehicles that can be shipped, maximum shipment volume, etc. This disclosure does not limit the content included in the warehouse information.

[0098] In one possible implementation, the target database can store warehouse information in tabular form. For example, warehouse information can be stored in the target database in the form shown in Table 4 below:

[0099] Table 4

[0100]

[0101] After extracting the attribute information of various data entities through the above process, orders and vehicles can then be allocated based on the obtained attribute information.

[0102] In some embodiments, when determining the orders included in the first order set and the orders included in the second order set in the case of obtaining multiple orders to be processed, step S101 can be achieved through the following steps:

[0103] S1011. Based on at least one of the following: order information of multiple pending orders, vehicle information of multiple pending vehicles, route information of transportation routes, warehouse information of shipping warehouses, and business constraint information, determine a first order set consisting of orders that need to be transported in the most recent batch among the multiple pending orders, and a third order set consisting of orders that need to be transported in a non-most recent batch among the multiple pending orders.

[0104] In one possible implementation, the computing device can determine, based on at least one of the following: order information of multiple pending orders, vehicle information of multiple pending vehicles, route information of transportation routes, warehouse information of shipping warehouses, and business constraint information, the pending orders that must be sent in the most recent batch (denoted as the first order) and the pending orders that must be sent in a non-most recent batch (denoted as the third order), so that multiple first orders can form a first order set and multiple third orders can form a third order set.

[0105] Among them, business constraint information can be used to indicate the constraints on the order delivery time of pending orders. For example, the time that pending orders stay in the warehouse cannot exceed the preset duration (such as 48 hours), pending orders must be delivered before the expected delivery time, and the delivery time of pending orders must be after the order generation time, etc.

[0106] Taking the business constraint that pending orders cannot stay in the warehouse for more than 48 hours as an example, for any pending order, by combining the order placement time in the order information, we can determine before which the pending order must be sent out. Then, by combining the warehouse shipping time in the warehouse information, we can determine whether the pending order must be sent out in the most recent batch.

[0107] Optionally, the order information can be set by the user when placing the order, or it can be automatically generated by the computing device based on at least one of the order information, vehicle information, route information and warehouse information. This disclosure does not limit this.

[0108] S1012. Based on multiple pending orders, the first order set, and the third order set, determine the second order set.

[0109] In one possible implementation, the second order set can be determined by the following formula (1):

[0110] I2=I-I1-I3 (1)

[0111] Where I represents a set of multiple orders to be processed, I1 represents the first set of orders, I2 represents the second set of orders, I3 represents the third set of orders, and I1∪I2∪I3=I.

[0112] Through the above process, multiple pending orders can be divided into a first order set, a second order set, and a third order set. Taking the business constraint that the waiting time of pending orders in the warehouse cannot exceed a preset time as an example, the orders included in the first order set are those whose waiting time in the warehouse will exceed the preset time when the second batch of vehicles is used for transportation. The orders included in the second order set are those whose waiting time in the warehouse will not exceed the preset time when the second batch of vehicles is used for transportation. The third order set is an empty set.

[0113] In one possible implementation, the departure time of the second batch of vehicles can be preset. Based on the order generation time of each order in the order information and the departure time of the second batch of vehicles in the vehicle information, the length of time each order stays in the warehouse can be determined. Orders with a stay time longer than the preset time are orders that need to be dispatched in the most recent batch and are assigned to the first order set. Orders with a stay time less than or equal to the preset time are orders that can be dispatched in either the most recent batch or a non-most recent batch and are assigned to the second order set. The third order set is denoted as the empty set.

[0114] For example, if the business constraint information is that pending orders must be delivered before the expected delivery time, then the first order set includes orders whose delivery time will exceed the expected delivery time when using the second batch of vehicles for transportation, the second order set includes orders whose delivery time will not exceed the expected delivery time when using the second batch of vehicles for transportation, and the third order set is an empty set.

[0115] In one possible implementation, the departure time of the second batch of vehicles can be pre-set, so that the estimated delivery time of each order can be determined based on the expected delivery time of each order in the order information and the transportation route time in the route information. Orders whose estimated delivery time exceeds the expected delivery time are orders that need to be sent in the most recent batch, and these orders that need to be sent in the most recent batch will be assigned to the first order set. Orders whose estimated delivery time does not exceed the expected delivery time are orders that can be sent in either the most recent batch or a non-most recent batch, and these orders that can be sent in either the most recent batch or a non-most recent batch will be assigned to the second order set. The third order set is denoted as the empty set.

[0116] For example, if the business constraint information is that the delivery time of the pending order must be after the order generation time, then the first order set is an empty set, the second order set includes orders whose generation time is earlier than the departure time of the current batch of vehicles, and the third order set includes orders whose generation time is later than the departure time of the current batch of vehicles.

[0117] In one possible implementation, the departure time of the current batch of vehicles can be pre-set. Based on the order generation time of each order in the order information, orders whose generation time is later than the departure time of the current batch of vehicles can be identified as orders that need to be sent in a non-recent batch. These orders that need to be sent in the most recent batch will be assigned to the third order set. Orders whose generation time is earlier than the departure time of the current batch of vehicles can be sent in either the most recent batch or a non-recent batch. These orders that can be sent in either the most recent batch or a non-recent batch will be assigned to the second order set. The first order set is denoted as the empty set.

[0118] The above are just a few exemplary ways to divide the order set based on different business constraint information, and do not constitute a limitation on the way the order set is divided in this disclosure. In more possible implementations, the business constraint information may include more other types of constraints, and correspondingly, there may be more ways to divide the order set.

[0119] After dividing the first order set and the second order set through the above process, step S102 can be used to determine multiple alternative vehicle sets that meet the transportation needs of the first order set and the second order set.

[0120] In some embodiments, step S102, when determining a plurality of alternative vehicle sets that satisfy the transportation needs of the first order set and the second order set, can be implemented in the following manner:

[0121] S1021. Obtain multiple initial vehicle sets, each initial vehicle set including one vehicle to be assigned.

[0122] In one possible implementation, multiple vehicles to be assigned can be sorted in order of increasing vehicle cost, thereby generating an initial vehicle set containing only that vehicle for each vehicle to be assigned, thus obtaining multiple initial vehicle sets.

[0123] S1022. Based on the first cargo information corresponding to the first order set and the second cargo information corresponding to the second order set, add vehicles to be assigned to each initial vehicle set to obtain multiple candidate vehicle sets. The first cargo information is used to indicate the total cargo volume and / or total cargo weight of the orders included in the first order set, and the second cargo information is used to indicate the total cargo volume and / or total cargo weight of the orders included in the second order set.

[0124] It should be noted that when determining the initial vehicle set, it was not considered whether the vehicles included in the initial vehicle set could meet the transportation needs of multiple pending orders. Therefore, there may be situations where the vehicles included in the initial vehicle set cannot meet the transportation needs of multiple pending orders. This necessitates adding vehicles to the initial vehicle set to obtain a candidate vehicle set that includes at least one vehicle, so that at least one vehicle included in the candidate vehicle set can meet the transportation needs of multiple pending orders.

[0125] Optionally, when adding vehicles to be assigned to each initial vehicle set based on the first cargo information corresponding to the first order set and the second cargo information corresponding to the second order set to obtain multiple candidate vehicle sets, this can be achieved in the following way:

[0126] In one possible implementation, for any initial vehicle set, if the loading information of the vehicles to be allocated in the initial vehicle set already satisfies the first cargo information and the second cargo information, then the initial vehicle set is used as the candidate vehicle set corresponding to the initial vehicle set.

[0127] It should be noted that the loading information of the vehicle to be assigned is used to indicate the loading volume and / or loading weight of the vehicle to be assigned. The loading information of the vehicle to be assigned satisfies the first cargo information and the second cargo information, that is, the loading volume of the vehicle to be assigned is greater than or equal to the total cargo volume of the orders included in the first order set and the second order set, or the loading weight of the vehicle to be assigned is greater than or equal to the total cargo weight of the orders included in the first order set and the second order set.

[0128] If the loading information of the vehicles to be assigned satisfies the first cargo information and the second cargo information, it means that the vehicles to be assigned included in the initial vehicle set have been able to transport all the cargo in the orders that need to be transported in the most recent batch (including orders that need to be transported in the most recent batch and orders that can be transported in any batch). In this case, there is no need to add vehicles to the initial vehicle set, but the initial vehicle set can be used directly as the candidate vehicle set.

[0129] In another possible implementation, for any initial vehicle set, if the loading information of the vehicles to be assigned in the initial vehicle set cannot satisfy the first cargo information and the second cargo information, then add vehicles to be assigned to the initial vehicle set until the loading information of the target vehicles in the initial vehicle set after adding vehicles to be assigned satisfies the first cargo information and the second cargo information, thus obtaining the candidate vehicle set corresponding to the initial vehicle set.

[0130] The target vehicle is the vehicle with the largest loading volume or loading weight in the vehicle set. The loading information of the target vehicle is used to indicate its loading volume and / or loading weight. The loading information of the vehicle to be assigned cannot meet the requirements of the first cargo information and the second cargo information, that is, the loading volume of the vehicle to be assigned is less than the total cargo volume of the orders included in the first order set and the second order set, or the loading weight of the vehicle to be assigned is less than the total cargo weight of the orders included in the first order set and the second order set.

[0131] If the loading information of the vehicles to be assigned cannot meet the requirements of the first and second cargo information, it indicates that the vehicles to be assigned in the initial vehicle set are unable to transport all the cargo in the orders that need to be transported in the most recent batch (including orders that need to be transported in the most recent batch and orders that can be transported in any batch). In this case, it is necessary to add vehicles to the initial vehicle set to obtain a set of alternative vehicles that can transport all the cargo in the orders that need to be transported in the most recent batch.

[0132] Optionally, vehicles to be assigned can be added to the initial vehicle set to obtain a first vehicle set. This allows us to determine whether the loading information of the target vehicles in the first vehicle set satisfies the first cargo information and the second cargo information. If the loading information of the target vehicles in the first vehicle set satisfies the first cargo information and the second cargo information, then the first vehicle set can be used as a candidate vehicle set. Otherwise, we need to continue adding vehicles to be assigned to the first vehicle set to obtain a second vehicle set. Then, we need to determine whether the loading information of the target vehicles in the second vehicle set satisfies the first cargo information and the second cargo information. This process continues until the loading information of the target vehicles in the vehicle set obtained by adding vehicles to be assigned to the initial vehicle set satisfies the first cargo information and the second cargo information. This is how the candidate vehicle set is generated.

[0133] It should be noted that when adding vehicles to be assigned to the currently determined vehicle set, the addition can be based on the loading information of the target vehicles in the currently determined vehicle set. Vehicles whose loading information meets the set conditions can be added to the currently determined vehicle set. Optionally, meeting the set conditions for loading information can be that the loading volume of the vehicle to be assigned is greater than the loading volume of the target vehicle in the currently determined vehicle set, and / or that the loading weight of the vehicle to be assigned is greater than the loading weight of the target vehicle in the currently determined vehicle set.

[0134] By adding vehicles with larger state volumes or loading weights to the currently determined vehicle set, the final determined vehicle set will not contain duplicate vehicle sets. This eliminates the need for the computing device to process duplicate vehicle sets, thereby reducing the processing load on the computing device, increasing its processing speed, and ultimately improving order processing speed.

[0135] Optionally, after identifying multiple sets of candidate vehicles, the following steps may also be included:

[0136] S1023. For any set of candidate vehicles, if the loading information of the vehicles to be assigned in the set of candidate vehicles cannot satisfy the first cargo information, then delete the set of candidate vehicles whose loading information cannot satisfy the first cargo information from the multiple sets of candidate vehicles.

[0137] It should be noted that there may be vehicles in the candidate vehicle set whose loading information does not meet the requirements of the first cargo information. That is, the loading volume of one vehicle in the candidate vehicle set is less than the total cargo volume corresponding to the orders included in the first order set, or the loading weight of one vehicle in the candidate vehicle set is less than the total cargo weight corresponding to the orders included in the first order set.

[0138] By removing candidate vehicle sets whose loading information fails to meet the first cargo information from multiple candidate vehicle sets, it is possible to eliminate candidate vehicle sets that do not meet the minimum shipping volume or minimum shipping weight. These candidate vehicle sets cannot transport orders that need to be transported in the same batch at once, thus failing to meet actual business needs. Removing these candidate vehicle sets will not only not affect the reasonable allocation of orders, but will also reduce the processing pressure on computing equipment, increase the processing speed of computing equipment, and thus improve the order processing speed.

[0139] Through the above process, multiple sets of alternative vehicles that can meet the transportation needs can be identified. However, how to identify the target set of vehicles with high cost performance and how to allocate orders to the vehicles included in the target set are still undetermined. Therefore, step S103 is still needed to identify the target set from the multiple sets of alternative vehicles and allocate pending orders to the multiple vehicles included in the target set.

[0140] To facilitate understanding, the following example illustrates the process of determining the candidate vehicle set:

[0141] Step 1: Sort the multiple vehicles to be allocated according to their cost from low to high.

[0142] Step 2: Generate an initial vehicle set for each vehicle to be assigned, such that each initial vehicle set includes one vehicle to be assigned, and the vehicles to be assigned in different initial vehicle sets are different.

[0143] Step 3: Traverse each vehicle set and determine whether to add vehicles to be assigned to the current vehicle set. If the loading volume of the vehicles in the current vehicle set is less than the total volume of goods for orders that need to be transported in the most recent batch (including orders that need to be transported in the most recent batch and orders that can be transported in any batch), or if the loading weight of the vehicles in the current vehicle set is less than the total weight of goods for orders that need to be transported in the most recent batch, then proceed to step 4; otherwise, proceed to step 5.

[0144] Step 4: Add vehicles to be assigned whose loading volume is greater than or equal to the loading volume of the target vehicle in the current vehicle set to the current vehicle set, or add vehicles to be assigned whose loading weight is greater than or equal to the loading weight of the target vehicle in the current vehicle set to the current vehicle set, and return to step 3 until step 5 is executed through step 3, then use the current vehicle set as the candidate vehicle set.

[0145] Step 5: Remove vehicles from the multiple candidate vehicle sets that do not meet the minimum shipment volume or minimum shipment weight requirements.

[0146] For details on the specific implementation of the above process, please refer to the above embodiments, which will not be repeated here.

[0147] In some embodiments, step S103, when determining the target vehicle set from a plurality of candidate vehicle sets and assigning pending orders to the plurality of vehicles included in the target vehicle set, can be achieved through the following steps:

[0148] S1031. For any set of candidate vehicles, based on pre-set target relationship data, determine the values ​​of the target relationship data for multiple candidate transportation schemes corresponding to the set of candidate vehicles.

[0149] The alternative transportation plan is used to indicate the pending orders that each vehicle in the alternative vehicle set is used to transport. In other words, the alternative transportation plan is used to indicate how to allocate multiple pending orders to multiple vehicles in the alternative vehicle set. The target relationship data is used to indicate the target cargo information when the same vehicle in the alternative vehicle set transports different pending orders. The target cargo information is used to indicate the total volume and / or total weight of the cargo of the pending orders transported by the vehicle.

[0150] If the vehicle set includes two vehicles, Vehicle 1 and Vehicle 2, and the pending orders include three orders, Order 1, Order 2, and Order 3, then the alternative transportation options are as shown in Table 5 below:

[0151] Table 5

[0152]

[0153] Optionally, under preset constraints, the values ​​of the target relationship data for multiple alternative transportation schemes corresponding to the alternative vehicle set can be determined based on pre-set target relationship data.

[0154] For example, the target relation data can be represented by the following formula (2):

[0155]

[0156] Where Target represents target relationship data, i represents order i, j represents vehicle j in the candidate vehicle set, and X ij Let X represent the probability that order i is loaded into vehicle j. If order i is loaded into vehicle j, then X... ij If it is 1, otherwise X ij 0, cube i This represents the volume of order i.

[0157] Taking alternative transportation scheme 1 in Table 5 above as an example, when calculating the target relationship data corresponding to alternative transportation scheme 1, the formula for solving the target relationship data is as shown in formula (3) below:

[0158]

[0159] Among them, X 11 This indicates that order 1 was loaded into vehicle 1, X 21 This indicates that order 2 was loaded into vehicle 1, X 31 This indicates that order 3 was loaded into vehicle 1, X 11 X 21 X31 The value of X is 0. 12 This indicates that order 1 was loaded into vehicle 2, X 22 This indicates that order 2 was loaded into vehicle 2, X 32 This indicates that order 3 was loaded into vehicle 2, X 12 X 22 X 32 The values ​​are all 1, where cube1 represents the volume of order 1, cube2 represents the volume of order 2, and cube3 represents the volume of order 3.

[0160] Optionally, under the preset constraints shown in formulas (4) to (7), the values ​​of the target relationship data corresponding to the multiple alternative transportation schemes of the alternative vehicle set can be determined:

[0161]

[0162]

[0163]

[0164]

[0165] Where i represents order i, j represents vehicle j in the candidate vehicle set, J represents the candidate vehicle set J, I1 represents the first order set, I2 represents the second order set, and X ij Let X represent the probability that order i is loaded into vehicle j. If order i is loaded into vehicle j, then X... ij If it is 1, otherwise X ij 0, cube i CUBE represents the volume of order i. j This represents the maximum loading volume of vehicle j, weight. i This represents the weight of order i. j This indicates the maximum load capacity of vehicle j.

[0166] For the preset constraints shown in formulas (4) to (7) above, the preset constraint shown in formula (4) indicates that the actual loading volume of the vehicle cannot exceed the upper limit of the loading volume of the vehicle, the preset constraint shown in formula (5) indicates that the actual loading weight of the vehicle cannot exceed the upper limit of the device weight of the vehicle, the preset constraint shown in formula (6) indicates that the orders that must be dispatched in the current batch must be loaded on the same vehicle, and the preset constraint shown in formula (7) indicates that an order can be loaded on at most one vehicle.

[0167] The above are just a few exemplary preset constraints. In more possible implementations, there may be more or fewer preset constraints. In addition, preset constraints may be other types of constraints, which are not limited in this disclosure.

[0168] S1032. For any set of candidate vehicles, based on the values ​​of the target relationship data of multiple candidate transportation schemes, assign pending orders to multiple vehicles included in the set of candidate vehicles to obtain the target transportation scheme corresponding to the set of candidate vehicles.

[0169] In one possible implementation, the alternative transportation plan with the largest value in the target relationship data can be determined as the target transportation plan, and pending orders can be assigned to multiple vehicles according to the target transportation plan.

[0170] Optionally, steps S1031 to S1032 can be performed using the solver CPLEX or ortools to achieve optimized solution of the target relation data.

[0171] S1033. Based on the cost information of the target transportation plan corresponding to each candidate vehicle set, determine the target vehicle set from the multiple candidate vehicle sets, and assign pending orders to the multiple vehicles included in the target vehicle set according to the target transportation plan corresponding to the target vehicle set.

[0172] Optionally, after determining the target transportation plan corresponding to each set of candidate vehicles through the above process, the allocation of multiple vehicles in each set of candidate vehicles to these multiple pending orders has been determined. Thus, the cost information of each target transportation plan can be determined based on the target transportation plan corresponding to each set of candidate vehicles, and the target vehicle set can be determined based on the determined cost information.

[0173] Specifically, for any set of candidate vehicles, when determining the cost information of the target transportation plan corresponding to the set of candidate vehicles, the cost information of the target transportation plan corresponding to each set of candidate vehicles can be determined based on the vehicle model of the vehicles included in the set of candidate vehicles, the cargo information (i.e., cargo volume and / or cargo weight) of each order to be processed, and the transportation start and end points (i.e., the order transportation start point and the order transportation end point).

[0174] It should be noted that the cost of transporting goods per unit weight or volume per unit distance for different vehicle models is preset. Therefore, when determining the cost information of the target transportation plan corresponding to each set of alternative vehicles based on the vehicle models of the vehicles included in the alternative vehicle set, as well as the cargo information and transportation origin and destination of each order to be processed, the transportation distance of the order can be determined based on the transportation origin and destination. Then, combined with the cost of transporting goods per unit weight or volume per unit distance for that vehicle model, the cost information can be determined.

[0175] After determining the cost information of the target transportation plan corresponding to each set of registered vehicles through the above process, the set of alternative vehicles corresponding to the target transportation plan with the lowest cost information can be determined as the target vehicle set, and then vehicles and orders can be allocated according to the target transportation plan corresponding to the target vehicle set.

[0176] Optionally, this cost information can be the mean square cost of the target transportation plan. When the cost information is the mean square cost of the target transportation plan, the mean square cost can be determined using the following formula (8):

[0177]

[0178] Where k represents the target transportation scheme k, C k Cost represents the mean square cost of the target transportation plan k. k Cube represents the total cost of the multiple vehicles included in the target transportation plan k. k This represents the total loading volume of the multiple vehicles included in the target transportation plan k.

[0179] Optionally, after determining the mean square cost of the target transportation scheme corresponding to each set of alternative vehicles, the set of alternative vehicles corresponding to the target transportation scheme with the minimum mean square cost can be determined as the target vehicle set, and then vehicles and orders can be allocated according to the target transportation scheme corresponding to the target vehicle set.

[0180] The solution provided in this disclosure considers various factors such as pending orders, vehicles to be allocated, shipping warehouses, and transportation routes to assign transport vehicles to multiple pending orders. This results in a target vehicle set and target transportation plan that meets cargo transportation needs at a low cost. This improves order processing efficiency and effectiveness while reducing transportation costs. Furthermore, the various constraints involved in this disclosure can be flexibly added or removed by those skilled in the art according to actual needs, enhancing the versatility of the order processing method and enabling it to adapt to more business scenarios.

[0181] After introducing the order processing method according to the exemplary embodiments of the present disclosure, the structure of the order processing apparatus and the computing device for implementing the order processing method according to the exemplary embodiments of the present disclosure will be described next.

[0182] See Figure 2 , Figure 2 This is a block diagram of an order processing apparatus according to an embodiment of the present disclosure, such as... Figure 2 As shown, the device includes:

[0183] The first determining module 201 is used to determine, when multiple pending orders are obtained, the orders included in the first order set and the orders included in the second order set. The first order set is a set of orders that need to be transported in the most recent batch, and the second order set is a set of orders that can be transported in any batch.

[0184] The second determining module 202 is used to determine multiple alternative vehicle sets that meet the transportation needs of the first order set and the second order set, each alternative vehicle set including at least one vehicle to be allocated;

[0185] The allocation module 203 is used to determine the target vehicle set from multiple alternative vehicle sets and to allocate pending orders to multiple vehicles included in the target vehicle set. The vehicles included in the target vehicle set are used to provide transportation services for multiple pending orders.

[0186] In some embodiments of this disclosure, the second determining module 202, when determining a plurality of alternative vehicle sets that satisfy the transportation needs of the first order set and the second order set, is used to:

[0187] Obtain multiple initial vehicle sets, each containing one vehicle to be assigned;

[0188] Based on the first cargo information corresponding to the first order set and the second cargo information corresponding to the second order set, vehicles to be assigned are added to each initial vehicle set to obtain multiple candidate vehicle sets. The first cargo information is used to indicate the total cargo volume and / or total cargo weight of the orders included in the first order set, and the second cargo information is used to indicate the total cargo volume and / or total cargo weight of the orders included in the second order set.

[0189] In some embodiments of this disclosure, the second determining module 202, when adding vehicles to be allocated to each initial vehicle set based on the first cargo information corresponding to the first order set and the second cargo information corresponding to the second order set to obtain multiple candidate vehicle sets, is used to:

[0190] For any initial vehicle set, if the loading information of the vehicles to be assigned in the initial vehicle set cannot meet the first cargo information and the second cargo information, then add vehicles to be assigned to the initial vehicle set until the loading information of the target vehicle in the initial vehicle set after adding vehicles to be assigned meets the first cargo information and the second cargo information, and obtain the candidate vehicle set corresponding to the initial vehicle set. The target vehicle is the vehicle with the largest loading volume or loading weight in the vehicle set.

[0191] For any initial vehicle set, if the loading information of the vehicles to be allocated in the initial vehicle set already satisfies the first cargo information and the second cargo information, then the initial vehicle set is used as the candidate vehicle set corresponding to the initial vehicle set.

[0192] The loading information is used to indicate the vehicle's loading volume and / or loading weight.

[0193] In some embodiments of this disclosure, the device further includes:

[0194] The deletion module is used to delete, for any set of candidate vehicles, the set of candidate vehicles whose loading information cannot meet the first cargo information from multiple sets of candidate vehicles. The loading information is used to indicate the loading volume and / or loading weight of the vehicle.

[0195] In some embodiments of this disclosure, the allocation module 203, when determining a target vehicle set from a plurality of candidate vehicle sets and allocating pending orders to the plurality of vehicles included in the target vehicle set, is configured to:

[0196] For any set of candidate vehicles, based on pre-set target relationship data, the values ​​of target relationship data for multiple candidate transportation schemes corresponding to the set of candidate vehicles are determined. The candidate transportation scheme is used to indicate the pending orders to be transported by each vehicle in the set of candidate vehicles. The target relationship data is used to indicate the target cargo information when the same vehicle in the set of candidate vehicles transports different pending orders. The target cargo information is used to indicate the total volume and / or total weight of the cargo in the pending orders transported by the vehicle.

[0197] For any set of candidate vehicles, based on the values ​​of the target relationship data of multiple candidate transportation schemes, orders to be processed are assigned to multiple vehicles included in the set of candidate vehicles to obtain the target transportation scheme corresponding to the set of candidate vehicles.

[0198] Based on the cost information of the target transportation plan corresponding to each candidate vehicle set, the target vehicle set is determined from multiple candidate vehicle sets, and pending orders are assigned to multiple vehicles included in the target vehicle set according to the target transportation plan corresponding to the target vehicle set.

[0199] In some embodiments of this disclosure, the device further includes:

[0200] The third determining module is used to determine the cost information of the target transportation plan corresponding to each candidate vehicle set based on the vehicle models of the vehicles included in the candidate vehicle set and the cargo information and transportation origin and destination of each order to be processed.

[0201] In some embodiments of this disclosure, the first determining module 201, when determining the orders included in the first order set and the orders included in the second order set when multiple orders to be processed are obtained, is configured to:

[0202] Based on at least one of the following: order information of multiple pending orders, vehicle information of multiple pending vehicles, route information of transportation routes, warehouse information of shipping warehouses, and business constraint information, determine a first set of orders consisting of orders that need to be transported in the most recent batch among the multiple pending orders, and a third set of orders consisting of orders that need to be transported in a non-most recent batch among the multiple pending orders.

[0203] Based on multiple pending orders, the first order set, and the third order set, the second order set is determined.

[0204] It should be noted that although several modules of the order processing apparatus have been mentioned in the detailed description above, this division is merely exemplary and not mandatory. In fact, according to embodiments of this disclosure, the features and functions of two or more modules described above can be embodied in one module. Conversely, the features and functions of one module described above can be further divided and embodied by multiple modules.

[0205] This disclosure also provides a computer-readable storage medium. Figure 3 This is a schematic diagram illustrating a computer-readable storage medium according to embodiments of the present disclosure, such as... Figure 3 As shown, the storage medium stores a computer program 301, which, when executed by the processor of a computing device, can perform the order processing method provided in any embodiment of this disclosure.

[0206] This disclosure also provides a computing device, which may include a memory and a processor. The memory stores computer instructions that can run on the processor, and the processor executes the computer instructions to implement the operations performed by the first computing device in the order processing method provided in any embodiment of this disclosure. See also Figure 4 , Figure 4This is a schematic diagram of the structure of a computing device according to an embodiment of the present disclosure. The computing device 400 may include, but is not limited to, a processor 410, a memory 420, and a bus 430 connecting different system components (including the memory 420 and the processor 410).

[0207] The memory 420 stores computer instructions that can be executed by the processor 410, enabling the processor 410 to perform the operations performed by the first computing device in the order processing method provided in any embodiment of this disclosure. The memory 420 may include a random access memory (RAM) 421, a cache memory 422, and / or a read-only memory (ROM) 423. The memory 420 may also include a program tool 425 having a set of program modules 424, including but not limited to: an operating system, one or more application programs, other program modules, and program data. One or more combinations of these program modules may include an implementation of a network environment.

[0208] Bus 430 may include, for example, a data bus, an address bus, and a control bus. The computing device 400 can also communicate with external devices 450 via I / O interface 440, such as a keyboard or a Bluetooth device. The computing device 400 can also communicate with one or more networks via network adapter 460, such as a local area network (LAN), a wide area network (WAN), or a public network. Figure 4 As shown, the network adapter 460 can also communicate with other modules of the computing device 400 via the bus 430.

[0209] This disclosure also provides a computer program product, which includes a computer program that, when executed by the processor 410 of the computing device 400, can implement the order processing method provided in any embodiment of this disclosure.

[0210] Furthermore, although the operations of the methods disclosed herein are described in a specific order in the accompanying drawings, this does not require or imply that these operations must be performed in that specific order, or that all of the operations shown must be performed to achieve the desired result. Additionally or alternatively, certain steps may be omitted, multiple steps may be combined into one step, and / or one step may be broken down into multiple steps.

[0211] While the spirit and principles of this disclosure have been described with reference to several specific embodiments, it should be understood that this disclosure is not limited to the disclosed specific embodiments, and the division of aspects does not imply that features in these aspects cannot be combined for benefit; such division is merely for convenience of expression. This disclosure is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.

Claims

1. An order processing method, characterized in that, The method includes: When multiple pending orders are obtained, based on business constraint information, a first order set consisting of orders that need to be shipped in the most recent batch and a third order set consisting of orders that need to be shipped in a non-most recent batch are determined from the multiple pending orders; wherein, the business constraint information is used to indicate the constraints on the order delivery time of the pending orders. Orders other than those included in the first order set and the third order set from the plurality of pending orders are identified as orders in the second order set to obtain the second order set, which is a set of orders that can be shipped in any batch; Determine multiple alternative vehicle sets that can meet the transportation needs of the first order set and the second order set, each alternative vehicle set including at least one vehicle to be allocated; Based on pre-set target relationship data, the values ​​of target relationship data for multiple alternative transportation schemes corresponding to each alternative vehicle set are determined under the condition of satisfying preset constraints. The alternative transportation scheme is used to indicate the pending orders to be transported by each vehicle in the alternative vehicle set. The target relationship data is used to indicate the target cargo information when the same vehicle in the alternative vehicle set transports different pending orders. The target cargo information is used to indicate the total volume and / or total weight of the cargo of the pending orders transported by the vehicle. The preset constraints include at least that the orders that must be dispatched in the current batch must be loaded on the same vehicle. Based on the values ​​of the target relationship data of the multiple alternative transportation schemes, orders to be processed are assigned to the multiple vehicles included in each alternative vehicle set to obtain the target transportation scheme corresponding to each alternative vehicle set. From the plurality of candidate vehicle sets, a target vehicle set is determined, and according to the target transportation plan corresponding to the target vehicle set, pending orders are assigned to the plurality of vehicles included in the target vehicle set.

2. The method according to claim 1, characterized in that, The determination of multiple candidate vehicle sets that satisfy the transportation needs of the first order set and the second order set includes: Obtain multiple initial vehicle sets, each containing one vehicle to be assigned; Based on the first cargo information corresponding to the first order set and the second cargo information corresponding to the second order set, vehicles to be assigned are added to each initial vehicle set to obtain multiple candidate vehicle sets. The first cargo information is used to indicate the total cargo volume and / or total cargo weight of the orders included in the first order set, and the second cargo information is used to indicate the total cargo volume and / or total cargo weight of the orders included in the second order set.

3. The method according to claim 2, characterized in that, Based on the first cargo information corresponding to the first order set and the second cargo information corresponding to the second order set, vehicles to be allocated are added to each initial vehicle set, resulting in multiple candidate vehicle sets, including: For any initial vehicle set, if the loading information of the vehicles to be assigned in the initial vehicle set cannot satisfy the first cargo information and the second cargo information, then add vehicles to be assigned to the initial vehicle set until the loading information of the target vehicle in the initial vehicle set after adding vehicles to be assigned satisfies the first cargo information and the second cargo information, thereby obtaining a candidate vehicle set corresponding to the initial vehicle set, wherein the target vehicle is the vehicle with the largest loading volume or loading weight in the vehicle set. For any initial vehicle set, if the loading information of the vehicles to be allocated in the initial vehicle set already satisfies the first cargo information and the second cargo information, then the initial vehicle set is used as the candidate vehicle set corresponding to the initial vehicle set. The loading information is used to indicate the vehicle's loading volume and / or loading weight.

4. The method according to claim 2, characterized in that, After adding vehicles to be assigned to each initial vehicle set based on the first cargo information corresponding to the first order set and the second cargo information corresponding to the second order set, resulting in multiple candidate vehicle sets, the method further includes: For any set of candidate vehicles, if the loading information of the vehicle to be assigned in the set of candidate vehicles cannot meet the first cargo information, then the set of candidate vehicles whose loading information cannot meet the first cargo information is deleted from the set of candidate vehicles. The loading information is used to indicate the loading volume and / or loading weight of the vehicle.

5. The method according to claim 1, characterized in that, The step of determining the target vehicle set from the plurality of candidate vehicle sets, and allocating pending orders to the plurality of vehicles included in the target vehicle set according to the target transportation plan corresponding to the target vehicle set, includes: Based on the cost information of the target transportation plan corresponding to each candidate vehicle set, a target vehicle set is determined from the multiple candidate vehicle sets, and pending orders are assigned to the multiple vehicles included in the target vehicle set according to the target transportation plan corresponding to the target vehicle set.

6. The method according to claim 5, characterized in that, Before determining the target vehicle set from the plurality of candidate vehicle sets based on the cost information of the target transportation plan corresponding to each candidate vehicle set, the method further includes: For any set of candidate vehicles, the cost information of the target transportation plan corresponding to each set of candidate vehicles is determined based on the vehicle models of the vehicles included in the set, the cargo information of each order to be processed, and the origin and destination of transportation.

7. The method according to claim 1, characterized in that, The step of determining, based on business constraint information, a first order set consisting of orders that need to be shipped in the most recent batch among the plurality of pending orders, and a third order set consisting of orders that need to be shipped in a non-most recent batch among the plurality of pending orders, includes: Based on the business constraint information, and combined with at least one of the following: order information of the multiple pending orders, vehicle information of the multiple pending vehicles, route information of the transportation route, and warehouse information of the shipping warehouse, a first order set consisting of orders that need to be transported in the most recent batch among the multiple pending orders, and a third order set consisting of orders that need to be transported in a non-most recent batch among the multiple pending orders.

8. An order processing device, characterized in that, The device includes: The first determining module is used to, when multiple pending orders are obtained, determine, based on business constraint information, a first order set consisting of orders that need to be shipped in the most recent batch and a third order set consisting of orders that need to be shipped in a non-most recent batch; wherein, the business constraint information is used to indicate the constraints on the order delivery time of the pending orders. The first determining module is further configured to determine the orders other than those included in the first order set and the third order set from the plurality of pending orders as orders in the second order set, so as to obtain the second order set, which is a set of orders that can be transported in any batch; The second determining module is used to determine multiple candidate vehicle sets that meet the transportation needs of the first order set and the second order set, each candidate vehicle set including at least one vehicle to be allocated; The allocation module is used to determine the values ​​of the target relationship data of multiple alternative transportation schemes corresponding to each alternative vehicle set based on pre-set target relationship data, under the condition of satisfying preset constraints. The alternative transportation scheme is used to indicate the pending orders to be transported by each vehicle in the alternative vehicle set. The target relationship data is used to indicate the target cargo information when the same vehicle in the alternative vehicle set transports different pending orders. The target cargo information is used to indicate the total volume and / or total weight of the cargo of the pending orders transported by the vehicle. The preset constraints include at least that the orders that must be dispatched in the current batch must be loaded on the same vehicle. The allocation module is also used to allocate pending orders to multiple vehicles included in each candidate vehicle set based on the value of the target relationship data of the multiple alternative transportation schemes, so as to obtain the target transportation scheme corresponding to each candidate vehicle set. The allocation module is further configured to determine a target vehicle set from the plurality of candidate vehicle sets, and allocate pending orders to the plurality of vehicles included in the target vehicle set according to the target transportation plan corresponding to the target vehicle set.

9. The apparatus according to claim 8, characterized in that, The second determining module, when determining a plurality of alternative vehicle sets that satisfy the transportation needs of the first order set and the second order set, is used to: Obtain multiple initial vehicle sets, each containing one vehicle to be assigned; Based on the first cargo information corresponding to the first order set and the second cargo information corresponding to the second order set, vehicles to be assigned are added to each initial vehicle set to obtain multiple candidate vehicle sets. The first cargo information is used to indicate the total cargo volume and / or total cargo weight of the orders included in the first order set, and the second cargo information is used to indicate the total cargo volume and / or total cargo weight of the orders included in the second order set.

10. The apparatus according to claim 9, characterized in that, The second determining module, when adding vehicles to be allocated to each initial vehicle set based on the first cargo information corresponding to the first order set and the second cargo information corresponding to the second order set to obtain multiple candidate vehicle sets, is used for: For any initial vehicle set, if the loading information of the vehicles to be assigned in the initial vehicle set cannot satisfy the first cargo information and the second cargo information, then add vehicles to be assigned to the initial vehicle set until the loading information of the target vehicle in the initial vehicle set after adding vehicles to be assigned satisfies the first cargo information and the second cargo information, thereby obtaining a candidate vehicle set corresponding to the initial vehicle set, wherein the target vehicle is the vehicle with the largest loading volume or loading weight in the vehicle set. For any initial vehicle set, if the loading information of the vehicles to be allocated in the initial vehicle set already satisfies the first cargo information and the second cargo information, then the initial vehicle set is used as the candidate vehicle set corresponding to the initial vehicle set. The loading information is used to indicate the vehicle's loading volume and / or loading weight.

11. The apparatus according to claim 9, characterized in that, The device further includes: The deletion module is used to delete, for any set of candidate vehicles, the set of candidate vehicles whose loading information cannot satisfy the first cargo information from the multiple sets of candidate vehicles. The loading information is used to indicate the loading volume and / or loading weight of the vehicle.

12. The apparatus according to claim 8, characterized in that, The allocation module, when determining the target vehicle set from the plurality of candidate vehicle sets and allocating pending orders to the plurality of vehicles included in the target vehicle set according to the target transportation plan corresponding to the target vehicle set, is configured to: Based on the cost information of the target transportation plan corresponding to each candidate vehicle set, a target vehicle set is determined from the multiple candidate vehicle sets, and pending orders are assigned to the multiple vehicles included in the target vehicle set according to the target transportation plan corresponding to the target vehicle set.

13. The apparatus according to claim 12, characterized in that, The device further includes: The third determining module is used to determine the cost information of the target transportation plan corresponding to each candidate vehicle set based on the vehicle models of the vehicles included in the candidate vehicle set and the cargo information and transportation origin and destination of each order to be processed.

14. The apparatus according to claim 8, characterized in that, The first determining module, when determining, based on business constraint information, a first order set consisting of orders that need to be shipped in the most recent batch and a third order set consisting of orders that need to be shipped in a non-most recent batch from the plurality of pending orders, is configured to: Based on the business constraint information, and combined with at least one of the following: order information of the multiple pending orders, vehicle information of the multiple pending vehicles, route information of the transportation route, and warehouse information of the shipping warehouse, a first order set consisting of orders that need to be transported in the most recent batch among the multiple pending orders, and a third order set consisting of orders that need to be transported in a non-most recent batch among the multiple pending orders.

15. A computing device, characterized in that, The computing device includes a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to perform the operations performed by the order processing method as described in any one of claims 1 to 7.

16. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a program that is executed by a processor as the order processing method as described in any one of claims 1 to 7.

Citation Information

Patent Citations

  • A loading method for freight vehicles

    CN109299810A

  • Order processing method and device

    CN110544055A

  • Article transportation method and device, electronic equipment and computer readable medium

    CN112966911A