CN112561330A - Method and device for generating scheduling instruction, electronic equipment and medium - Google Patents
Method and device for generating scheduling instruction, electronic equipment and medium Download PDFInfo
- Publication number
- CN112561330A CN112561330A CN202011486933.8A CN202011486933A CN112561330A CN 112561330 A CN112561330 A CN 112561330A CN 202011486933 A CN202011486933 A CN 202011486933A CN 112561330 A CN112561330 A CN 112561330A
- Authority
- CN
- China
- Prior art keywords
- candidate
- area
- order
- region
- heat
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 44
- 230000000875 corresponding effect Effects 0.000 claims description 105
- 230000002238 attenuated effect Effects 0.000 claims description 23
- 238000004364 calculation method Methods 0.000 claims description 7
- 230000002596 correlated effect Effects 0.000 claims description 6
- 238000004590 computer program Methods 0.000 claims description 3
- 230000007774 longterm Effects 0.000 abstract description 6
- 238000010438 heat treatment Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 5
- 230000008569 process Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 125000004122 cyclic group Chemical group 0.000 description 3
- 238000003062 neural network model Methods 0.000 description 3
- 235000019633 pungent taste Nutrition 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 230000007480 spreading Effects 0.000 description 2
- 239000000446 fuel Substances 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000000306 recurrent effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000002441 reversible effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012549 training Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
- G06Q30/0635—Processing of requisition or of purchase orders
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Marketing (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- Finance (AREA)
- Accounting & Taxation (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Traffic Control Systems (AREA)
Abstract
The application provides a method, a device, an electronic device and a medium for generating a scheduling instruction, wherein the method comprises the following steps: determining a target area in which the idle vehicle needs to be scheduled to other areas; respectively calculating the order propagation heat of each candidate area corresponding to the target area; the order propagation heat is used for representing the order heat of the candidate area and a plurality of adjacent areas which are different in distance from the candidate area at different reference moments in the future; determining the occupation ratio of idle vehicles to be dispatched from the target area to each candidate area respectively according to the difference of the order propagation heat degrees of different candidate areas; and generating a dispatching instruction used for sending to the idle vehicles in the target area according to the ratio so that the idle vehicles in the target area can drive to the corresponding candidate area according to the dispatching instruction. The method and the device can meet the requirement of long-term supply and demand balance of idle vehicles and riding orders over time.
Description
Technical Field
The application relates to the technical field of fleet management, in particular to a method and device for generating a scheduling instruction, electronic equipment and a medium.
Background
Currently, for the situation of unbalanced supply and demand of the idle vehicles and the riding orders, the existing vehicle scheduling scheme is to schedule the idle vehicles according to the predicted supply and demand distribution of the idle vehicles and the riding orders at a certain time (for example, after 30 minutes) in the future.
The applicant finds in research that the existing vehicle dispatching scheme only considers the supply and demand distribution situation of idle vehicles and riding orders at a certain time in the future, and cannot meet the long-term supply and demand balance requirement of the idle vehicles and the riding orders over time.
Disclosure of Invention
In view of the above, an object of the present application is to provide a method, an apparatus, an electronic device, and a medium for generating a scheduling command, which can satisfy the demand of long-term supply and demand balance of idle vehicles and riding orders over time.
According to a first aspect of the present invention, there is provided a method for generating a scheduling instruction, including:
determining a target area in which the idle vehicle needs to be scheduled to other areas;
respectively calculating the order propagation heat of each candidate area corresponding to the target area; the order propagation heat is used for representing order heat of a candidate area and a plurality of adjacent areas which are different in distance from the candidate area at different reference moments in the future, the candidate area is an area with a distance from a target area smaller than a preset value, and the order heat is obtained through prediction based on historical order data;
determining the occupation ratio of idle vehicles to be respectively dispatched from the target area to each candidate area according to the difference value of the order propagation heat degrees of different candidate areas;
and generating a scheduling instruction for sending to the idle vehicles in the target area according to the occupation ratio so that the idle vehicles in the target area run to the corresponding candidate areas according to the scheduling instruction.
In a possible implementation manner, calculating the order propagation heat of each candidate area corresponding to the target area respectively includes:
respectively calculating the order heat of each candidate region and each adjacent region corresponding to the candidate region at the corresponding reference time aiming at each candidate region and any adjacent region of the candidate region; the difference between the current time and the reference time is in positive correlation with the target distance; the reference time is a time after the current time, and the target distance is a distance between each candidate region or any neighboring region of the candidate region and the candidate region;
and aiming at each candidate region, calculating the order propagation heat of the candidate region according to the order heat and the corresponding target distance of each adjacent region corresponding to the candidate region and the candidate region.
In a possible implementation manner, for each candidate region, calculating the order propagation heat of the candidate region according to the order heat and the corresponding target distance of each neighboring region corresponding to the candidate region and the candidate region, includes:
calculating the order propagation heat of each candidate region based on the attenuated order heat of each adjacent region corresponding to the candidate region and the candidate region; wherein the degree of attenuation of the order popularity is positively correlated with the target distance.
In a possible implementation manner, for each candidate region and any neighboring region of the candidate region, respectively calculating the order popularity of each neighboring region corresponding to the candidate region and the candidate region at the corresponding reference time includes:
calculating a first order heat degree of each candidate area at a first reference moment;
respectively calculating second order heat of each first adjacent area at a second reference moment aiming at each first adjacent area of each candidate area;
respectively calculating third order heat of each second adjacent area of each candidate area at a third reference moment;
the first reference time, the second reference time and the third reference time are all times after the current time, the difference value between the second reference time and the current time is larger than the difference value between the first reference time and the current time, and the difference value between the third reference time and the current time is larger than the difference value between the second reference time and the current time.
In a possible implementation manner, for each candidate region, calculating the order propagation heat of the candidate region based on the attenuated order heat of the candidate region and each neighboring region corresponding to the candidate region includes:
calculating the order propagation heat of each candidate area based on the attenuated first order heat, the attenuated second order heat and the attenuated third order heat; the attenuation degree of the third order heat degree is greater than that of the second order heat degree, and the attenuation degree of the second order heat degree is greater than that of the first order heat degree.
In a possible implementation manner, for each candidate region, the distances between the respective first neighboring regions corresponding to the candidate region and the candidate region are the same, and the distances between the respective second neighboring regions corresponding to the candidate region and the candidate region are the same.
In a possible implementation manner, for the target region, distances between the candidate regions corresponding to the target region and the target region are the same.
In one possible embodiment, the order propagation heat of the candidate area has a positive correlation with the corresponding proportion of the candidate area.
In one possible embodiment, determining a target area in which a free vehicle needs to be scheduled to another area includes:
and determining the area, in each area, with the vehicle using saturation exceeding a preset threshold and the vehicle using saturation higher than that of the surrounding area, as the target area.
In one possible embodiment, determining a target area in which a free vehicle needs to be scheduled to another area includes:
predicting the vehicle using demand condition of each area after preset time based on historical order data;
and selecting a target area from the plurality of areas according to the vehicle saturation in each area, the vehicle saturation difference and the vehicle using requirement after the preset time.
In one possible embodiment, determining a target area in which a free vehicle needs to be scheduled to another area includes:
and after the idle vehicles are matched with the orders every time, determining the areas, which are not matched with the orders, of the areas with the number larger than the preset number as target areas.
In a possible implementation manner, generating a scheduling instruction for sending to an idle vehicle in the target area according to the occupancy ratio, so that the idle vehicle in the target area travels to a corresponding candidate area according to the scheduling instruction, includes:
acquiring a scheduling distance between each idle vehicle in the target area and each candidate area corresponding to the target area;
and determining a target idle vehicle scheduled to each candidate area corresponding to the target area according to the occupation ratio and the scheduling distance, and generating a scheduling instruction for sending to the target idle vehicle so as to enable the target idle vehicle to run to the candidate area.
According to a second aspect of the present invention, there is provided a scheduling instruction generating apparatus, including:
the region determining module is used for determining a target region in which the idle vehicle needs to be scheduled to other regions;
the heat calculation module is used for respectively calculating the order propagation heat of each candidate area corresponding to the target area; the order propagation heat is used for representing order heat of a candidate area and a plurality of adjacent areas which are different in distance from the candidate area at different reference moments in the future, the candidate area is an area with a distance from a target area smaller than a preset value, and the order heat is obtained through prediction based on historical order data;
the occupation ratio determining module is used for determining occupation ratios of idle vehicles respectively scheduled from the target area to each candidate area according to the difference of the order propagation heat degrees of different candidate areas;
and the instruction generating module is used for generating a scheduling instruction which is used for sending to the idle vehicles in the target area according to the occupation ratio so as to enable the idle vehicles in the target area to drive to the corresponding candidate areas according to the scheduling instruction.
According to a third aspect of embodiments of the present application, there is provided an electronic apparatus, including: a processor, a storage medium and a bus, wherein the storage medium stores machine-readable instructions executable by the processor, when the electronic device runs, the processor communicates with the storage medium through the bus, and the processor executes the machine-readable instructions to perform the steps of the method according to any one of the first aspect.
According to a fourth aspect of embodiments of the present application, there is provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of the method of any one of the above-mentioned first aspects.
The embodiment of the application provides a method for generating a scheduling instruction, which includes the steps of firstly determining a target area needing to schedule an idle vehicle to other areas, and then respectively calculating order propagation heat degrees of candidate areas corresponding to the target area, wherein the order propagation heat degrees not only consider the order heat degrees of the candidate areas at a certain future time, but also consider the order heat degrees of the candidate areas and a plurality of adjacent areas with different distances from the candidate areas at different reference times in the future along with the time lapse, the candidate areas are areas with distances from the target area smaller than a preset value, and the order heat degrees are obtained through prediction based on historical order data. In this way, according to the difference of the order propagation heat degrees of different candidate areas, the occupation ratio of idle vehicles respectively scheduled from the target area to each candidate area is determined, and a scheduling instruction used for sending to the idle vehicles in the target area is generated according to the occupation ratio, so that the idle vehicles in the target area travel to the corresponding candidate area according to the scheduling instruction, and the requirement of long-term supply and demand balance of the idle vehicles and the riding orders can be met along with the time.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are required to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained from the drawings without inventive effort.
Fig. 1 is a flowchart illustrating a method for generating a scheduling instruction according to an embodiment of the present application;
fig. 2 is a flowchart illustrating a specific embodiment of a method for generating a scheduling instruction according to an embodiment of the present application;
FIG. 3 is a diagram showing a distribution of locations of candidate regions corresponding to a target region;
fig. 4 is a schematic structural diagram illustrating a scheduling instruction generating apparatus according to an embodiment of the present application;
fig. 5 shows a schematic structural diagram of an electronic device provided in an embodiment of the present application.
Detailed Description
In order to make the purpose, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it should be understood that the drawings in the present application are for illustrative and descriptive purposes only and are not used to limit the scope of protection of the present application. Additionally, it should be understood that the schematic drawings are not necessarily drawn to scale. The flowcharts used in this application illustrate operations implemented according to some embodiments of the present application. It should be understood that the operations of the flow diagrams may be performed out of order, and steps without logical context may be performed in reverse order or simultaneously. One skilled in the art, under the guidance of this application, may add one or more other operations to, or remove one or more operations from, the flowchart.
In addition, the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. The components of the embodiments of the present application, generally described and illustrated in the figures herein, can be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present application, presented in the accompanying drawings, is not intended to limit the scope of the claimed application, but is merely representative of selected embodiments of the application. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the present application without making any creative effort, shall fall within the protection scope of the present application.
It should be noted that in the embodiments of the present application, the term "comprising" is used to indicate the presence of the features stated hereinafter, but does not exclude the addition of further features.
The terms "passenger," "requestor," "service requestor," and "customer" are used interchangeably in this application to refer to an individual, entity, or tool that can request or order a service. The terms "driver," "provider," "service provider," and "provider" are used interchangeably in this application to refer to an individual, entity, or tool that can provide a service. The term "user" in this application may refer to an individual, entity or tool that requests a service, subscribes to a service, provides a service, or facilitates the provision of a service. For example, the user may be a passenger, a driver, an operator, etc., or any combination thereof. In the present application, "passenger" and "passenger terminal" may be used interchangeably, and "driver" and "driver terminal" may be used interchangeably.
The terms "service request" and "order" are used interchangeably herein to refer to a request initiated by a passenger, a service requester, a driver, a service provider, or a supplier, the like, or any combination thereof. Accepting the "service request" or "order" may be a passenger, a service requester, a driver, a service provider, a supplier, or the like, or any combination thereof. The service request may be charged or free.
In the conventional scheme, aiming at the condition of unbalanced supply and demand of the idle vehicles and the riding orders, the idle vehicles are scheduled according to the predicted supply and demand distribution conditions of the idle vehicles and the riding orders at a certain future time (for example, after 30 minutes). However, the conventional scheme only considers the distribution situation of supply and demand of idle vehicles and riding orders at a certain time in the future, and cannot meet the long-term demand of supply and demand balance of the idle vehicles and the riding orders over time. Based on this, the present application provides a method, an apparatus, an electronic device, and a medium for generating a scheduling command, which are specifically described below.
Referring to fig. 1, fig. 1 is a flowchart illustrating a method for generating a scheduling instruction according to an embodiment of the present disclosure. As shown in fig. 1, the following steps may be included:
s101, determining a target area where an idle vehicle needs to be scheduled to other areas;
s102, respectively calculating order propagation heat of each candidate area corresponding to the target area; the order propagation heat is used for representing order heat of a candidate area and a plurality of adjacent areas which are different in distance from the candidate area at different reference moments in the future, the candidate area is an area with a distance from a target area smaller than a preset value, and the order heat is obtained through prediction based on historical order data;
s103, determining the occupation ratio of idle vehicles to be respectively dispatched from the target area to each candidate area according to the difference value of the order propagation heat degrees of different candidate areas;
and S104, generating a scheduling instruction for sending to the idle vehicles in the target area according to the ratio, so that the idle vehicles in the target area run to the corresponding candidate areas according to the scheduling instruction.
In step S101, the physical area is generally divided into a plurality of areas, and the target area is an area in which the free vehicles need to be dispatched to other areas among the plurality of areas. An idle vehicle is a vehicle that has not received an order. In a specific implementation, at least one of the following possible implementations may be employed to determine the target region.
In a first possible embodiment, a region in each region in which the vehicle occupancy saturation exceeds a preset threshold and the vehicle occupancy saturation is higher than that of the surrounding region is determined as the target region. The vehicle utilization saturation refers to a ratio of an actual vehicle utilization requirement in the current area to a bearable maximum vehicle utilization requirement, and the bearable maximum vehicle utilization requirement is determined based on the network car reservation quantity, the network car reservation distribution situation and the network car reservation user quantity in the current area. In the embodiment, the target area is determined according to the vehicle utilization saturation, and the free vehicles in the target area are dispatched to the candidate areas with lower vehicle utilization saturation, so that the vehicle utilization saturation of each area can be balanced, and the problem that the waiting time for driver order taking in the areas with higher vehicle utilization saturation is too long is solved.
In a second possible implementation manner, the vehicle demand condition of each area after the preset time is predicted based on historical order data; and selecting a target area from the plurality of areas according to the vehicle saturation in each area, the vehicle saturation difference and the vehicle using requirement after the preset time. The vehicle saturation refers to the ratio of the actual number of vehicles in the current area to the reasonable number of vehicles in the current area. Regarding the reasonable number of net appointment vehicles, if one more net appointment vehicle is added to one area, the competition intensity is increased from the perspective of drivers; and from the perspective of passengers, if one more car is reserved, the waiting time can be reduced. And for the increase of the number of vehicles, the drivers and the passengers are in a benefit conflict state, and when the waiting time of the drivers and the waiting time of the passengers in the current area reach an equilibrium point, namely the reasonable network car reservation number in the area. In this embodiment, the vehicle using demand condition of each area after a preset time (for example, 1 hour) is predicted, if the current vehicle saturation of a certain area is high, the vehicle using saturation is high, and the predicted vehicle using demand after the preset time is reduced, the area is determined as a target area, and then the idle vehicles in the target area are scheduled to other candidate areas, so that the idle vehicles can be scheduled in advance to respond to future orders, and the order rate is increased.
In a third possible embodiment, after each matching of a free vehicle with an order, i.e. after each order dispatch, the area in each area where the number of free vehicles that have not matched an order is greater than the preset number is determined as the target area. In the traditional scheme, only order dispatching is considered, and vehicle scheduling is not considered, namely a management mode of a free vehicle which is not matched with an order after the order dispatching is not considered. This can result in wasted resources (time, fuel consumption, etc.) for the driver to find passengers in certain areas, while passengers do not get into the car in certain areas. In other words, the mismatch between the vehicle distribution and the order distribution results in a large number of orders being abandoned and a high rate of empty drivers, directly affecting the order response rate and platform revenue of the network reservation platform. In the embodiment, order dispatching and order scheduling are considered at the same time, after each order dispatching, some areas have idle vehicles which are not matched with the orders, if the number of the idle vehicles which are not matched with the orders in a certain area is larger than the area with the preset number, the area is determined as a target area, and then the idle vehicles in the target area are scheduled to other candidate areas, so that the vehicle distribution and the order distribution are balanced, and the order response rate and the platform yield of a network appointment platform are improved.
In step S102, the order popularity refers to the number of orders included in a certain area at a certain time, and is predicted based on historical order data. In this embodiment, the prediction process of the order popularity may include: firstly, training a cyclic neural network model of a gating cyclic unit by using historical order data until the cyclic neural network model converges; and then inputting the order data of the previous M time periods into a trained recurrent neural network model to predict the order heat of each area of the M +1 time period. The embodiment is not limited to this, and other prediction methods may be adopted to predict the order popularity.
The candidate region of the target region refers to a region having a distance from the target region smaller than a preset value, for example, a region adjacent to the target region, a region located near the target region. Preferably, for the target region, the distances between each candidate region corresponding to the target region and the target region are the same. The neighborhood of the candidate region refers to a region adjacent to the candidate region, a region located in the vicinity of the candidate region. The future different reference time instant refers to a number of different time instants following the current time instant.
The order propagation heat is used for characterizing the order heat of the candidate area and a plurality of adjacent areas which are different in distance from the candidate area at different reference time in the future. That is, the order propagation heat degree not only considers the order heat degree of the candidate area at a future time, but also considers the order heat degree of the candidate area and a plurality of adjacent areas having different distances from the candidate area at different reference times in the future over time.
The following explains a calculation process of the order propagation heat of the candidate area.
Step S102 may comprise the following sub-steps:
s1021, aiming at each candidate area and any adjacent area of the candidate area, respectively calculating the order heat of each adjacent area corresponding to the candidate area and the candidate area at the corresponding reference moment;
s1022, for each candidate region, according to the order heat and the corresponding target distance of each neighboring region corresponding to the candidate region and the candidate region, calculating the order propagation heat of the candidate region.
In step S1021, the reference time is a time after the current time, that is, a future time. The difference between the current time and the reference time has positive correlation with the target distance, that is, the target distance gradually becomes farther with the delay of the reference time.
The target distance is the distance between each candidate region or any adjacent region of the candidate region and the candidate region, the target distance between each candidate region and the candidate region is zero, and the target distance between each adjacent region and the candidate region is the straight-line distance between the centers of the two regions.
For example, if the neighborhood of each candidate region includes a plurality of first neighborhoods and second neighborhoods, first the first order popularity h of each candidate region at the first reference time t1 is calculatedt1Then, a second order degree h of each first neighboring area of each candidate area at a second reference time t2 is calculatedt2(ii) a Finally, respective second neighbors of each candidate region are computedThird order Heat h of the near zone at third reference time t3t3. The first reference time t1, the second reference time t2, and the third reference time t3 are all times after the current time t. The first target distance L1 represents the distance between each candidate region and the candidate region, the second target distance L2 represents the distance between the first neighboring region and the candidate region, and the third target distance L3 represents the distance between the second neighboring region and the candidate region. the difference between t2 and t is greater than the difference between t1 and t, and the difference between t3 and t is greater than the difference between t2 and t; l3 is greater than L2 and L2 is greater than L1. That is, the difference between the current time and the reference time has a positive correlation with the target distance, and the target distance gradually increases with the delay of the reference time.
In step S1022, for each candidate region, based on the attenuated order heat of the candidate region and each neighboring region corresponding to the candidate region, the order propagation heat of the candidate region is calculated; wherein the degree of attenuation of the order popularity is positively correlated with the target distance.
For example, for each candidate region, based on the attenuated first order heat h't1And each second order heat h't2And each third order heat h't3Calculating an order propagation heat H ═ H 'of the candidate region't1+∑h't2+∑h't3. Wherein the third order heat ht3Is more than the second order heat ht2The degree of decay of, the second order heat ht2Is more than the first order heat ht1The degree of attenuation of. Attenuated first order heat h't1＝λH1ht1，λH1Indicates the first order degree of heating ht1The discount factor of (1) is generally taken. Attenuated second order heat h't2＝λH2ht2，λH2Indicates the first order degree of heating ht2The discount factor of (2) is generally a constant gamma, and the value range of gamma is [0,1 ]]. Attenuated third order heat h't3＝λH3ht3，λH3Indicates the first order degree of heating ht3The discount factor of (2) is generally taken as a constant gamma2The value range of gamma is [0,1 ]]. Then, the order propagation heat H ═ λ of the candidate areaH1ht1+∑λH2ht2+∑λH3ht3。
It should be noted that the order propagation degree H of the candidate area may also consider a fourth order degree H of each third neighboring area of the candidate area at a fourth reference time t4t4Calculating the order propagation heat H ═ lambda of the candidate areaH1ht1+∑λH2ht2+∑λH3ht3+∑λH4ht4，λH4Indicates the fourth order degree of hotness ht4The discount factor of (2) is generally taken as a constant gamma3The value range of gamma is [0,1 ]]. That is, as the target distance is farther, the discount factor of the corresponding order heat is smaller, the influence of the corresponding order heat on the order propagation heat is smaller, and the degree of attenuation of the corresponding order heat is larger.
In a possible implementation manner, for each candidate region, the distances between the respective first neighboring regions corresponding to the candidate region and the candidate region are the same, and the distances between the respective second neighboring regions corresponding to the candidate region and the candidate region are the same. Then, the second order degree h of each first neighboring area corresponding to each candidate areat2Are the same, corresponding discount factor lambdaH2The same applies; the second order heat h of each second adjacent area corresponding to each candidate areat3Are the same, corresponding discount factor lambdaH3The same applies. Therefore, the order propagation heat of the candidate area may also be expressed as H ═ λH1ht1+λH2∑ht2+λH3∑ht3。
In order to more clearly understand step S102, the above steps S1021 and S1022 are explained in detail below with reference to fig. 2 and 3.
As shown in fig. 2, the physical area is divided into hexagonal areas of equal size, and six candidate areas a1-a6 are around the target area a. As shown in FIG. 3, the neighborhood of the candidate region A1 includes a first neighborhood B1-B6 and a second neighborhood C1-C12.
In step S1021, a first order popularity h of candidate area A1 at a first reference time t1 is calculatedt1The second order popularity h of the first adjacent area B1-B6 at the second reference time t2t2And a third order popularity h of the second neighboring area C1-C12 at a third reference time t3t3. The first reference time t1, the second reference time t2, and the third reference time t3 are all times after the current time t. The first target distance L1 represents the distance between the candidate region a1 and the candidate region a1, the second target distance L2 represents the distance between the first neighboring region B1-B6 and the candidate region a1, and the third target distance L3 represents the distance between the second neighboring region C1-C12 and the candidate region a 1. the difference between t2 and t is greater than the difference between t1 and t, and the difference between t3 and t is greater than the difference between t2 and t; l3 is greater than L2 and L2 is greater than L1. That is, the difference between the current time and the reference time has a positive correlation with the target distance, and the target distance gradually increases with the delay of the reference time.
In step S1022, first, the attenuated first order heat h 'is calculated't1And each second order heat h't2And each third order heat h't3. Specifically, the attenuated first order heat h't1＝λH1ht1，λH1Indicates the first order degree of heating ht1The discount factor of (1) is generally taken. Attenuated second order heat h't2＝λH2ht2，λH2Indicates the first order degree of heating ht2The discount factor of (2) is generally a constant gamma, and the value range of gamma is [0,1 ]]. Attenuated third order heat h't3＝λH3ht3，λH3Indicates the first order degree of heating ht3The discount factor of (2) is generally taken as a constant gamma2The value range of gamma is [0,1 ]]. The order propagation heat for candidate area a1 is then calculated. Since the distances between the candidate region A1 and the respective first neighboring regions B1-B6 to which the candidate region A1 corresponds are the same, the candidatesThe distances between the second adjacent areas C1-C12 corresponding to the area A1 and the candidate area A1 are the same, and the second order popularity h of the first adjacent areas B1-B6 corresponding to the candidate area A1 is larger than that of the second adjacent area A1t2Are the same, corresponding discount factor lambdaH2The same applies; the second order popularity h of each second adjacent region C1-C12 corresponding to the candidate region A1t3Are the same, corresponding discount factor lambdaH3The same applies. Thus, the order propagation heat for candidate area A1 may be expressed as
Wherein the value range of the constant gamma is [0,1 ]]，ht2iRepresents a second degree of hotness of the order, h, of the first contiguous area Bi at a second reference time t2t3jIndicating a third degree of hotness of the order for the second neighboring area Cj at a third reference time t 3.
In step S103, the order propagation degree of the candidate area indicates the order degree of the candidate area and the neighboring area thereof at a plurality of different times in the future. And determining the occupation ratio of idle vehicles to be respectively dispatched from the target area to each candidate area according to the difference value of each candidate area. Preferably, the order propagation heat of the candidate area has a positive correlation with the proportion corresponding to the candidate area.
Taking FIG. 2 as an example, the order propagation heat H of the candidate area A1 is calculated through the step 102A1The order propagation heat H of the candidate area A2-A6 is calculated in the same wayA2-HA6. First, taking the candidate area a1 as an example, the scheduling probability p1 of the candidate area a1 is calculated, and the scheduling probability p1 of the candidate area a1 is the ratio of the order propagation heat of the candidate area a1 to the sum of the order propagation heat of each of the candidate areas a1-a6 corresponding to the target area a, that is, the ratio is
Similarly, the scheduling probabilities p2-p6 of the candidate regions A2-A6 are calculated, and are not described in detail herein. Then generating the candidate region A1-A6 corresponding to the target region A based on the scheduling probability p1-p6The scheduling probability of each candidate area is positively correlated with the number of the virtual orders of the candidate area, and the number of the virtual orders of the candidate area is positively correlated with the ratio corresponding to the candidate area. According to the embodiment, the free vehicles in the target area A are dispatched to the corresponding candidate areas according to the dispatching probabilities p1-p6 of the candidate areas A1-A6 corresponding to the target area A, instead of dispatching the free vehicles in the target area A to the candidate areas with the highest order spreading degree, so that the situations that the number of the free vehicles dispatched by the candidate areas with the highest order spreading degree is too many and the number of the free vehicles dispatched by other candidate areas is too few can be effectively prevented.
In step S104, according to the occupation ratios of idle vehicles respectively dispatched from the target area to each of the candidate areas, for example, the occupation ratio corresponding to the first candidate area is 10%, the occupation ratio corresponding to the second candidate area is 20%, the occupation ratio corresponding to the third candidate area is 40%, and the occupation ratio corresponding to the fourth candidate area is 30%, assuming that the total number of idle vehicles to be dispatched by the target area is ten, one vehicle is dispatched to the first candidate area, two vehicles are dispatched to the second candidate area, four vehicles are dispatched to the third candidate area, and three vehicles are dispatched to the fourth candidate area. And generating a scheduling instruction for sending to the idle vehicles in the target area according to the ratio, and sending the scheduling instruction to the ten idle vehicles in the target area respectively, so that the idle vehicles in the target area run to corresponding candidate areas according to the scheduling instruction respectively.
In specific implementation, firstly, the scheduling distance between each idle vehicle in the target area and each candidate area corresponding to the target area is obtained; and then according to the occupation ratio and the dispatching distance, determining a target idle vehicle dispatched to each candidate area corresponding to the target area, and generating a dispatching instruction for sending to the target idle vehicle so as to enable the target idle vehicle to travel to the candidate area. According to the embodiment, the target free vehicles in the target area are dispatched to the corresponding candidate areas according to the occupation ratio and the dispatching distance, the target free vehicles in the target area are dispatched to the candidate areas with the closer dispatching distance in priority, the integral vehicle dispatching distance can be reduced, and therefore the integral vehicle dispatching cost is reduced.
Taking fig. 2 as an example, first, the current position information (longitude and latitude) of each idle vehicle in the target area a and the position information (longitude and latitude) of the area center of each candidate area a1-a6 corresponding to the target area a are obtained, and then the scheduling distance between each idle vehicle in the target area a and each candidate area a1-a6 corresponding to the target area a is calculated. The number of free vehicles dispatched from the target area a to the candidate areas a1-a6, respectively, is then determined based on the fraction of free vehicles dispatched from the target area a to the candidate areas a1-a6, respectively. For example: the corresponding percentage of the candidate area a1-A3 is 10%, the corresponding percentage of the candidate area a4 is 20%, the corresponding percentage of the candidate area a5 is 30%, the corresponding percentage of the candidate area a6 is 20%, and assuming that the total number of free vehicles to be dispatched by the target area a is ten, one vehicle is dispatched to the candidate areas a1-A3, two vehicles are dispatched to the candidate area a4, three vehicles are dispatched to the candidate area a5, and two vehicles are dispatched to the candidate area a6, respectively. And finally, determining a target idle vehicle scheduled to each candidate area corresponding to the target area A according to the occupation ratio and the scheduling distance, generating a scheduling instruction for sending the target idle vehicle, and preferentially scheduling the target idle vehicle in the target area to the candidate area with a short adjacent scheduling distance without cross-area scheduling, so that the overall vehicle scheduling distance can be reduced, the overall vehicle scheduling cost is reduced, and the intention of a driver is improved.
The embodiment of the application provides a method for generating a scheduling instruction, which includes the steps of firstly determining a target area needing to schedule an idle vehicle to other areas, and then respectively calculating order propagation heat degrees of candidate areas corresponding to the target area, wherein the order propagation heat degrees not only consider the order heat degrees of the candidate areas at a certain future time, but also consider the order heat degrees of the candidate areas and a plurality of adjacent areas with different distances from the candidate areas at different reference times in the future along with the time lapse, the candidate areas are areas with distances from the target area smaller than a preset value, and the order heat degrees are obtained through prediction based on historical order data. In this way, according to the difference of the order propagation heat degrees of different candidate areas, the occupation ratio of idle vehicles respectively scheduled from the target area to each candidate area is determined, and a scheduling instruction used for sending to the idle vehicles in the target area is generated according to the occupation ratio, so that the idle vehicles in the target area travel to the corresponding candidate area according to the scheduling instruction, and the requirement of long-term supply and demand balance of the idle vehicles and the riding orders can be met along with the time.
Based on the same technical concept, embodiments of the present application further provide a device for generating a scheduling instruction, an electronic device, a computer storage medium, and the like, which can be specifically referred to in the following embodiments.
Referring to fig. 4, fig. 4 is a schematic structural diagram of a device for generating a scheduling instruction according to an embodiment of the present disclosure. As shown in fig. 4, the apparatus may include:
the region determining module 10 is configured to determine a target region where an idle vehicle needs to be scheduled to another region;
the heat calculation module 20 is configured to calculate order propagation heat of each candidate area corresponding to the target area; the order propagation heat is used for representing order heat of a candidate area and a plurality of adjacent areas which are different in distance from the candidate area at different reference moments in the future, the candidate area is an area with a distance from a target area smaller than a preset value, and the order heat is obtained through prediction based on historical order data;
the proportion determining module 30 is configured to determine, according to the difference between the order propagation heat degrees of different candidate areas, the proportion of idle vehicles to be dispatched from the target area to each of the candidate areas;
and the instruction generating module 40 is configured to generate a scheduling instruction used for sending to the idle vehicle in the target area according to the proportion, so that the idle vehicle in the target area travels to a corresponding candidate area according to the scheduling instruction.
In one possible implementation, the heat calculation module 20 may include:
the first calculation unit is used for respectively calculating the order heat degree of each candidate region and each adjacent region corresponding to the candidate region at the corresponding reference time aiming at each candidate region and any adjacent region of the candidate region; the difference between the current time and the reference time is in positive correlation with the target distance; the reference time is a time after the current time, and the target distance is a distance between each candidate region or any neighboring region of the candidate region and the candidate region;
and the second calculation unit is used for calculating the order propagation heat of each candidate area according to the order heat and the corresponding target distance of each adjacent area corresponding to the candidate area and the candidate area.
In a possible implementation, the second computing unit is specifically configured to: calculating the order propagation heat of each candidate region based on the attenuated order heat of each adjacent region corresponding to the candidate region and the candidate region; wherein the degree of attenuation of the order popularity is positively correlated with the target distance.
In a possible implementation, the first computing unit is specifically configured to:
calculating a first order heat degree of each candidate area at a first reference moment;
respectively calculating second order heat of each first adjacent area at a second reference moment aiming at each first adjacent area of each candidate area;
respectively calculating third order heat of each second adjacent area of each candidate area at a third reference moment;
the first reference time, the second reference time and the third reference time are all times after the current time, the difference value between the second reference time and the current time is larger than the difference value between the first reference time and the current time, and the difference value between the third reference time and the current time is larger than the difference value between the second reference time and the current time.
In a possible implementation, the second computing unit is specifically configured to: calculating the order propagation heat of each candidate area based on the attenuated first order heat, the attenuated second order heat and the attenuated third order heat; the attenuation degree of the third order heat degree is greater than that of the second order heat degree, and the attenuation degree of the second order heat degree is greater than that of the first order heat degree.
In a possible implementation manner, for each candidate region, the distances between the respective first neighboring regions corresponding to the candidate region and the candidate region are the same, and the distances between the respective second neighboring regions corresponding to the candidate region and the candidate region are the same.
In a possible implementation manner, for the target region, distances between the candidate regions corresponding to the target region and the target region are the same.
In one possible embodiment, the order propagation heat of the candidate area has a positive correlation with the corresponding proportion of the candidate area.
In a possible implementation, the area determination module 10 is specifically configured to: and determining the area, in each area, with the vehicle using saturation exceeding a preset threshold and the vehicle using saturation higher than that of the surrounding area, as the target area.
In a possible implementation, the area determination module 10 is specifically configured to: predicting the vehicle using demand condition of each area after preset time based on historical order data; and selecting a target area from the plurality of areas according to the vehicle saturation in each area, the vehicle saturation difference and the vehicle using requirement after the preset time.
In a possible implementation, the area determination module 10 is specifically configured to: and after the idle vehicles are matched with the orders every time, determining the areas, which are not matched with the orders, of the areas with the number larger than the preset number as target areas.
In one possible implementation, the instruction generation module 40 includes:
the acquiring unit is used for acquiring the scheduling distance between each idle vehicle in the target area and each candidate area corresponding to the target area;
and the generating unit is used for determining a target idle vehicle scheduled to each candidate area corresponding to the target area according to the occupation ratio and the scheduling distance, and generating a scheduling instruction sent to the target idle vehicle so as to enable the target idle vehicle to run to the candidate area.
An embodiment of the present application discloses an electronic device, as shown in fig. 5, including: a processor 501, a memory 502 and a bus 503, wherein the memory 502 stores machine-readable instructions executable by the processor 501, and when the electronic device is operated, the processor 501 and the memory 502 communicate with each other through the bus 503. The machine readable instructions, when executed by the processor 501, perform the method described in the foregoing method embodiment, and specific implementation may refer to the method embodiment, which is not described herein again.
The computer program product for performing virtual card interaction provided in the embodiment of the present application includes a computer-readable storage medium storing nonvolatile program code executable by the processor 501, where instructions included in the program code may be used to execute the method described in the foregoing method embodiment, and specific implementation may refer to the method embodiment, and is not described herein again.
It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the system and the apparatus described above may refer to corresponding processes in the method embodiments, and are not described in detail in this application. In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. The above-described apparatus embodiments are merely illustrative, and for example, the division of the modules is merely a logical division, and there may be other divisions in actual implementation, and for example, a plurality of modules or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of devices or modules through some communication interfaces, and may be in an electrical, mechanical or other form.
The modules described as separate parts may or may not be physically separate, and parts displayed as modules may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a non-volatile computer-readable storage medium executable by a processor. Based on such understanding, the technical solution of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a U disk, a removable hard disk, a ROM, a RAM, a magnetic disk, or an optical disk.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (15)
1. A method for generating a scheduling instruction, comprising:
determining a target area in which the idle vehicle needs to be scheduled to other areas;
respectively calculating the order propagation heat of each candidate area corresponding to the target area; the order propagation heat is used for representing order heat of a candidate area and a plurality of adjacent areas which are different in distance from the candidate area at different reference moments in the future, the candidate area is an area with a distance from a target area smaller than a preset value, and the order heat is obtained through prediction based on historical order data;
determining the occupation ratio of idle vehicles to be respectively dispatched from the target area to each candidate area according to the difference value of the order propagation heat degrees of different candidate areas;
and generating a scheduling instruction for sending to the idle vehicles in the target area according to the occupation ratio so that the idle vehicles in the target area run to the corresponding candidate areas according to the scheduling instruction.
2. The method according to claim 1, wherein calculating the order propagation heat of each candidate area corresponding to the target area comprises:
respectively calculating the order heat of each candidate region and each adjacent region corresponding to the candidate region at the corresponding reference time aiming at each candidate region and any adjacent region of the candidate region; the difference between the current time and the reference time is in positive correlation with the target distance; the reference time is a time after the current time, and the target distance is a distance between each candidate region or any neighboring region of the candidate region and the candidate region;
and aiming at each candidate region, calculating the order propagation heat of the candidate region according to the order heat and the corresponding target distance of each adjacent region corresponding to the candidate region and the candidate region.
3. The method of claim 2, wherein calculating, for each candidate region, the order propagation heat of the candidate region according to the order heat and the corresponding target distance of each neighboring region corresponding to the candidate region and the candidate region comprises:
calculating the order propagation heat of each candidate region based on the attenuated order heat of each adjacent region corresponding to the candidate region and the candidate region; wherein the degree of attenuation of the order popularity is positively correlated with the target distance.
4. The method of claim 3, wherein calculating the order popularity of each candidate region and each neighboring region corresponding to the candidate region at the corresponding reference time for each candidate region and any neighboring region of the candidate region respectively comprises:
calculating a first order heat degree of each candidate area at a first reference moment;
respectively calculating second order heat of each first adjacent area at a second reference moment aiming at each first adjacent area of each candidate area;
respectively calculating third order heat of each second adjacent area of each candidate area at a third reference moment;
the first reference time, the second reference time and the third reference time are all times after the current time, the difference value between the second reference time and the current time is larger than the difference value between the first reference time and the current time, and the difference value between the third reference time and the current time is larger than the difference value between the second reference time and the current time.
5. The method of claim 4, wherein calculating, for each candidate region, the order propagation heat for the candidate region based on the attenuated order heat for the candidate region and the respective neighboring regions to which the candidate region corresponds comprises:
calculating the order propagation heat of each candidate area based on the attenuated first order heat, the attenuated second order heat and the attenuated third order heat; the attenuation degree of the third order heat degree is greater than that of the second order heat degree, and the attenuation degree of the second order heat degree is greater than that of the first order heat degree.
6. The method of claim 3, wherein for each candidate region, distances between the candidate region and the respective first neighboring regions corresponding to the candidate region are the same, and distances between the candidate region and the respective second neighboring regions corresponding to the candidate region are the same.
7. The method of claim 1, wherein for the target region, distances between the candidate regions corresponding to the target region and the target region are the same.
8. The method of claim 1, wherein the order propagation heat of the candidate area has a positive correlation with the corresponding proportion of the candidate area.
9. The method of claim 1, wherein determining a target area where free vehicles need to be scheduled to other areas comprises:
and determining the area, in each area, with the vehicle using saturation exceeding a preset threshold and the vehicle using saturation higher than that of the surrounding area, as the target area.
10. The method of claim 1, wherein determining a target area where free vehicles need to be scheduled to other areas comprises:
predicting the vehicle using demand condition of each area after preset time based on historical order data;
and selecting a target area from the plurality of areas according to the vehicle saturation in each area, the vehicle saturation difference and the vehicle using requirement after the preset time.
11. The method of claim 1, wherein determining a target area where free vehicles need to be scheduled to other areas comprises:
and after the idle vehicles are matched with the orders every time, determining the areas, which are not matched with the orders, of the areas with the number larger than the preset number as target areas.
12. The method of claim 1, wherein generating a scheduling command for sending to the idle vehicles in the target area according to the occupancy ratio so that the idle vehicles in the target area travel to the corresponding candidate areas according to the scheduling command comprises:
acquiring a scheduling distance between each idle vehicle in the target area and each candidate area corresponding to the target area;
and determining a target idle vehicle scheduled to each candidate area corresponding to the target area according to the occupation ratio and the scheduling distance, and generating a scheduling instruction for sending to the target idle vehicle so as to enable the target idle vehicle to run to the candidate area.
13. An apparatus for generating a scheduling instruction, comprising:
the region determining module is used for determining a target region in which the idle vehicle needs to be scheduled to other regions;
the heat calculation module is used for respectively calculating the order propagation heat of each candidate area corresponding to the target area; the order propagation heat is used for representing order heat of a candidate area and a plurality of adjacent areas which are different in distance from the candidate area at different reference moments in the future, the candidate area is an area with a distance from a target area smaller than a preset value, and the order heat is obtained through prediction based on historical order data;
the occupation ratio determining module is used for determining occupation ratios of idle vehicles respectively scheduled from the target area to each candidate area according to the difference of the order propagation heat degrees of different candidate areas;
and the instruction generating module is used for generating a scheduling instruction which is used for sending to the idle vehicles in the target area according to the occupation ratio so as to enable the idle vehicles in the target area to drive to the corresponding candidate areas according to the scheduling instruction.
14. An electronic device, comprising: a processor, a storage medium and a bus, the storage medium storing machine-readable instructions executable by the processor, the processor and the storage medium communicating via the bus when the electronic device is operating, the processor executing the machine-readable instructions to perform the steps of the method according to any one of claims 1 to 12.
15. A computer-readable storage medium, having stored thereon a computer program which, when being executed by a processor, is adapted to carry out the steps of the method according to any one of claims 1 to 12.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011486933.8A CN112561330A (en) | 2020-12-16 | 2020-12-16 | Method and device for generating scheduling instruction, electronic equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011486933.8A CN112561330A (en) | 2020-12-16 | 2020-12-16 | Method and device for generating scheduling instruction, electronic equipment and medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112561330A true CN112561330A (en) | 2021-03-26 |
Family
ID=75064074
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011486933.8A Pending CN112561330A (en) | 2020-12-16 | 2020-12-16 | Method and device for generating scheduling instruction, electronic equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112561330A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113902156A (en) * | 2021-11-16 | 2022-01-07 | 南京领行科技股份有限公司 | Scheduling method and device for network appointment vehicle and storage medium |
| CN114091932A (en) * | 2021-11-25 | 2022-02-25 | 南京领行科技股份有限公司 | Resource scheduling method, device, medium and electronic equipment |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106709847A (en) * | 2016-11-28 | 2017-05-24 | 中兴软创科技股份有限公司 | Taxi information pushing method and system |
| CN108346280A (en) * | 2018-01-30 | 2018-07-31 | 北京摩拜科技有限公司 | Vehicle dispatching method, server, client and system |
| CN109784648A (en) * | 2018-12-14 | 2019-05-21 | 北京三快在线科技有限公司 | Scheduling resource distributing method, device, electronic equipment and readable storage medium storing program for executing |
| CN110188968A (en) * | 2018-02-22 | 2019-08-30 | 北京嘀嘀无限科技发展有限公司 | Region division, the method and device of hot statistics |
| US20200005420A1 (en) * | 2017-06-21 | 2020-01-02 | Beijing Didi Infinity Technology And Development Co., Ltd. | Systems and methods for transportation capacity dispatch |
| CN111081015A (en) * | 2019-12-17 | 2020-04-28 | 深圳市锐明技术股份有限公司 | Taxi scheduling method and device, storage medium and intelligent terminal |
| US20200175635A1 (en) * | 2018-03-28 | 2020-06-04 | Beijing Didi Infinity Technology And Development Co., Ltd. | System and method for determining passenger-seeking ride-sourcing vehicle navigation |
| CN111626534A (en) * | 2019-02-28 | 2020-09-04 | 北京嘀嘀无限科技发展有限公司 | Resource scheduling method and device, electronic equipment and readable storage medium |
| CN111754149A (en) * | 2019-03-28 | 2020-10-09 | 天津五八到家科技有限公司 | Driver scheduling method, device and storage medium |
-
2020
- 2020-12-16 CN CN202011486933.8A patent/CN112561330A/en active Pending
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106709847A (en) * | 2016-11-28 | 2017-05-24 | 中兴软创科技股份有限公司 | Taxi information pushing method and system |
| US20200005420A1 (en) * | 2017-06-21 | 2020-01-02 | Beijing Didi Infinity Technology And Development Co., Ltd. | Systems and methods for transportation capacity dispatch |
| CN108346280A (en) * | 2018-01-30 | 2018-07-31 | 北京摩拜科技有限公司 | Vehicle dispatching method, server, client and system |
| CN110188968A (en) * | 2018-02-22 | 2019-08-30 | 北京嘀嘀无限科技发展有限公司 | Region division, the method and device of hot statistics |
| US20200175635A1 (en) * | 2018-03-28 | 2020-06-04 | Beijing Didi Infinity Technology And Development Co., Ltd. | System and method for determining passenger-seeking ride-sourcing vehicle navigation |
| CN109784648A (en) * | 2018-12-14 | 2019-05-21 | 北京三快在线科技有限公司 | Scheduling resource distributing method, device, electronic equipment and readable storage medium storing program for executing |
| CN111626534A (en) * | 2019-02-28 | 2020-09-04 | 北京嘀嘀无限科技发展有限公司 | Resource scheduling method and device, electronic equipment and readable storage medium |
| CN111754149A (en) * | 2019-03-28 | 2020-10-09 | 天津五八到家科技有限公司 | Driver scheduling method, device and storage medium |
| CN111081015A (en) * | 2019-12-17 | 2020-04-28 | 深圳市锐明技术股份有限公司 | Taxi scheduling method and device, storage medium and intelligent terminal |
Non-Patent Citations (1)
| Title |
|---|
| 郭力飞: "基于四叉树网格的快速层次聚类热图可视化研究", 《中国优秀硕士学位论文全文数据库 信息科技缉》, pages 14 - 15 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113902156A (en) * | 2021-11-16 | 2022-01-07 | 南京领行科技股份有限公司 | Scheduling method and device for network appointment vehicle and storage medium |
| CN113902156B (en) * | 2021-11-16 | 2022-04-08 | 南京领行科技股份有限公司 | Scheduling method and device for network appointment vehicle and storage medium |
| CN114091932A (en) * | 2021-11-25 | 2022-02-25 | 南京领行科技股份有限公司 | Resource scheduling method, device, medium and electronic equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113692609B (en) | Multi-agent reinforcement learning with order dispatch by order vehicle distribution matching | |
| TWI676783B (en) | Method and system for estimating time of arrival | |
| CN110737529B (en) | Short-time multi-variable-size data job cluster scheduling adaptive configuration method | |
| US20180314998A1 (en) | Resource Allocation in a Network System | |
| CN110712206B (en) | Multitask allocation method, multitask allocation device, multitask allocation equipment and storage medium of intelligent robot | |
| CN111340318B (en) | Vehicle dynamic scheduling method and device and terminal equipment | |
| Shi et al. | Memory-based ant colony system approach for multi-source data associated dynamic electric vehicle dispatch optimization | |
| CN112561330A (en) | Method and device for generating scheduling instruction, electronic equipment and medium | |
| US11507896B2 (en) | Method and system for spatial-temporal carpool dual-pricing in ridesharing | |
| CN111433795A (en) | System and method for determining estimated arrival time of online-to-offline service | |
| CN111832869A (en) | Vehicle scheduling method and device, electronic equipment and storage medium | |
| WO2018146622A1 (en) | Dynamic selection of geo-based service options in a network system | |
| US11626021B2 (en) | Systems and methods for dispatching shared rides through ride-hailing platform | |
| CN110750709A (en) | Service recommendation method and device | |
| CN111695842A (en) | Distribution scheme determination method and device, electronic equipment and computer storage medium | |
| CN113886080A (en) | High-performance cluster task scheduling method and device, electronic equipment and storage medium | |
| US20220044570A1 (en) | Dispatching provider devices utilizing multi-outcome transportation-value metrics and dynamic provider device modes | |
| CN111275229A (en) | Resource model training method, resource gap prediction method, device and electronic equipment | |
| CN113793195B (en) | Network about vehicle order processing method and device, computer equipment and readable storage medium | |
| CN111798283A (en) | Order distribution method and device, electronic equipment and computer readable storage medium | |
| Zinnen et al. | Deadline constrained scheduling in hybrid clouds with Gaussian processes | |
| CN111833119A (en) | Order allocation method and device, electronic equipment and storage medium | |
| JP7453131B2 (en) | Dispatch system and vehicle candidate display method | |
| WO2022164511A1 (en) | System and method for evaluation of a route score for an electric vehicle and electric vehicle fleets | |
| KR101831003B1 (en) | Method and apparatus for scheduling a relocation of vehicles using a genetic algorithm in a car sharing system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |