Transport capacity resource scheduling method, device and system

Abstract

The invention discloses a transport capacity resource scheduling method, device and system, and relates to the technical field of logistics transportation. According to one specific embodiment, the method comprises the steps that in response to a received transport task request, multiple candidate transport capacity resources are determined from a transport capacity resource pool, and portrait labels and resource state information of the candidate transport capacity resources are matched with the transport task request; pushing bid inviting information corresponding to the transportation task request to a receiving end of the candidate transportation capacity resource; determining a target transport capacity resource from the candidate transport capacity resources according to bid response information in response to the bid invitation information, and assigning the transport task to the target transport capacity resource; wherein the transport capacity resources in the transport capacity resource pool comprise drivers and associated carriers, and the resource state information comprises position information and task state information of the transport capacity resources. According to the embodiment, the identification efficiency and accuracy of the transport capacity resources can be improved, and the expansion of the transport capacity scale and the improvement of the transaction efficiency are facilitated.

Description

Technical Field

[0001] This application relates to the field of logistics and transportation technology, specifically to a method, apparatus, and system for scheduling transportation resources. Background Technology

[0002] For logistics and transportation companies, in order to support more and more complex transportation business scenarios, it is necessary to achieve refined operation and management of transportation capacity resources.

[0003] Currently, the allocation of transportation capacity is typically done manually, relying on experience to select idle capacity that matches the cargo to be transported by upstream shippers and assigning it to them. This method of allocation usually only considers one level of optimal solution for identifying and recalling available drivers, focusing on either timeliness or cost, and cannot take into account multiple dimensions based on actual conditions. Furthermore, this method does not consider the dynamic changes in the status of transportation capacity, resulting in poor flexibility and making it difficult to cope with changes and uncertainties in the external environment. In addition, most logistics and transportation companies face the reality of finding vehicles offline and quoting prices online. Most transportation capacity is registered on transportation platforms through offline relationships, and orders are only processed online, which is not conducive to expanding the scale of transportation capacity and improving transaction efficiency. Summary of the Invention

[0004] This application provides a method, apparatus and system for scheduling transportation resources, an electronic device, and a storage medium.

[0005] According to a first aspect, embodiments of this application provide a method for scheduling transportation resources. The method includes: in response to receiving a transportation task request, determining multiple candidate transportation resources from a transportation resource pool, wherein the profile tags and resource status information of the candidate transportation resources match the transportation task request; pushing bidding invitation information corresponding to the transportation task request to the receiving end of the candidate transportation resources; and determining a target transportation resource from the candidate transportation resources based on the bidding response information in response to the bidding invitation information, and assigning the transportation task to the target transportation resource; wherein the transportation resources in the transportation resource pool include drivers and associated vehicles, and the resource status information includes the location information and task status information of the transportation resources.

[0006] In some examples, the above method also includes: constructing a profile label for transportation resources based on pre-configured transportation resource data labels, wherein the transportation resource data labels include basic capability labels and historical performance capability labels. The basic capability labels include at least one of the following: driver identity information, certificate qualification information, vehicle type, vehicle load capacity, and vehicle volume; the historical performance capability labels include at least one of the following: driver validity, vehicle validity, blacklist information, driver level information, number of historical transactions, historical transaction evaluation, advantageous transportation routes, and advantageous transportation area.

[0007] In some examples, in response to receiving a transportation task request, multiple candidate transportation resources are determined from a transportation resource pool, including: identifying a first set of transportation resources from the pool based on the profile tags of the transportation resources, wherein the profile tags of the first transportation resources match at least one of the capacity requirements included in the transportation task request; and determining candidate transportation resources based on the resource status information of the first transportation resources, wherein the resource status information of the candidate transportation resources matches at least one of the task requirements included in the transportation task request; wherein the capacity requirements include at least one of the following: qualification validity verification, blacklist verification, driver level, transportation resource type, cargo type, and cargo weight; and the task requirements include at least one of the following: pickup location, destination, pickup start time, and delivery time.

[0008] In some examples, the above method further includes: updating the resource status information of the transportation resources based on the acquired task list of transportation resources and at least one of the location information, task status information, and abnormal status information of the transportation resources. The task status information includes at least one of the following: task not started, task started, task start time, estimated task end time, task finished, task end time, and load change information. The abnormal status information includes at least one of the following: fault information and estimated maintenance completion time. The resource status information includes at least one of the following: current location, current route, available location, available time period, resource abnormal information, available load, and available capacity.

[0009] In some examples, candidate transport resources are determined based on the resource status information of the first transport resource, including: determining location-available transport resources from the first transport resource according to the pickup location in the task requirements; and determining time-available transport resources from the location-available transport resources as candidate transport resources; wherein, location-available transport resources include transport resources whose current location is within a radiation range centered on the pickup location and with a predetermined distance as the radius; time-available transport resources include transport resources whose estimated pickup time is less than the pickup start time in the task requirements, and the estimated pickup time is calculated based on the earliest available time of the available time period and the estimated pickup time determined based on the distance between the available location of the transport resource and the pickup location.

[0010] In some examples, the process of identifying candidate transportation resources based on the resource status information of the first transportation resource also includes: determining whether the transportation task is a short-distance transportation task or a long-distance transportation task based on whether the current location of the first transportation resource and the pickup location are in the same city or whether the distance is less than a first distance threshold; and determining the corresponding predetermined distance based on the type of transportation task, wherein the predetermined distance for a short-distance transportation task is less than the predetermined distance for a long-distance transportation task.

[0011] In some examples, the process of determining candidate capacity resources based on the resource status information of the first capacity resource further includes: in response to the fact that the number of capacity resources available at the determined location has not reached a predetermined threshold, increasing the predetermined distance and then re-determining the capacity resources available at the location; or, determining from the first capacity resources the capacity resources that match the current route with the pickup location or destination as the capacity resources available at the location.

[0012] In some examples, the above method also includes: prioritizing candidate transport capacity resources according to preset scheduling rules; determining the method of pushing bidding invitation information to candidate transport capacity resources based on the priority ranking of candidate transport capacity resources; wherein, the scheduling rules include: a single rule among cost priority rule, distance priority rule, and timeliness priority rule; or a rule that comprehensively evaluates cost, distance, and timeliness based on different weights.

[0013] In some examples, the target capacity resource is determined from the candidate capacity resources based on the bid information in response to the invitation to tender, including: determining the target capacity resource from the candidate capacity resources corresponding to the bid information based on the cost information or quotation information included in the bid information.

[0014] According to a second aspect, embodiments of this application provide a transportation resource scheduling device, comprising: a resource management module configured to manage the profile tags and resource status information of transportation resources through a transportation resource pool, wherein the transportation resources include at least drivers and associated vehicles, and the resource status information includes the location information and task status information of the transportation resources; an interaction module configured to receive transportation task requests and transmit them to a scheduling module; and return the target transportation resource assigned by the scheduling module to the initiator of the transportation task request; a scheduling module configured to, in response to receiving a transportation task request, determine multiple candidate transportation resources from the transportation resource pool, wherein the profile tags and resource status information of the candidate transportation resources match the transportation task request; and determine the target transportation resource based on the bidding information in response to the bidding invitation information, and assign the transportation task to the target transportation resource; and a push module configured to push the bidding invitation information corresponding to the transportation task request to the candidate transportation resources.

[0015] According to a third aspect, embodiments of this application provide a transportation capacity scheduling system, comprising: a transportation capacity scheduling server configured to, in response to receiving a transportation task request from a transportation task request initiator, determine multiple candidate transportation capacity resources from a transportation capacity resource pool, and push invitation information corresponding to the transportation task request to the transportation capacity resource provider corresponding to the candidate transportation capacity resources, wherein the profile tags and resource status information of the candidate transportation capacity resources match the transportation task request; and determine a target transportation capacity resource based on the bidding information in response to the invitation information, and return the information of the target transportation capacity resource to the transportation task request initiator; a transportation task request initiator configured to send a transportation task request to a transportation capacity push server and receive the target transportation capacity resource information returned by the transportation capacity push server; and a transportation capacity resource provider configured to receive the invitation information pushed by the transportation capacity push server and send bidding information in response to the invitation information to the transportation capacity push server.

[0016] According to a fourth aspect, embodiments of this application provide an electronic device including one or more processors; a storage device having one or more programs stored thereon, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the capacity resource scheduling method as described in any embodiment of the first aspect.

[0017] According to a fifth aspect, embodiments of this application provide a computer-readable medium having a computer program stored thereon that, when executed by a processor, implements a capacity resource scheduling method as described in any embodiment of the first aspect.

[0018] The transportation capacity scheduling method, apparatus, and system provided in the embodiments of this application construct profile tags for transportation capacity resources, thereby making the characteristics of transportation capacity resources more concrete and clear, and improving the efficiency and accuracy of transportation capacity resource search and identification. Furthermore, by building a dynamic transportation capacity resource pool, dynamic status management of transportation capacity resources is implemented, including available time, available location, and abnormal situations. Then, by analyzing the transportation needs of upstream cargo owners and combining the dynamic resource status information, more reasonable and available candidate transportation capacity resources can be searched and recommended. Simultaneously, by accurately pushing bidding invitation information to the receiving end of candidate transportation capacity resources, the transportation capacity resources in the pool can be activated / enhanced, which is conducive to expanding the scale of transportation capacity and improving transaction efficiency.

[0019] It should be understood that the description in this section is not intended to identify key or essential features of the embodiments of this disclosure, nor is it intended to limit the scope of this disclosure. Other features of this disclosure will become readily apparent from the following description. Attached Figure Description

[0020] Figure 1 This is an exemplary system architecture diagram to which this application can be applied;

[0021] Figure 2 This is a flowchart of an embodiment of the transportation capacity resource scheduling method according to this application;

[0022] Figure 3a This is a schematic diagram of a resource profile label for transportation capacity resources according to an embodiment of this application;

[0023] Figure 3b This is a schematic diagram of the resource status information of transportation capacity resources according to the embodiments of this application;

[0024] Figure 4 This is a flowchart of yet another embodiment of the transportation capacity resource scheduling method according to this application;

[0025] Figure 5a This is a flowchart illustrating how candidate transport capacity resources are determined based on the resource status information of a first transport capacity resource, as described in an example of the transport capacity resource scheduling method of this application.

[0026] Figure 5b This is a schematic diagram illustrating, according to an example of this application, determining the available capacity resources for a location from a first capacity resource;

[0027] Figure 6 This is a schematic diagram illustrating the composition of one embodiment of the transportation capacity resource scheduling device according to this application;

[0028] Figure 7 This is a schematic diagram illustrating the composition of an embodiment of the transportation capacity resource scheduling system according to this application;

[0029] Figure 8 Based on Figure 7 The illustrated embodiment of the transportation capacity scheduling system is a schematic diagram of the transportation capacity scheduling method.

[0030] Figure 9 This is a schematic diagram of the structure of a computer system suitable for implementing the embodiments of this application. Detailed Implementation

[0031] The following description, in conjunction with the accompanying drawings, illustrates exemplary embodiments of this application, including various details to aid understanding. These should be considered merely exemplary. Therefore, those skilled in the art will recognize that various changes and modifications can be made to the embodiments described herein without departing from the scope and spirit of this application. Similarly, for clarity and brevity, descriptions of well-known functions and structures are omitted in the following description.

[0032] It should be noted that, unless otherwise specified, the embodiments and features described in this application can be combined with each other. This application will now be described in detail with reference to the accompanying drawings and embodiments.

[0033] Figure 1 An exemplary system architecture 100 is shown, in which embodiments of the capacity resource scheduling method of this application can be applied.

[0034] like Figure 1 As shown, system architecture 100 may include terminal devices 101, 102, and 103, a network 104, and a server 105. Network 104 serves as the medium for providing communication links between terminal devices 101, 102, and 103 and server 105. Network 104 may include various connection types, such as wired or wireless communication links, or fiber optic cables, etc.

[0035] Terminal devices 101, 102, and 103 interact with server 105 via network 104 to receive or send messages, etc. Various application platforms can be installed on terminal devices 101, 102, and 103.

[0036] Terminal devices 101, 102, and 103 can be either hardware or software. When terminal devices 101, 102, and 103 are hardware, they can be various electronic devices with displays, including but not limited to mobile phones, laptops, and scanning devices. When terminal devices 101, 102, and 103 are software, they can be installed in the aforementioned electronic devices. They can be implemented as multiple software programs or software modules, or as a single software program or software module. For example, it can serve as a transportation task request initiator, enabling a transportation resource requester (such as an upstream cargo owner) to publish a transportation task request (the transportation task request may include relevant information about the cargo to be transported, capacity requirements, and task requirements, etc.), and to receive target transportation resource information (including drivers and vehicles, which may include vehicles, airplanes, trains, ships, etc.) assigned by the server to undertake the transportation task. It can also serve as a receiving device for transportation resources (such as carriers, drivers, and vehicles) or as a providing device for transportation resources (such as carriers or freight forwarders), receiving invitations to tender from the server that correspond to the transportation task requirements, and sending response information to the server in response to the invitations to tender. No specific limitations are made here.

[0037] Server 105 can be a server that provides various services, such as a capacity resource push server or a capacity resource scheduling server. For example, in response to receiving a transportation task request from a requester, it can determine multiple candidate capacity resources from the capacity resource pool and push the invitation information corresponding to the transportation task request to the receiving end of the candidate capacity resources; and based on the bid response information received in response to the invitation information, it can determine the target capacity resource from the candidate capacity resources and assign the transportation task to the target capacity resource.

[0038] It should be noted that server 105 can be either hardware or software. When server 105 is hardware, it can be implemented as a distributed server cluster consisting of multiple servers, or as a single server. When server 105 is software, it can be implemented as multiple software programs or software modules (for example, used to provide capacity resource scheduling services), or as a single software program or software module. No specific limitations are made here.

[0039] It should be noted that the capacity resource scheduling method provided in the embodiments of this disclosure can be executed by server 105, or by server 105 and terminal devices 101, 102, and 103 in cooperation with each other. Accordingly, the various parts (e.g., various units, sub-units, modules, and sub-modules) included in the capacity resource scheduling device can all be set in server 105, or they can be set in server 105 and terminal devices 101, 102, and 103 respectively.

[0040] It should be understood that Figure 1 The number of terminal devices, networks, and servers shown is merely illustrative. Depending on implementation needs, any number of terminal devices, networks, and servers can be included.

[0041] Figure 2 A flowchart 200 is shown, illustrating an embodiment of the capacity resource scheduling method applicable to this application. In this embodiment, the capacity resource scheduling method includes the following steps:

[0042] Step 201: In response to receiving a transportation task request, determine multiple candidate transportation resources from the transportation resource pool.

[0043] In this embodiment, the execution subject (such as...) Figure 1 The server 105 shown in the figure determines multiple candidate transportation resources from the transportation resource pool based on the received transportation task request (e.g., a transportation task request initiated by the requester of transportation resources), wherein the profile tag and resource status information of each candidate transportation resource are matched with the above-mentioned transportation task request.

[0044] Step 202: Push the invitation information corresponding to the transportation task request to the receiving end of the candidate transportation capacity resources.

[0045] In this embodiment, after identifying the candidate transportation capacity resources, the aforementioned executing entity pushes the corresponding invitation information to the receiving end of the candidate transportation capacity resources.

[0046] Taking vehicles as an example, the receiving end of transportation resources can be the driver's (individual driver's) smart terminal device, a vehicle equipped with a smart terminal device or smart interactive device, or the receiving end of the transportation resource carrier, etc.

[0047] Step 203: Based on the bid response information in response to the invitation to bid information, determine the target transportation resource from the candidate transportation resources and assign the transportation task to the target transportation resource.

[0048] In some optional implementations, the above method may further include: constructing a profile tag for the transportation capacity resources based on pre-configured transportation capacity resource data tags.

[0049] The aforementioned profile tags for transportation capacity resources can be understood as tags for massive amounts of data. These tags can include carriers, drivers, vehicles, routes, network points, and scenarios. Based on real-world data from the actual operation of these resources, they are managed in a tiered and hierarchical manner. For example, for drivers, the first level is simply "driver," and the second level can be further divided into road drivers, rail drivers, aircraft drivers, and ship drivers. Within the second level, drivers can be further divided into third-level individual drivers (self-employed drivers), carrier-affiliated drivers, and platform-affiliated drivers. Similarly, for carriers at the first level, they can be further divided into second-level road carriers, rail carriers, air carriers, and water carriers. Each type of carrier at the second level can be further divided into third-level enterprise-level carriers and platform-level carriers.

[0050] Taking drivers in transportation resources as an example, based on differences in drivers' basic attributes, behavioral habits, task scenarios, credit scores, and other aspects, corresponding transportation resource profile tags can be constructed through pre-set multi-dimensional tags, thus distinguishing transportation resources into different types. Here, tags represent the finest-grained division of data items; and data items themselves can also become tags, such as the areas of expertise and transportation routes that drivers fill in when enterprise-level carriers register.

[0051] It should be noted that the collection, gathering, updating, analysis, processing, use, transmission, and storage of user personal information involved in the technical solution of this application all comply with relevant laws and regulations, are used for legitimate purposes, and do not violate public order and good morals. Necessary measures are taken to prevent unauthorized access to user personal information data and to safeguard user personal information security, network security, and national security. Furthermore, once this user personal information data is no longer needed, risks are minimized by restricting or even prohibiting data collection and / or deleting the data.

[0052] Combination Figure 3aAs shown in the exemplary embodiment, the pre-configured capacity resource data tags mentioned above may include basic capacity tags and historical performance capability tags. Basic capacity tags may include at least one of the following: driver identity information, certificate qualification information, vehicle type, vehicle load capacity, and vehicle volume; historical performance capability tags may include at least one of the following: driver rating information, driver validity, vehicle validity, blacklist information, number of historical transactions, historical transaction evaluation, advantageous transportation routes, and advantageous transportation area range.

[0053] In the above exemplary embodiments, the pre-configured tags cover the aggregated capabilities of transportation resources (carriers, freight forwarders, vehicles, drivers, branches, routes), where capabilities are divided into: basic capabilities (non-operational capabilities) and historical fulfillment capabilities (operational capabilities). These tags can include factual tags, business tags, statistical tags, or predictive tags, etc. For example, based on preset business rules and combined with historical statistical data of transportation resources, predictive tags for transportation resources can be constructed using deep learning algorithms to predict the behavioral patterns of transportation resources.

[0054] According to the above exemplary implementation method of the capacity resource scheduling method, the tag objects of the capacity resources include, but are not limited to, carriers, freight forwarders, vehicles, drivers, outlets, and routes. It can cover multiple dimensions of capacity resource data such as resource entry, resource procurement, contract signing, freight rate management, scheduling operation, operation execution, and settlement rewards and penalties. It provides multi-dimensional and accurate data support for the identification and recommendation of capacity resources, and plays an important role in the accurate recommendation, personalized recommendation and intelligent risk control of capacity resources.

[0055] In some optional implementations, the above method may further include: updating the resource status information of the transportation resources based on the acquired task list of transportation resources and at least one of the location information, task status information, abnormal status information, etc. of the transportation resources.

[0056] For example, taking the transportation capacity resource as a highway driver and the associated vehicle as a vehicle, the real-time location or current location information of the vehicle can be obtained from a GIS (Geographic Information System). Furthermore, based on the status detection or data collection during the transportation task execution process, the pre-occupancy / locking status of the transportation capacity resource (e.g., pre-occupancy, locking, use, and release, which can be used to indicate the association between the transportation capacity resource and the transportation task), task status information, task node information, and abnormal status information can be obtained.

[0057] The task status information may include at least one of the following: task not started, task started, task start time, estimated task end time, task completed, task end time, and load change information. Abnormal status information may include at least one of the following: fault information and estimated repair completion time.

[0058] refer to Figure 3b As shown, the resource status information of transportation capacity resources may include at least one of the following: current location, current route, available location (e.g., the location at the end of the current task), available time period (e.g., including the earliest available time and the latest available time, where the earliest available time may be the expected end time of the current task, etc.), resource anomaly information (e.g., vehicle failure, risk warning, etc.), available load capacity, and available volume.

[0059] According to the capacity resource scheduling method of the above exemplary implementation, for the registered capacity resources, the static and dynamic information of the capacity resources are comprehensively managed through a capacity resource pool. The static information may include information on carriers, vehicles, drivers, and freight forwarders, such as, but not limited to: carrier company information, advantageous route information, service coverage information, operational status, vehicle status, vehicle type, and number of vehicles; and driver information: driving experience, employee type, and affiliated fleet. The dynamic information may include the availability status, available location, available time, current location, route, available capacity, and available load capacity of the capacity resources.

[0060] Furthermore, according to the capacity resource scheduling method of this embodiment, the aforementioned static and dynamic information of capacity resources can be managed (including storing and updating) by building a capacity resource pool. For example, capacity resource profile tags can be accumulated and capacity resource status information can be maintained. Thus, upon receiving a transportation task request, capacity resources can be identified and dynamically recommended by parsing the transportation needs of upstream cargo owners. Under certain multi-dimensional rules such as time, space, scope, and safety, reasonable and available candidate capacity resources can be determined, thereby improving service quality and user experience.

[0061] Furthermore, according to the capacity resource scheduling method of this embodiment, by pushing the invitation information corresponding to the transportation task request to the receiving end of the candidate capacity resources, the capacity resources are accurately invited to participate in the bidding, thereby revitalizing / activating the capacity resources and enabling drivers to move from passively joining offline to actively bidding online. While increasing the participation of capacity resources, a bidding advantage is formed, which in turn leads to cost reduction.

[0062] See also Figure 4 , Figure 4 A flowchart 400 is shown, illustrating another embodiment of the capacity resource scheduling method applicable to this application. In this embodiment, the capacity resource scheduling method includes the following steps:

[0063] Step 401: Receive the transportation task request initiated by the requester.

[0064] In this embodiment, the execution entity may be a scheduling server (such as...) Figure 1 As shown in server 105, requesters who need to publish transportation task requirements can initiate transportation task requests to the scheduling server through the transportation task request initiation terminal or through the interactive platform, requesting the allocation of transportation capacity resources. The scheduling server can monitor the requesters' transportation task requests in real time or periodically.

[0065] Step 402: Based on the profile tags of the transportation resources, identify a first set of transportation resources from the transportation resource pool.

[0066] In this embodiment, in response to receiving a transportation task request from the requester, the scheduling server can obtain resource profile data of the transportation resources from the transportation resource pool using a wired or wireless connection method, such as obtaining the profile tags of the transportation resources.

[0067] The aforementioned wireless connection methods may include, but are not limited to, 3G / 4G connection, WiFi connection, Bluetooth connection, WiMAX (World Interoperability for Microwave Access) connection, Zigbee connection, UWB (ultra-wideband) connection, and other currently known or future wireless connection methods.

[0068] The transportation task request may include various requirements related to the transportation task, such as capacity requirements and task requirements. Capacity requirements may include at least one of the following: qualification validity verification (including driver validity and vehicle validity), blacklist verification, driver level, transportation resource type, cargo type, cargo weight, etc.; task requirements may include at least one of the following: pickup location, destination, pickup start time, and delivery time.

[0069] In some optional implementations, the scheduling server can identify a first set of transportation resources from the transportation resource pool based on the profile tags of the transportation resources, wherein the profile tags of the first set of transportation resources match at least one of the capability requirements included in the transportation task request. Specifically, for example, if the transportation task request includes the following capability requirements: no blacklist + valid qualification + vehicle type is a vehicle + driver level is greater than level 2 + cargo weight is 1.2 tons, then the executing entity will identify multiple transportation resources from the transportation resource pool that match the above capability requirements as the identified first set of transportation resources.

[0070] In some optional implementations, the scheduling server may also generate a first capacity resource list based on the identified first set of capacity resources. In one example, the first capacity resource list may include information such as: driver ID, driver phone number, driver level, license plate number, vehicle type, preferred transportation routes, number of historical transactions, and historical winning freight rates.

[0071] Step 403: Based on the resource status information of the first transport capacity resource, determine the candidate transport capacity resource.

[0072] In this embodiment, the scheduling server can determine candidate transportation resources based on the resource status information of the first transportation resource obtained from the transportation resource pool, wherein the resource status information of the candidate transportation resource matches at least one of the task requirements included in the transportation task request.

[0073] Specifically, for example, if the transportation task request includes the following task requirements: pick-up location, destination, pick-up start time, and delivery time, then the executing entity will further filter out the transportation resources that match the task requirements from the first transportation resources based on the resource status information of the first transportation resources, such as available time periods and available locations, as candidate transportation resources.

[0074] Step 404: Push the invitation information corresponding to the transportation task request to the receiving end corresponding to the candidate transportation capacity resources.

[0075] In some optional implementations, the executing entity can also prioritize candidate transport capacity resources according to preset scheduling rules; and determine the method of pushing bidding invitation information to candidate transport capacity resources based on the priority ranking. The scheduling rules can be a single rule among cost-priority rules, distance-priority rules, and time-priority rules; or they can be rules that assign different weights to cost, distance, and timeliness, and conduct a comprehensive evaluation based on these different weights. Furthermore, filtering can be performed according to set filtering conditions, such as filtering out candidate transport capacity resources if a risk assessment is determined to be risky based on preset risk control evaluation rules.

[0076] Specifically, candidate capacity resources can be prioritized based on cost priority, and their priorities can be designated as high or low (e.g., the top N candidate resources can be prioritized as high). Multiple push notification methods can then be used for high-priority resources, while a single push notification method can be used for low-priority resources. For example, high-priority candidate capacity resources can be reached through a combination of push notifications such as app push, SMS, voice messages, and email, while low-priority candidate capacity resources can be reached through only app push or SMS.

[0077] Step 405: Receive bid response information in response to the invitation to bid information. In an exemplary embodiment, the bid response information may include cost information (e.g., freight) or price quotation information.

[0078] Step 406: Determine the target capacity resource from the candidate capacity resources based on the received bidding information.

[0079] In some optional implementations, the scheduling server can determine the lowest cost or lowest price among the candidate capacity resources corresponding to the bid information as the target capacity resource based on the cost information or price information included in the received bid information.

[0080] In other alternative implementations, the scheduling server may also perform a comprehensive evaluation based on the cost information or quotation information included in the received bidding information, combined with other information of the candidate capacity resources in the bidding information, including resource status information, and adopt a preset evaluation strategy to determine the target capacity resources. This application does not limit this aspect.

[0081] Step 407: Return the target transportation capacity resources to the requester who requested the transportation task.

[0082] The scheduling server returns the information of the identified target transportation capacity resources to the requester of the transportation task request, thus completing the scheduling of transportation capacity resources for the requested transportation task.

[0083] According to the capacity resource scheduling method in this embodiment, by constructing capacity resource profile tags, the characteristics of capacity resources become more concrete and clear, improving the efficiency and accuracy of capacity resource search and identification. Furthermore, by building a dynamic capacity resource pool, dynamic status management of capacity resources is implemented, including timeliness, availability, location, and abnormal situations. Then, by analyzing the transportation needs of upstream cargo owners and combining the dynamic resource status information, more reasonable and available candidate capacity resources can be searched and recommended. Moreover, based on preset scheduling rules, candidate capacity resources can be further comprehensively evaluated from multiple dimensions, avoiding the previous single recommendation method and making the recommendation method more multi-dimensional to meet the diverse and customized needs of users. Simultaneously, by using multiple information delivery channels (such as SMS, email, and app push notifications), bidding invitation information is accurately pushed to capacity resources, thereby revitalizing / activating the capacity resources in the pool.

[0084] refer to Figure 5a , Figure 5a This is an example of a capacity resource scheduling method according to this application, specifically a process 500 that determines candidate capacity resources based on the resource status information of a first capacity resource. This process 500 may include the following sub-steps:

[0085] Step 501: Based on the pickup location in the task requirements, determine the available transportation resources from the first transportation resources.

[0086] Step 502: Determine time-available capacity resources from the available location capacity resources as candidate capacity resources.

[0087] refer to Figure 5b As shown, in some optional implementations, the available transportation resources at the location in step 501 may include transportation resources within a radius of a predetermined distance (e.g., 100 km) centered on the pickup location.

[0088] In some alternative implementations, when determining the available transportation capacity resources at a location, the type of transportation task can be determined as either a short-distance transportation task or a long-distance transportation task based on whether the current location of the first transportation capacity resource and the pickup location are in the same city or whether the distance is less than a first distance threshold. A corresponding predetermined distance is then determined based on the type of transportation task; for example, the first predetermined distance for a short-distance transportation task is less than the second predetermined distance for a long-distance transportation task. Furthermore, for short-distance transportation tasks, available transportation capacity resources are determined within a first radiation range centered on the pickup location and with a radius equal to the first predetermined distance. For long-distance transportation tasks, available transportation capacity resources are determined within a second radiation range centered on the pickup location and with a radius equal to the second predetermined distance.

[0089] Furthermore, in some alternative implementations, when determining available transportation resources at a location, if the number of available resources does not reach a predetermined threshold (e.g., less than 3 or 5), the predetermined distance can be increased (e.g., increased to 120km) before re-determining available resources. Alternatively, transportation resources matching the current route with the pickup location or destination can be determined from the first set of resources as available resources. For example, matching and identification can be performed step-by-step based on the detailed address of the pickup location, according to township, district / county, city, and province. For instance, if driver A's current route is Beijing-Langfang, and the requested route for the transportation task is Beijing-Xianghe, then driver A will also have the opportunity to be identified as available transportation resources.

[0090] It should be understood that the available transportation resources for the aforementioned locations can be determined in many other ways, and are not limited to the implementation methods exemplified above.

[0091] In some optional implementations, the available transportation capacity resources in step 502 above may include transportation capacity resources whose estimated pickup time is less than the pickup start time in the task requirements. The estimated pickup time can be obtained by adding the estimated pickup time to the earliest available time within the available time period, and the estimated pickup time can be determined based on the distance between the available location of the transportation capacity resources and the pickup location. It should be understood that the available transportation capacity resources can also be determined in various other ways, and are not limited to the implementation methods exemplified above; furthermore, the estimated pickup time can also be determined in various other ways, and this application does not impose any limitations on this.

[0092] The following will provide a more detailed description of the specific implementation of the above-mentioned capacity resource scheduling method in this application, with examples of application scenarios.

[0093] As mentioned above, the capacity resource pool can update the resource status information of the capacity resources based on the acquired location information, task execution status information, and in-transit anomaly information.

[0094] In an exemplary embodiment, the capacity resource pool can be connected to a task management module used to monitor the execution status of capacity resource tasks. By inputting specified input parameters, the driver's task list information (including tasks that have not started, have started, and have ended), task execution status information, and on-the-go abnormal information are connected to the capacity resource pool. Based on the task list and task execution status information, the available location, available time, and resource usage of the driver (including the vehicle currently being used by the driver) are further determined, thereby providing underlying data support for dynamically recommending reasonable and available candidate capacity resources.

[0095] In one application scenario example, the following steps may be included:

[0096] Step S1: Obtain transportation capacity resource data by specifying input parameters.

[0097] Taking transportation resources, including drivers and associated vehicles, as an example, the input parameters include: pin, carrier number, working status, carrier attributes, coverage area (center point location, radius-km), start time period - end time.

[0098] Step S2: Based on the above input parameters, find nearby available transportation resources (drivers) based on [location + time]. The returned output parameters may include:

[0099] >>Latest location coordinates (latitude and longitude), location text address, latest location time, and speed (average speed at the time of query);

[0100] >>Assigned / actual driver + phone number;

[0101] >>Task status: Not started, Started, Completed;

[0102] >>Task Data:

[0103] ① Not started: Return to the task list, task number + task to be executed (scheduled start, scheduled arrival time);

[0104] ② Already started: Task number + estimated arrival time (e.g., the time for route assessment after dynamic vehicle closure), whether it is delayed / estimated delay duration;

[0105] ③ Completed: Task number + actual arrival time.

[0106] The explanation of the time dimension is as follows: Based on the driver's task status, ① if the task status is "task not started", look at the planned arrival time; ② if the task status is "task started", look at the estimated arrival time after the vehicle is sealed (meaning the goods have been loaded onto the transport vehicle), or look at the planned arrival time in the scenario where the vehicle is not sealed; ③ if the task status is "task completed", look at the actual arrival time.

[0107] Step S3: Based on the judgment of task execution status information, further refine the available location and available time of the driver (including the vehicle currently being used by the driver), and record or update the resource usage.

[0108] 1) Current / Historical / Backup Speed

[0109] Priority 11: Obtain the latest travel speed (most recent task) of the transport capacity resources;

[0110] Priority 12: If the latest driving speed of the transportation resources is not obtained, determine whether the distance between the pickup location (detailed origin address) and the current location is greater than the predetermined distance. For example, if the distance between the two locations is greater than 100KM, it is considered a long-distance scenario, and the recommended average speed is 60KM / h (based on highway driving).

[0111] Priority 13: If the latest driving speed of the transportation resources is not obtained, and the distance between the pickup start point and the current location is determined to be ≤100KM, it is considered a short-distance scenario, and the average speed is recommended to be 30KM / h.

[0112] 2) Driver recall within a specified radius (find nearby drivers / find drivers within a predetermined distance radius)

[0113] Priority 21: Driver identification and recall logic based on task status

[0114] Scenario 1: [Individual Driver - No Task]

[0115] Based on the distance between the latest location (using the most recent task) and the pickup location (detailed origin address), as well as the historical speed, determine the travel time and whether the travel time is less than or equal to the pickup time.

[0116] Record the current driver's estimated pickup time. If there are multiple drivers with multiple travel times, the shorter the travel time, the higher the recommendation priority in this scenario.

[0117] Scenario 2: [Individual driver has a mission - mission started (on the way)]

[0118] If the driver has an ongoing task, determine whether the estimated delivery end time for that task is less than or equal to the pickup time.

[0119] The estimated pickup time is equal to the distance between the destination address of the previous task and the pickup location (detailed origin address) divided by the historical speed.

[0120] Record the current driver's estimated pickup time. If there are multiple drivers with multiple estimated pickup times, the earlier the estimated pickup time, the higher the recommendation priority in this scenario.

[0121] Scenario 3: [Individual driver has a mission - mission has not yet started]

[0122] If the driver has not yet started a task, determine whether the estimated pickup time is less than or equal to the pickup time.

[0123] The estimated delivery start time is determined based on the driver's estimated start time of the previous task, travel distance, and historical average speed. The travel time is then determined based on the distance between the detailed address of the previous task's destination and the pickup location, as well as historical speed. Finally, the estimated pickup time is determined by adding the estimated delivery start time to the travel time.

[0124] Record the driver's estimated pickup time. The earlier the estimated pickup time, the higher the recommendation priority in this scenario.

[0125] Priority 22: Driver identification and recall logic for transportation scenarios

[0126] Scenario 1: Driver identification and recall in short-distance scenarios

[0127] Identify historical transport routes, checking if the distance between cities, districts / counties, towns / townships, and detailed addresses (judging upwards level by level) is ≤100KM. At this point, the task execution status of the driver or vehicle can be disregarded.

[0128] If ≤100KM, the transportation range is radiating outward from the origin city, origin district / county, origin town / township, and origin detailed address within a 100KM radius.

[0129] Scenario 2: Driver identification and recall in long-distance driving scenarios

[0130] If the distance is ≥100KM, drivers can be matched step by step according to the advantageous provinces, cities, districts and counties, towns and townships, and routes, and the coverage area can be expanded outward.

[0131] Scenario 3: The identified driver has not reached the predetermined threshold.

[0132] If the number of identified drivers does not reach the predetermined threshold, drivers will be matched according to the advantageous provinces, advantageous cities, advantageous districts and counties, advantageous towns, and advantageous routes (matching is progressively scaled up from the smallest granularity of advantageous routes).

[0133] Furthermore, in other implementations, candidate transportation resources can be identified based on fuzzy search rules. For example, for short-distance scenarios, vehicle type matching can be set to vehicle length and load capacity within 80% to 120% of the vehicle length and cargo weight in the transportation task request. Similarly, for long-distance scenarios, route matching can be expanded from city / regional route matching to province route matching, and so on.

[0134] By combining the above methods with the transportation needs of upstream cargo owners, and based on the profile tags of transportation capacity resources and dynamic resource status information, reasonable and available transportation capacity resources are output as candidate transportation capacity resources through a transportation capacity search and recommendation strategy.

[0135] refer to Figure 6 As an implementation of the methods shown in the above figures, this application provides an embodiment of a transportation capacity resource scheduling device, which can be used with... Figure 2 Corresponding to the method embodiments shown, this device can be specifically applied to various electronic devices.

[0136] like Figure 6 As shown, the capacity resource scheduling device 600 in this embodiment includes: a resource management module 610, an interaction module 620, a scheduling module 630, and a push module 640.

[0137] The resource management module 610 can be configured to manage the profile tags and resource status information of transportation resources through the transportation resource pool. The transportation resources include at least drivers and associated vehicles, and the resource status information includes the location information and task status information of the transportation resources.

[0138] The interaction module 620 can be configured to receive transportation task requests and transmit them to the scheduling module 630; and to return the target transportation capacity resources assigned by the scheduling module 630 to the initiator of the transportation task request.

[0139] The scheduling module 630 can be configured to, in response to receiving a transportation task request, determine multiple candidate transportation resources from the transportation resource pool, wherein the profile tags and resource status information of the candidate transportation resources are matched with the transportation task request; and determine the target transportation resource based on the bidding information in response to the invitation to bid information, and assign the transportation task to the target transportation resource.

[0140] The push module 640 can be configured to push invitation information corresponding to the transportation task request to candidate transportation capacity resources.

[0141] In some optional embodiments of this example, the resource management module 610 may be further configured to construct a profile tag for the transport capacity resources based on pre-configured transport capacity resource data tags, wherein the transport capacity resource data tags may include basic capacity tags and historical fulfillment capacity tags.

[0142] In some optional embodiments of this example, the resource management module 610 may be further configured to update the resource status information of the transportation resources based on the acquired task list of transportation resources and at least one of the location information, task status information, and abnormal status information of the transportation resources.

[0143] In some optional embodiments of this example, the scheduling module 630 may be further configured to identify a first set of transportation resources from the transportation resource pool based on the profile tags of the transportation resources, wherein the profile tags of the first transportation resources match at least one of the capacity requirements included in the transportation task request; and to determine candidate transportation resources based on the resource status information of the first transportation resources, wherein the resource status information of the candidate transportation resources matches at least one of the task requirements included in the transportation task request.

[0144] In some optional embodiments of this example, the scheduling module 630 is further configured to determine location-available transportation resources from the first transportation resources based on the pickup location in the task requirements; and to determine time-available transportation resources from the location-available transportation resources as candidate transportation resources.

[0145] In some optional embodiments of this example, the scheduling module 630 may be further configured to determine whether the transportation task is a short-distance transportation task or a long-distance transportation task based on whether the current location of the first transportation resource and the pickup location are in the same city or whether the distance is less than a first distance threshold; and to determine the corresponding predetermined distance based on the type of transportation task, wherein the predetermined distance corresponding to the short-distance transportation task is less than the predetermined distance corresponding to the long-distance transportation task.

[0146] In some alternative embodiments of this embodiment, the scheduling module 630 may be further configured to, in response to the fact that the number of available transportation resources at the determined location has not reached a predetermined threshold, increase the predetermined distance and then redetermine the available transportation resources at the location; or, determine from the first transportation resources the transportation resources that match the current route with the pickup location or destination as the available transportation resources at the location.

[0147] In some optional embodiments of this example, the scheduling module 630 may be further configured to prioritize candidate transport capacity resources according to preset scheduling rules; and determine the method of pushing invitation information to candidate transport capacity resources based on the priority ranking of candidate transport capacity resources; wherein, the scheduling rules include: a single rule among cost priority rule, distance priority rule, and timeliness priority rule; or a rule that comprehensively evaluates cost, distance, and timeliness based on different weights.

[0148] In some optional embodiments of this example, the push module 640 may be further configured to sort the candidate capacity resources according to their priority, using multiple push methods for high-priority resources and a single push method for low-priority resources.

[0149] In some optional embodiments of this example, the scheduling module 630 may be further configured to determine the target transportation capacity resource from the candidate transportation capacity resources corresponding to the bidding information based on the cost information or quotation information included in the bidding information.

[0150] Further reference Figure 7 This application also provides an embodiment of a transportation capacity resource scheduling system.

[0151] like Figure 7 As shown, the transportation resource scheduling system 700 in this embodiment may include: a transportation task request initiator 710, a transportation resource scheduling server 720, and a transportation resource provider 730.

[0152] Among them, the transportation task request initiator 710 can be configured to send a transportation task request to the transportation capacity resource push server and receive the target transportation capacity resource information returned by the transportation capacity resource push server.

[0153] In some optional ways of this embodiment, the transportation task request initiator 710 can initiate a transportation task request to the transportation resource scheduling server 720 through various interactive platforms or inquiry business platforms, or it can publish a transportation task request through the client app of the freight platform.

[0154] The capacity resource scheduling server 720 can be configured to, in response to receiving a transportation task request from the transportation task request initiator, determine multiple candidate capacity resources from the capacity resource pool, and push bidding invitation information corresponding to the transportation task request to the capacity resource provider corresponding to the candidate capacity resources, wherein the profile tags and resource status information of the candidate capacity resources match the transportation task request; and determine the target capacity resource based on the bidding information in response to the bidding invitation information, and return the information of the target capacity resource to the transportation task request initiator.

[0155] In some optional embodiments of this example, the capacity resource scheduling server 720 may include the capacity resource scheduling device 600 in the foregoing embodiments.

[0156] In some optional embodiments of this example, the capacity resource scheduling server 720 may also include a scheduling platform and a resource management system (e.g., a capacity resource pool), and may also include a task management module, such as determining the resource status information of the capacity resources based on the acquired task execution status data of the capacity resources.

[0157] In an exemplary implementation, the capacity resource pool is connected to the task management module. By specifying the required input parameters, the driver's task information (including initial task, started task, and completed task) and in-transit anomaly information are connected to the dynamic resource pool. Furthermore, the available location, available time, and resource usage of the driver (including the vehicle currently being used by the driver) are determined through the task execution status information, thereby providing underlying data support for dynamically recommending reasonable and available candidate capacity resources.

[0158] The capacity resource provider 730 can be configured to receive bidding invitation information pushed by the capacity resource push server, and to send bidding response information to the capacity resource push server in response to the bidding invitation information. In some optional embodiments of this embodiment, the capacity resource provider 730 may be a carrier, freight forwarder, or self-operated driver, etc., and this application does not limit it.

[0159] refer to Figure 8 , Figure 8 The flowchart illustrates an embodiment of the capacity resource scheduling method of this application implemented based on the capacity resource scheduling system 700.

[0160] like Figure 8 As shown, the capacity resource scheduling method in this embodiment may include:

[0161] Step 801: The requester of transportation resources initiates a transportation task request to the transportation resource scheduling server 720 through the transportation task request initiator 710.

[0162] Step 802: The capacity resource scheduling server 720 identifies a first set of capacity resources from the capacity resource pool based on the profile tags of the capacity resources and the received transportation task request.

[0163] In this embodiment, the implementation details and technical effects of step 802 can be found in the description of step 402, and will not be repeated here.

[0164] Step 803: The capacity resource scheduling server 720 determines candidate capacity resources based on the resource status information of the first capacity resource.

[0165] In this embodiment, the implementation details and technical effects of step 803 can be found in the description of step 403, as well as steps 501 and 502, and will not be repeated here.

[0166] Step 804: The capacity resource scheduling server 720 pushes the invitation information corresponding to the transportation task request to the capacity resource provider 730 corresponding to the candidate capacity resource.

[0167] In this embodiment, the implementation details and technical effects of step 804 can be found in the description of step 404, and will not be repeated here.

[0168] Step 805: The capacity resource provider 730 returns the bid response information in response to the invitation to bid information to the capacity resource scheduling server 720.

[0169] Step 806: The capacity resource scheduling server 720 determines the target capacity resource from the candidate capacity resources based on the received bidding information.

[0170] In this embodiment, the implementation details and technical effects of step 806 can be found in the description of step 406, and will not be repeated here.

[0171] Step 807: The capacity resource scheduling server 720 returns the determined target capacity resources to the transportation task request initiator 710 corresponding to the requester of the transportation task request.

[0172] According to the transportation capacity resource scheduling method and system described in the above embodiments, based on the transportation task requirements of the transportation capacity resource requester (upstream cargo owner), and using the profile tags and resource status information of the transportation capacity resources, the system identifies and recommends effective and available candidate transportation capacity resources for the requester. This improves the efficiency and accuracy of transportation capacity resource identification and enhances the user experience. Furthermore, by pushing bidding invitation information to candidate transportation capacity resources, the system can effectively stimulate cooperation potential and promote the rational and effective use of transportation capacity resources. Thus, by connecting upstream and downstream links through the transportation capacity resource scheduling server, it is beneficial to expand the scale of transportation capacity and improve transaction efficiency.

[0173] The following is for reference. Figure 9It illustrates a device suitable for implementing embodiments of this application (e.g., Figure 1 The diagram below illustrates the structure of a computer system 900 (including servers or terminal devices). Terminal devices in the embodiments of this application may include, but are not limited to, mobile terminals such as mobile phones, laptops, digital radio receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), and in-vehicle terminals (e.g., in-vehicle navigation terminals), as well as fixed terminals such as digital TVs and desktop computers. Figure 9 The device shown is merely an example and should not impose any limitation on the functionality and scope of use of the embodiments of this application.

[0174] like Figure 9 As shown, the computer system 900 may include a processor (e.g., CPU, Central Processing Unit) 901, which can perform various appropriate actions and processes according to a program stored in read-only memory (ROM) 902 or a program loaded from storage section 908 into random access memory (RAM) 903. The RAM 903 also stores various programs and data required for the operation of the system 900. The processor 901, ROM 902, and RAM 903 are interconnected via a bus 904. An input / output (I / O) interface 905 is also connected to the bus 904.

[0175] The following components are connected to I / O interface 905: an input section 906 including a keyboard, mouse, etc.; an output section 907 including a cathode ray tube (CRT), liquid crystal display (LCD), etc., and speakers, etc.; a storage section 908 including a hard disk, etc.; and a communication section 909 including a network interface card such as a LAN card, modem, etc. The communication section 909 performs communication processing via a network such as the Internet. A drive 910 is also connected to I / O interface 905 as needed. A removable medium 911, such as a disk, optical disk, magneto-optical disk, semiconductor memory, etc., is installed on drive 910 as needed so that computer programs read from it can be installed into storage section 908 as needed.

[0176] Specifically, according to embodiments of this application, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, embodiments of this application include a computer program product comprising a computer program carried on a computer-readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via communication section 909, and / or installed from removable medium 911. When the computer program is executed by processor 901, it performs the functions defined above in the methods of embodiments of this application.

[0177] It should be noted that the computer-readable medium described in the embodiments of this disclosure can be a computer-readable signal medium or a computer-readable storage medium, or any combination thereof. A computer-readable storage medium can be, for example,—but not limited to—an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of a computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination thereof. In the embodiments of this disclosure, a computer-readable storage medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. In the embodiments of this disclosure, a computer-readable signal medium can include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code. Such propagated data signals can take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A computer-readable signal medium can be any computer-readable medium other than a computer-readable storage medium, which can send, propagate, or transmit a program for use by or in connection with an instruction execution system, apparatus, or device. The program code contained on the computer-readable medium can be transmitted using any suitable medium, including but not limited to: wires, optical fibers, RF (radio frequency), etc., or any suitable combination thereof.

[0178] The aforementioned computer-readable medium may be included in the aforementioned electronic device; or it may exist independently and not assembled into the electronic device. The aforementioned computer-readable medium carries one or more programs that, when executed by the electronic device, cause the electronic device to: in response to receiving a transportation task request, determine multiple candidate transportation resources from a capacity resource pool, wherein the profile tags and resource status information of the candidate transportation resources match the transportation task request; push bidding invitation information corresponding to the transportation task request to the receiving end of the candidate transportation resources; and, based on the bidding response information in response to the bidding invitation information, determine a target transportation resource from the candidate transportation resources and assign the transportation task to the target transportation resource; wherein the transportation resources in the capacity resource pool include drivers and associated vehicles, and the resource status information includes the location information and task status information of the transportation resources.

[0179] Computer program code for performing the operations of embodiments of this disclosure can be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, and C++, and conventional procedural programming languages ​​such as the "C" language or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer can be connected to the user's computer via any type of network—including a local area network (LAN) or a wide area network (WAN)—or can be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0180] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this disclosure. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.

[0181] The modules described in the embodiments of this disclosure can be implemented in software or hardware. The described modules can also be housed in a processor; for example, a processor may be described as including an interaction module, a resource management module, a scheduling module, and a push module. The names of these modules do not necessarily limit the module itself; for example, an interaction module may also be described as an "interaction unit," etc.

[0182] The above description is merely a preferred embodiment of this disclosure and an explanation of the technical principles employed. Those skilled in the art should understand that the scope of the invention involved in the embodiments of this disclosure is not limited to technical solutions formed by specific combinations of the above-described technical features, but should also cover other technical solutions formed by arbitrary combinations of the above-described technical features or their equivalents without departing from the above-described inventive concept. For example, technical solutions formed by substituting the above-described features with (but not limited to) technical features with similar functions disclosed in the embodiments of this disclosure.

Claims

1. A method for scheduling transportation capacity resources, the method comprising: In response to receiving a transportation task request, multiple candidate transportation resources are determined from the transportation resource pool, wherein the profile tags and resource status information of the candidate transportation resources are matched with the transportation task request; The invitation information corresponding to the transportation task request is pushed to the receiving end of the candidate transportation capacity resources; as well as Based on the bid response information in response to the invitation to bid information, a target transportation resource is determined from the candidate transportation resources, and the transportation task is assigned to the target transportation resource; The transportation resources in the transportation resource pool include drivers and associated vehicles, and the resource status information includes the location information and task status information of the transportation resources.

2. The method according to claim 1, wherein, The method further includes: Based on pre-configured capacity resource data tags, a profile tag is constructed for the capacity resource, wherein the capacity resource data tags include basic capacity tags and historical fulfillment capacity tags. The basic capability tags include at least one of the following: driver identity information, certificate and qualification information, vehicle type, vehicle load capacity, and vehicle volume; The historical performance capability label includes at least one of the following: driver validity, vehicle validity, blacklist information, driver rating information, number of historical transactions, historical transaction evaluation, advantageous transportation routes, and advantageous transportation area.

3. The method according to claim 2, wherein, In response to receiving a transportation task request, the method of determining multiple candidate transportation resources from the capacity resource pool includes: Based on the profile tags of the transport capacity resources, a first set of transport capacity resources is identified from the transport capacity resource pool, wherein the profile tags of the first transport capacity resources match at least one of the capacity requirements included in the transport task request; and Based on the resource status information of the first transport capacity resource, the candidate transport capacity resource is determined, wherein the resource status information of the candidate transport capacity resource matches at least one of the task requirements included in the transport task request; The capability requirements include at least one of the following: qualification validity verification, blacklist verification, driver level, transportation resource type, cargo type, and cargo weight; The task requirements include at least one of the following: pick-up location, destination, pick-up start time, and delivery time.

4. The method according to claim 3, wherein, The method further includes: Based on the acquired task list of the transportation resources, and at least one of the location information, task status information, and abnormal status information of the transportation resources, update the resource status information of the transportation resources. The task status information includes at least one of the following: task not started, task started, task start time, estimated task end time, task completed, task end time, and load change information. The abnormal status information includes at least one of the following: fault information, estimated repair completion time; The resource status information includes at least one of the following: current location, current line, available location, available time period, resource anomaly information, available load capacity, and available volume.

5. The method according to claim 4, wherein determining the candidate transportation capacity resource based on the resource status information of the first transportation capacity resource includes: Based on the pickup location in the task requirements, determine the available transportation resources from the first transportation resources. as well as Time-available transportation resources are determined from the available transportation resources at the location, and these are used as candidate transportation resources. The available transportation resources at the location include those within a radius of a predetermined distance centered on the pickup location. The available transportation resources at that time include those with an estimated pickup time less than the pickup start time in the task requirements. The estimated pickup time is calculated based on the earliest available time of the available time period and the estimated pickup time determined by the distance between the available location of the transportation resources and the pickup location.

6. The method according to claim 5, wherein determining the candidate transportation capacity resource based on the resource status information of the first transportation capacity resource further includes: Based on whether the current location of the first transportation resource and the pickup location are in the same city or whether the distance is less than a first distance threshold, the type of the transportation task is determined to be either a short-distance transportation task or a long-distance transportation task. as well as The predetermined distance is determined according to the type of the transportation task, wherein the predetermined distance for short-distance transportation tasks is less than the predetermined distance for long-distance transportation tasks.

7. The method according to claim 5, wherein determining the candidate transportation capacity resource based on the resource status information of the first transportation capacity resource further comprises: In response to the fact that the number of available transportation resources at the determined location does not reach a predetermined threshold, the predetermined distance is increased and the available transportation resources at the location are re-determined; Alternatively, the transportation resources that match the current route with the pickup location or the destination can be determined from the first transportation resources as the available transportation resources for the location.

8. The method according to any one of claims 1-7, wherein, The method further includes: The candidate transportation resources are prioritized according to preset scheduling rules; Based on the priority ranking of the candidate transportation resources, determine the method for pushing the invitation information to the candidate transportation resources; The scheduling rules include: A single rule from the cost-priority rule, distance-priority rule, and time-priority rule; or The rules for comprehensive evaluation based on different weights of cost, distance, and timeliness.

9. The method according to any one of claims 1-7, wherein, The step of determining the target transportation capacity resource from the candidate transportation capacity resources based on the bid response information in response to the invitation to bid information includes: Based on the cost information or quotation information included in the bidding information, the target transportation capacity resource is determined from the candidate transportation capacity resources corresponding to the bidding information.

10. A transportation capacity resource scheduling device, the device comprising: The resource management module is configured to manage the profile tags and resource status information of transportation resources through a transportation resource pool, wherein the transportation resources include at least drivers and associated vehicles, and the resource status information includes the location information and task status information of the transportation resources. The interaction module is configured to receive transportation task requests and transmit them to the scheduling module. And return the target transportation capacity resources assigned by the scheduling module to the initiator of the transportation task request; The scheduling module is configured to, in response to receiving the transportation task request, determine multiple candidate transportation resources from the transportation resource pool, wherein the profile tags and resource status information of the candidate transportation resources are matched with the transportation task request; And determine the target transportation capacity resource based on the bid response information in response to the invitation to bid information, and assign the transportation task to the target transportation capacity resource; The push module is configured to push the invitation information corresponding to the transportation task request to the candidate transportation capacity resources.

11. A transportation capacity resource scheduling system, the system comprising: The capacity resource scheduling server is configured to respond to a transportation task request received from a transportation task request initiator, determine multiple candidate capacity resources from the capacity resource pool, and push bidding information corresponding to the transportation task request to the capacity resource provider corresponding to the candidate capacity resources, wherein the profile tags and resource status information of the candidate capacity resources are matched with the transportation task request. And determine the target transportation capacity resources based on the bid response information in response to the invitation to bid information, and return the information of the target transportation capacity resources to the transportation task request initiator; The transportation task request initiator is configured to send the transportation task request to the transportation resource push server and receive the target transportation resource information returned by the transportation resource push server. The capacity resource provider is configured to receive the invitation information pushed by the capacity resource push server, and to send a response to the invitation information to the capacity resource push server.

12. An electronic device, characterized in that, include: One or more processors; A storage device on which one or more programs are stored; When the one or more programs are executed by the one or more processors, the one or more processors perform the method of any one of claims 1-9.

13. A computer-readable medium having a computer program stored thereon, wherein, When the program is executed by the processor, it implements the method as described in any one of claims 1-9.

Images