Vehicle dispatching method, electronic device, storage medium and computer program product

Abstract

The application discloses a vehicle scheduling method, an electronic device, a storage medium and a computer program product. The method comprises the following steps: obtaining a plurality of first requests, each first request being used for indicating a transfer task and a scheduling type to which a transfer vehicle for executing the transfer task belongs, and the scheduling type comprising any one of a hanging bucket, a virtual pallet and a whole vehicle; performing vehicle allocation on the transfer tasks indicated by the plurality of first requests based on a first condition and the scheduling type indicated by each first request in the plurality of first requests, to obtain first information, wherein the first condition represents a constraint condition for scheduling a transfer vehicle, and the first information indicates a transfer vehicle, a first time period and a first driving route for executing at least part of the transfer tasks indicated by the plurality of first requests.

Description

Technical Field

[0001] This application relates to the field of artificial intelligence technology, and in particular to a vehicle dispatching method, electronic device, storage medium, and computer program product. Background Technology

[0002] In scenarios involving vehicle-based transportation, vehicles are needed to transport parts, components, various materials, or goods to a target location. When there are numerous transportation tasks requiring a large number of vehicles, vehicle scheduling becomes extremely important. Currently, vehicle scheduling management is rather rudimentary, mostly relying on offline communication and a first-come, first-served model, leading to chaotic vehicle scheduling issues. Summary of the Invention

[0003] To address the related technical issues, embodiments of this application provide a vehicle dispatching method, an electronic device, a storage medium, and a computer program product.

[0004] The technical solution of this application embodiment is implemented as follows:

[0005] This application provides a vehicle dispatching method, the method comprising:

[0006] Obtain multiple first requests, each first request indicating the dispatch type of the barge task and the barge vehicle requesting to perform the barge task. The dispatch type includes any one of trailer, virtual pallet, and full vehicle.

[0007] Based on the first condition and the scheduling type indicated by each of the plurality of first requests, vehicles are allocated to the barge tasks indicated by the plurality of first requests to obtain first information; wherein, the first condition characterizes the constraints for scheduling barge vehicles, and the first information indicates the barge vehicles, the first time period, and the first travel route for executing at least a portion of the barge tasks indicated by the plurality of first requests.

[0008] In the above scheme, the first condition includes a first constraint condition of scheduling barge vehicles by combining first requests; the allocation of vehicles to the barge tasks indicated by the plurality of first requests based on the first condition and the scheduling type indicated by each of the plurality of first requests, to obtain first information, includes:

[0009] All second requests are determined from the plurality of first requests, wherein the scheduling type indicated by the second requests is virtual tray;

[0010] Based on the first constraint, all second requests are combined to obtain second information and / or third information; wherein, the second information indicates the shuttle vehicle, first time period and first route of each carpooling combination in the first carpooling combination, the first carpooling combination including at least part of the second requests, and the third information indicates the shuttle vehicle, first time period and first route of the shuttle task indicated by a single second request.

[0011] In the above scheme, the first request carries the second time period and the second route of the transport task; based on the first constraint, all second requests are combined to obtain second information, including:

[0012] Based on the first constraint, a first set and a second set are determined for each second request. The second time period carried by all second requests included in the first set satisfies the second condition, and the second travel route carried by all second requests included in the second set satisfies the third condition.

[0013] Determine the third set for each second request, where the third set of a second request is the intersection of the first set and the second set of the corresponding second request;

[0014] Based on a third set of all second requests, the first carpooling combination is determined;

[0015] Based on the first carpooling combination, the second information is determined.

[0016] In the above scheme, the first request also carries the number of virtual pallets required for the transport task and the first vehicle type; the determination of the first carpooling combination based on the third set of all second requests includes:

[0017] Different second requests in the third set of the same second request are combined to obtain the second carpooling combination of the corresponding second request;

[0018] Deduplicate all second carpooling combinations requested in the second request to obtain the third carpooling combination;

[0019] A fourth carpooling combination is determined from the third carpooling combination; wherein, each carpooling combination included in the fourth carpooling combination has the same first vehicle type, and the total number of virtual pallets required by each carpooling combination included in the fourth carpooling combination is less than or equal to the maximum number of pallets supported by the first vehicle type of the corresponding carpooling combination;

[0020] In the fourth carpooling combination, carpooling combinations that do not overlap are identified to obtain the first carpooling combination.

[0021] In the above scheme, the second condition includes the start time of the second time period falling within a first range and the end time of the second time period falling within a second range; the first range is determined based on the first maximum advance duration, the first maximum lag duration, and the start time of the second time period carried by the second request corresponding to the first set; the second range is determined based on the second maximum advance duration, the second maximum lag duration, and the end time of the second time period carried by the second request corresponding to the first set; and / or

[0022] The third condition includes the overlap of the dot matrix sets of the second driving routes carried by different second requests being greater than a set threshold, or the longest paths corresponding to the second driving routes carried by different second requests being the same.

[0023] In the above scheme, the step of determining the first carpooling combination by identifying non-overlapping carpooling combinations in the fourth carpooling combination includes:

[0024] Among the carpooling combinations included in the fourth carpooling combination, a fifth carpooling combination and all sixth carpooling combinations are determined. The fifth carpooling combination represents any carpooling combination included in the fourth carpooling combination, and the sixth carpooling combination represents a carpooling combination associated with the fifth carpooling combination.

[0025] Based on the score of the fifth carpooling combination and the score of each sixth carpooling combination, the seventh carpooling combination is determined. The seventh carpooling combination represents either the sixth or fifth carpooling combination whose score satisfies the fourth condition.

[0026] From the fourth carpooling combination, delete the carpooling combination that intersects with the seventh carpooling combination to obtain the updated fourth carpooling combination;

[0027] If there is no overlap among the carpooling combinations included in the updated fourth carpooling combination, the union of all seventh carpooling combinations and the updated fourth carpooling combination is determined as the first carpooling combination.

[0028] The method in the above scheme further includes:

[0029] Based on the first, second, third, and fourth values ​​of each carpooling combination in the fourth carpooling combination, a score is determined for each carpooling combination in the fourth carpooling combination; wherein,

[0030] The first value indicates the vehicle space utilization rate of the carpooling combination; the second value indicates the proportion of the total number of second requests of the carpooling combination; the third value indicates the proportion of the number of carpooling combinations associated with the carpooling combination; and the fourth value indicates the occupancy rate of the first vehicle type of the carpooling combination in the third time period. The third time period is determined based on the second time period carried by the second request of the carpooling combination.

[0031] In the above scheme, based on the first constraint, all second requests are combined to obtain third information, including:

[0032] In the event of a second ride-sharing request that fails and / or a second request that does not meet the first constraint, the priority of the second vehicle type is determined based on the fifth and sixth values ​​of the second vehicle type; the fifth value indicates the vehicle space utilization rate of the second vehicle type, and the sixth value indicates the occupancy rate of the second vehicle type.

[0033] The third information is determined based on the priority of each second vehicle type.

[0034] In the above scheme, the first request includes the loading and unloading time periods for the goods carrying the barge transport task; the allocation of vehicles for the barge transport tasks indicated by the multiple first requests based on the first condition and the scheduling type indicated by each of the multiple first requests, to obtain the first information, includes:

[0035] All third requests are determined from the plurality of first requests, wherein the scheduling type indicated by the third request is a hanging bucket;

[0036] Based on the first condition and the fourth time period corresponding to each third request, vehicles are allocated to all third requests to obtain the first information; the fourth time period is determined based on the start time of the loading time of the items carried by the corresponding third request and the end time of the unloading time of the items.

[0037] In the above scheme, the first information includes fourth information, which indicates the barge vehicle executing the barge task indicated by the fourth request, the first time period, and the first route; the fourth request represents a first request that meets the fifth condition; the fifth condition includes a dispatch type of trailer and / or full vehicle, and the barge task supports multiple transports from one vehicle; the method further includes:

[0038] Based on the remaining available barge vehicles, at least part of the fourth information is updated.

[0039] This application embodiment also provides a vehicle dispatching device, the device comprising:

[0040] The acquisition module is used to acquire multiple first requests, each first request indicating the dispatch type of the barge task and the barge vehicle requesting to perform the barge task. The dispatch type includes any one of trailer, virtual pallet and full vehicle.

[0041] The allocation module is used to allocate vehicles to the barge tasks indicated by the plurality of first requests based on a first condition and the scheduling type indicated by each of the plurality of first requests, and to obtain first information; wherein, the first condition represents the constraint conditions for scheduling barge vehicles, and the first information indicates the barge vehicles, the first time period, and the first travel route for executing at least some of the barge tasks indicated by the plurality of first requests.

[0042] This application also provides an electronic device, including: a processor and a communication interface; wherein,

[0043] The processor is configured to acquire a plurality of first requests, each first request indicating a barge transport task and the scheduling type to which the barge vehicle requesting to perform the barge transport task belongs, the scheduling type including any one of trailer, virtual pallet, and full vehicle; based on a first condition and the scheduling type indicated by each of the plurality of first requests, the processor allocates vehicles to the barge transport tasks indicated by the plurality of first requests to obtain first information; wherein, the first condition characterizes the constraints for scheduling barge transport vehicles, and the first information indicates the barge vehicle, first time period, and first travel route for performing at least some of the barge transport tasks indicated by the plurality of first requests.

[0044] This application also provides an electronic device, including a processor and a memory for storing a computer program capable of running on the processor.

[0045] When the processor runs the computer program, it executes any of the steps of the above methods.

[0046] This application also provides a storage medium storing a computer program thereon, which, when executed by a processor, implements the steps of any of the above methods.

[0047] This application also provides a computer program product, including a computer program that, when executed by a processor, implements the steps of any of the above methods.

[0048] The vehicle dispatching method, electronic device, storage medium, and computer program product provided in this application embodiment obtain multiple first requests. Each first request indicates a transport task and the dispatching type of the transport vehicle requesting to perform the transport task. The dispatching type includes any one of trailer, virtual pallet, and whole vehicle. Based on a first condition and the dispatching type indicated by each of the multiple first requests, vehicles are allocated to the transport tasks indicated by the multiple first requests to obtain first information. The first condition represents the constraints for dispatching transport vehicles, and the first information indicates the transport vehicles performing at least some of the transport tasks indicated by the multiple first requests, the first time period, and the first travel route. The above solution obtains multiple first requests without adopting a first-come, first-served allocation mode. By allocating vehicles through the first condition and the dispatching type indicated by each of the multiple first requests, flexible vehicle allocation can be achieved, and considering the constraints for dispatching transport vehicles, vehicle dispatching chaos can be avoided. Attached Figure Description

[0049] Figure 1 This is a schematic flowchart of a vehicle dispatching method according to an embodiment of this application;

[0050] Figure 2 This is a schematic diagram of a second driving route carried in a second request according to an embodiment of this application;

[0051] Figure 3 This is a schematic diagram of the second driving route carried in another second request according to an embodiment of this application;

[0052] Figure 4 This is a schematic diagram illustrating the application process of the vehicle dispatching method according to an embodiment of this application;

[0053] Figure 5 This is a schematic diagram of the vehicle dispatching device structure according to an embodiment of this application;

[0054] Figure 6 This is a schematic diagram of the electronic device structure according to an embodiment of this application. Detailed Implementation

[0055] In scenarios involving vehicle-based transportation, such as shipyards and / or ports and / or mines, vehicles are needed to transport parts, components, various materials, or goods to their destinations. When there are numerous transportation tasks requiring a large number of vehicles, vehicle scheduling becomes extremely important. Currently, vehicle scheduling management is rather rudimentary, mostly relying on offline communication and a first-come, first-served model, leading to chaotic vehicle scheduling problems.

[0056] Taking shipyards as an example, the shipbuilding or repair process generates numerous barge transport tasks involving various parts or components to different ships, sections, or berths. The scientific and rational allocation of barge vehicles for these tasks—that is, vehicle scheduling—directly affects the production progress of shipbuilding or repair. Currently, most shipyard barge vehicle scheduling adopts an offline, first-come, first-served model. Supervisors in each work area contact barge drivers by phone. When multiple barge tasks conflict, the order of barge transport is usually negotiated between the driver and the work area supervisor. This makes it difficult to fully consider factors such as barge routes, full truck capacity, and trailer capacity, resulting in chaotic vehicle scheduling in shipyards, leading to high barge transport costs and low efficiency.

[0057] Based on this, in various embodiments of this application, multiple first requests are obtained, each first request indicating a barge task and the scheduling type of the barge vehicle requesting to perform the barge task. The scheduling type includes any one of trailer, virtual pallet, and full vehicle. Based on a first condition and the scheduling type indicated by each of the multiple first requests, vehicles are allocated to the barge tasks indicated by the multiple first requests to obtain first information. The first condition represents the constraints for scheduling barge vehicles, and the first information indicates the barge vehicles, the first time period, and the first travel route for performing at least some of the barge tasks indicated by the multiple first requests. The above scheme, by obtaining multiple first requests and not adopting a first-come, first-served allocation mode, and by allocating vehicles through the first condition and the scheduling type indicated by each of the multiple first requests, enables flexible vehicle allocation and, considering the constraints for scheduling barge vehicles, avoids vehicle scheduling chaos.

[0058] The present application will now be described in further detail with reference to the accompanying drawings and embodiments.

[0059] This application provides a vehicle dispatching method applied to an electronic device. The electronic device may have a display screen or display function, or may be connected to a display screen; the electronic device includes a terminal and / or a device with a display screen or display function. Figure 1 As shown, it includes:

[0060] Step 101: Obtain multiple first requests, each first request indicating the dispatch type of the barge task and the dispatch type of the barge vehicle requesting to perform the barge task.

[0061] The dispatch type includes any one of trailer, virtual pallet, and whole vehicle.

[0062] A first request indicates a transshipment task. A transshipment task indicates transportation-related information. A transshipment task may include one or more of the following: the transportation route, the transportation time period, and information about the transported goods; specific details are not limited. The trailer is detachable and includes space for loading goods; when using a trailer for goods transportation, the trailer and trailer must be connected before transport. The vehicle is not detachable and includes space for loading goods, such as a cargo box. The loading space of the trailer and the vehicle can be divided into one or more virtual pallets. It is worth noting that the goods are not limited; for example, goods can be parts, components, and various materials.

[0063] The dispatch type is trailer, indicating that the type of the barge vehicle that the first request cannot be combined and requests to perform the barge task is trailer.

[0064] The scheduling type is virtual pallet, which indicates that the first request is combinable and that the type of the barge vehicle requesting to perform the barge task is trailer and / or full vehicle.

[0065] The dispatch type is "full vehicle", which indicates that the first request is not combinable and the type of the barge vehicle that requests to perform the barge task is "full vehicle".

[0066] Step 102: Based on the first condition and the scheduling type indicated by each of the plurality of first requests, allocate vehicles to the barge tasks indicated by the plurality of first requests to obtain first information.

[0067] Wherein, the first condition characterizes the constraints for scheduling the barge vehicles, and the first information indicates the barge vehicles, the first time period, and the first travel route for executing at least a portion of the barge tasks indicated by the plurality of first request instructions.

[0068] The first condition may include the existence of available barge vehicles, and / or, the time period and route of the first requested barge transport task meeting the corresponding conditions, without being specifically limited. Available barge vehicles may refer to barge vehicles other than those that are scrapped or out of service, and barge vehicles that are idle and usable during the time period of the first requested barge transport task. The barge vehicles, the first time period, and the first route in the first information are all allocated information, and the barge transport task can be executed according to the first information, that is, the barge vehicles transport according to the first route during the first time period to perform the barge transport task.

[0069] Here, based on the first condition and the scheduling type indicated by each of the multiple first requests, vehicle allocation is performed on the barge tasks indicated by the multiple first requests to obtain first information, including one or more of the following:

[0070] All second requests are determined from multiple first requests, and vehicles are allocated to all second requests based on first conditions to obtain first information; the scheduling type indicated by the second request is virtual tray.

[0071] All third requests are identified from multiple first requests, and vehicles are allocated to all third requests based on first conditions to obtain first information; the scheduling type indicated by the third request is trailer;

[0072] All fifth requests are identified from multiple first requests. Vehicles are allocated to all fifth requests based on first conditions to obtain first information; the scheduling type indicated by the fifth request is a full vehicle. Vehicles are allocated to all fifth requests based on the first conditions, such as the existence of available shuttle vehicles. The first information includes fifth information, which indicates the shuttle vehicle, first time period, and first route for the shuttle task indicated by a single fifth request. Vehicles are allocated to all fifth requests based on available shuttle vehicles to obtain fifth information. It should be understood that one fifth request corresponds to one shuttle vehicle.

[0073] It is worth noting that in practical applications, when multiple first requests include second requests, vehicle allocation is prioritized for all second requests.

[0074] In this embodiment, multiple first requests are obtained, and instead of a first-come, first-served allocation mode, vehicles are allocated based on a first condition and the scheduling type indicated by each of the multiple first requests. This enables flexible vehicle allocation and takes into account the constraints of scheduling shuttle vehicles, thus avoiding vehicle scheduling chaos.

[0075] The items to be transported by barge vehicles are typically of varying sizes, and the loading space of a barge vehicle can be divided into one or more virtual pallets. This means that one barge vehicle can simultaneously execute multiple barge tasks indicated by first requests. Based on this, in one embodiment, the first condition includes a first constraint condition of scheduling barge vehicles by combining first requests. The allocation of vehicles to the multiple barge tasks indicated by the multiple first requests based on the first condition and the scheduling type of each first request indicates a first information step includes:

[0076] All second requests are determined from the plurality of first requests, wherein the scheduling type indicated by the second requests is virtual tray;

[0077] Based on the first constraint, all second requests are combined to obtain second information and / or third information; wherein, the second information indicates the shuttle vehicle, first time period and first route of each carpooling combination in the first carpooling combination, the first carpooling combination including at least part of the second requests, and the third information indicates the shuttle vehicle, first time period and first route of the shuttle task indicated by a single second request.

[0078] The first constraint may include the time period and route of the second request to carry out the transshipment task meeting the corresponding conditions, without being specifically limited.

[0079] The first carpooling combination includes one or more carpooling combinations. One carpooling combination within the first carpooling combination includes at least two second requests. It is worth noting that the carpooling combinations included in the first carpooling combination do not overlap. The first time period for each carpooling combination in the second information can be determined based on the time periods of all second requests within the corresponding carpooling combination that carry the transfer task. The first route for each carpooling combination in the second information can be determined based on the routes of all second requests within the corresponding carpooling combination that carry the transfer task.

[0080] The third information is obtained from vehicle allocation for second requests that failed to carpool and / or second requests that did not meet the first constraint. It should be understood that second requests that failed to carpool and / or second requests that did not meet the first constraint are no longer combined, but are allocated as individual second requests.

[0081] In this embodiment, requests with the scheduling type of virtual pallet are combined to dynamically determine the transport vehicle, the first time period, and the first travel route, which can improve transportation efficiency and reduce transportation costs.

[0082] In one embodiment, the first request carries a second time period and a second route for the transport task; based on the first constraint, all second requests are combined to obtain second information, including:

[0083] Based on the first constraint, a first set and a second set are determined for each second request. The second time period carried by all second requests included in the first set satisfies the second condition, and the second travel route carried by all second requests included in the second set satisfies the third condition.

[0084] Determine the third set for each second request, where the third set of a second request is the intersection of the first set and the second set of the corresponding second request;

[0085] Based on a third set of all second requests, the first carpooling combination is determined;

[0086] Based on the first carpooling combination, the second information is determined.

[0087] Here, the second time period of the first request to carry out the barge transport task can be understood as the time period occupied by the barge vehicle expected to perform the barge transport task in the first request. The second travel route of the first request to carry out the barge transport task can be understood as the travel route of the barge vehicle expected to perform the barge transport task in the first request. The first set can be an empty set or a non-empty set. The second set can be an empty set or a non-empty set. The second condition indicates that the second time period of the second request to carry out the task is within a set range, or indicates that the second time periods of the second request to carry out the task are the same, without specific limitations. The third condition indicates that the overlap of the second travel routes of the second request to carry out the task is greater than a set threshold, or indicates that the longest paths corresponding to the second travel routes of the second request to carry out the task are the same, without specific limitations.

[0088] The first set of each second request includes the second request corresponding to the first set. The second set of each second request includes the second request corresponding to the second set. For example, the first set of second request A is {A, B, C}, and the second set of second request A is {A, B, D}, where B, C, and D represent the second request.

[0089] Based on the third set of all second requests, the first carpooling combination is determined. This can be done by combining different second requests from the third set of the same second request to obtain the corresponding second carpooling combination, and then randomly selecting the first carpooling combination from all the second carpooling combinations of the second requests; or by combining different second requests from the third set of the same second request to obtain the corresponding second carpooling combination, deduplicating all the second carpooling combinations of the second requests to obtain the third carpooling combination, and then determining the first carpooling combination from the third carpooling combination.

[0090] Based on the first carpooling combination, the second information is determined. This can be achieved by allocating vehicles to each carpooling combination within the first carpooling combination. In practical applications, vehicle allocation can be performed once a carpooling combination within the first carpooling combination is identified.

[0091] In this embodiment, the method of combining all second requests based on the first constraint to obtain the second information is clearly defined, which improves the efficiency and accuracy of obtaining the second information. The second time period carried by the second request in the first carpooling combination needs to meet the second condition, and the second driving route needs to meet the third condition. This can ensure the matching of the time period and driving route of the second request in the carpooling combination, and avoid the combination of mismatched second requests, which would increase the transportation time and transportation cost.

[0092] In one embodiment, the second condition includes the start time of the second time period falling within a first range and the end time of the second time period falling within a second range; the first range is determined based on a first maximum advance duration, a first maximum lag duration, and the start time of the second time period carried by the second request corresponding to the first set; the second range is determined based on a second maximum advance duration, a second maximum lag duration, and the end time of the second time period carried by the second request corresponding to the first set; and / or

[0093] The third condition includes the overlap of the dot matrix sets of the second driving routes carried by different second requests being greater than a set threshold, or the longest paths corresponding to the second driving routes carried by different second requests being the same.

[0094] The first maximum advance time, the first maximum lag time, the second maximum advance time, and the second maximum lag time can be set based on actual needs. The first maximum advance time and the second maximum advance time can be the same or different. Similarly, the first maximum advance time and the first maximum lag time can be the same or different. For example, the first maximum advance time and the second maximum advance time could be 30 minutes, and the first maximum lag time and the second maximum lag time could be 1 hour; the specific values ​​are not limited.

[0095] The first range is determined based on the first maximum advance time, the first maximum lag time, and the start time of the second time period carried by the second request corresponding to the first set. It can be that the start time of the first range is determined based on the first maximum advance time and the start time of the second time period carried by the second request corresponding to the first set, and the end time of the first range is determined based on the first maximum lag time and the start time of the second time period carried by the second request corresponding to the first set. Alternatively, the first range can be determined based on both the start and end times. For example, if the start time of the second time period carried by the second request corresponding to the first set is 9:00 AM, the first maximum advance time is 30 minutes, and the first maximum lag time is 1 hour, then the first range is from 8:30 AM to 10:00 AM.

[0096] The second range is determined based on the second maximum advance time, the second maximum lag time, and the end time of the second time period carried by the second request corresponding to the first set. Specifically, the start time of the second range can be determined based on the second maximum advance time and the end time of the second time period carried by the second request corresponding to the first set; the end time of the second range can be determined based on the second maximum lag time and the end time of the second time period carried by the second request corresponding to the first set; and the second range can be determined based on both the start and end times. For example, if the end time of the second time period carried by the second request corresponding to the first set is 11:00, the second maximum advance time is 30 minutes, and the second maximum lag time is 1 hour, then the second range is from 10:30 to 12:00.

[0097] Here, the threshold can be set based on actual needs. All the longest paths corresponding to the application scenario of the first request, namely the barge transportation scenario, can be determined in advance.

[0098] The set of points for the second travel route carried in the second request can be understood as the set of path points for the second travel route carried in the second request. Taking a shipyard as an example of the application scenario corresponding to the first request, the schematic diagram of the second travel route carried in the second request is as follows: Figure 2 As shown. Figure 2 The second route carried by the second request A is from pier 1 to pier 7, the second route carried by the second request B is from pier 1 to pier 5, and the second route carried by the second request D is from pier 2 to pier 4. Figure 2 If the overlap between the point set of the second driving route carried by the second request B and the point set of the second driving route carried by the second request A is greater than a set threshold, and the overlap between the point set of the second driving route carried by the second request D and the point set of the second driving route carried by the second request A is greater than a set threshold, then the second set of the second request A is {A, B, D}.

[0099] The longest path corresponding to the second travel route carried in the second request can be understood as any longest path in the application scenario corresponding to the first request that includes the second travel route carried in the second request. Taking a shipyard as an example of the application scenario corresponding to the first request, the schematic diagram of the second travel route carried in the second request is as follows: Figure 3 As shown. Figure 3 The second route carried by the second request A is from pier 1 to pier 7, the second route carried by the second request B is from pier 1 to pier 5, and the second route carried by the second request D is from pier 2 to pier 4. Figure 3If the longest path corresponding to the second driving route carried by the second request A is from dock 1 to dock 7, the longest path corresponding to the second driving route carried by the second request B is from dock 1 to dock 7, and the longest path corresponding to the second driving route carried by the second request D is from dock 1 to dock 7, then the second set of the second request A is {A, B, D}.

[0100] In practical applications, the third condition includes the overlap of the dot matrix sets of the second driving routes carried by different second requests being greater than a set threshold.

[0101] In this embodiment, the second condition includes the start time of the second time period being within the first range and the end time of the second time period being within the second range. This can ensure that the second time periods of all second requests in the first set have a high degree of overlap or consistency, thus improving the accuracy of the first set. The third condition can improve the accuracy of the second set.

[0102] In one embodiment, the first request also carries the number of virtual pallets required for the transport task and the first vehicle type; determining the first carpooling combination based on the third set of all second requests includes:

[0103] Different second requests in the third set of the same second request are combined to obtain the second carpooling combination of the corresponding second request;

[0104] Deduplicate all second carpooling combinations requested in the second request to obtain the third carpooling combination;

[0105] A fourth carpooling combination is determined from the third carpooling combination; wherein, each carpooling combination included in the fourth carpooling combination has the same first vehicle type, and the total number of virtual pallets required by each carpooling combination included in the fourth carpooling combination is less than or equal to the maximum number of pallets supported by the first vehicle type of the corresponding carpooling combination;

[0106] In the fourth carpooling combination, carpooling combinations that do not overlap are identified to obtain the first carpooling combination.

[0107] The first vehicle type represents the type of vehicle that can be used to perform the barge transport task. The first vehicle type may include one or more of the following: freight truck, four-wheeled electric vehicle, flatbed truck, container truck, forklift; no specific limitation is made.

[0108] The number of virtual pallets required for a transshipment task can be determined based on the dimensions of the virtual pallets for the first vehicle type and the dimensions of the goods being transported in the transshipment task, or it can be set based on actual needs. It is worth noting that each virtual pallet of the same first vehicle type has the same dimensions (length and width), while virtual pallets of different first vehicle types can have different dimensions. The dimensions of the virtual pallets for each first vehicle type can be set in advance. For example, if the dimensions of the goods being transported in the transshipment task are 2 meters × 10 meters, and each virtual pallet of the first vehicle type is 2 meters × 2 meters, then the transshipment task requires 5 virtual pallets.

[0109] The total number of virtual pallets required by each carpooling combination included in the fourth carpooling combination represents the sum of the number of virtual pallets required for all second requests to carry transport tasks within the corresponding carpooling combination. The maximum number of pallets supported by the first vehicle type can be preset or determined based on the size of each virtual pallet of the first vehicle type and the size of the loading space of the transport vehicle of the first vehicle type. Taking a freight truck as an example, if the loading space of the freight truck is 2 meters × 10 meters and the size of each virtual pallet of the freight truck is 2 meters × 2 meters, then the maximum number of pallets supported by the freight truck is 5.

[0110] Here, different second requests in the third set of the same second request are combined to obtain the second carpooling combination of the corresponding second request. Taking the third set of second request E as {E, F, G, H} as an example, the different second requests in the third set of second request E are combined to obtain the second carpooling combination of second request E, which includes (E, F), (E, G), (E, H), (F, G), (F, H), (G, H), (E, F, G), (E, F, H), (E, G, H), (F, G, H) and (E, F, G, H), a total of 11 carpooling combinations.

[0111] For all second carpooling combinations in the second requests, deduplication is performed to obtain the third carpooling combination. This includes: if there are identical carpooling combinations in the second carpooling combinations of different second requests, retaining one identical carpooling combination and deleting the other identical carpooling combinations to obtain the third carpooling combination. The third carpooling combination includes all the deduplicated second carpooling combinations from the second requests.

[0112] The first carpooling group is determined by identifying non-overlapping carpooling groups from the fourth group. This can be done by randomly selecting non-overlapping carpooling groups from the fourth group, or by using an algorithm to determine non-overlapping carpooling groups from the fourth group. For example, a genetic algorithm can be used, but the specific algorithm is not limited.

[0113] In this embodiment, the method of determining the first carpooling combination based on the third set of all second requests is clearly defined, which improves the efficiency of determining the first carpooling combination. The second carpooling combinations of all second requests are deduplicated, reducing the data volume of the third carpooling combination. The fourth carpooling combination is determined from the third carpooling combination. Carpooling combinations with different first vehicle types can be removed, and carpooling combinations whose total number of required virtual pallets is greater than the maximum number of pallets supported by the first vehicle type of the corresponding carpooling combination can be removed, thus avoiding invalid carpooling combinations and reducing the amount of subsequent calculations.

[0114] A genetic algorithm can be used to determine non-overlapping carpooling combinations in the fourth carpooling combination to obtain the first carpooling combination. Based on this, in one embodiment, determining non-overlapping carpooling combinations in the fourth carpooling combination to obtain the first carpooling combination includes:

[0115] Among the carpooling combinations included in the fourth carpooling combination, a fifth carpooling combination and all sixth carpooling combinations are determined. The fifth carpooling combination represents any carpooling combination included in the fourth carpooling combination, and the sixth carpooling combination represents a carpooling combination associated with the fifth carpooling combination.

[0116] Based on the score of the fifth carpooling combination and the score of each sixth carpooling combination, the seventh carpooling combination is determined. The seventh carpooling combination represents either the sixth or fifth carpooling combination whose score satisfies the fourth condition.

[0117] From the fourth carpooling combination, delete the carpooling combination that intersects with the seventh carpooling combination to obtain the updated fourth carpooling combination;

[0118] If there is no overlap among the carpooling combinations included in the updated fourth carpooling combination, the union of all seventh carpooling combinations and the updated fourth carpooling combination is determined as the first carpooling combination.

[0119] Here, after determining the fifth carpooling combination, all sixth carpooling combinations can be determined through a variable neighborhood search method to improve the convergence speed of the genetic algorithm.

[0120] The fourth condition can be either the highest score or a score greater than a set threshold. The set threshold can be set based on actual needs. If there are multiple sixth or fifth carpooling combinations with scores satisfying the fourth condition, and there is overlap among these combinations, one carpooling combination can be randomly selected as the seventh carpooling combination. Alternatively, the carpooling combination with the highest number of second requests among the sixth or fifth carpooling combinations satisfying the fourth condition can be selected as the seventh carpooling combination.

[0121] If there is overlap among the carpooling combinations included in the updated fourth carpooling combination, return to the updated fourth carpooling combination and continue execution. Among the carpooling combinations included in the fourth carpooling combination, determine the fifth carpooling combination and all sixth carpooling combinations.

[0122] Taking the fourth carpooling combination as an example, which includes five carpooling combinations: I1(a, b), I2(a, c), I3(c, d), I4(e, f), and I5(e, g, h), with a, b, c, d, e, f, g, and h representing the second request, we determine the fifth carpooling combination I1 from among the carpooling combinations included in the fourth carpooling combination. All sixth carpooling combinations include I2 and I3. For example, if I1 has the highest score among I1, I2, and I3, then I1 is determined as the seventh carpooling combination. From the fourth carpooling combination, we delete the carpooling combinations that intersect with I1, namely I1 and I2, to obtain the updated fourth carpooling combination, which includes I3, I4, and I5. 5. The updated fourth carpooling combination includes carpooling combinations that have overlap. Among the carpooling combinations included in the updated fourth carpooling combination, the fifth carpooling combination I4 is determined, and all sixth carpooling combinations include I5. For example, if I5 has a higher score than I4, then I5 is determined as the seventh carpooling combination. From the updated fourth carpooling combination, the carpooling combinations that have overlap with I5, namely I4 and I5, are deleted, resulting in the updated fourth carpooling combination. The updated fourth carpooling combination includes I3. That is, the carpooling combinations included in the updated fourth carpooling combination do not have overlap. I1, I5, and I3 are determined as the first carpooling combination, which includes 3 carpooling combinations.

[0123] In this embodiment, a genetic algorithm is used to determine the carpooling combinations that do not overlap in the fourth carpooling combination to obtain the first carpooling combination. This improves the accuracy of the first carpooling combination. By using the genetic algorithm, the computational complexity is reduced, which can further improve the efficiency of obtaining the first carpooling combination.

[0124] In one embodiment, the vehicle dispatching method further includes:

[0125] Based on the first, second, third, and fourth values ​​of each carpooling combination in the fourth carpooling combination, a score is determined for each carpooling combination in the fourth carpooling combination; wherein,

[0126] The first value indicates the vehicle space utilization rate of the carpooling combination; the second value indicates the proportion of the total number of second requests of the carpooling combination; the third value indicates the proportion of the number of carpooling combinations associated with the carpooling combination; and the fourth value indicates the occupancy rate of the first vehicle type of the carpooling combination in the third time period. The third time period is determined based on the second time period carried by the second request of the carpooling combination.

[0127] Here, the first value is determined based on a first coefficient, the maximum number of pallets supported by the first vehicle type in the carpooling combination, and the total number of virtual pallets required by the carpooling combination. The first coefficient can be understood as a first vehicle space utilization coefficient. The first value can be obtained by multiplying the first coefficient by the sum of the number of virtual pallets required by the carpooling combination, and then dividing by the maximum number of pallets supported by the first vehicle type in the carpooling combination.

[0128] The second value is determined based on the second coefficient, the set maximum number of carpooling trips, and the total number of second requests for carpooling combinations. The second coefficient can be understood as the carpooling odds coefficient. The set maximum number of carpooling trips is a constant and can be set based on actual needs. Taking carpooling combination I5(e, g, h) as an example, the total number of second requests for I5 is 3. The second value can be obtained by multiplying the second coefficient by the total number of second requests for carpooling combinations, and then dividing by the set maximum number of carpooling trips.

[0129] The third value is determined based on the third coefficient, the number of carpooling combinations associated with the carpooling combination, and the total number of second requests for the carpooling combination. The third coefficient can be understood as the coefficient for the hoisting requests associated with the carpooling. The third value can be obtained by multiplying the number of carpooling combinations associated with the carpooling combination by the third coefficient and dividing by the total number of second requests for the carpooling combination.

[0130] The fourth value is determined based on the fourth coefficient and the occupancy rate of the first vehicle type in the carpooling combination during the third time period. The fourth coefficient can be understood as the occupancy rate coefficient of the first required vehicle type during the time period. The third time period is determined based on the second time period carried by the second request of the carpooling combination, which can be based on the earliest start time and the latest end time of the second time period carried by the second request of the carpooling combination. The occupancy rate of the first vehicle type in the carpooling combination during the third time period is determined based on the number of vehicles of the first vehicle type in the carpooling combination that are occupied during the third time period and the total number of vehicles of the first vehicle type in the carpooling combination. For example, dividing the number of vehicles of the first vehicle type in the carpooling combination that are occupied during the third time period by the total number of vehicles of the first vehicle type in the carpooling combination yields the occupancy rate of the first vehicle type in the carpooling combination during the third time period. The fourth value can be the product of the fourth coefficient and the occupancy rate of the first vehicle type in the carpooling combination during the third time period.

[0131] The first, second, third, and fourth coefficients can be set based on actual needs. For example, the first coefficient can be 0.6, the second coefficient 0.4, the third coefficient 0.3, and the fourth coefficient 0.7. The specific values ​​of the first, second, third, and fourth coefficients are not limited.

[0132] Based on the first, second, third, and fourth values ​​of each carpooling combination in the fourth carpooling combination, the score of each carpooling combination in the fourth carpooling combination is determined. This can be achieved by subtracting the second sum from the first sum, or by summing the difference between the first and second sums with a first predetermined deviation value. The first predetermined deviation value can be set based on actual needs. Specifically, the first sum is the sum of the first and second values ​​of the corresponding carpooling combination, and the second sum is the sum of the third and fourth values ​​of the corresponding carpooling combination.

[0133] In this embodiment, explicitly determining the score of each carpooling group in the fourth carpooling group can improve the efficiency and accuracy of determining the score of each carpooling group in the fourth carpooling group.

[0134] In one embodiment, all second requests are combined based on the first constraint to obtain third information, including:

[0135] In the event of a second ride-sharing request that fails and / or a second request that does not meet the first constraint, the priority of the second vehicle type is determined based on the fifth and sixth values ​​of the second vehicle type; the fifth value indicates the vehicle space utilization rate of the second vehicle type, and the sixth value indicates the occupancy rate of the second vehicle type.

[0136] The third information is determined based on the priority of each second vehicle type.

[0137] Here, a second request for carpooling failure may occur if no available shuttle vehicle is available when allocating vehicles for carpooling combinations within the first carpooling combination, and / or if the first carpooling combination does not include all second requests. A second request that does not satisfy the first constraint may occur if the third set of all second requests is empty and / or the fourth carpooling combination is empty.

[0138] The second vehicle type represents the vehicle type of the remaining available barge vehicles.

[0139] The fifth value is determined based on the fifth coefficient. The fifth coefficient can be understood as the second vehicle space utilization coefficient. The fifth coefficient can be set based on actual needs. The fifth coefficient can be the same as or different from the first coefficient. For example, the fifth coefficient can be 0.6. The fifth value can be the fifth coefficient.

[0140] The sixth value is determined based on the sixth coefficient and the occupancy rate of the second vehicle type. The sixth coefficient can be understood as the occupancy rate coefficient for the second required vehicle type during a specific time period. The sixth coefficient can be set based on actual demand. The sixth coefficient can be the same as or different from the fourth coefficient. For example, the sixth coefficient can be 0.7. The occupancy rate of the second vehicle type is determined based on the number of occupied second-type shuttle vehicles and the total number of second-type shuttle vehicles. For example, dividing the number of occupied second-type shuttle vehicles by the total number of second-type shuttle vehicles yields the occupancy rate of the second vehicle type. The sixth value can be the product of the sixth coefficient and the occupancy rate of the second vehicle type.

[0141] The priority of the second vehicle type is determined based on its fifth and sixth numerical values. This can be achieved by determining a seventh numerical value for the second vehicle type based on these values, and then prioritizing the second vehicle types from highest to lowest priority according to the seventh numerical values. Alternatively, the seventh numerical value can be determined by subtracting the sixth numerical value from the fifth, or by summing the difference between the two values ​​with a second predefined deviation value. This second predefined deviation value can be set based on actual needs.

[0142] Based on the priority of each second vehicle type, the third information is determined. This can be achieved by allocating vehicles to second requests that failed to carpool and / or second requests that do not meet the first constraint conditions, according to the priority of each second vehicle type from high to low.

[0143] In this embodiment, for second requests that fail to carpool and / or second requests that do not meet the first constraint, the method of combining second requests is no longer used for vehicle allocation. Instead, vehicle allocation is performed on individual second requests, and the method of clearly determining the third information is used to improve vehicle dispatching efficiency.

[0144] In one embodiment, the first request includes the loading and unloading periods of the goods for the barge transport task; the allocation of vehicles for the barge transport tasks indicated by the plurality of first requests is based on a first condition and the scheduling type indicated by each of the plurality of first requests, to obtain first information, including:

[0145] All third requests are determined from the plurality of first requests, wherein the scheduling type indicated by the third request is a hanging bucket;

[0146] Based on the first condition and the fourth time period corresponding to each third request, vehicles are allocated to all third requests to obtain the first information; the fourth time period is determined based on the start time of the loading time of the items carried by the corresponding third request and the end time of the unloading time of the items.

[0147] Here, the fourth time period can be understood as the time period during which the barge vehicle is expected to perform the barge transport task in the third request. The first condition includes the existence of an available barge vehicle. The first information includes the sixth information, which indicates the barge vehicle, the first time period, and the first route for the barge transport task indicated in the single third request.

[0148] Based on the first condition and the fourth time period corresponding to each third request, vehicles are allocated to all third requests to obtain the first information. Alternatively, based on the available barge vehicles and the fourth time period corresponding to each third request, vehicles can be allocated to all third requests to obtain the sixth information. It should be understood that the first time period of the barge task indicated by a single third request is determined based on the fourth time period of the corresponding third request.

[0149] In this embodiment, the method of vehicle allocation for the first request indicated by the scheduling type of trailer is clearly defined. Considering that trailers are different from whole vehicles, trailers require an additional tractor unit to move them. The tractor unit only needs to transport the trailer to the loading location before loading the goods, and can then be detached from the trailer to transport other trailers. After the goods are loaded, the trailer can be transported to the unloading location by any suitable tractor unit. Based on the fourth time period corresponding to the third request, the vehicle allocation for the third request is more in line with the actual method of vehicle allocation for the third request in practical applications, and further avoids vehicle scheduling chaos.

[0150] In one embodiment, the first information includes fourth information, which indicates the barge vehicle executing the barge task indicated by the fourth request, the first time period, and the first route; the fourth request represents a first request that satisfies a fifth condition; the fifth condition includes a scheduling type of trailer and / or full vehicle, and the barge task supports multiple transports per vehicle; the vehicle scheduling method further includes:

[0151] Based on the remaining available barge vehicles, at least part of the fourth information is updated.

[0152] Here, "remaining available barge vehicles" refers to the remaining available barge vehicles after allocating vehicles for all first requests with scheduling types of trailers and / or full vehicles, and the vehicle type of the remaining available barge vehicles is the same as the first vehicle type of the fourth request. Updating at least part of the fourth information can be done by updating the barge vehicles executing the barge task indicated by the fourth request and the first time period in the fourth information. For example, if the initial fourth information is that the fourth request is executed by barge vehicle W making two round trips along the first route from 9:00 to 11:00 in the first time period, and there is a remaining available barge vehicle V, then the updated fourth information is that the fourth request is executed by barge vehicle W and barge vehicle V making one round trip along the first route from 9:00 to 10:00 in the first time period.

[0153] In this embodiment, for cases where the barge transport task supports multiple transports from a single vehicle, at least some of the fourth information can be updated based on the remaining available barge transport vehicles, thereby improving the utilization rate of the barge transport vehicles.

[0154] The following section provides a more detailed description of this application with reference to application examples.

[0155] The application flow diagram of the vehicle dispatching method provided in this application is as follows: Figure 4 As shown, it includes:

[0156] Step 1: Begin.

[0157] Step 2: Obtain the first request. Each first request indicates the transport task and the dispatch type of the transport vehicle requesting the transport task. A first request with a dispatch type of virtual pallet can at least include the second time period and second route of the transport task, as well as the number of virtual pallets required for the transport task and the first vehicle type. A first request with a dispatch type of trailer can at least include the loading and unloading time periods of the transport task.

[0158] Step 3: Split the first request according to the scheduling type.

[0159] The first request is split into three parts based on scheduling type: all second requests, all third requests, and all fifth requests are determined from the first request. The scheduling type indicated by the second request is virtual pallet, the scheduling type indicated by the third request is trailer, and the scheduling type indicated by the fifth request is full vehicle. Specifically, steps 4.1 to 4.9 are executed for the second request; steps 5.1 to 5.3 are executed for the third request; and steps 6.1 to 6.2 are executed for the fifth request.

[0160] Step 4.1: Determine the first set for each second request.

[0161] Based on the first constraint, a first set is determined for each second request. All second requests in the first set carry a second time period that satisfies the second condition, which will not be elaborated here.

[0162] Step 4.2: Determine the second set for each second request.

[0163] Based on the first constraint, a second set is determined for each second request. All second driving routes carried by the second requests included in the second set satisfy the third condition, which will not be elaborated here.

[0164] Step 4.3: Determine the third set for each second request. The third set for a second request is the intersection of the first and second sets of the corresponding second request. If the third set for all second requests is empty, proceed to step 4.9.

[0165] Step 4.4: Determine the second carpooling combination for each second request.

[0166] Different second requests in the third set of the same second request are combined to obtain the second carpooling combination of the corresponding second request.

[0167] Step 4.5: Deduplicate all second carpooling combinations in the second request to obtain the third carpooling combination.

[0168] Step 4.6: Determine the fourth carpooling combination from the third carpooling combination.

[0169] The first vehicle type is the same for each carpooling combination included in the fourth carpooling combination, and the total number of virtual pallets required for each carpooling combination included in the fourth carpooling combination is less than or equal to the maximum number of pallets supported by the first vehicle type of the corresponding carpooling combination. If the fourth carpooling combination is empty, proceed to step 4.9.

[0170] Step 4.7: Identify the carpooling combinations that do not overlap in the fourth carpooling combination to obtain the first carpooling combination. The specific implementation process will not be described in detail here.

[0171] Step 4.8: Determine the second information based on the first carpooling combination.

[0172] The second information indicates the shuttle vehicle, first time period, and first route for each carpooling group in the first carpooling group. If all carpooling groups in the first carpooling group successfully allocate vehicles and the first carpooling group includes all second requests, proceed to step 7; if no shuttle vehicle is available when carpooling groups in the first carpooling group are allocated vehicles and / or the first carpooling group does not include all second requests, proceed to step 4.9.

[0173] Step 4.9: Based on the fifth and sixth values ​​of the second vehicle type, determine the priority of the second vehicle type. Based on the priority of each second vehicle type, determine the third information. The third information indicates the transport vehicle, first time period, and first route for the transport task indicated by a single second request. The specific implementation process will not be described in detail here. After step 4.9 is executed, proceed to step 7.

[0174] Step 5.1: Determine the fourth time period corresponding to each third request.

[0175] The fourth time period is determined based on the start time of the loading time of the corresponding third request and the end time of the unloading time of the corresponding third request.

[0176] Step 5.2: Based on the first condition and the fourth time period corresponding to each third request, allocate vehicles to all third requests to obtain the first information. If the first information includes the fourth information and there are remaining available barge vehicles, proceed to step 5.3; if the first information does not include the fourth information, proceed to step 7. At this time, the fourth information indicates the barge vehicle, the first time period, and the first route for executing the barge task indicated by the fourth request; the fourth request represents the first request that meets the fifth condition; the fifth condition includes that the scheduling type is a trailer and that the barge task supports multiple transports by one vehicle.

[0177] Step 5.3: Update at least part of the fourth information based on the remaining available barge vehicles. After completing Step 5.3, proceed to Step 7.

[0178] Step 6.1: Allocate vehicles to all fifth requests based on the first condition to obtain first information. If the first information includes the fourth information and there are remaining available shuttle vehicles, proceed to step 6.2; if the first information does not include the fourth information, proceed to step 7. At this time, the fourth information indicates the shuttle vehicle, the first time period, and the first route for executing the shuttle task indicated by the fourth request; the fourth request represents the first request that meets the fifth condition; the fifth condition includes that the scheduling type is full vehicle and that the shuttle task supports multiple transports from one vehicle.

[0179] Step 6.2: Update at least part of the fourth information based on the remaining available barge vehicles. After completing Step 6.2, proceed to Step 7.

[0180] Step 7: End.

[0181] It is worth noting that during the execution of steps 1 to 7, a map can be used to show the time periods during which all the barge vehicles in the application scenario corresponding to the first request perform barge tasks. If no barge vehicles are available when executing steps 4.9, 5.2 and 6.1, the second time period carried by the first request can be modified, or the loading time period and unloading time period of the items carried by the first request can be modified to successfully allocate vehicles and update the map in real time.

[0182] The vehicle dispatching method provided in this application includes dispatching types such as trailers, virtual pallets, and full vehicles. Combining first requests with dispatching types of virtual pallets can improve vehicle dispatching efficiency and the utilization rate of barge vehicles while avoiding vehicle dispatching chaos, thereby reducing transportation costs and improving transportation efficiency. Allocating vehicles to the third request based on the fourth time period corresponding to the third request is more in line with the actual way of allocating vehicles to the third request in practical applications, further avoiding vehicle dispatching chaos. Updating at least some of the fourth information based on the remaining available barge vehicles can reduce the complexity of vehicle dispatching problems while ensuring the accuracy of vehicle dispatching. Dispatchers can also intuitively operate and monitor the vehicle dispatching process through the user interface of electronic devices, making it highly practical.

[0183] To implement the vehicle dispatching method provided in this application embodiment, this application embodiment also provides a vehicle dispatching device, such as... Figure 5 As shown, the device includes:

[0184] The acquisition module 501 is used to acquire multiple first requests, each first request being used to indicate the barge task and the scheduling type of the barge vehicle requesting to perform the barge task. The scheduling type includes any one of trailer, virtual pallet, and whole vehicle.

[0185] The allocation module 502 is used to allocate vehicles to the barge tasks indicated by the plurality of first requests based on a first condition and the scheduling type indicated by each of the plurality of first requests, and to obtain first information; wherein, the first condition represents the constraint condition for scheduling barge vehicles, and the first information indicates the barge vehicles, the first time period, and the first travel route for executing at least some of the barge tasks indicated by the plurality of first requests.

[0186] In one embodiment, the first condition includes a first constraint condition of scheduling the barge vehicle by combining the first requests; the allocation module 502 is specifically used to determine all second requests from the plurality of first requests, wherein the scheduling type indicated by the second request is a virtual pallet;

[0187] Based on the first constraint, all second requests are combined to obtain second information and / or third information; wherein, the second information indicates the shuttle vehicle, first time period and first route of each carpooling combination in the first carpooling combination, the first carpooling combination including at least part of the second requests, and the third information indicates the shuttle vehicle, first time period and first route of the shuttle task indicated by a single second request.

[0188] In one embodiment, the first request carries a second time period and a second route for the transport task; the allocation module 502 is specifically used to determine a first set and a second set for each second request based on the first constraint condition, wherein the second time period carried by all second requests included in the first set satisfies a second condition, and the second route carried by all second requests included in the second set satisfies a third condition;

[0189] Determine the third set for each second request, where the third set of a second request is the intersection of the first set and the second set of the corresponding second request;

[0190] Based on a third set of all second requests, the first carpooling combination is determined;

[0191] Based on the first carpooling combination, the second information is determined.

[0192] In one embodiment, the first request also carries the number of virtual pallets required for the transport task and the first vehicle type; the allocation module 502 is specifically used to combine different second requests in the third set of the same second request to obtain the second carpooling combination of the corresponding second request;

[0193] Deduplicate all second carpooling combinations requested in the second request to obtain the third carpooling combination;

[0194] A fourth carpooling combination is determined from the third carpooling combination; wherein, each carpooling combination included in the fourth carpooling combination has the same first vehicle type, and the total number of virtual pallets required by each carpooling combination included in the fourth carpooling combination is less than or equal to the maximum number of pallets supported by the first vehicle type of the corresponding carpooling combination;

[0195] In the fourth carpooling combination, carpooling combinations that do not overlap are identified to obtain the first carpooling combination.

[0196] In one embodiment, the second condition includes the start time of the second time period falling within a first range and the end time of the second time period falling within a second range; the first range is determined based on a first maximum advance duration, a first maximum lag duration, and the start time of the second time period carried by the second request corresponding to the first set; the second range is determined based on a second maximum advance duration, a second maximum lag duration, and the end time of the second time period carried by the second request corresponding to the first set; and / or

[0197] The third condition includes the overlap of the dot matrix sets of the second driving routes carried by different second requests being greater than a set threshold, or the longest paths corresponding to the second driving routes carried by different second requests being the same.

[0198] In one embodiment, the allocation module 502 is specifically used to determine a fifth carpooling combination and all sixth carpooling combinations among the carpooling combinations included in the fourth carpooling combination. The fifth carpooling combination represents any carpooling combination included in the fourth carpooling combination, and the sixth carpooling combination represents a carpooling combination associated with the fifth carpooling combination.

[0199] Based on the score of the fifth carpooling combination and the score of each sixth carpooling combination, the seventh carpooling combination is determined. The seventh carpooling combination represents either the sixth or fifth carpooling combination whose score satisfies the fourth condition.

[0200] From the fourth carpooling combination, delete the carpooling combination that intersects with the seventh carpooling combination to obtain the updated fourth carpooling combination;

[0201] If there is no overlap among the carpooling combinations included in the updated fourth carpooling combination, the union of all seventh carpooling combinations and the updated fourth carpooling combination is determined as the first carpooling combination.

[0202] In one embodiment, the device further includes:

[0203] The determining module is used to determine the score of each carpooling combination in the fourth carpooling combination based on the first value, second value, third value and fourth value of each carpooling combination in the fourth carpooling combination; wherein, the first value indicates the vehicle space utilization rate of the carpooling combination, the second value indicates the proportion of the total number of second requests of the carpooling combination, the third value indicates the proportion of the number of carpooling combinations associated with the carpooling combination, and the fourth value indicates the occupancy rate of the first vehicle type of the carpooling combination in the third time period, and the third time period is determined based on the second time period carried by the second request of the carpooling combination.

[0204] In one embodiment, the allocation module 502 is specifically used to determine the priority of the second vehicle type based on a fifth value and a sixth value when there is a second request that fails to carpool and / or a second request that does not meet the first constraint condition; the fifth value indicates the vehicle space utilization rate of the second vehicle type, and the sixth value indicates the occupancy rate of the second vehicle type.

[0205] The third information is determined based on the priority of each second vehicle type.

[0206] In one embodiment, the first request carries the loading and unloading time periods of the goods for the barge transport task; the allocation module 502 is specifically used to determine all third requests from the plurality of first requests, wherein the scheduling type indicated by the third request is a hanging bucket;

[0207] Based on the first condition and the fourth time period corresponding to each third request, vehicles are allocated to all third requests to obtain the first information; the fourth time period is determined based on the start time of the loading time of the items carried by the corresponding third request and the end time of the unloading time of the items.

[0208] In one embodiment, the first information includes fourth information, which indicates the barge vehicle executing the barge task indicated by the fourth request, the first time period, and the first route; the fourth request represents a first request that satisfies a fifth condition; the fifth condition includes a dispatch type of trailer and / or full vehicle, and the barge task supports multiple transports per vehicle; the device further includes:

[0209] An update module is used to update at least a portion of the fourth information based on the remaining available barge vehicles.

[0210] In practical applications, the acquisition module 501, allocation module 502, determination module, and update module can be implemented by the processor in the vehicle dispatching device.

[0211] It should be noted that the vehicle dispatching device provided in the above embodiments is only illustrated by the division of the above-described program modules. In practical applications, the above processing can be assigned to different program modules as needed, that is, the internal structure of the device can be divided into different program modules to complete all or part of the processing described above. In addition, the vehicle dispatching device and the vehicle dispatching method embodiments provided in the above embodiments belong to the same concept, and their specific implementation process can be found in the method embodiments, which will not be repeated here.

[0212] Based on the hardware implementation of the above program modules, and in order to implement the vehicle dispatching method provided in this application embodiment, this application embodiment also provides an electronic device, such as... Figure 6 As shown, the electronic device 600 includes:

[0213] The communication interface 601 enables information exchange with other network nodes;

[0214] The processor 602 is connected to the communication interface 601 to enable information interaction with other network nodes and to execute the methods provided by one or more of the above-described technical solutions when running a computer program. The computer program is stored in the memory 603.

[0215] Specifically, the processor 602 is configured to acquire a plurality of first requests, each first request indicating a barge transport task and the scheduling type to which the barge vehicle requesting to perform the barge transport task belongs, the scheduling type including any one of trailer, virtual pallet, and full vehicle; based on a first condition and the scheduling type indicated by each of the plurality of first requests, the processor allocates vehicles to the barge transport tasks indicated by the plurality of first requests to obtain first information; wherein, the first condition characterizes the constraints for scheduling barge transport vehicles, and the first information indicates the barge vehicle, the first time period, and the first travel route for performing at least some of the barge transport tasks indicated by the plurality of first requests.

[0216] In one embodiment, the first condition includes a first constraint condition for scheduling the barge vehicle by combining the first requests; the processor 602 is specifically configured to determine all second requests from the plurality of first requests, wherein the scheduling type indicated by the second requests is a virtual pallet;

[0217] Based on the first constraint, all second requests are combined to obtain second information and / or third information; wherein, the second information indicates the shuttle vehicle, first time period and first route of each carpooling combination in the first carpooling combination, the first carpooling combination including at least part of the second requests, and the third information indicates the shuttle vehicle, first time period and first route of the shuttle task indicated by a single second request.

[0218] In one embodiment, the first request carries a second time period and a second route for the transport task; the processor 602 is specifically configured to determine a first set and a second set for each second request based on the first constraint condition, wherein the second time period carried by all second requests included in the first set satisfies a second condition, and the second route carried by all second requests included in the second set satisfies a third condition;

[0219] Determine the third set for each second request, where the third set of a second request is the intersection of the first set and the second set of the corresponding second request;

[0220] Based on a third set of all second requests, the first carpooling combination is determined;

[0221] Based on the first carpooling combination, the second information is determined.

[0222] In one embodiment, the first request also carries the number of virtual pallets required for the transport task and the first vehicle type; the processor 602 is specifically used to combine different second requests in the third set of the same second request to obtain the second carpooling combination of the corresponding second request;

[0223] Deduplicate all second carpooling combinations requested in the second request to obtain the third carpooling combination;

[0224] A fourth carpooling combination is determined from the third carpooling combination; wherein, each carpooling combination included in the fourth carpooling combination has the same first vehicle type, and the total number of virtual pallets required by each carpooling combination included in the fourth carpooling combination is less than or equal to the maximum number of pallets supported by the first vehicle type of the corresponding carpooling combination;

[0225] In the fourth carpooling combination, carpooling combinations that do not overlap are identified to obtain the first carpooling combination.

[0226] In one embodiment, the second condition includes the start time of the second time period falling within a first range and the end time of the second time period falling within a second range; the first range is determined based on a first maximum advance duration, a first maximum lag duration, and the start time of the second time period carried by the second request corresponding to the first set; the second range is determined based on a second maximum advance duration, a second maximum lag duration, and the end time of the second time period carried by the second request corresponding to the first set; and / or

[0227] The third condition includes the overlap of the dot matrix sets of the second driving routes carried by different second requests being greater than a set threshold, or the longest paths corresponding to the second driving routes carried by different second requests being the same.

[0228] In one embodiment, the processor 602 is specifically configured to determine a fifth carpooling combination and all sixth carpooling combinations among the carpooling combinations included in the fourth carpooling combination, wherein the fifth carpooling combination represents any carpooling combination included in the fourth carpooling combination, and the sixth carpooling combination represents a carpooling combination associated with the fifth carpooling combination.

[0229] Based on the score of the fifth carpooling combination and the score of each sixth carpooling combination, the seventh carpooling combination is determined. The seventh carpooling combination represents either the sixth or fifth carpooling combination whose score satisfies the fourth condition.

[0230] From the fourth carpooling combination, delete the carpooling combination that intersects with the seventh carpooling combination to obtain the updated fourth carpooling combination;

[0231] If there is no overlap among the carpooling combinations included in the updated fourth carpooling combination, the union of all seventh carpooling combinations and the updated fourth carpooling combination is determined as the first carpooling combination.

[0232] In one embodiment, the processor 602 is further configured to determine a score for each carpooling combination in the fourth carpooling combination based on a first value, a second value, a third value, and a fourth value; wherein,

[0233] The first value indicates the vehicle space utilization rate of the carpooling combination; the second value indicates the proportion of the total number of second requests of the carpooling combination; the third value indicates the proportion of the number of carpooling combinations associated with the carpooling combination; and the fourth value indicates the occupancy rate of the first vehicle type of the carpooling combination in the third time period. The third time period is determined based on the second time period carried by the second request of the carpooling combination.

[0234] In one embodiment, the processor 602 is specifically configured to determine the priority of a second vehicle type based on a fifth value and a sixth value when there is a second request that fails to carpool and / or a second request that does not meet the first constraint condition; the fifth value indicates the vehicle space utilization rate of the second vehicle type, and the sixth value indicates the occupancy rate of the second vehicle type.

[0235] The third information is determined based on the priority of each second vehicle type.

[0236] In one embodiment, the first request carries the loading and unloading time periods of the goods for the barge transport task; the processor 602 is specifically configured to determine all third requests from the plurality of first requests, wherein the scheduling type indicated by the third request is a hanging bucket;

[0237] Based on the first condition and the fourth time period corresponding to each third request, vehicles are allocated to all third requests to obtain the first information; the fourth time period is determined based on the start time of the loading time of the items carried by the corresponding third request and the end time of the unloading time of the items.

[0238] In one embodiment, the first information includes fourth information, which indicates the barge vehicle executing the barge task indicated by the fourth request, the first time period, and the first route; the fourth request represents a first request that satisfies a fifth condition; the fifth condition includes a scheduling type of trailer and / or full vehicle, and the barge task supports multiple transports per vehicle; the processor 602 is further configured to update at least a portion of the fourth information based on the remaining available barge vehicles.

[0239] It should be noted that the specific processing procedure of processor 602 can be understood by referring to the above method.

[0240] Of course, in practical applications, the various components in electronic device 600 are coupled together through bus system 604. It can be understood that bus system 604 is used to realize the connection and communication between these components. In addition to a data bus, bus system 604 also includes a power bus, a control bus, and a status signal bus. However, for the sake of clarity, in... Figure 6 The general designated all buses as Bus System 604.

[0241] The memory 603 in this embodiment is used to store various types of data to support the operation of the electronic device 600. Examples of such data include any computer program used to operate on the electronic device 600.

[0242] The methods disclosed in the embodiments of this application can be applied to the processor 602, or implemented by the processor 602. The processor 602 may be an integrated circuit chip with signal processing capabilities. In the implementation process, each step of the above method can be completed by the integrated logic circuit of the hardware in the processor 602 or by instructions in the form of software. The processor 602 may be a general-purpose processor, a digital signal processor (DSP), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The processor 602 can implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the methods disclosed in the embodiments of this application can be directly reflected as being executed by a hardware decoding processor, or being executed by a combination of hardware and software modules in the decoding processor. The software modules may be located in a storage medium, which is located in the memory 603. The processor 602 reads the information in the memory 603 and combines its hardware to complete the steps of the aforementioned method.

[0243] In an exemplary embodiment, the electronic device 600 may be implemented by one or more application-specific integrated circuits (ASICs), DSPs, programmable logic devices (PLDs), complex programmable logic devices (CPLDs), field-programmable gate arrays (FPGAs), general-purpose processors, controllers, microcontrollers (MCUs), microprocessors, or other electronic components to perform the aforementioned method.

[0244] It is understood that the memory 603 in this embodiment can be volatile memory or non-volatile memory, or both. Non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), ferromagnetic random access memory (FRAM), flash memory, magnetic surface memory, optical disc, or compact disc read-only memory (CD-ROM); magnetic surface memory can be disk storage or magnetic tape storage. Volatile memory can be random access memory (RAM), which is used as an external cache. By way of example, but not limitation, many forms of RAM are available, such as Static Random Access Memory (SRAM), Synchronous Static Random Access Memory (SSRAM), Dynamic Random Access Memory (DRAM), Synchronous Dynamic Random Access Memory (SDRAM), Double Data Rate Synchronous Dynamic Random Access Memory (DDRSDRAM), Enhanced Synchronous Dynamic Random Access Memory (ESDRAM), SyncLink Dynamic Random Access Memory (SLDRAM), and Direct Rambus Random Access Memory (DRRAM).The memory 603 described in the embodiments of this application is intended to include, but is not limited to, these and any other suitable types of memory.

[0245] In an exemplary embodiment, this application also provides an electronic device, including a processor and a memory for storing a computer program capable of running on the processor, wherein the processor, when running the computer program, performs the steps of any of the methods described above.

[0246] This application embodiment also provides a storage medium, namely a computer storage medium, specifically a computer-readable storage medium, such as a memory 603 that stores a computer program. The computer program can be executed by the processor 602 of the electronic device 600 to complete the steps described in the aforementioned method. The computer-readable storage medium can be a memory such as FRAM, ROM, PROM, EPROM, EEPROM, Flash Memory, magnetic surface memory, optical disc, or CD-ROM.

[0247] This application also provides a computer program product, including a computer program that, when executed by a processor, implements the steps of any of the above methods.

[0248] It should be noted that terms such as "first" and "second" are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. The term "and / or" in this article merely describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, and B alone. Furthermore, the term "one or more" in this article refers to any combination of at least two of any one or more items from a set of A, B, and C. For example, "one or more of A, B, and C" can represent any one or at least two or more elements selected from the set of A, B, and C.

[0249] Furthermore, the technical solutions described in the embodiments of this application can be combined arbitrarily without conflict.

[0250] The above description is merely a preferred embodiment of this application and is not intended to limit the scope of protection of this application.

Claims

1. A vehicle dispatching method, characterized in that, The method includes: Obtain multiple first requests, each first request indicating the dispatch type of the barge task and the barge vehicle requesting to perform the barge task. The dispatch type includes any one of trailer, virtual pallet, and full vehicle. Based on the first condition and the scheduling type indicated by each of the plurality of first requests, vehicles are allocated to the barge tasks indicated by the plurality of first requests to obtain first information; wherein, the first condition characterizes the constraints for scheduling barge vehicles, and the first information indicates the barge vehicles, the first time period, and the first travel route for executing at least a portion of the barge tasks indicated by the plurality of first requests.

2. The method according to claim 1, characterized in that, The first condition includes a first constraint condition of scheduling barge vehicles by combining first requests; the allocation of vehicles to the barge tasks indicated by the plurality of first requests based on the first condition and the scheduling type indicated by each of the plurality of first requests, to obtain first information, includes: All second requests are determined from the plurality of first requests, wherein the scheduling type indicated by the second requests is virtual tray; Based on the first constraint, all second requests are combined to obtain second information and / or third information; wherein, the second information indicates the shuttle vehicle, first time period and first route of each carpooling combination in the first carpooling combination, the first carpooling combination including at least part of the second requests, and the third information indicates the shuttle vehicle, first time period and first route of the shuttle task indicated by a single second request.

3. The method according to claim 2, characterized in that, The first request is to carry out the second time period and the second route for the barge transport mission; Based on the first constraint, all second requests are combined to obtain second information, including: Based on the first constraint, a first set and a second set are determined for each second request. The second time period carried by all second requests included in the first set satisfies the second condition, and the second travel route carried by all second requests included in the second set satisfies the third condition. Determine the third set for each second request, where the third set of a second request is the intersection of the first set and the second set of the corresponding second request; Based on a third set of all second requests, the first carpooling combination is determined; Based on the first carpooling combination, the second information is determined.

4. The method according to claim 3, characterized in that, The first request also carries the number of virtual pallets required for the transport mission and the first vehicle type; the determination of the first carpooling combination based on the third set of all second requests includes: Different second requests in the third set of the same second request are combined to obtain the second carpooling combination of the corresponding second request; Deduplicate all second carpooling combinations requested in the second request to obtain the third carpooling combination; A fourth carpooling combination is determined from the third carpooling combination; wherein, each carpooling combination included in the fourth carpooling combination has the same first vehicle type, and the total number of virtual pallets required by each carpooling combination included in the fourth carpooling combination is less than or equal to the maximum number of pallets supported by the first vehicle type of the corresponding carpooling combination; In the fourth carpooling combination, carpooling combinations that do not overlap are identified to obtain the first carpooling combination.

5. The method according to claim 3, characterized in that, The second condition includes that the start time of the second time period is within a first range, and the end time of the second time period is within a second range; the first range is determined based on a first maximum advance duration, a first maximum lag duration, and the start time of the second time period carried by the second request corresponding to the first set; the second range is determined based on a second maximum advance duration, a second maximum lag duration, and the end time of the second time period carried by the second request corresponding to the first set; and / or The third condition includes the overlap of the dot matrix sets of the second driving routes carried by different second requests being greater than a set threshold, or the longest paths corresponding to the second driving routes carried by different second requests being the same.

6. The method according to claim 4, characterized in that, The step of identifying non-overlapping carpooling combinations in the fourth carpooling combination to obtain the first carpooling combination includes: Among the carpooling combinations included in the fourth carpooling combination, a fifth carpooling combination and all sixth carpooling combinations are determined. The fifth carpooling combination represents any carpooling combination included in the fourth carpooling combination, and the sixth carpooling combination represents a carpooling combination associated with the fifth carpooling combination. Based on the score of the fifth carpooling combination and the score of each sixth carpooling combination, the seventh carpooling combination is determined. The seventh carpooling combination represents either the sixth or fifth carpooling combination whose score satisfies the fourth condition. From the fourth carpooling combination, delete the carpooling combination that intersects with the seventh carpooling combination to obtain the updated fourth carpooling combination; If there is no overlap among the carpooling combinations included in the updated fourth carpooling combination, the union of all seventh carpooling combinations and the updated fourth carpooling combination is determined as the first carpooling combination.

7. The method according to claim 6, characterized in that, The method further includes: Based on the first, second, third, and fourth values ​​of each carpooling combination in the fourth carpooling combination, a score is determined for each carpooling combination in the fourth carpooling combination; wherein, The first value indicates the vehicle space utilization rate of the carpooling combination; the second value indicates the proportion of the total number of second requests of the carpooling combination; the third value indicates the proportion of the number of carpooling combinations associated with the carpooling combination; and the fourth value indicates the occupancy rate of the first vehicle type of the carpooling combination in the third time period. The third time period is determined based on the second time period carried by the second request of the carpooling combination.

8. The method according to claim 2, characterized in that, Based on the first constraint, all second requests are combined to obtain third information, including: In the event of a second ride-sharing request that fails and / or a second request that does not meet the first constraint, the priority of the second vehicle type is determined based on the fifth and sixth values ​​of the second vehicle type; the fifth value indicates the vehicle space utilization rate of the second vehicle type, and the sixth value indicates the occupancy rate of the second vehicle type. The third information is determined based on the priority of each second vehicle type.

9. The method according to claim 1, characterized in that, The first request specifies the loading and unloading times for goods carrying the barge transport task; based on the first condition and the scheduling type indicated by each of the multiple first requests, vehicle allocation is performed on the barge transport tasks indicated by the multiple first requests to obtain first information, including: All third requests are determined from the plurality of first requests, wherein the scheduling type indicated by the third request is a hanging bucket; Based on the first condition and the fourth time period corresponding to each third request, vehicles are allocated to all third requests to obtain the first information; the fourth time period is determined based on the start time of the loading time of the items carried by the corresponding third request and the end time of the unloading time of the items.

10. The method according to claim 1, characterized in that, The first information includes fourth information, which indicates the barge vehicle performing the barge task instructed by the fourth request, the first time period, and the first route. The fourth request represents the first request that satisfies the fifth condition; The fifth condition includes that the dispatch type is trailer and / or full vehicle, and that the barge transport task supports multiple transports per vehicle; The method further includes: Based on the remaining available barge vehicles, at least part of the fourth information is updated.

11. An electronic device, characterized in that, This includes a processor and memory for storing computer programs that can run on the processor. When the processor is used to run the computer program, it performs the steps of the method according to any one of claims 1 to 10.

12. A storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 10.

13. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 10.

Images