CN109961158B - Reservation order distribution method and reservation order distribution device - Google Patents
Reservation order distribution method and reservation order distribution device Download PDFInfo
- Publication number
- CN109961158B CN109961158B CN201711421035.2A CN201711421035A CN109961158B CN 109961158 B CN109961158 B CN 109961158B CN 201711421035 A CN201711421035 A CN 201711421035A CN 109961158 B CN109961158 B CN 109961158B
- Authority
- CN
- China
- Prior art keywords
- reservation
- time
- reserved
- target vehicle
- preset
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 42
- 238000004590 computer program Methods 0.000 claims description 3
- 230000005540 biological transmission Effects 0.000 claims description 2
- 238000004364 calculation method Methods 0.000 claims description 2
- 238000010586 diagram Methods 0.000 description 14
- 230000004044 response Effects 0.000 description 3
- 230000006978 adaptation Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 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/02—Reservations, e.g. for tickets, services or events
-
- 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
-
- 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)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Marketing (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Accounting & Taxation (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Finance (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The embodiment of the invention relates to the technical field of network taxi booking, in particular to a reservation order distribution method and a reservation order distribution device, wherein the method comprises the following steps: receiving information of a reserved order, wherein the information of the reserved order comprises demand information of preset service; acquiring reserved starting time and a reserved starting position in the information of the reserved order, and determining the time interval between the reserved starting time and the sending time of the reserved order; under the condition that the time interval is smaller than a preset time length, determining a target vehicle meeting a preset condition from non-idle vehicles and idle vehicles which can provide the preset service; and distributing the reserved order to the target vehicle. Through the embodiment of the invention, the successful reservation of the passenger requiring the preset service can be ensured to a great extent, and the vehicle capable of providing the preset service can be provided.
Description
Technical Field
The embodiment of the invention relates to the technical field of network taxi booking, in particular to a reservation order distribution method, a reservation order distribution device, electronic equipment and a computer readable storage medium.
Background
With the increasing maturity of network car booking services, the targeted services provided for the personalized requirements are more and more, but the vehicles capable of providing the targeted servers are only a small part of common vehicles and are relatively scarce. For example, in the beijing area, vehicles capable of providing child seats are a small percentage of all vehicles capable of providing network car booking services.
At present, when a reservation order with personalized requirements is received, the reservation order is directly tried to be distributed to an idle vehicle capable of providing targeted service, if the idle vehicle capable of receiving the reservation order is not inquired, a passenger is prompted to fail to reserve, however, the number of vehicles capable of providing the targeted service is small, and the probability of successful reservation of the passenger is low; however, even if the free vehicle capable of taking orders is inquired and the reservation order is allocated to the free vehicle, the time interval between the time when the passenger sends the reservation order and the reservation departure time in the reservation order may be large, and the probability that the order is cancelled by the vehicle taking orders during the time is also large, that is, the reservation of the passenger may be finally failed.
Therefore, at present, for reservation orders with personalized requirements, the reservation success rate of passengers is difficult to be effectively ensured.
Disclosure of Invention
The embodiment of the invention provides a reservation order distribution method, a reservation order distribution device, electronic equipment and a computer readable storage medium, which are used for solving the defects in the related art.
According to a first aspect of the embodiments of the present invention, there is provided a reservation order distribution method, including:
receiving information of a reserved order, wherein the information of the reserved order comprises demand information of preset service;
acquiring reserved starting time and a reserved starting position in the information of the reserved order, and determining the time interval between the reserved starting time and the sending time of the reserved order;
under the condition that the time interval is smaller than a preset time length, determining a target vehicle meeting a preset condition from non-idle vehicles and idle vehicles which can provide the preset service;
and distributing the reserved order to the target vehicle.
According to a second aspect of the embodiments of the present invention, there is provided a reservation order distribution apparatus including:
the system comprises a receiving unit, a processing unit and a processing unit, wherein the receiving unit is used for receiving information of a reserved order, and the information of the reserved order comprises demand information of preset service;
an acquisition unit, configured to acquire a reserved departure time and a reserved starting point position in the information of the reserved order, and determine a time interval between the reserved departure time and a departure time of the reserved order;
a determining unit, configured to determine, in a case where the time interval is less than a preset time period, a target vehicle that meets a preset condition, from among a non-idle vehicle and an idle vehicle that can provide the preset service;
a distribution unit for distributing the reservation order to the target vehicle.
According to a third aspect of embodiments of the present invention, there is provided an electronic apparatus, including:
a processor;
a memory for storing processor-executable instructions;
wherein the processor is configured to:
receiving information of a reserved order, wherein the information of the reserved order comprises demand information of preset service;
acquiring reserved starting time and a reserved starting position in the information of the reserved order, and determining the time interval between the reserved starting time and the sending time of the reserved order;
under the condition that the time interval is smaller than a preset time length, determining a target vehicle meeting a preset condition from non-idle vehicles and idle vehicles which can provide the preset service;
and distributing the reserved order to the target vehicle.
According to a fourth aspect of embodiments of the present invention, there is provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of:
receiving information of a reserved order, wherein the information of the reserved order comprises demand information of preset service;
acquiring reserved starting time and a reserved starting position in the information of the reserved order, and determining the time interval between the reserved starting time and the sending time of the reserved order;
under the condition that the time interval is smaller than a preset time length, determining a target vehicle meeting a preset condition from non-idle vehicles and idle vehicles which can provide the preset service;
and distributing the reserved order to the target vehicle.
As can be seen from the above embodiments, in the present invention, instead of directly trying to allocate a reserved order to a target vehicle capable of providing a preset service when receiving information of the reserved order, the order allocation is performed when the sending time of the reserved order is closer to the reserved starting time, that is, the time interval is less than the preset time length. And under the condition that the time interval between the sending time of the reserved order and the reserved starting time is smaller, the reserved order is distributed to the target vehicle, and the probability of canceling the order is smaller in the shorter time interval of the target vehicle, so that the passenger can be guaranteed to be reserved successfully to a greater extent.
Further, according to the above-described embodiment, it is possible to determine not only the target vehicle to which the reservation order can be allocated among the vacant vehicles capable of providing the preset service, but also the target vehicle to which the reservation order can be allocated among the non-vacant vehicles capable of providing the preset service, thereby inquiring the target vehicle in a larger range in the case where there are fewer vehicles capable of providing the preset service, so as to further improve the passenger reservation success.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention, as claimed.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the invention and together with the description, serve to explain the principles of the invention.
Fig. 1 is a schematic flow chart illustrating a reservation order distribution method according to an embodiment of the present invention.
Fig. 2 is a schematic flow chart diagram illustrating another reservation order distribution method according to an embodiment of the present invention.
Fig. 3 is a schematic flow chart illustrating still another reservation order distribution method according to an embodiment of the present invention.
Fig. 4 is a schematic flow chart illustrating still another reservation order distribution method according to an embodiment of the present invention.
Fig. 5 is a schematic flow chart illustrating still another reservation order distribution method according to an embodiment of the present invention.
Fig. 6 is a schematic flow chart illustrating still another reservation order distribution method according to an embodiment of the present invention.
Fig. 7 is a schematic flow chart illustrating still another reservation order distribution method according to an embodiment of the present invention.
Fig. 8 is a schematic flow chart illustrating still another reservation order distribution method according to an embodiment of the present invention.
Fig. 9 is a schematic flow chart illustrating still another reservation order distribution method according to an embodiment of the present invention.
Fig. 10 is a schematic block diagram illustrating a reservation order distribution apparatus according to an embodiment of the present invention.
Fig. 11 is a schematic block diagram illustrating another reservation order distribution apparatus according to an embodiment of the present invention.
Fig. 12 is a schematic block diagram illustrating still another reservation order distribution apparatus according to an embodiment of the present invention.
Fig. 13 is a schematic block diagram illustrating still another reservation order distribution apparatus according to an embodiment of the present invention.
Fig. 14 is a schematic block diagram illustrating still another reservation order distribution apparatus according to an embodiment of the present invention.
Fig. 15 is a schematic block diagram illustrating still another reservation order distribution apparatus according to an embodiment of the present invention.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present invention. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the invention, as detailed in the appended claims.
Fig. 1 is a schematic flow chart illustrating a reservation order distribution method according to an embodiment of the present invention, which may be used for a server providing a network car reservation service. As shown in fig. 1, the reservation order distribution method may include the steps of:
step S1, receiving information of a reservation order, wherein the information of the reservation order includes information of a requirement for a preset service.
In one embodiment, the predetermined service may be that the vehicle is provided with a child seat, the driver is able to guide a tour, the driver allows a pet to ride a car, etc. In the reservation order, the passenger can note the reservation starting time, the reservation starting position and the reservation ending position, and can also note the required preset service, and the server can determine the requirement information of the passenger for the preset server from the reservation order after receiving the information of the reservation order.
Step S2, acquiring the reserved departure time and the reserved starting position in the information of the reserved order, determining the time interval between the reserved departure time and the departure time of the reserved order, and executing step S3 if the time interval is less than the preset duration.
And step S3, determining a target vehicle meeting preset conditions from the non-idle vehicles and the idle vehicles which can provide the preset service.
Step S4, the reservation order is distributed to the target vehicle.
In one embodiment, a time interval between the reserved departure time and the departure time of the reserved order (which may be approximately equal to the time when the server receives the information of the reserved order) may be determined, and in the case that the time interval is less than a preset time period, a target vehicle meeting a preset condition is determined among the vehicles capable of providing the preset service, and the reserved order is distributed to the target vehicle.
According to the embodiment, instead of directly attempting to allocate the reservation order to the target vehicle capable of providing the preset service when the information of the reservation order is received, the order allocation is performed when the issuing time of the reservation order is close to the reservation departure time, that is, the time interval is less than the preset time length. For example, if the reserved departure time is 10:00 and the preset time duration is 30 minutes, the order distribution is not performed if the departure time of the reserved order is 9:20, and the order distribution is performed if the departure time of the reserved order is 9: 40. And under the condition that the time interval between the sending time of the reserved order and the reserved starting time is smaller, the reserved order is distributed to the target vehicle, and the probability of canceling the order is smaller in the shorter time interval of the target vehicle, so that the passenger can be guaranteed to be reserved successfully to a greater extent.
Further, according to the present embodiment, it is possible to determine not only a target vehicle to which a reservation order can be allocated among idle vehicles capable of providing a preset service, but also a target vehicle to which a reservation order can be allocated among non-idle vehicles capable of providing a preset service (for example, vehicles that are executing an order), thereby inquiring the target vehicle in a wider range in the case where there are fewer vehicles capable of providing a preset service, so as to further improve the passenger reservation success.
Fig. 2 is a schematic flow chart diagram illustrating another reservation order distribution method according to an embodiment of the present invention. As shown in fig. 2, on the basis of the embodiment shown in fig. 1, the determining of the target vehicle meeting the preset condition includes:
and step S31, determining a vehicle having a distance from the reservation starting point position smaller than a first preset distance, among the non-idle vehicles and the idle vehicles capable of providing the preset service, as a target vehicle.
In one embodiment, the first preset distance may be preset as needed, and when the reservation order is received, the target vehicle may be queried within a range where the distance from the reservation location of the reservation order is less than the first preset distance. Based on this, the range of determining the target vehicle is favorably narrowed, and excessive query time is avoided from being wasted by querying the target vehicle in an excessively large area (for example, in the whole city).
Fig. 3 is a schematic flow chart illustrating still another reservation order distribution method according to an embodiment of the present invention. As shown in fig. 3, on the basis of the embodiment shown in fig. 2, the determining the target vehicle meeting the preset condition further includes:
step S32, calculating the expected duration of the reserved order according to the reserved end position and the reserved initial position in the information of the reserved order;
and step S33, determining vehicles which do not accept other reservation orders in the expected time length in the future as target vehicles in the vehicles with the distance between the reservation starting positions smaller than the first preset distance.
In one embodiment, fewer vehicles can be provided, and thus more reservation orders may be assigned. Therefore, before the preset vehicle can be provided with the allocated order, the expected time length required by the vehicle to complete the reserved order can be determined, if the vehicle already accepts other reserved orders within the expected time length in the future, if the reserved order is accepted again, other reserved orders cannot be executed in time, and the reserved order is not allocated to the vehicle; if the vehicle does not accept other reservation orders within the expected time length in the future, the other reservation orders cannot be executed in time if the vehicle accepts the reservation orders, and the reservation orders can be distributed to the vehicle.
Fig. 4 is a schematic flow chart illustrating still another reservation order distribution method according to an embodiment of the present invention. As shown in fig. 4, on the basis of the embodiment shown in fig. 2, the determining the target vehicle meeting the preset condition further includes:
and step S34, determining, as a target vehicle, a vehicle, of which the sum of the time required for reaching the reservation starting point and the reserved time is less than the first preset time, among the vehicles, of which the distance to the reservation starting point is less than the first preset distance.
In one embodiment, in the vehicles having a distance from the reservation starting position smaller than the first preset distance, although all the vehicles in the range have a distance to the reservation starting position smaller than the first preset distance, the road distances from each vehicle to the reservation starting position are not equal, some vehicles have a longer road distance to the reservation starting position, and even the vehicles may not reach the reservation starting position at the reservation departure time, that is, the time required for the vehicles to reach the reservation starting position is longer than the first preset time.
Therefore, it is possible to further determine the road surface distance of each vehicle to the reserved starting position, and calculate the time required for the vehicle to travel to the reserved starting position based on the road surface distance and the estimated travel speed, and if the sum of the required time and the reserved time (the reserved time may be set as needed) is less than the first preset time, it is possible to determine that the vehicle can reach the reserved starting position before the reserved departure time, so that the reserved order can be allocated to the vehicle to ensure that the reserved order can be executed in time.
It should be noted that the embodiment shown in fig. 4 may be combined with the embodiment shown in fig. 3, wherein step S32 is executed before step S34, or may be executed after step S34.
Fig. 5 is a schematic flow chart illustrating still another reservation order distribution method according to an embodiment of the present invention. As shown in fig. 5, on the basis of the embodiment shown in fig. 2, the determining the target vehicle meeting the preset condition further includes:
a step S35 of specifying a target vehicle having the shortest road surface distance from the current position to the reservation starting point position among the target vehicles;
wherein the assigning the reservation order to the target vehicle comprises:
and step S41, distributing the reservation order to the target vehicle with the shortest road surface distance.
In one embodiment, for a target vehicle whose distance from the reservation starting position is less than the first preset distance, a target vehicle in which the road surface distance from the current position to the reservation starting position is shortest may be further determined, and the reservation order may be assigned to the target vehicle.
The road surface distance from the current position to the reserved starting point position can be directly calculated for the idle vehicle in the target vehicles. For a non-idle vehicle among the above-described target vehicles, the sum of the road surface distance thereof from the current position to the end point of the order being executed and the road surface distance from the end point of the order being executed to the reservation starting point position may be calculated. And further determining the target vehicle with the shortest road surface distance according to the road surface distances from the current position to the reserved starting point position of all the target vehicles.
Therefore, on one hand, the target vehicle distributed with the reservation order can reach the reservation starting position under the condition of consuming as little time as possible, and the target vehicle can reach the reservation starting position with a higher probability even if the target vehicle delays time on the way to the reservation starting position due to the problems of congestion and the like; on the other hand, the cost of the target vehicle driving to the reserved starting point position can be reduced as much as possible, and the cost is saved for the target vehicle.
It should be noted that the embodiment shown in fig. 5 may be combined with the embodiments shown in fig. 3 or fig. 4.
Fig. 6 is a schematic flow chart illustrating still another reservation order distribution method according to an embodiment of the present invention. As shown in fig. 6, on the basis of the embodiment shown in fig. 2, the determining the target vehicle meeting the preset condition further includes:
a step S36 of determining, among the target vehicles, a target vehicle that has a minimum sum of a distance cost from a current position to the reservation starting position and a time cost;
wherein the assigning the reservation order to the target vehicle comprises:
and step S42, allocating the reservation order to the target vehicle with the minimum sum of the costs.
In one embodiment, for a target vehicle whose distance from the reservation starting position is less than a first preset distance, a target vehicle in which a distance cost and a time cost from the current position to the reservation starting position are the smallest may be further determined, and the reservation order may be allocated to the target vehicle.
Accordingly, the cost of the target vehicle to drive to the reserved starting position can be reduced as much as possible, and the cost is saved for the target vehicle.
It should be noted that the embodiment shown in fig. 6 may be combined with the embodiments shown in fig. 3 or fig. 4.
Fig. 7 is a schematic flow chart illustrating still another reservation order distribution method according to an embodiment of the present invention. As shown in fig. 7, on the basis of the embodiment shown in fig. 6, the determining the target vehicle having the smallest sum of the distance cost and the time cost from the current location to the reservation starting location includes:
step S361, calculating a road surface distance from the current position to the reserved starting position of the target vehicle, and a time required to wait after the current position reaches the reserved starting position;
step S362, respectively setting weights for the road distance and the waiting time, and calculating the sum of the distance cost and the time cost of the target vehicle from the current position to the reservation starting position according to the road distance and the waiting time after the weights are set;
and step 363, determining the target vehicle with the minimum sum of the distance cost and the time cost according to the sum of the distance cost and the time cost of each target vehicle.
In one embodiment, the distance cost is primarily related to the road distance of the target vehicle from the current location to the reserved starting location. Therefore, when calculating the distance cost, the road surface distance from the current position to the reserved starting point position can be directly calculated for the free vehicle among the target vehicles. For a non-idle vehicle among the above-described target vehicles, the sum of the road surface distance thereof from the current position to the end point of the order being executed and the road surface distance from the end point of the order being executed to the reservation starting point position may be calculated. And then weighting the road surface distance corresponding to each vehicle according to a first preset weight value to be used as the distance cost.
The time cost is primarily related to the time the target vehicle waits for a passenger after reaching about the starting location. Therefore, in calculating the time cost, for an idle vehicle among the above-described target vehicles, a time difference between the time T1 required for it to travel from the current position to the reserved starting position and the preset time period T0 and the reserved time T ', that is, the time cost SC is T1-T0-T', may be calculated. For the non-idle vehicle among the above-described target vehicles, the time difference between the time T2 required for it to complete the order being executed, the sum of the time T3 required for it to reach the reservation starting point position from the end point of the order being executed, and the preset time period T0 and the reserved time T ', that is, the time cost SC is T2+ T3-T0-T', may be calculated. And then weighting the road surface distance according to a preset weight value to be used as distance cost. And then weighting the time difference value corresponding to each vehicle according to a second preset weight value to be used as the time cost.
Further, for each target vehicle, the distance cost after the distance weighting and the time cost after the weighting may be added to obtain the cost required for the target vehicle to reach the reserved starting point position. The first preset weight and the second preset weight may be set as needed, and the second preset weight may be associated with the first preset weight, for example, the first preset weight is 1, and if the target vehicle travels 1 km every 3 minutes, the second preset weight may be 1/3.
Fig. 8 is a schematic flow chart illustrating still another reservation order distribution method according to an embodiment of the present invention. As shown in fig. 8, on the basis of the embodiment shown in fig. 1, in the case that the time interval is greater than or equal to the preset time length, the method further includes:
step S5, inquiring in historical data, and distributing a historical booking order containing the demand of the preset service to a success rate of a vehicle capable of providing the preset service at a preset duration before the booking departure time and the booking starting point position, if the success rate is less than or equal to a preset probability, executing step S6, and if the probability is greater than the preset probability, executing step S7;
step S6, broadcasting the reservation order to all idle vehicles capable of providing the preset service;
step S7, transmitting reservation success information to the terminal which issued the information of the reservation order, and executing step S3 when the time interval is equal to the preset time length.
In one embodiment, in the case that the time interval between the reserved departure time and the departure time of the reserved order is large, that is, greater than the preset time, the historical data may be queried for a success rate of distributing the historical reserved order including the demand for the preset service to the vehicle capable of providing the preset service at the preset time before the reserved departure time and the reserved starting point position.
If the success rate is higher, namely greater than the preset probability, the reservation order is distributed at the preset time before the reservation starting time, so that the passenger can be guaranteed to reserve the vehicle with higher probability. Therefore, the reservation success information can be transmitted to the terminal sending the information of the reservation order, so that the passenger can timely receive the response on the basis of ensuring that the reservation success can be reserved with higher probability, and the reservation experience is ensured
If the success rate is smaller, that is, smaller than or equal to the preset probability, it is indicated that the reservation order is allocated at the preset time before the reservation departure time, and it is difficult to ensure that the passenger can reserve the vehicle. Therefore, the reservation order can be broadcasted to all idle vehicles capable of providing preset services, so that the response of the idle vehicles can be obtained as soon as possible, the reservation order is distributed to the responded reservation vehicles, and reservation success information is transmitted to the passengers, so that the passengers can receive the response in time, and reservation experience is guaranteed.
Fig. 9 is a schematic flow chart illustrating still another reservation order distribution method according to an embodiment of the present invention. As shown in fig. 9, on the basis of the embodiment shown in fig. 1, the method further includes:
step S8, after determining the target vehicle meeting the preset conditions, if other reservation orders need to be distributed to the target vehicle, determining whether the information of the other reservation orders comprises the demand information of the preset service; if the information does not include the information about the requirement for the preset service, step S4 is executed to allocate the reservation order to the target vehicle.
In one embodiment, in the reservation order distribution process, in addition to distributing the reservation orders requiring the preset service to the target vehicle, the reservation orders not requiring the preset service may be distributed to the target vehicle, however, since the vehicles capable of providing the preset service are rare and the passengers requiring the preset service are rare, when the reservation orders including the requirement information for the preset service and the reservation orders not including the requirement information for the preset service are simultaneously distributed to the target vehicle which is determined to meet the preset condition, the reservation orders including the requirement information for the preset service may be preferentially distributed to the target vehicle, so as to ensure that the passengers requiring the preset service have good riding experience to the maximum extent.
It should be noted that the embodiment shown in fig. 9 may be combined with the embodiment shown in fig. 8.
Corresponding to the embodiment of the reservation order distribution method, the invention also provides an embodiment of a reservation order distribution device.
Fig. 10 is a schematic block diagram illustrating a reservation order distribution apparatus according to an embodiment of the present invention. As shown in fig. 10, the reservation order distribution apparatus includes:
a receiving unit 11, configured to receive information of a reserved order, where the information of the reserved order includes information of a requirement for a preset service;
an obtaining unit 12, configured to obtain a reserved departure time and a reserved starting point position in the information of the reserved order, and determine a time interval between the reserved departure time and a departure time of the reserved order;
a determining unit 13, configured to determine, in a case where the time interval is less than a preset time period, a target vehicle that meets a preset condition, from among a non-idle vehicle and an idle vehicle that can provide the preset service;
an assigning unit 14 for assigning the reservation order to the target vehicle.
Optionally, the determining unit is configured to determine, as the target vehicle, a vehicle whose distance from the reservation starting point position is smaller than a first preset distance, from among a non-idle vehicle and an idle vehicle that can provide the preset service.
Fig. 11 is a schematic block diagram illustrating another reservation order distribution apparatus according to an embodiment of the present invention. As shown in fig. 11, the determination unit 13 includes:
a duration calculating subunit 131, configured to calculate an expected duration for completing the reserved order according to a reserved end position and the reserved start position in the information of the reserved order;
and a vehicle determining subunit 132, configured to determine, as the target vehicle, a vehicle that has not received other reservation orders within the expected time period in the future, among the vehicles whose distance from the reservation starting point position is smaller than a first preset distance.
Optionally, the determining unit is configured to determine, as the target vehicle, a vehicle whose sum of a time required for reaching the reservation starting position and a reserved time is less than a first preset time, among vehicles whose distance from the reservation starting position is less than the first preset distance.
Fig. 12 is a schematic block diagram illustrating still another reservation order distribution apparatus according to an embodiment of the present invention. As shown in fig. 12, the determination unit 13 includes:
a distance determining subunit 133 configured to determine, among the target vehicles, a target vehicle whose road surface distance from the current position to the reservation starting point position is shortest;
wherein the distribution unit 14 is configured to distribute the reservation order to the target vehicle with the shortest road distance.
Optionally, the determination unit is configured to determine, among the target vehicles, a target vehicle in which a sum of a distance cost and a time cost from a current location to the reservation starting location is minimum;
wherein the allocation unit is configured to allocate the reservation order to the target vehicle with the smallest sum of the costs.
Fig. 13 is a schematic block diagram illustrating still another reservation order distribution apparatus according to an embodiment of the present invention. As shown in fig. 13, the determination unit 13 includes:
a calculation subunit 134 configured to calculate a road surface distance from the current position to the reservation starting point position and a time required to wait after the current position to the reservation starting point position by the target vehicle;
a weighting subunit 135, configured to set weights for the road distance and the time required to wait, respectively, and calculate a sum of a distance cost and a time cost of the target vehicle from the current position to the reservation starting position according to the road distance and the time required to wait after the weights are set;
and a determining subunit 136, configured to determine, according to the sum of the distance cost and the time cost of each target vehicle, a target vehicle with the smallest sum of the distance cost and the time cost.
Fig. 14 is a schematic block diagram illustrating still another reservation order distribution apparatus according to an embodiment of the present invention. As shown in fig. 14, the reservation order distribution apparatus further includes:
a query unit 15 configured to query, in the history data, a success rate of distributing a history reservation order including a demand for the preset service to a vehicle capable of providing the preset service at a preset time before the reservation departure time and the reservation starting point position, in a case where the time interval is greater than or equal to a preset time;
the broadcasting unit 16 broadcasts the reservation order to all idle vehicles capable of providing the preset service under the condition that the success rate is less than or equal to the preset probability;
a transmission unit 17 configured to transmit reservation success information to a terminal that issued the information of the reservation order, when the probability is greater than a preset probability;
wherein the allocating unit 14 is further configured to determine a target vehicle meeting a preset condition, among non-idle vehicles and idle vehicles capable of providing the preset service, when the time interval is equal to a preset time.
Fig. 15 is a schematic block diagram illustrating still another reservation order distribution apparatus according to an embodiment of the present invention. As shown in fig. 15, the method further includes:
the information determining unit 18 is configured to, after determining a target vehicle meeting a preset condition, determine whether information of other reservation orders includes information on a requirement for a preset service if the other reservation orders need to be allocated to the target vehicle;
wherein the distribution unit 14 is configured to distribute the reservation order to the target vehicle if the information of the other reservation orders does not include the demand information for the preset service.
With regard to the apparatus in the above-described embodiments, the specific manner in which each unit performs operations has been described in detail in the related method embodiments, and will not be described in detail here.
For the device embodiments, since they substantially correspond to the method embodiments, reference may be made to the partial description of the method embodiments for relevant points. The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units 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 modules can be selected according to actual needs to achieve the purpose of the scheme of the invention. One of ordinary skill in the art can understand and implement it without inventive effort.
An embodiment of the present invention further provides an electronic device, including:
a processor;
a memory for storing processor-executable instructions;
wherein the processor is configured to:
receiving information of a reserved order, wherein the information of the reserved order comprises demand information of preset service;
acquiring reserved starting time and a reserved starting position in the information of the reserved order, and determining the time interval between the reserved starting time and the sending time of the reserved order;
under the condition that the time interval is smaller than a preset time length, determining a target vehicle meeting a preset condition from non-idle vehicles and idle vehicles which can provide the preset service;
and distributing the reserved order to the target vehicle.
An embodiment of the invention is a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of:
receiving information of a reserved order, wherein the information of the reserved order comprises demand information of preset service;
acquiring reserved starting time and a reserved starting position in the information of the reserved order, and determining the time interval between the reserved starting time and the sending time of the reserved order;
under the condition that the time interval is smaller than a preset time length, determining a target vehicle meeting a preset condition from non-idle vehicles and idle vehicles which can provide the preset service;
and distributing the reserved order to the target vehicle.
Other embodiments of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This invention is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the invention and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the invention being indicated by the following claims.
It will be understood that the invention is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the invention is limited only by the appended claims.
Claims (14)
1. A reservation order distribution method, comprising:
receiving information of a reserved order, wherein the information of the reserved order comprises demand information of preset service;
acquiring reserved starting time and a reserved starting position in the information of the reserved order, and determining the time interval between the reserved starting time and the sending time of the reserved order;
determining a vehicle having a distance from the reservation starting point position smaller than a first preset distance as a pre-selected vehicle among non-idle vehicles and idle vehicles capable of providing the preset service under the condition that the time interval is smaller than a preset time length;
determining a target vehicle from the preselected vehicles;
assigning the reservation order to a target vehicle;
the determining a target vehicle from the preselected vehicles comprises: calculating the road surface distance from the current position to the reservation starting position of the target vehicle and the waiting time from the current position to the reservation starting position;
setting weights for the road distance and the time required to wait respectively, and calculating the sum of the distance cost and the time cost of the target vehicle from the current position to the reservation starting position according to the road distance and the time required to wait after the weights are set;
and determining the target vehicle with the minimum sum of the distance cost and the time cost according to the sum of the distance cost and the time cost of each target vehicle.
2. The method of claim 1, wherein said determining a target vehicle from said preselected vehicles further comprises:
calculating the expected duration for completing the reserved order according to the reserved end position and the reserved starting position in the information of the reserved order;
and determining vehicles which do not accept other reservation orders within the expected time length in the future as target vehicles in the pre-selected vehicles with the distance of the reservation starting position smaller than a first preset distance.
3. The method of claim 1, wherein said determining a target vehicle from said preselected vehicles further comprises:
and determining the vehicles with the sum of the time required for reaching the reserved starting position and the reserved time smaller than the first preset time as target vehicles in the pre-selected vehicles with the distance from the reserved starting position smaller than the first preset distance.
4. The method of claim 1, wherein said determining a target vehicle from said preselected vehicles further comprises:
and determining a target vehicle with the shortest road surface distance from the current position to the reserved starting point position in the preselected vehicles.
5. The method according to any one of claims 1 to 4, wherein in case the time interval is greater than or equal to a preset duration, the method further comprises:
querying historical data, and distributing a historical reservation order containing the demand for the preset service to a vehicle capable of providing the preset service according to a preset duration before the reservation starting time and the reservation starting position;
if the success rate is smaller than or equal to a preset probability, broadcasting the reservation order to all idle vehicles capable of providing the preset service;
if the probability is larger than the preset probability, transmitting reservation success information to a terminal sending out the information of the reservation order, and determining a target vehicle meeting preset conditions in non-idle vehicles and idle vehicles capable of providing the preset service when the time interval is equal to the preset time length.
6. The method of any of claims 1 to 4, further comprising:
after a target vehicle is determined from the pre-selected vehicles, if other reservation orders need to be distributed to the target vehicle, determining whether the information of the other reservation orders comprises the demand information of preset services;
and if the reservation order does not contain the requirement information of the preset service, distributing the reservation order to the target vehicle.
7. An order reservation dispensing apparatus, comprising:
the system comprises a receiving unit, a processing unit and a processing unit, wherein the receiving unit is used for receiving information of a reserved order, and the information of the reserved order comprises demand information of preset service;
an acquisition unit, configured to acquire a reserved departure time and a reserved starting point position in the information of the reserved order, and determine a time interval between the reserved departure time and a departure time of the reserved order;
a determination unit configured to determine, as a pre-selected vehicle, a vehicle whose distance from the reservation starting point position is less than a first preset distance, among non-idle vehicles and idle vehicles that can provide the preset service, in a case where the time interval is less than a preset time period;
determining a target vehicle from the preselected vehicles;
a distribution unit configured to distribute the reservation order to the target vehicle;
the determination unit includes: a calculation subunit configured to calculate a road surface distance from a current position to the reservation starting point position of the target vehicle, and a time required to wait after the current position to the reservation starting point position; the weighting subunit is used for respectively setting weights for the road surface distance and the time required to wait, and calculating the sum of the distance cost and the time cost of the target vehicle from the current position to the reservation starting position according to the road surface distance after the weight is set and the time required to wait; and the determining subunit is used for determining the target vehicle with the minimum sum of the distance cost and the time cost according to the sum of the distance cost and the time cost of each target vehicle.
8. The apparatus of claim 7, wherein the determining unit comprises:
the duration calculating subunit is used for calculating the expected duration for completing the reservation order according to the reservation end position and the reservation start position in the information of the reservation order;
and the vehicle determining subunit is used for determining a vehicle which does not accept other reservation orders within the expected time length in the future as a target vehicle in the pre-selected vehicles with the distance of the reservation starting point position smaller than a first preset distance.
9. The apparatus according to claim 7, wherein the determination unit is configured to determine, among preselected vehicles whose distance to the reservation starting position is less than a first preset distance, a vehicle whose sum of a time required to reach the reservation starting position and a reserved time is less than a first preset time as a target vehicle.
10. The apparatus of claim 7, wherein the determining unit comprises:
a distance determining subunit configured to determine, among the preselected vehicles, a target vehicle whose road surface distance from the current position to the reservation starting point position is shortest.
11. The apparatus of any one of claims 7 to 10, further comprising:
the query unit is used for querying historical data under the condition that the time interval is greater than or equal to a preset time length, and distributing a historical reservation order containing the demand of the preset service to a vehicle capable of providing the preset service in the preset time length before the reservation starting time and the reservation starting position;
the broadcasting unit is used for broadcasting the reservation order to all idle vehicles capable of providing the preset service under the condition that the success rate is less than or equal to the preset probability;
the transmission unit is used for transmitting reservation success information to a terminal which sends out the information of the reservation order under the condition that the probability is greater than the preset probability;
the allocation unit is further used for determining a target vehicle meeting a preset condition in non-idle vehicles and idle vehicles capable of providing the preset service when the time interval is equal to a preset time.
12. The apparatus of any one of claims 7 to 10, further comprising:
the system comprises an information determining unit, a service processing unit and a service processing unit, wherein the information determining unit is used for determining whether the information of other reservation orders comprises the demand information of preset services or not if other reservation orders need to be distributed to a target vehicle after the target vehicle is determined from the pre-selected vehicles;
the distribution unit is configured to distribute the reservation order to the target vehicle when the information of the other reservation orders does not include the demand information for the preset service.
13. An electronic device, comprising:
a processor;
a memory for storing processor-executable instructions;
wherein the processor is configured to: receiving information of a reserved order, wherein the information of the reserved order comprises demand information of preset service;
acquiring reserved starting time and a reserved starting position in the information of the reserved order, and determining the time interval between the reserved starting time and the sending time of the reserved order;
under the condition that the time interval is smaller than a preset time length, determining a target vehicle meeting a preset condition from non-idle vehicles and idle vehicles which can provide the preset service;
assigning the reservation order to the target vehicle;
the determining a target vehicle from the preselected vehicles comprises: calculating the road surface distance from the current position to the reservation starting position of the target vehicle and the waiting time from the current position to the reservation starting position;
setting weights for the road distance and the time required to wait respectively, and calculating the sum of the distance cost and the time cost of the target vehicle from the current position to the reservation starting position according to the road distance and the time required to wait after the weights are set;
and determining the target vehicle with the minimum sum of the distance cost and the time cost according to the sum of the distance cost and the time cost of each target vehicle.
14. A computer-readable storage medium, on which a computer program is stored, which program, when executed by a processor, carries out the steps of:
receiving information of a reserved order, wherein the information of the reserved order comprises demand information of preset service;
acquiring reserved starting time and a reserved starting position in the information of the reserved order, and determining the time interval between the reserved starting time and the sending time of the reserved order;
under the condition that the time interval is smaller than a preset time length, determining a target vehicle meeting a preset condition from non-idle vehicles and idle vehicles which can provide the preset service;
assigning the reservation order to the target vehicle; the determining a target vehicle from the preselected vehicles comprises: calculating the road surface distance from the current position to the reservation starting position of the target vehicle and the waiting time from the current position to the reservation starting position;
setting weights for the road distance and the time required to wait respectively, and calculating the sum of the distance cost and the time cost of the target vehicle from the current position to the reservation starting position according to the road distance and the time required to wait after the weights are set;
and determining the target vehicle with the minimum sum of the distance cost and the time cost according to the sum of the distance cost and the time cost of each target vehicle.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711421035.2A CN109961158B (en) | 2017-12-25 | 2017-12-25 | Reservation order distribution method and reservation order distribution device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711421035.2A CN109961158B (en) | 2017-12-25 | 2017-12-25 | Reservation order distribution method and reservation order distribution device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109961158A CN109961158A (en) | 2019-07-02 |
| CN109961158B true CN109961158B (en) | 2022-03-08 |
Family
ID=67020972
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711421035.2A Active CN109961158B (en) | 2017-12-25 | 2017-12-25 | Reservation order distribution method and reservation order distribution device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109961158B (en) |
Families Citing this family (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3757929B1 (en) * | 2018-03-27 | 2023-12-06 | Honda Motor Co., Ltd. | Control device for sharing service, control method, and program |
| CN110322159A (en) * | 2019-07-10 | 2019-10-11 | 金瓜子科技发展（北京）有限公司 | A kind of data processing method and device |
| CN110472836A (en) * | 2019-07-24 | 2019-11-19 | 欧拉信息服务有限公司 | Net about vehicle order processing method, equipment and terminal device |
| CN110570002A (en) * | 2019-08-20 | 2019-12-13 | 南京领行科技股份有限公司 | Reservation list mixed interlinked dispatching method and device based on non-idle travel vehicle |
| CN110852464A (en) * | 2019-08-20 | 2020-02-28 | 南京领行科技股份有限公司 | Reservation list interlinked dispatching method and device based on real-time single-stroke vehicle |
| CN110570003A (en) * | 2019-08-20 | 2019-12-13 | 南京领行科技股份有限公司 | Reservation travel order dispatching method and device based on idle travel vehicle |
| CN111860905A (en) * | 2019-09-27 | 2020-10-30 | 北京嘀嘀无限科技发展有限公司 | Method, system, computer equipment and storage medium for dispatching orders |
| CN112907008A (en) * | 2019-12-04 | 2021-06-04 | 贝壳技术有限公司 | Processing method and device with viewing request, storage medium and equipment |
| CN111598277B (en) * | 2020-04-15 | 2021-09-14 | 杭州优行科技有限公司 | Delivery method and device for reserved delivery piece order, electronic equipment and storage medium |
| CN112116114A (en) * | 2020-09-11 | 2020-12-22 | 中国第一汽车股份有限公司 | Taxi appointment order issuing method, taxi appointment order issuing device, taxi appointment order issuing equipment and storage medium |
| CN112149854A (en) * | 2020-09-28 | 2020-12-29 | 建信金融科技有限责任公司 | Data processing method, device and equipment |
| CN112509164A (en) * | 2020-10-30 | 2021-03-16 | 长沙市到家悠享网络科技有限公司 | Attendance card-punching method, attendance card-punching device, attendance card-punching equipment and storage medium |
| KR20220119819A (en) * | 2021-02-22 | 2022-08-30 | 현대자동차주식회사 | Management server and service mathod for pet care |
| CN113269427B (en) * | 2021-05-19 | 2024-04-05 | 中科美络科技股份有限公司 | Official trip task scheduling management method and system |
| CN113469514B (en) * | 2021-06-25 | 2024-03-08 | 广州宸祺出行科技有限公司 | Network appointment vehicle dispatching method and device based on appointment orders and electronic equipment |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101826256A (en) * | 2010-04-29 | 2010-09-08 | 联华电信股份有限公司 | Vehicle dispatching method and vehicle dispatching system |
| CN105761482A (en) * | 2016-05-10 | 2016-07-13 | 北京交通大学 | Taxi real-time appointing method and system based on fairness |
| CN107464001A (en) * | 2016-06-06 | 2017-12-12 | 滴滴（中国）科技有限公司 | Confirmation slip distributes processing method and server |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104766467A (en) * | 2010-11-23 | 2015-07-08 | 互动网数位科技股份有限公司 | Taxi-calling system with pairing function and method thereof |
-
2017
- 2017-12-25 CN CN201711421035.2A patent/CN109961158B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101826256A (en) * | 2010-04-29 | 2010-09-08 | 联华电信股份有限公司 | Vehicle dispatching method and vehicle dispatching system |
| CN105761482A (en) * | 2016-05-10 | 2016-07-13 | 北京交通大学 | Taxi real-time appointing method and system based on fairness |
| CN107464001A (en) * | 2016-06-06 | 2017-12-12 | 滴滴（中国）科技有限公司 | Confirmation slip distributes processing method and server |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109961158A (en) | 2019-07-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109961158B (en) | Reservation order distribution method and reservation order distribution device | |
| CN110832512B (en) | System and method for reducing latency in providing transport services | |
| US20210192423A1 (en) | System and method for driver selection | |
| US20190057312A1 (en) | Method and system for providing transportation service | |
| CN107464001B (en) | Reservation ticket distribution processing method and server | |
| CN110570003A (en) | Reservation travel order dispatching method and device based on idle travel vehicle | |
| US20190057475A1 (en) | System and method for predicting wait time | |
| CN111526170B (en) | Push method, display method, device, server, terminal and storage medium | |
| CN107784412B (en) | Automatic order matching processing method and server | |
| JP2019219759A (en) | Shared vehicle management system | |
| KR20130130978A (en) | System and method for allocating call tax based on recommending of course | |
| CN115641704A (en) | Intelligent bus scheduling method and system | |
| CN114372714A (en) | Automatic vehicle allocation method, device, equipment, medium and program product | |
| CN112669116A (en) | Order processing method and device, electronic equipment and readable storage medium | |
| CN113516332A (en) | Information processing apparatus, non-transitory storage medium, and evaluation method | |
| CN110276628B (en) | Order processing method and device | |
| CN111178558B (en) | Network appointment order processing method and device, computer equipment and readable storage medium | |
| CN113632151B (en) | Information providing system and information providing method | |
| CN109543862A (en) | Network about vehicle order allocation method and network about vehicle Order splitting device | |
| CN109215369B (en) | Control method, device, equipment and network equipment of ADAS system | |
| CN111860905A (en) | Method, system, computer equipment and storage medium for dispatching orders | |
| CN113129102B (en) | Delayed order dispatching method and device, electronic equipment and storage medium | |
| CN114493236A (en) | Service vehicle assignment method, service vehicle assignment device, service vehicle assignment apparatus, service vehicle assignment medium, and program product | |
| CN113614802B (en) | Information providing system and information providing method | |
| CN110753073B (en) | Information pushing method, device, equipment and computer readable storage medium |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |