Vehicle scheduling method and device, server and storage medium

By dividing the demand sub-region and supply sub-region on the vehicle platform, and scheduling the vehicle according to the preset scheduling scheme and weights, the problem of inefficiency in the order distribution caused by uneven demand and supply in the vehicle platform is solved, and more efficient Vehicle resource allocation.

CN119007425APending Publication Date: 2024-11-22NANJING LINGXING TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202310577536.9
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2023-05-22
Publication Date
2024-11-22

AI Technical Summary

Technical Problem

In vehicle platforms, due to the uneven temporal and spatial distribution of demand and supply, the vehicle order distribution efficiency is low, supply in short supply or supply overflow.

Method used

By dividing the target area into the demand sub-region and the supply sub-region, and scheduling idle vehicles to the demand area according to the preset scheduling scheme and scheduling weights, the vehicle scheduling scheme is optimized to improve order allocation efficiency.

Benefits of technology

It alleviates the unevenness of temporal and spatial distribution of demand and supply, improves the order allocation efficiency of vehicle platforms, and ensures the rational allocation and use of vehicle resources.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119007425A_ABST
    Figure CN119007425A_ABST
Patent Text Reader

Abstract

The invention provides a vehicle scheduling method and device, a server and a storage medium, and relates to the technical field of online car-hailing scheduling, and the method comprises the steps: dividing a plurality of sub-regions in a target region into demand sub-regions and supply sub-regions; determining at least one preset scheduling scheme and a plurality of scheduling weights; determining a use weight of each preset scheduling scheme according to at least one preset scheduling scheme and a scheduling weight corresponding to any idle vehicle in any supply sub-region to any demand sub-region; and determining a preset scheduling scheme meeting a use weight of a preset requirement from the at least one preset scheduling scheme, and scheduling the idle vehicles in the plurality of supply sub-regions according to the determined preset scheduling scheme. According to the embodiment of the invention, one scheduling scheme can be determined according to the preset scheduling scheme and the weight, so that the vehicles are scheduled from the supply sub-region to the demand sub-region, and the non-uniformity of space-time distribution of demand and supply is relieved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of online car-hailing dispatching, and in particular to a vehicle dispatching method, device, server and storage medium. Background Art

[0002] In the vehicle scenario, the vehicle platform needs to uniformly dispatch orders to vehicles. Generally speaking, the vehicle platform divides the area into multiple sub-areas. When dispatching orders, orders initiated by passengers in a sub-area are often dispatched to vehicles in the sub-area. However, in some sub-areas, the number of orders initiated by passengers is relatively large, and there are relatively few idle vehicles in the sub-areas, resulting in supply exceeding demand. In some sub-areas, the number of orders initiated by passengers is relatively small, and there are relatively many idle vehicles in the sub-areas, resulting in supply overflow. In this way, demand and supply often have uneven temporal and spatial distribution, which reduces the order dispatching efficiency of the vehicle platform. Summary of the invention

[0003] The present invention provides a vehicle dispatching method, device, server and storage medium, which can determine a dispatching plan through preset dispatching plans and weights, thereby dispatching vehicles from a supply sub-area to a demand sub-area, alleviating the unevenness of the temporal and spatial distribution of demand and supply, and improving the order distribution efficiency.

[0004] In a first aspect, an embodiment of the present invention provides a vehicle dispatching method, comprising:

[0005] Divide multiple sub-areas in the target area into demand sub-areas and supply sub-areas; wherein the demand sub-area is a sub-area where the number of idle vehicles in a preset time period is less than the number of unassigned vehicle orders; and the supply sub-area is a sub-area where the number of idle vehicles in the preset time period exceeds the number of unassigned vehicle orders;

[0006] Determine at least one preset dispatching scheme for at least one dispatchable vehicle in at least one supply sub-area to go to at least one demand sub-area, and a dispatching weight corresponding to a dispatchable vehicle in any supply sub-area going to any demand sub-area; wherein the dispatchable vehicle is an idle vehicle dispatched to a demand sub-area;

[0007] Determine a usage weight of each preset scheduling scheme according to at least one preset scheduling scheme and a scheduling weight corresponding to any idle vehicle in any supply sub-area going to any demand sub-area;

[0008] A preset scheduling scheme with a usage weight that meets preset requirements is determined from at least one of the preset scheduling schemes, and idle vehicles for multiple supply sub-areas are scheduled according to the determined preset scheduling scheme.

[0009] The above method divides the target area into multiple sub-areas, into supply sub-areas and demand sub-areas, and determines multiple preset scheduling schemes and scheduling weights for scheduling the supply sub-areas to the demand sub-areas. Based on the multiple preset scheduling schemes and scheduling weights, a usable preset scheduling scheme is determined, and scheduling is performed according to the usable preset scheduling scheme, thereby alleviating the unevenness of the temporal and spatial distribution of demand and supply and improving the order matching efficiency.

[0010] In one possible implementation, determining at least one preset dispatching scheme for at least one dispatchable vehicle in at least one supply sub-area to at least one demand sub-area includes:

[0011] Based on the number of dispatchable vehicles in at least one supply sub-area and the target order type and the number of each target order type in at least one demand sub-area, at least one preset dispatching scheme is determined for at least one dispatchable vehicle in at least one supply sub-area to go to at least one demand sub-area.

[0012] The above method can determine the preset scheduling plan according to the number of dispatchable vehicles and the order type of the service demand sub-area. In this way, setting the scheduling plan by considering the order type of the dispatchable vehicle service can improve the scheduling efficiency.

[0013] In one possible implementation, determining the dispatch weight corresponding to a dispatchable vehicle in any supply sub-area going to any demand sub-area includes:

[0014] For each dispatchable vehicle in each supply sub-area going to each demand sub-area, according to the characteristic information of the dispatchable vehicle in the supply sub-area going to the demand sub-area, determine the initial dispatch weight corresponding to the dispatchable vehicle in the supply sub-area going to the demand sub-area;

[0015] According to the target order type that the dispatchable vehicles in the supply sub-area serve in the demand sub-area, the initial dispatch weight corresponding to the dispatchable vehicles in the supply sub-area going to the demand sub-area is optimized, and the dispatch weight corresponding to the dispatchable vehicles in the supply sub-area going to the demand sub-area is determined.

[0016] The above method can determine the dispatch weight through the characteristic information of the dispatch and the order type of the dispatchable vehicle service. In this way, the dispatch weight can be determined by considering the order type, thereby improving the dispatch efficiency.

[0017] In a possible implementation, for each dispatchable vehicle in each supply sub-area going to each demand sub-area, determining an initial dispatch weight corresponding to the dispatchable vehicle in the supply sub-area going to the demand sub-area according to feature information of the dispatchable vehicle in the supply sub-area going to the demand sub-area includes:

[0018] For each dispatchable vehicle in each supply sub-area going to each demand sub-area, a first weight is determined according to the time it takes for the dispatchable vehicle in the supply sub-area to go to the demand sub-area;

[0019] Determining a second weight according to the number of target orders in the demand sub-area;

[0020] Determining a third weight according to the number of dispatchable vehicles supplying the sub-area;

[0021] An initial dispatch weight corresponding to the idle vehicle in the sub-area going to the demand sub-area is determined according to part or all of the first weight, the second weight, and the third weight.

[0022] The above method can determine the initial scheduling weight based on some or all of the factors such as the time it takes for the dispatchable vehicles in the supply sub-area to go to the demand sub-area, the number of target orders in the demand sub-area, and the number of dispatchable vehicles in the supply sub-area, so as to better distinguish different scheduling schemes.

[0023] In a possible implementation, according to the target order type served by the dispatchable vehicle in the supply sub-area to the demand sub-area, the initial dispatch weight corresponding to the dispatchable vehicle in the supply sub-area to the demand sub-area is optimized, and the dispatch weight corresponding to the dispatchable vehicle in the supply sub-area to the demand sub-area is determined, including:

[0024] If the target order type served by the dispatchable vehicle in the supply sub-area to the demand sub-area is the first order type, the sum of the initial dispatch weight corresponding to the dispatchable vehicle in the supply sub-area to the demand sub-area and the first preset value is used as the dispatch weight corresponding to the dispatchable vehicle in the supply sub-area to the demand sub-area;

[0025] If the target order type served by the dispatchable vehicle in the supply sub-area to serve the demand sub-area is the second order type, the sum of the initial dispatching weight corresponding to the dispatchable vehicle in the supply sub-area serving the demand sub-area and the second preset value shall be used as the dispatching weight corresponding to the dispatchable vehicle in the supply sub-area serving the demand sub-area; wherein the first preset value is greater than the second preset value.

[0026] The above method can add different preset values ​​to the initial dispatch weights according to different order types, thereby realizing vehicle dispatch considering different order types.

[0027] In a possible implementation, the following conditions are met for each preset scheduling scheme:

[0028] Condition 1: The number of orders served by any dispatchable vehicle in any supply sub-area to any demand sub-area is one; and / or

[0029] Condition 2: For each demand sub-area, the sum of the dispatch willingness of all dispatchable vehicles going to the demand sub-area does not exceed the number of vehicles required by the demand sub-area.

[0030] The above method can determine that each dispatchable vehicle in the preset dispatching scheme can only serve one order. At the same time, the preset dispatching scheme is set considering the dispatchable vehicle's willingness to accept dispatch, thereby improving the success rate of matching.

[0031] In a possible implementation, the preset requirements are part or all of the following:

[0032] the maximum usage weight among the usage weights of at least one of the preset scheduling schemes;

[0033] A usage weight of at least one of the preset scheduling schemes is greater than a third preset value.

[0034] The above method uses the maximum usage weight, that is, taking the weight into consideration, the best preset scheduling plan as the scheduling plan actually used, or only needs to be a preset scheduling plan with a usage weight greater than a preset value, that is, taking the weight into consideration, it only needs to be greater than the preset value to be the scheduling plan actually used, which can improve the success rate of scheduling.

[0035] In a second aspect, an embodiment of the present invention provides a vehicle dispatching device, comprising:

[0036] A division module is used to divide multiple sub-areas in the target area into demand sub-areas and supply sub-areas; wherein the demand sub-area is a sub-area in which the number of idle vehicles in a preset time period is less than the number of unassigned vehicle orders; and the supply sub-area is a sub-area in which the number of idle vehicles in the preset time period exceeds the number of unassigned vehicle orders;

[0037] A determination module is used to determine at least one preset dispatching scheme for at least one dispatchable vehicle in at least one supply sub-area to go to at least one demand sub-area, and a dispatching weight corresponding to a dispatchable vehicle in any supply sub-area going to any demand sub-area; wherein the dispatchable vehicle is an idle vehicle dispatched to the demand sub-area; according to at least one preset dispatching scheme and the dispatching weight corresponding to any idle vehicle in any supply sub-area going to any demand sub-area, a use weight of each preset dispatching scheme is determined;

[0038] The scheduling module is used to determine a preset scheduling scheme with a usage weight that meets preset requirements from at least one of the preset scheduling schemes, and schedule idle vehicles in multiple supply sub-areas according to the determined preset scheduling scheme.

[0039] In a third aspect, an embodiment of the present invention provides a server, including:

[0040] processor;

[0041] A processor is used to execute the computer program or instructions in the memory so that any method described in the first aspect is executed.

[0042] In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium. When instructions in the storage medium are executed by a processor, the processor is enabled to execute any method described in the first aspect.

[0043] In a fifth aspect, an embodiment of the present invention provides a computer program product, comprising: a computer program code, when the computer program code is run on a computer, the computer executes any of the methods described in the first aspect.

[0044] In addition, the technical effects brought about by any implementation method in the second to fifth aspects can refer to the technical effects brought about by different implementation methods in the first aspect, and will not be repeated here.

[0045] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0046] Figure 1 A flow chart of a vehicle dispatching method provided by an embodiment of the present invention;

[0047] Figure 2 A schematic diagram of sub-regions of a target region divided according to an embodiment of the present invention;

[0048] Figure 3 A schematic diagram of vehicle dispatching provided by an embodiment of the present invention;

[0049] Figure 4 A flow chart of another vehicle dispatching method provided by an embodiment of the present invention;

[0050] Figure 5 A flowchart of a method for determining a scheduling weight provided by an embodiment of the present invention;

[0051] Figure 6 A schematic diagram of scheduling based on willingness to accept scheduling provided by an embodiment of the present invention;

[0052] Figure 7 A schematic diagram of the structure of a vehicle dispatching device provided by an embodiment of the present invention;

[0053] Figure 8A schematic diagram of the structure of a server provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0054] In order to make the purpose, technical scheme and advantages of the present invention clearer, the present invention will be further described in detail below with reference to the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0055] The present invention is described in detail below with reference to the accompanying drawings:

[0056] Combination Figure 1 As shown, an embodiment of the present invention provides a vehicle scheduling method, including:

[0057] S100: Divide multiple sub-areas in the target area into demand sub-areas and supply sub-areas;

[0058] The sub-regions can be hexagonal grids, and the sub-regions in the target region are connected but not overlapped. Taking the target region divided into 7 sub-regions as an example, combined with Figure 2 As shown, sub-region 1, sub-region 2, sub-region 3, sub-region 4, sub-region 5, sub-region 6, and sub-region 7, these 7 sub-regions are connected but do not overlap.

[0059] The demand sub-area is a sub-area where the number of idle vehicles in a preset time period is less than the number of unassigned vehicle orders; the supply sub-area is a sub-area where the number of idle vehicles in a preset time period exceeds the number of unassigned vehicle orders;

[0060] The preset time period may be a time period after the current time, for example, if the current time is 10 am, the preset time period may be from 10 am to 10:15 am.

[0061] Idle vehicles include vehicles that have not processed orders at the current time, and idle vehicles may also include vehicles that have not processed orders within a preset time period. Vehicles that have not processed orders are vehicles that are not picking up or dropping off passengers, that is, empty vehicles. Vehicles that have not processed orders within a preset time period are vehicles that have processed orders during the current time period, but have not processed orders since then. For example, at 10 a.m., vehicle A is in the passenger drop-off stage, and at 10:10 a.m., vehicle A ends the order, that is, the passenger of the order has arrived at the destination, then vehicle A is an idle vehicle.

[0062] When obtaining idle vehicles in a demand sub-area, vehicles that are in the demand sub-area and have not processed orders at the current time point are obtained from the vehicle platform, as well as vehicles whose destination is the demand sub-area and whose arrival time is within a preset time period.

[0063] Unassigned car orders include orders that passengers have placed but the vehicle platform has not assigned a car to the passenger. They can also include orders that may appear within a preset time period, where the orders that may appear within the preset time period can be predicted based on historical data, for example, the number of orders that appeared in the same time period a few days ago, and the number of historical orders can be used to predict the orders that may appear within the preset time period. The order types that may appear within the preset time period can also be predicted based on historical data.

[0064] S101: Determine at least one preset dispatching scheme for at least one dispatchable vehicle in at least one supply sub-area to go to at least one demand sub-area, and a dispatching weight corresponding to the dispatchable vehicle in any supply sub-area going to any demand sub-area;

[0065] The dispatchable vehicles in a supply sub-area are idle vehicles in the supply sub-area that are dispatched to the demand sub-area;

[0066] For example, when the target area is divided into 4 sub-areas, 2 demand sub-areas and 2 supply sub-areas, the first demand sub-area lacks 3 vehicles, the second demand sub-area lacks 2 vehicles, the first supply sub-area has 2 dispatchable vehicles, and the second supply sub-area has 1 dispatchable vehicle.

[0067] The specific preset scheduling scheme can be shown in Table 1 below:

[0068] Table 1

[0069]

[0070]

[0071] As shown in Table 1, the preset scheduling scheme 1 is that 2 dispatchable vehicles in the first supply sub-area go to the first demand sub-area, and 1 dispatchable vehicle in the second supply sub-area goes to the second demand sub-area. The preset scheduling schemes 2 to 4 are all understood as above.

[0072] The dispatch weight corresponding to the dispatchable vehicle in any supply sub-area going to any demand sub-area is, taking the above as an example, determine the dispatch weight corresponding to the dispatchable vehicle in the first supply sub-area going to the first demand sub-area, the dispatch weight corresponding to the dispatchable vehicle in the second supply sub-area going to the first demand sub-area, the dispatch weight corresponding to the dispatchable vehicle in the first supply sub-area going to the second demand sub-area, and the dispatch weight corresponding to the dispatchable vehicle in the second supply sub-area going to the second demand sub-area.

[0073] S102: Determine a usage weight of each preset scheduling scheme according to at least one preset scheduling scheme and a scheduling weight corresponding to a dispatchable vehicle in any supply sub-area going to any demand sub-area;

[0074] In the preset scheduling scheme, when a dispatchable vehicle is set to go to the demand sub-area, it is set to 1, otherwise it is set to 0. The usage weight of the preset scheduling scheme is determined in the following way: the value corresponding to whether multiple vehicles in the preset scheduling scheme go to the demand sub-area is multiplied by the sum of the scheduling weights corresponding to the vehicles going to the demand sub-area, which is used as the usage weight of this preset scheduling scheme.

[0075] Taking Table 1 as an example, the usage weight of the preset scheduling scheme 1 is calculated as follows: 1*the scheduling weight corresponding to the dispatchable vehicle in the first supply sub-area going to the first demand sub-area+1*the scheduling weight corresponding to the dispatchable vehicle in the first supply sub-area going to the first demand sub-area+1*the scheduling weight corresponding to the dispatchable vehicle in the second supply sub-area going to the second demand sub-area;

[0076] By analogy, the usage weights of preset scheduling schemes 2 to 4 are calculated respectively.

[0077] S103: Determine a preset scheduling scheme with a usage weight that meets preset requirements from at least one preset scheduling scheme, and schedule multiple dispatchable vehicles supplying the sub-areas according to the determined preset scheduling scheme.

[0078] Among them, the preset requirements are some or all of the following:

[0079] a maximum usage weight among usage weights of at least one preset scheduling scheme;

[0080] A usage weight of at least one preset scheduling scheme is greater than a third preset value.

[0081] For the above preset requirements, an embodiment of the present invention provides a possible solution. If there is only one maximum usage weight among the usage weights of at least one preset scheduling scheme, then the dispatchable vehicles supplying multiple sub-areas can be directly scheduled according to the preset scheduling scheme with the maximum usage weight.

[0082] If there are multiple maximum usage weights in the usage weights of at least one preset scheduling scheme, a preset scheduling scheme may be selected from the preset scheduling schemes with the multiple maximum usage weights, and scheduling may be performed according to the preset scheduling scheme.

[0083] Similarly, if there is one usage weight greater than the third preset value, the multiple dispatchable vehicles supplying the sub-areas are dispatched directly according to the preset dispatching scheme with the usage weight greater than the third preset value. If there are multiple usage weights greater than the third preset value, a preset dispatching scheme is selected from the multiple preset dispatching schemes with the usage weights greater than the third preset value, and the dispatching is performed according to the preset dispatching scheme.

[0084] It should be noted that, since it is acceptable for supply and demand balance when the usage weight of the preset scheduling scheme exceeds a certain value, this value is also the third preset value, and the third preset value is set by the user according to his own experience.

[0085] Exemplary, combined Figure 3 As shown, there are 8 idle vehicles in the first supply sub-area C1, and 4 idle vehicles in the second supply sub-area C2. If the preset scheduling scheme is determined as shown in Table 1, and the preset scheduling scheme that meets the preset conditions among the 4 preset scheduling schemes in Table 1 is determined to be preset scheduling scheme 1, then the 2 dispatchable vehicles in the first supply sub-area C1 are dispatched to the first demand sub-area C3, and the 1 dispatchable vehicle in the second supply sub-area C2 is dispatched to the second demand sub-area C4.

[0086] Exemplarily, when scheduling is performed according to a predetermined preset scheduling scheme, specific dispatchable vehicles can be determined. Dispatched vehicles can be idle vehicles remaining after idle vehicles are planned to be configured for unconfigured orders; for example, idle vehicles in a supply sub-area include vehicles aa, vehicles ab, vehicles ac, and vehicles ad, and the unconfigured orders in the supply sub-area include order 1 and order 2. The distances between the starting point position in order 1 and the current positions of vehicles aa, vehicles ab, vehicles ac, and vehicles ad are calculated respectively, and the vehicle with the smallest distance is the idle vehicle planned to be configured for order 1, for example, the vehicle is vehicle aa; similarly, the idle vehicle planned to be configured for order 2, for example, the vehicle is vehicle ad, then the dispatchable vehicles are vehicles ab and vehicle ac. That is, the dispatchable vehicle can be directly dispatched according to the preset scheduling scheme.

[0087] The implementation method of determining at least one preset scheduling scheme for at least one dispatchable vehicle in at least one supply sub-area to go to at least one demand sub-area is as follows: based on the number of dispatchable vehicles in at least one supply sub-area and the target order type and the number of each target order type in at least one demand sub-area, at least one preset scheduling scheme for at least one dispatchable vehicle in at least one supply sub-area to go to at least one demand sub-area is determined.

[0088] Based on the above scheme, combined with Figure 4 As shown, an embodiment of the present invention provides another vehicle scheduling method, including:

[0089] S400: Divide multiple sub-areas in the target area into demand sub-areas and supply sub-areas;

[0090] S401: Determine a plurality of dispatch weights, and determine at least one preset dispatching scheme for at least one dispatchable vehicle in at least one supply sub-area to go to at least one demand sub-area based on the number of dispatchable vehicles in at least one supply sub-area and the target order type and the number of each target order type in at least one demand sub-area;

[0091] S402: Determine a usage weight of each preset scheduling scheme according to at least one preset scheduling scheme and a scheduling weight corresponding to a dispatchable vehicle in any supply sub-area going to any demand sub-area;

[0092] S403: Determine a preset scheduling scheme with a usage weight that meets preset requirements from at least one preset scheduling scheme, and schedule multiple dispatchable vehicles supplying the sub-areas according to the determined preset scheduling scheme.

[0093] Specifically, step 400 and Figure 1 The same as step 100, refer to step 100.

[0094] In step 401, the number of dispatchable vehicles in a supply sub-area is the number of idle vehicles in the supply sub-area minus the number of unconfigured orders in the supply sub-area;

[0095] The target order type in a demand sub-region is an order type in the order types of unconfigured orders in the demand sub-region that meet preset conditions.

[0096] The preset conditions are: if the order types of unconfigured orders in a demand sub-area only include reservation orders, then the target order type is reservation orders; if the order types of unconfigured orders in a demand sub-area only include real-time orders, then the target order type is real-time orders; if the order types of unconfigured orders in a demand sub-area include reservation orders and real-time orders, and the difference between the number of unconfigured orders and the number of idle vehicles is less than or equal to reservation orders, then the target order type is reservation orders; if the difference between the number of unconfigured orders and the number of idle vehicles is greater than reservation orders, then the target order types are reservation orders and real-time orders.

[0097] Determine the target order type and the number of each target order type in a demand sub-area. For example, the order types and number of unconfigured orders in a demand sub-area are: 3 scheduled orders and 4 real-time orders. The number of idle vehicles in the demand sub-area is 2. Then the number of target orders in the demand sub-area is 7 minus 2, that is, 5. This situation meets the order types of unconfigured orders in a demand sub-area, including scheduled orders and real-time orders, and the difference between the number of unconfigured orders and the number of idle vehicles is greater than the scheduled order. Then the target order types include scheduled orders and real-time orders, the number of scheduled orders is 3, and the number of real-time orders is 2.

[0098] If the number of idle vehicles in the demand sub-area is 4, then the number of target orders in the demand sub-area is 7 minus 4, that is, 3. This situation meets the order types of unconfigured orders in a demand sub-area, including reservation orders and real-time orders, and the difference between the number of unconfigured orders and the number of idle vehicles is less than or equal to reservation orders, then the target order type is reservation orders, and the number of reservation orders is 3.

[0099] Exemplarily, the preset scheduling scheme obtained is:

[0100] When the target area is divided into 4 sub-areas, 2 demand sub-areas, and 2 supply sub-areas, the target orders in the first demand sub-area have order types including reservation orders and real-time orders, with 2 reservation orders and 1 real-time order, and the target orders in the second demand sub-area have order types including real-time orders, with 2 real-time orders, and there are 2 dispatchable vehicles in the first supply sub-area and 1 dispatchable vehicle in the second supply sub-area.

[0101] The specific preset scheduling scheme can be shown in Table 2 below:

[0102] Table 2

[0103]

[0104]

[0105]

[0106] As shown in Table 2, the preset scheduling plan 1 is that 2 dispatchable vehicles in the first supply sub-area go to the first demand sub-area, and are specifically assigned 2 reservation orders to 2 dispatchable vehicles; the dispatchable vehicle in the second supply sub-area goes to the second demand sub-area, and is specifically assigned 1 dispatchable vehicle and 1 real-time order. The preset scheduling plans 2 to 8 are all understood as above.

[0107] Step 401, determine the implementation method of multiple scheduling weights, combined with Figure 5 As shown, including:

[0108] S500: for each dispatchable vehicle in each supply sub-area going to each demand sub-area, according to characteristic information of the dispatchable vehicle in the supply sub-area going to the demand sub-area, determining an initial dispatch weight corresponding to the dispatchable vehicle in the supply sub-area going to the demand sub-area;

[0109] S501: According to the target order type that the dispatchable vehicles in the supply sub-area serve in the demand sub-area, the initial dispatch weight corresponding to the dispatchable vehicles in the supply sub-area going to the demand sub-area is optimized to determine the dispatch weight corresponding to the dispatchable vehicles in the supply sub-area going to the demand sub-area.

[0110] The specific implementation of step 500 is as follows:

[0111] For each dispatchable vehicle in each supply sub-area going to each demand sub-area, a first weight is determined according to the time it takes for the dispatchable vehicle in the supply sub-area to go to the demand sub-area;

[0112] Determining a second weight according to the number of target orders in the demand sub-area;

[0113] Determining a third weight according to the number of dispatchable vehicles supplying the sub-area;

[0114] According to part or all of the first weight, the second weight, and the third weight, an initial dispatch weight corresponding to the dispatchable vehicles in the supply sub-area to the demand sub-area is determined.

[0115] The time taken by the dispatchable vehicle of the supply sub-area to go to the demand sub-area is the distance from the center point of the supply sub-area to the center point of the demand sub-area divided by the speed, which may be the driving speed, such as 45 km / h. Currently, the time taken by the dispatchable vehicle of the supply sub-area to go to the demand sub-area can be obtained based on the historical time, that is, the average time taken by the center point of the supply sub-area to go to the center point of the demand sub-area in the historical orders.

[0116] One way to determine the first weight is to determine the first weight based on the time it takes for the dispatchable vehicle in the supply sub-area to go to the demand sub-area as a fraction of the denominator, that is, the longer the time, the smaller the first weight, and the smaller the time, the larger the first weight. In this way, when dispatching, vehicles with relatively close dispatch times can be preferentially considered, so that the time it takes for the vehicle to pick up passengers after receiving an order is relatively short. Exemplarily, the time it takes for the dispatchable vehicle in the supply sub-area to go to the demand sub-area is the denominator, and 1 is the fraction composed of the numerator. All fractions are normalized to obtain the first weight of the dispatchable vehicle in each supply sub-area to go to each demand sub-area.

[0117] Another implementation method of determining the first weight is to determine the first weight by the corresponding relationship between the duration and the preset weight. As shown in Table 3:

[0118] Table 3

[0119] Duration Preset Weights More than 20 minutes 0.2 More than 10 minutes but not more than 20 minutes 0.3 No more than 10 minutes 0.5

[0120] When it is determined that the time it takes for the dispatchable vehicles in the supply sub-area to go to the demand sub-area is 15 minutes, that is, more than 10 minutes and no more than 20 minutes, the corresponding preset weight 0.3 is used as the first weight.

[0121] One implementation method for determining the second weight is: calculating the ratio between the number of target orders in the demand sub-area and the number of target orders in all demand sub-areas, and then normalizing the ratios of all demand sub-areas to determine the second weight, that is, the larger the number of target orders, the larger the second weight, and the smaller the number of target orders, the smaller the second weight. The number of target orders in a demand sub-area is equal to the number of unconfigured orders in the demand sub-area minus the number of idle vehicles in the demand sub-area; the target order in a demand sub-area is an order corresponding to a target order type in a demand sub-area.

[0122] Another implementation method of determining the second weight is to determine the second weight by the corresponding relationship between the number of target orders in the demand sub-area and the preset weight. As shown in Table 4:

[0123] Table 4

[0124] The number of target orders in this demand sub-area Preset Weights More than 5 0.6 More than 2 but not more than 5 0.25 No more than 2 0.15

[0125] When it is determined that the number of target orders in the demand sub-area is 3, that is, more than 2 and not more than 5, the corresponding preset weight of 0.25 is used as the second weight.

[0126] One way to determine the third weight is to calculate the ratio between the number of dispatchable vehicles in the supply sub-area and the number of dispatchable vehicles in all supply sub-areas, and then normalize the ratios of all supply sub-areas to determine the third weight, that is, the larger the number of dispatchable vehicles, the larger the third weight, and the smaller the number of dispatchable vehicles, the smaller the third weight.

[0127] Another implementation method of determining the third weight is to determine the third weight by the corresponding relationship between the number of dispatchable vehicles supplying the sub-area and the preset weight. As shown in Table 5:

[0128] Table 5

[0129] The number of dispatchable vehicles in this demand sub-area Preset Weights More than 10 0.4 More than 5 but not more than 10 0.35 No more than 5 0.25

[0130] When it is determined that the number of dispatchable vehicles supplying the sub-area is 3, that is, it meets the requirement of not more than 5, the corresponding preset weight of 0.25 is used as the third weight.

[0131] Among them, the first weight can be used as the initial dispatching weight corresponding to the dispatchable vehicles in the supply sub-area to the demand sub-area; the second weight can be used as the initial dispatching weight corresponding to the dispatchable vehicles in the supply sub-area to the demand sub-area; the third weight can be used as the initial dispatching weight corresponding to the dispatchable vehicles in the supply sub-area to the demand sub-area; the sum of the first weight and the second weight can be used as the initial dispatching weight corresponding to the dispatchable vehicles in the supply sub-area to the demand sub-area; the sum of the second weight and the third weight can be used as the initial dispatching weight corresponding to the dispatchable vehicles in the supply sub-area to the demand sub-area; the sum of the first weight, the second weight and the third weight can be used as the initial dispatching weight corresponding to the dispatchable vehicles in the supply sub-area to the demand sub-area; of course, when two weights or three weights determine the initial dispatching weight corresponding to the dispatchable vehicles in the supply sub-area to the demand sub-area, in addition to the sum between them, the product between them can also be used.

[0132] Regarding order types, the present invention proposes to classify order types according to the value of the orders. For example, when classifying, the order types can be divided into scheduled orders with high order value and real-time orders with low order value. Of course, different levels can also be divided according to the value of the orders to determine different order types. For example, when the value of the order does not exceed the first threshold, it is the first level, and the order type is the first level type; when the value of the order does not exceed the second threshold but exceeds the first threshold, it is the second level, and the order type is the second level type; when the value of the order exceeds the second threshold, it is the third level, and the order type is the third level type.

[0133] Exemplarily, the specific implementation of step 501 is as follows:

[0134] If the target order type served by the dispatchable vehicle in the supply sub-area to the demand sub-area is the first order type, the sum of the initial dispatch weight corresponding to the dispatchable vehicle in the supply sub-area to the demand sub-area and the first preset value is used as the dispatch weight corresponding to the dispatchable vehicle in the supply sub-area to the demand sub-area;

[0135] If the target order type served by the dispatchable vehicle in the supply sub-area to serve the demand sub-area is the second order type, the sum of the initial dispatching weight corresponding to the dispatchable vehicle in the supply sub-area serving the demand sub-area and the second preset value shall be used as the dispatching weight corresponding to the dispatchable vehicle in the supply sub-area serving the demand sub-area; wherein the first preset value is greater than the second preset value.

[0136] Among them, the target order type that the dispatchable vehicles in the supply sub-area serve in the demand sub-area is the order type of the dispatchable vehicles in the supply sub-area to be dispatched to the demand sub-area to provide the configured orders.

[0137] The first order type is a scheduled order, and the second order type is a real-time order; the first preset value is 1, and the second preset value is 0, that is, the scheduled order adds 1 to the initial scheduling weight, and the real-time order does not change on the basis of the initial scheduling weight.

[0138] Based on the above weights, the usage weight of the preset scheduling scheme is obtained as follows:

[0139] Take the preset scheduling plan 1 as an example: 2 dispatchable vehicles in the first supply sub-area go to the first demand sub-area, and are specifically assigned 2 reservation orders to the 2 dispatchable vehicles; the dispatchable vehicles in the second supply sub-area go to the second demand sub-area, and are specifically assigned 1 dispatchable vehicle with 1 real-time order.

[0140] Determine the initial dispatch weights corresponding to the two dispatchable vehicles in the first supply sub-area going to the first demand sub-area; since the two dispatchable vehicles are both assigned to two reservation orders, add the initial dispatch weight and 1 to obtain the dispatch weight;

[0141] Determine the initial dispatch weight corresponding to the dispatchable vehicle in the second supply sub-area going to the second demand sub-area; since one dispatchable vehicle is assigned to one real-time order, add the initial dispatch weight and 0 to obtain the dispatch weight;

[0142] The usage weight of the preset scheduling scheme 1 is obtained as follows: 1*the scheduling weight corresponding to the dispatchable vehicles in the first supply sub-area going to the first demand sub-area + 1*the scheduling weight corresponding to the dispatchable vehicles in the first supply sub-area going to the first demand sub-area + 1*the scheduling weight corresponding to the dispatchable vehicles in the second supply sub-area going to the second demand sub-area.

[0143] Among them, the following conditions are met for each preset scheduling scheme:

[0144] Condition 1: The number of orders served by any dispatchable vehicle in any supply sub-area to any demand sub-area is one; and / or

[0145] Condition 2: For each demand sub-area, the sum of the dispatch willingness of all dispatchable vehicles going to the demand sub-area does not exceed the number of vehicles required by the demand sub-area.

[0146] The requirement of condition one can be understood as that in a preset scheduling plan, a dispatchable vehicle in a supply sub-area can only go to one demand sub-area to serve one order.

[0147] Condition 2: Figure 6 For example: demand sub-area 1 lacks a vehicle, but there are 3 dispatchable vehicles to demand sub-area 1 in a preset scheduling plan. The willingness of the 3 dispatchable vehicles to accept scheduling is determined to be 0.4, 0.3, and 0.2. Then their sum (0.4+0.3+0.2=0.9), 0.9 does not exceed 1, so the preset scheduling plan meets condition 2.

[0148] Based on the above embodiments, the present invention provides a scheduling model:

[0149]

[0150]

[0151] Wherein, y is the usage weight of a preset scheduling scheme. represents the weight of a dispatchable vehicle i from a supply sub-area to a demand sub-area j to serve the first order type and the weight of the second order type, x ij =1 means that a dispatchable vehicle i in the supply sub-area is dispatched to the demand sub-area j according to the order type to be dispatched to the demand sub-area, x ij Can be divided into and It indicates whether a dispatchable vehicle i in the supply sub-area goes to the demand sub-area j to serve the first order type or the second order type. In addition, the driver of the dispatchable vehicle has a willingness to accept each dispatch task, denoted as p ij (0≤pij ≤1), that is, when the platform pushes a dispatch task to the driver, the driver has a certain probability of choosing to accept or reject the dispatch task. The dispatch task is for the platform to assign an order in a demand sub-area to a dispatchable vehicle in a supply sub-area. Constraint formula (1) indicates that each dispatchable vehicle can only go to one demand sub-area to serve one order at most, that is, a dispatchable vehicle can only be assigned one order in one demand sub-area. Constraint formula (2) indicates that the sum of the willingness to accept dispatch of all dispatchable vehicles in each demand sub-area cannot exceed the number of vehicles required in the demand sub-area. Constraint formula (3) is that the dispatchable vehicle either goes to the demand sub-area to serve orders of the first order type, or goes to the demand sub-area to serve orders of the first order type. Constraint formula (4) is and The value range constraints of Either 1 or 0.

[0152] The dispatchable vehicle's willingness to accept dispatch can be determined based on the basic information of the dispatchable vehicle's driver, the length of idle time, and other factors. The basic information of the driver includes the driver's age, gender, working hours, and length of service; the length of idle time refers to the length of time that the driver has not accepted any orders.

[0153] The willingness to accept dispatch can be determined based on a neural network. The neural network is trained through the historical drivers' order acceptance situation, and after the training is completed, the willingness of the dispatchable vehicles to accept dispatch is determined.

[0154] Algorithmic solution for the objective function y:

[0155] In view of the above problems, a genetic algorithm is designed to solve them. Genetic algorithm is an optimization algorithm that simulates the evolutionary laws of the biological world, such as survival of the fittest and survival of the fittest. Through parent crossover, offspring mutation, natural selection and other methods, the quality of the population is continuously improved, thereby obtaining a better solution or optimal solution to the problem. It mainly includes the following operations:

[0156] (1) Coding operation: integers are used to encode the grids for driver dispatch. The chromosome coding range is 1 to N, where N is the number of grids to which the capacity is transferred, and the gene length is the number of dispatchable drivers. For example, if there are 5 empty capacities and the number of grids to which the capacity is transferred is 3, the length of the code "11213" is 5, indicating that there are 5 empty capacities to be dispatched. The dispatch result is that capacities 1, 2, and 4 are dispatched to grid 1, capacity 3 is dispatched to grid 2, and capacity 5 is dispatched to grid 3.

[0157] (2) Population initialization: In order to ensure the diversity of the population and improve the efficiency of the algorithm, all the populations are initialized.

[0158] All chromatin bodies are initialized randomly.

[0159] (3) Crossover operation: In order to ensure the diversity of the offspring, the parent will perform single-point crossover or fragment crossover with a certain probability.

[0160] (4) Mutation operation: The mutated individuals in the population will add 1 or subtract 1 to a certain gene with a certain probability.

[0161] (5) Selection operation: After the individuals in the population undergo crossover, mutation, and natural selection operations, the quality of the population is continuously improved. After the individuals in the population undergo crossover and mutation operations, natural selection is used to determine whether the offspring will enter the next generation of the population, thereby allowing the population to continuously update and evolve. This chapter uses the roulette wheel method to perform selection operations on the population, while adopting an elite retention strategy.

[0162] (6) Termination conditions: There are generally two termination conditions for the algorithm. One is that if the optimal fitness value (objective function value) of all individuals in the population has not been further optimized and improved in multiple consecutive iterations, the other is that the total number of iterations of the algorithm reaches a predetermined value. In this case, the algorithm ends. The optimal solution of the algorithm includes the decision variables corresponding to the optimal individual after decoding and the optimal objective function value corresponding to the individual when the algorithm terminates.

[0163] In this way, the present invention considers the willingness of drivers of dispatchable vehicles to accept dispatch and determines multiple preset dispatch plans. At the same time, because drivers often want to receive orders of high or low value in the process of accepting orders, the present invention also considers the order types based on the value of the orders to determine the dispatch weights. While alleviating the problem of uneven distribution of supply and demand, it also improves the success rate of order matching.

[0164] like Figure 7 As shown, the present invention also provides a vehicle dispatching device, comprising:

[0165] The division module 700 is used to divide the multiple sub-areas in the target area into demand sub-areas and supply sub-areas; wherein the demand sub-area is a sub-area in which the number of idle vehicles in a preset time period is less than the number of unassigned vehicle orders; and the supply sub-area is a sub-area in which the number of idle vehicles in the preset time period exceeds the number of unassigned vehicle orders;

[0166] The determination module 701 is used to determine at least one preset dispatching scheme for at least one dispatchable vehicle in at least one supply sub-area to go to at least one demand sub-area, and the dispatching weight corresponding to the dispatchable vehicle in any supply sub-area going to any demand sub-area; wherein the dispatchable vehicle is an idle vehicle dispatched to the demand sub-area; according to at least one preset dispatching scheme and the dispatching weight corresponding to the dispatching of any idle vehicle in any supply sub-area to any demand sub-area, determine the use weight of each preset dispatching scheme;

[0167] The scheduling module 702 is used to determine a preset scheduling scheme with a usage weight that meets preset requirements from at least one of the preset scheduling schemes, and schedule idle vehicles in multiple supply sub-areas according to the determined preset scheduling scheme.

[0168] Optionally, the determination module 701 is specifically configured to:

[0169] Based on the number of dispatchable vehicles in at least one supply sub-area and the target order type and the number of each target order type in at least one demand sub-area, at least one preset dispatching scheme is determined for at least one dispatchable vehicle in at least one supply sub-area to go to at least one demand sub-area.

[0170] Optionally, the determination module 701 is specifically configured to:

[0171] For each dispatchable vehicle in each supply sub-area going to each demand sub-area, according to the characteristic information of the dispatchable vehicle in the supply sub-area going to the demand sub-area, determine the initial dispatch weight corresponding to the dispatchable vehicle in the supply sub-area going to the demand sub-area;

[0172] According to the target order type that the dispatchable vehicles in the supply sub-area serve in the demand sub-area, the initial dispatch weight corresponding to the dispatchable vehicles in the supply sub-area going to the demand sub-area is optimized, and the dispatch weight corresponding to the dispatchable vehicles in the supply sub-area going to the demand sub-area is determined.

[0173] Optionally, the determination module 701 is further configured to:

[0174] For each dispatchable vehicle in each supply sub-area going to each demand sub-area, a first weight is determined according to the time it takes for the dispatchable vehicle in the supply sub-area to go to the demand sub-area;

[0175] Determining a second weight according to the number of target orders in the demand sub-area;

[0176] Determining a third weight according to the number of dispatchable vehicles supplying the sub-area;

[0177] An initial dispatch weight corresponding to the idle vehicle in the sub-area going to the demand sub-area is determined according to part or all of the first weight, the second weight, and the third weight.

[0178] Optionally, the determination module 701 is further configured to:

[0179] If the target order type served by the dispatchable vehicle in the supply sub-area to the demand sub-area is the first order type, the sum of the initial dispatch weight corresponding to the dispatchable vehicle in the supply sub-area to the demand sub-area and the first preset value is used as the dispatch weight corresponding to the dispatchable vehicle in the supply sub-area to the demand sub-area;

[0180] If the target order type served by the dispatchable vehicle in the supply sub-area to serve the demand sub-area is the second order type, the sum of the initial dispatching weight corresponding to the dispatchable vehicle in the supply sub-area serving the demand sub-area and the second preset value shall be used as the dispatching weight corresponding to the dispatchable vehicle in the supply sub-area serving the demand sub-area; wherein the first preset value is greater than the second preset value.

[0181] Optionally, the following conditions are met for each preset scheduling scheme:

[0182] Condition 1: The number of orders served by any dispatchable vehicle in any supply sub-area to any demand sub-area is one; and / or

[0183] Condition 2: For each demand sub-area, the sum of the dispatch willingness of all dispatchable vehicles going to the demand sub-area does not exceed the number of vehicles required by the demand sub-area.

[0184] Optionally, the preset requirements are part or all of the following:

[0185] the maximum usage weight among the usage weights of at least one of the preset scheduling schemes;

[0186] A usage weight of at least one of the preset scheduling schemes is greater than a third preset value.

[0187] In addition, combined Figure 1-Figure 7 The vehicle dispatching method and device described in the embodiments of the present invention may be implemented by a server.

[0188] Server, including: processor;

[0189] a memory for storing instructions executable by the processor;

[0190] Wherein, the processor is configured to execute the instructions to implement the vehicle dispatching method as described in any one of the above introductions.

[0191] Based on the above introduction, an exemplary Figure 8 The server structure.

[0192] The server may include a processor 810 and a memory 820 storing computer program instructions.

[0193] Specifically, the processor 810 may include a central processing unit (CPU), or an application specific integrated circuit (ASIC), or may be configured to implement one or more integrated circuits of the embodiments of the present invention.

[0194] The memory 820 may include a large capacity memory for data or instructions. By way of example and not limitation, the memory 820 may include a hard disk drive (HDD), a floppy disk drive, a flash memory, an optical disk, a magneto-optical disk, a magnetic tape, or a universal serial bus (USB) drive or a combination of two or more of these. In appropriate cases, the memory 820 may include a removable or non-removable (or fixed) medium. In appropriate cases, the memory 820 may be inside or outside a data processing device. In a specific embodiment, the memory 820 is a non-volatile solid-state memory. In a specific embodiment, the memory 820 includes a read-only memory (ROM). In appropriate cases, the ROM may be a mask-programmed ROM, a programmable ROM (PROM), an erasable PROM (EPROM), an electrically erasable PROM (EEPROM), an electrically rewritable ROM (EAROM) or a flash memory or a combination of two or more of these.

[0195] The processor 810 implements any one of the methods for performing tasks in the above embodiments by reading and executing computer program instructions stored in the memory 820 .

[0196] In one example, the server may further include a communication interface 830 and a bus 840. Figure 8 As shown, the processor 810, the memory 820, and the communication interface 830 are connected via a bus 840 and communicate with each other.

[0197] The communication interface 830 is mainly used to implement communication between various modules, devices, units and / or equipment in the embodiment of the present invention.

[0198] Bus 840 includes hardware, software or both, and the components of the server are coupled to each other. For example, but not limitation, the bus may include accelerated graphics port (AGP) or other graphics bus, enhanced industrial standard architecture (EISA) bus, front-side bus (FSB), hypertransport (HT) interconnection, industrial standard architecture (ISA) bus, infinite bandwidth interconnection, low pin count (LPC) bus, memory bus, micro channel architecture (MCA) bus, peripheral component interconnect (PCI) bus, PCI-Express (PCI-X) bus, serial advanced technology attachment (SATA) bus, video electronics standard association local (VLB) bus or other suitable bus or two or more of these combinations. In appropriate cases, bus 840 may include one or more buses. Although the embodiment of the present invention describes and shows a specific bus, the present invention considers any suitable bus or interconnection.

[0199] The server can execute the vehicle dispatching method in the embodiment of the present invention based on the received task, thereby realizing the combination Figure 1-Figure 7 The vehicle dispatching method and device are described.

[0200] In addition, in combination with the server in the above embodiment, an embodiment of the present invention may provide a storage medium, when the instructions in the storage medium are executed by the processor of the server, the server can execute the vehicle scheduling method as described in any one of the above items.

[0201] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0202] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0203] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0204] Although the preferred embodiments of the present invention have been described, those skilled in the art may make other changes and modifications to these embodiments once they have learned the basic creative concept. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and all changes and modifications that fall within the scope of the present invention.

[0205] Obviously, those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if these modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include these modifications and variations.

Claims

1. A vehicle dispatching method, characterized in that: include: Divide multiple sub-areas in the target area into demand sub-areas and supply sub-areas; wherein the demand sub-area is a sub-area where the number of idle vehicles in a preset time period is less than the number of unassigned vehicle orders; and the supply sub-area is a sub-area where the number of idle vehicles in the preset time period exceeds the number of unassigned vehicle orders; Determine at least one preset dispatching scheme for at least one dispatchable vehicle in at least one supply sub-area to go to at least one demand sub-area, and a dispatching weight corresponding to a dispatchable vehicle in any supply sub-area going to any demand sub-area; wherein the dispatchable vehicle is an idle vehicle dispatched to a demand sub-area; Determine a usage weight of each preset scheduling scheme according to at least one preset scheduling scheme and a scheduling weight corresponding to any idle vehicle in any supply sub-area going to any demand sub-area; A preset scheduling scheme with a usage weight that meets preset requirements is determined from at least one of the preset scheduling schemes, and idle vehicles for multiple supply sub-areas are scheduled according to the determined preset scheduling scheme.

2. The vehicle dispatching method according to claim 1, characterized in that: Determining at least one preset dispatching scheme for at least one dispatchable vehicle in at least one supply sub-area to at least one demand sub-area includes: Based on the number of dispatchable vehicles in at least one supply sub-area and the target order type and the number of each target order type in at least one demand sub-area, at least one preset dispatching scheme is determined for at least one dispatchable vehicle in at least one supply sub-area to go to at least one demand sub-area.

3. The vehicle dispatching method according to claim 2, characterized in that: Determine the dispatch weight corresponding to the dispatchable vehicle in any supply sub-area to any demand sub-area, including: For each dispatchable vehicle in each supply sub-area going to each demand sub-area, according to the characteristic information of the dispatchable vehicle in the supply sub-area going to the demand sub-area, determine the initial dispatch weight corresponding to the dispatchable vehicle in the supply sub-area going to the demand sub-area; According to the target order type that the dispatchable vehicles in the supply sub-area serve in the demand sub-area, the initial dispatch weight corresponding to the dispatchable vehicles in the supply sub-area going to the demand sub-area is optimized, and the dispatch weight corresponding to the dispatchable vehicles in the supply sub-area going to the demand sub-area is determined.

4. The vehicle dispatching method according to claim 3, characterized in that: For each dispatchable vehicle in each supply sub-area going to each demand sub-area, according to the characteristic information of the dispatchable vehicle in the supply sub-area going to the demand sub-area, the initial dispatch weight corresponding to the dispatchable vehicle in the supply sub-area going to the demand sub-area is determined, including: For each dispatchable vehicle in each supply sub-area going to each demand sub-area, a first weight is determined according to the time it takes for the dispatchable vehicle in the supply sub-area to go to the demand sub-area; Determining a second weight according to the number of target orders in the demand sub-area; Determining a third weight according to the number of dispatchable vehicles supplying the sub-area; An initial dispatch weight corresponding to the idle vehicle in the sub-area going to the demand sub-area is determined according to part or all of the first weight, the second weight, and the third weight.

5. The vehicle dispatching method according to claim 3, characterized in that: According to the target order type that the dispatchable vehicles in the supply sub-area serve in the demand sub-area, the initial dispatch weight corresponding to the dispatchable vehicles in the supply sub-area going to the demand sub-area is optimized to determine the dispatch weight corresponding to the dispatchable vehicles in the supply sub-area going to the demand sub-area, including: If the target order type served by the dispatchable vehicle in the supply sub-area to the demand sub-area is the first order type, the sum of the initial dispatch weight corresponding to the dispatchable vehicle in the supply sub-area to the demand sub-area and the first preset value is used as the dispatch weight corresponding to the dispatchable vehicle in the supply sub-area to the demand sub-area; If the target order type served by the dispatchable vehicle in the supply sub-area to serve the demand sub-area is the second order type, the sum of the initial dispatching weight corresponding to the dispatchable vehicle in the supply sub-area serving the demand sub-area and the second preset value shall be used as the dispatching weight corresponding to the dispatchable vehicle in the supply sub-area serving the demand sub-area; wherein the first preset value is greater than the second preset value.

6. The vehicle dispatching method according to claim 1, characterized in that: The following conditions are met for each preset scheduling scheme: Condition 1: The number of orders served by any dispatchable vehicle in any supply sub-area to any demand sub-area is one; and / or Condition 2: For each demand sub-area, the sum of the dispatch willingness of all dispatchable vehicles going to the demand sub-area does not exceed the number of vehicles required by the demand sub-area.

7. The vehicle dispatching method according to any one of claims 1 to 6, characterized in that: in, The preset requirements are some or all of the following: the maximum usage weight among the usage weights of at least one of the preset scheduling schemes; A usage weight of at least one of the preset scheduling schemes is greater than a third preset value.

8. A vehicle dispatching device, characterized in that: include: A division module is used to divide multiple sub-areas in the target area into demand sub-areas and supply sub-areas; wherein the demand sub-area is a sub-area in which the number of idle vehicles in a preset time period is less than the number of unassigned vehicle orders; and the supply sub-area is a sub-area in which the number of idle vehicles in the preset time period exceeds the number of unassigned vehicle orders; A determination module is used to determine at least one preset dispatching scheme for at least one dispatchable vehicle in at least one supply sub-area to go to at least one demand sub-area, and a dispatching weight corresponding to a dispatchable vehicle in any supply sub-area going to any demand sub-area; wherein the dispatchable vehicle is an idle vehicle dispatched to the demand sub-area; according to at least one preset dispatching scheme and the dispatching weight corresponding to any idle vehicle in any supply sub-area going to any demand sub-area, a use weight of each preset dispatching scheme is determined; The scheduling module is used to determine a preset scheduling scheme with a usage weight that meets preset requirements from at least one of the preset scheduling schemes, and schedule idle vehicles in multiple supply sub-areas according to the determined preset scheduling scheme.

9. A server, characterized in that: include: Memory, used to store computer programs or instructions; A processor is used to execute the computer program or instructions in the memory so that the method according to any one of claims 1 to 6 is performed.

10. A computer-readable storage medium, characterized in that: When the instructions in the storage medium are executed by a processor, the processor is enabled to perform the method according to any one of claims 1 to 6.