CN110853333A - Reservation order dispatching method and device based on real-time single-stroke vehicle - Google Patents
Reservation order dispatching method and device based on real-time single-stroke vehicle Download PDFInfo
- Publication number
- CN110853333A CN110853333A CN201910770386.7A CN201910770386A CN110853333A CN 110853333 A CN110853333 A CN 110853333A CN 201910770386 A CN201910770386 A CN 201910770386A CN 110853333 A CN110853333 A CN 110853333A
- Authority
- CN
- China
- Prior art keywords
- time
- real
- vehicle
- order
- reservation
- 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.)
- Withdrawn
Links
- 238000000034 method Methods 0.000 title claims abstract description 48
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 26
- 238000001914 filtration Methods 0.000 claims description 30
- 238000004364 calculation method Methods 0.000 claims description 14
- 238000005457 optimization Methods 0.000 claims description 10
- 239000011159 matrix material Substances 0.000 claims description 9
- 230000007774 longterm Effects 0.000 claims description 8
- 230000006399 behavior Effects 0.000 claims description 5
- 238000010606 normalization Methods 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 10
- 230000008569 process Effects 0.000 description 8
- 238000004590 computer program Methods 0.000 description 7
- 230000029305 taxis Effects 0.000 description 5
- 230000006870 function Effects 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 238000003860 storage Methods 0.000 description 3
- 230000005611 electricity Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 230000006698 induction Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/20—Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles
- G08G1/205—Indicating the location of the monitored vehicles as destination, e.g. accidents, stolen, rental
-
- 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
- G06Q10/025—Coordination of plural reservations, e.g. plural trip segments, transportation combined with accommodation
-
- 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/06311—Scheduling, planning or task assignment for a person or group
- G06Q10/063112—Skill-based matching of a person or a group to a task
-
- 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)
- Tourism & Hospitality (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Economics (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Development Economics (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Traffic Control Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a method and a device for dispatching reservation orders based on real-time single-stroke vehicles, which are applied to a server of a trip taxi taking system, in particular to acquisition of reservation trip orders; acquiring a plurality of real-time single-stroke vehicles according to the real-time positions of the vehicles and the current real-time single-terminal position; pushing medium and long reservation orders of the reserved travel orders to a plurality of real-time single-stroke vehicles in a broadcasting mode; removing real-time single-travel vehicles with the current real-time reservation list conflicting with the reservation time of the short-time reservation list; removing real-time single-stroke vehicles with the comprehensive order receiving time being longer than the preset time; calculating a short-time reservation list and a real-time single-stroke vehicle through a greedy algorithm to obtain a target vehicle; and sending the reserved travel order to the target vehicle. Through the scheme, even under the condition that no idle trip vehicle exists currently, the reservation sheets can be distributed to the corresponding real-time single-trip vehicles, so that the use experience of a user is improved.
Description
Technical Field
The invention relates to the technical field of network booking vehicles, in particular to a booking order dispatching method and device based on a real-time single-stroke vehicle.
Background
Generally, taxis can be divided into touring taxis and network reservation taxis, wherein the touring taxis are usually touring on the road, and the touring taxis stop to provide transportation services for passengers; the automobile rented by network reservation provides transportation service for passengers by a mode of ordering and receiving orders through the network. The network taxi appointment is a short for network taxi appointment.
When the vehicle is in a peak time period such as commuting, almost all vehicles are in a service state, so that the passenger can not be dispatched based on the dispatching method of the idle-trip vehicle, the passenger needing service and sending the reservation order can not use the vehicle, and the service experience of the user is poor.
Disclosure of Invention
In view of the above, the invention provides a reservation order dispatching method and device based on a real-time single-trip vehicle, so as to improve the service experience of a user.
In order to solve the problems, the invention discloses an appointment order sending method based on a real-time single-trip vehicle, which is applied to a server of a trip taxi taking system, and comprises the following steps:
acquiring an appointed travel order;
acquiring a plurality of real-time single-stroke vehicles according to the real-time positions of the vehicles and the current real-time single-terminal position;
judging whether the travel reservation order is a long-time reservation order or a short-time reservation order;
if the reserved travel order is the long-term reservation order, pushing the long-term reservation order to the plurality of real-time single-stroke vehicles in a broadcasting mode;
removing real-time single-trip vehicles with the current real-time reservation list conflicting with the reservation time of the short-time reservation list;
removing real-time single-stroke vehicles with the comprehensive order receiving time being greater than a preset time length, wherein the preset time length is equal to the sum of the current time subtracted from the appointment time of the short-time appointment order and a preset time delay threshold value;
performing optimization calculation on the short-time reservation list and the vehicle information of the real-time single-trip vehicle through a greedy algorithm, and determining a target vehicle from the plurality of real-time single-trip vehicles;
and sending the short-time reservation list to the target vehicle.
Optionally, the obtaining of the real-time travel order includes:
pulling all outgoing orders in a preset time length from an order pool of the server every other preset time length;
and selecting the reserved travel orders from all the travel orders according to the time parameters of the travel orders.
Optionally, the obtaining a plurality of real-time single-trip vehicles according to the real-time positions of the vehicles and the current real-time single-end positions thereof includes:
acquiring real-time positions of a plurality of vehicles and current real-time single terminal positions;
and calculating the real-time distance between the real-time position and the current real-time single-end-point position, and determining the vehicle with the real-time distance smaller than a preset distance threshold value as the real-time single-travel vehicle.
Optionally, the method for acquiring a plurality of real-time single-trip vehicles according to the real-time position of the vehicle and the current real-time single-end position further includes the steps of:
and removing the real-time single-stroke vehicles of which the types are not matched with the specified vehicle type of the short-time reservation list from the plurality of real-time single-stroke vehicles.
Optionally, the method for acquiring a plurality of real-time single-trip vehicles according to the real-time position of the vehicle and the current real-time single-end position further includes the steps of:
and removing the real-time single-trip vehicles of which the drivers make the pre-specified rejection behaviors from the plurality of real-time single-trip vehicles.
Optionally, the method for acquiring a plurality of real-time single-trip vehicles according to the real-time position of the vehicle and the current real-time single-end position further includes the steps of:
and removing real-time single-trip vehicles with residual trips not matched with the actual trips of the short-time reservation list from the plurality of real-time single-trip vehicles.
Optionally, the performing optimized calculation on the short-time reservation ticket and the vehicle information of the real-time one-trip vehicle through a greedy algorithm includes:
constructing a vehicle-order matrix, wherein the vehicle-order matrix comprises a vehicle set and a reservation order set and further comprises a distance parameter corresponding to each real-time single-trip vehicle in the vehicle set and each short-time reservation single-phase in the reservation order set, and the distance parameter is the reciprocal of the distance between the current position of the real-time single-trip vehicle subjected to normalization processing and the starting position of the short-time reservation order;
and aiming at each short-time reservation list, selecting the target vehicle from the vehicle set by utilizing a greedy algorithm.
The utility model provides an reservation order group device based on real-time single stroke vehicle, is applied to the server of trip system of taking a taxi, reservation order group device includes:
the order acquisition module is configured to acquire an appointed travel order;
a vehicle acquisition module configured to acquire a plurality of real-time single-trip vehicles according to real-time positions of the vehicles and current real-time single-terminal positions;
the first pushing module is configured to judge whether the reserved travel order is a long-time reservation order or a short-time reservation order; if the reserved travel order is the long-time reservation order, pushing the long-time reservation order to the plurality of real-time single-trip vehicles in a broadcasting mode;
the conflict filtering module is configured to eliminate real-time single-trip vehicles with current real-time tickets conflicting with the reservation time of the short-time reservation tickets;
the time delay filtering module is configured to reject real-time single-stroke vehicles with comprehensive order receiving time larger than preset time length, wherein the preset time length is equal to the sum of the current time subtracted from the appointment time of the short-time appointment order and a preset time delay threshold value;
the optimization calculation module is configured to perform optimization calculation on the short-time reservation list and the vehicle information of the real-time single-trip vehicles through a greedy algorithm, and determine a target vehicle from the plurality of real-time single-trip vehicles;
a second push module configured to send the short-time reservation ticket to the target vehicle.
Optionally, the order obtaining module includes:
the first obtaining unit is configured to pull all travel orders within a preset time length from an order pool of the server every other preset time length;
a first filtering unit configured to pick out the reserved travel order from all the travel orders according to the time parameter of the travel order.
Optionally, the vehicle acquisition module includes:
a second acquisition unit configured to acquire real-time positions of a plurality of vehicles and current real-time single-end-point positions;
and the second filtering unit is configured to calculate a real-time distance between the real-time position and the current real-time single-end position, and determine the vehicle with the real-time distance smaller than a preset distance threshold value as the real-time single-stroke vehicle.
Optionally, the vehicle obtaining module further includes:
a third filtering unit configured to remove real-time one-trip vehicles of a type not matching the specified vehicle type of the short-time reservation ticket from the plurality of real-time one-trip vehicles.
Optionally, the vehicle obtaining module further includes:
a fourth filtering unit configured to eliminate real-time single-trip vehicles, of which drivers make a predefined rejection, from the plurality of real-time single-trip vehicles.
Optionally, the vehicle obtaining module further includes:
a fifth filtering unit configured to remove real-time one-trip vehicles, of which remaining trips do not match the actual trips of the short-time reservation ticket, from the plurality of real-time one-trip vehicles.
According to the technical scheme, the invention provides a reservation order dispatching method and device based on a real-time single-stroke vehicle, which are applied to a server of a trip taxi taking system, in particular to acquisition of a reserved trip order; acquiring a plurality of real-time single-stroke vehicles according to the real-time positions of the vehicles and the current real-time single-terminal position; judging whether the reserved travel order is a long-time reservation order or a short-time reservation order, and pushing the long-time reservation order to a plurality of real-time single-stroke vehicles in a broadcasting mode; removing real-time single-stroke vehicles with the conflict between the reservation time of the current real-time order and the reservation time of the short-time reservation order; removing real-time single-stroke vehicles with the comprehensive order receiving time being greater than the preset time length, wherein the preset time length is equal to the sum of the current time subtracted from the appointment time of the short-time appointment order and a preset time delay threshold value; optimizing and calculating vehicle information of the short-time reservation list and the real-time single-trip vehicle through a greedy algorithm, and obtaining a target vehicle from a plurality of real-time single-trip vehicles; and sending the real-time travel order to the target vehicle. Through the scheme, even under the condition that no idle trip vehicle exists currently, the reservation sheet can be distributed to the corresponding real-time single-trip vehicle, so that the use experience of the user is improved.
In addition, corresponding vehicles are selected from the vehicle set as target vehicles through a greedy algorithm for corresponding short-time reservation lists in the method and the system, and the lists are not simply sent based on the distance between the vehicles, so that the problem that no vehicles can be sent is solved, the overall efficiency is improved, and the service experience of users is correspondingly improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a flow chart of a real-time single-trip vehicle-based reservation order dispatch method according to an embodiment of the present application;
fig. 2 is a block diagram of an apparatus for delivering reservation orders based on real-time single-trip vehicles according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Example one
Fig. 1 is a flowchart of an appointment dispatch method based on a real-time single-trip vehicle according to an embodiment of the present application.
As shown in fig. 1, the reservation order dispatching method provided by the embodiment is applied to a server of a trip taxi taking system, and is used for ordering passengers and providing a dispatching scheme for dispatching taxi vehicles. The real-time one-trip vehicle is a contracted vehicle belonging to the trip taxi-taking system and is in a service state at the present time, that is, a state in which a taxi service is being provided to a passenger, and the vehicle is not limited to an electric vehicle and may include a hybrid vehicle. The real-time order dispatching method specifically comprises the following steps:
and S1, acquiring the reserved travel order.
The reserved travel order refers to a travel order which is currently issued by a passenger needing to provide the car rental service and needs to be obtained in the future. When a passenger sends a corresponding order, the passenger generally sends electronic information to a server of the trip taxi taking system through the mobile terminal. The reserved travel order may include corresponding location information that may indicate the specific location of the passenger placing the travel order.
Since the travel orders received by the server include the real-time travel orders and the reserved travel orders, the obtaining of the reserved travel orders is specifically realized by the following operations:
firstly, pulling all travel orders generated in the time period from an order pool of the server every preset time period, such as every 2 seconds, wherein the travel orders comprise real-time travel orders and reserved travel orders, and whether a specific travel order is a real-time travel order or a reserved travel order can be determined through additional information of the order or the type of the order; and after all travel orders in the time are pulled, judging according to additional information in the travel orders or the types of the orders, and selecting all reserved travel orders from the travel orders through judgment.
And S2, acquiring a plurality of real-time single-trip vehicles according to the positions of the vehicles and the starting positions of the reservation sheets.
Namely, under the condition that no idle travel vehicle exists currently, the real-time single-travel vehicle in the preset range based on the position information is obtained according to the position information of the corresponding real-time travel order. The preset range may be determined according to actual conditions, such as a block with the location information as a basic point, a range within a certain spatial scale, or a city.
In the process of acquiring a plurality of real-time single-stroke vehicles, firstly, acquiring real-time positions of the plurality of vehicles and current real-time single-terminal positions according to the position information, wherein the vehicles are vehicles which have signed a contract with a travel taxi taking system in advance; and then calculating the distance between the real-time position and the current real-time single-end position, and determining the vehicle with the distance smaller than a preset distance threshold value as the selected real-time single-stroke vehicle. The distance threshold value can be a fixed value, such as 3-10 km, or a variable value determined according to the current congestion condition.
In addition, after acquiring a plurality of real-time single-trip vehicles, the method may further include some or all of the following steps, and the following sequence of the steps does not represent the sequence.
And S01, removing real-time single-trip vehicles of which the types are not matched with the appointed vehicle type of the reserved travel order.
Generally, a travel order sent by a passenger sometimes provides a vehicle type required by the passenger, namely, the vehicle type requirement is included, and the use experience of the passenger is reduced if the requirement of the passenger cannot be met, so that after all real-time single-stroke vehicles are determined, all real-time single-stroke vehicles are filtered according to a specified vehicle type in the travel order, and if one or some vehicles are not matched with the specified vehicle type, the vehicles are removed and then optimized and calculated, so that the vehicle type definitely rejected by the passenger can be prevented from participating in calculation.
And S02, removing the real-time single-trip vehicle of which the driver does the pre-specified rejection.
After all real-time single-trip vehicles are determined, if drivers of the vehicles make a pre-specified rejection behavior, such as the previous unproblematic rejection or a limited number of times of rejection in a certain time, the vehicles can be rejected, and then optimization calculation is carried out, so that the problem that the vehicles are pushed to a reservation order to influence the use of passengers can be avoided.
And S03, removing real-time single-stroke vehicles with residual strokes incapable of meeting the order requirements.
In the process of selecting all real-time single-stroke vehicles, the remaining stroke information of each vehicle is received at the same time, the stroke requirement of the corresponding reserved travel order is judged, and the vehicles with the remaining strokes which cannot meet the stroke requirement are removed, so that the influence of stopping in midway on the travel of passengers is avoided.
The vehicle in the present application is generally a pure electric vehicle, and therefore, the remaining range refers to a range that can be supported by the remaining amount of electricity of the vehicle. The remaining distance is directly related to the remaining capacity, as well as to the road environment currently in operation, such as a congestion situation.
And S3, judging the long-time reservation order and broadcasting and pushing the long-time reservation order.
After the real-time single-trip vehicle is determined, whether the corresponding reserved travel order is a long-time reservation order or a short-time reservation order is determined through judgment of the reserved time information, the two reservation orders are divided according to the length of the reserved vehicle time pointed by the reserved time information and the current time, namely the long-time reservation order is judged through a preset time threshold, the time threshold can be one day or one week, and the time thresholds determined according to the principle are within the protection range of the application.
For the long-term reservation order in the real-time single-trip vehicle, because no conflict is generated with the current order state of the real-time single-trip vehicle, the real-time reservation order can be pushed to all the real-time single-trip vehicles in a broadcasting mode, and drivers of the real-time single-trip vehicles can receive the order or reject the order at any time.
And S4, eliminating the real-time single-trip vehicles with the conflict between the reservation time of the current real-time reservation list and the reservation time of the short-time reservation list.
For short-time reservation tickets, further filtering of real-time single-trip vehicles is required. If the time of a real-time single-trip vehicle conflicts with the time of the short-time reservation list, for example, the real-time single-trip vehicle cannot arrive at the position specified by the short-time reservation list in a short time, the real-time single-trip vehicle is rejected.
And S5, removing the real-time single-stroke vehicles with overlong comprehensive order receiving time.
In order to avoid long-time waiting of passengers, real-time single-stroke vehicles with overlong comprehensive order receiving time need to be removed, and the vehicles with the comprehensive order receiving time exceeding a preset time length are removed during specific operation, wherein the preset time length is obtained by subtracting the current time from the reservation time of a short-time reservation order and adding a preset time length threshold value, and the preset time length threshold value can be determined according to actual conditions.
And S6, matching the target vehicle according to the greedy algorithm.
The method comprises the steps of calculating a short-time reservation list in a reserved travel order and vehicle information of a selected real-time single-trip vehicle according to a greedy algorithm, and finding out the real-time single-trip vehicle which is most matched with the short-time reservation list from a plurality of real-time single-trip vehicles as a target vehicle.
Specifically, a vehicle-order matrix is firstly constructed, when the vehicle-order matrix is constructed, a plurality of short-time reservation orders are firstly obtained, so that a reservation order set O is constructed, and for each short-time reservation order O, a candidate vehicle set D is obtained by selecting the current positions of a plurality of real-time one-trip vehicles D according to the starting position distance of the short-time reservation order. The reservation list set and the vehicle set are used as two dimensions to form the vehicle-order matrix, the matrix further comprises reciprocals of distances between the starting position of each short-time reservation list and the current position of each real-time single-trip vehicle, and after the reciprocals are obtained, the reciprocals are subjected to normalization processing to serve as distance parameters v between the corresponding short-time reservation list and the corresponding real-time single-trip vehicle, and the parameters are specifically shown in table 1.
| d1 | d2 | d3 | d4 | d5 | d6 | |
| o1 | v＝0.2 | 0.5 | 0.6 | 0.8 | 0.7 | 0.8 |
| o2 | 0.1 | 0.6 | 0.7 | 0.7 | 0.2 | 0.2 |
| o3 | 0.6 | 0.4 | 0.5 | 0.3 | 0.1 | 0.7 |
TABLE 1
After the vehicle-order matrix is obtained, for each short-time reservation list, selecting from a vehicle set by using a greedy algorithm, namely calculating the corresponding short-time reservation list, the corresponding real-time single-trip vehicle and distance parameters between the short-time reservation list and the corresponding real-time single-trip vehicle by using the greedy algorithm to obtain a target vehicle.
Specifically, screening is started from the order o1, and d4(0.8) and d6(0.8) are selected; o2 then continues to select, selecting d3(0.7), d4(0.7), but d4 has been selected by o1, at which time d2(0.6) is selected; finally o3 chooses, d1(0.6), d6(0.7), without conflict.
The greedy algorithm means that the overall optimal solution of the solved problem can be achieved through a series of local optimal choices, namely greedy choices. The method is the first basic element of the greedy algorithm and is the main difference between the greedy algorithm and the dynamic programming algorithm.
The greedy algorithm is used for making successive selection from top to bottom in an iterative method, and the problem to be solved is simplified into a sub-problem with smaller scale every time the greedy selection is made. To determine whether a particular problem is characterized by greedy choices, we must demonstrate that the greedy choices made at each step ultimately yield the best solution to the problem.
Usually, an overall optimal solution of the problem can be firstly proved, which starts from greedy selection, and after greedy selection, the original problem is simplified into a similar subproblem with smaller scale. Then, a mathematical induction method is used for proving that an overall optimal solution of the problem can be finally obtained through greedy selection at each step.
And S7, sending the short-time reservation list to the target vehicle.
After the target vehicle is determined, a corresponding short-time reservation order is sent to the target vehicle so that the target vehicle serves the passenger who sent the order. Sending to the target vehicle actually means sending the real-time outgoing order to a mobile device on the target vehicle, such as a mobile phone held by a driver or a vehicle machine of the vehicle.
As can be seen from the above technical solutions, the embodiment provides a reservation order dispatching method based on a real-time single-trip vehicle, which is applied to a server of a travel taxi taking system, specifically, for acquiring a reservation travel order; acquiring a plurality of real-time single-stroke vehicles according to the real-time positions of the vehicles and the current real-time single-terminal position; judging whether the reserved travel order is a long-time reservation order or a short-time reservation order, and pushing the long-time reservation order to a plurality of real-time single-stroke vehicles in a broadcasting mode; removing real-time single-travel vehicles with the current real-time reservation list conflicting with the reservation time of the short-time reservation list; removing real-time single-trip vehicles with the comprehensive order receiving time being greater than a preset time length, wherein the preset time length is equal to the sum of the current time subtracted from the reservation time of the short-time reservation order and a preset time delay threshold value; optimizing and calculating vehicle information of the short-time reservation list and the real-time single-trip vehicle through a greedy algorithm, and obtaining a target vehicle from a plurality of real-time single-trip vehicles; and sending the real-time trip order to the target vehicle. Through the scheme, even under the condition that no idle trip vehicle exists currently, the reservation sheets can be distributed to the corresponding real-time single-trip vehicles, so that the use experience of a user is improved.
In addition, corresponding vehicles are selected from the vehicle set as target vehicles through a greedy algorithm for corresponding short-time reservation lists in the method and the system, and the lists are not simply sent based on the distance between the vehicles, so that the problem that no vehicles can be sent is solved, the overall efficiency is improved, and the service experience of users is correspondingly improved.
Example two
Fig. 2 is a block diagram of an apparatus for delivering reservation orders based on real-time single-trip vehicles according to an embodiment of the present application.
As shown in fig. 2, the reservation order dispatching device provided in this embodiment is applied to a server of a trip taxi-taking system, and can be understood as a functional module of an actual electronic device or server, and is used for issuing an order for a passenger and dispatching an order to a taxi. The real-time one-trip vehicle is a contracted vehicle belonging to the travel taxi-taking system and is in a service state at the present time, that is, a state in which a taxi renting service is being provided to a passenger. The real-time order dispatching device specifically comprises an order obtaining module 10, a vehicle obtaining module 20, a first pushing module 30, a conflict filtering module 40, a time delay filtering module 50, an optimization calculating module 60 and a second pushing module 70.
The order obtaining module 10 is configured to obtain an order for an appointment trip.
The reserved travel order refers to a travel order which is currently issued by a passenger needing to provide the car rental service and needs to be obtained in the future. When a passenger sends a corresponding order, the passenger generally sends electronic information to a server of the trip taxi taking system through the mobile terminal. The reserved travel order may include corresponding location information that may indicate the specific location of the passenger placing the travel order.
The travel orders received by the server include real-time travel orders and reserved travel orders, so the order acquisition module specifically includes a first acquisition unit and a first filtering unit.
The first obtaining unit is configured to pull all travel orders generated in the time period every preset time period, for example, every 2 seconds, from the order pool of the server, where the pull includes a real-time travel order and an ordered travel order, and whether a specific travel order is a real-time travel order or an ordered travel order may be determined according to additional information of the order itself or a type of the order itself; the first filtering unit is used for judging according to additional information in the travel orders or types of the travel orders after the first obtaining unit pulls all travel orders in the period of time, and selecting all reserved travel orders from the travel orders through judgment.
The vehicle obtaining module 20 is configured to obtain a plurality of real-time single-trip vehicles according to the real-time positions of the vehicles and the current real-time single-end positions.
Namely, under the condition that no idle travel vehicle exists currently, the real-time single-travel vehicle in the preset range based on the position information is obtained according to the position information of the real-time travel order. The preset range may be determined according to actual conditions, such as a block with the location information as a base point, a range within a certain spatial scale, or a city.
The module comprises a second acquisition unit and a second filtering unit, wherein in the process of acquiring a plurality of real-time single-stroke vehicles, the second acquisition unit is used for acquiring the real-time positions and the current real-time single-terminal positions of the plurality of vehicles, wherein the vehicles are vehicles which have been signed with a travel taxi taking system in advance; the second filtering unit is used for calculating the distance between the real-time position and the current real-time single-end position, and determining the vehicle with the distance smaller than a preset distance threshold value as the selected real-time single-stroke vehicle. The distance threshold value can be a fixed value, such as 3-10 km, or a variable value determined according to the current congestion condition.
In addition, the vehicle obtaining module in the application further comprises a part or all of the third filtering unit, the fourth filtering unit and the fifth filtering unit, and the sequence of the units does not represent the sequence.
The third filtering unit is used for eliminating real-time single-stroke vehicles of which the types are not matched with the appointed vehicle type of the reserved travel order.
Generally, a travel order sent by a passenger sometimes provides a vehicle type required by the passenger, namely, the vehicle type requirement is included, and the use experience of the passenger is reduced if the requirement of the passenger cannot be met, so that after all real-time single-stroke vehicles are determined, all real-time single-stroke vehicles are filtered according to a specified vehicle type in the travel order, and if one or some vehicles are not matched with the specified vehicle type, the vehicles are removed and then optimized and calculated, so that the vehicle type definitely rejected by the passenger can be prevented from participating in calculation.
The fourth filtering unit is used for rejecting real-time single-trip vehicles of which drivers do preset rejection behaviors.
After all real-time single-trip vehicles are determined, if drivers of the vehicles make a pre-specified rejection behavior, such as the previous unproblematic rejection or the rejection of a limited number of times within a certain time, the vehicles can be removed, and then optimization calculation is carried out, so that the problem that the vehicles with problems are pushed to reserve trip orders to influence the use of passengers can be avoided.
And the fifth filtering unit is used for eliminating real-time single-stroke vehicles with residual strokes which cannot meet the order requirements.
In the process of selecting all real-time single-stroke vehicles, the remaining stroke information of each vehicle is received at the same time, the stroke requirement of the corresponding reserved travel order is judged, and the vehicles with the remaining strokes which cannot meet the stroke requirement are removed, so that the influence of stopping in midway on the travel of passengers is avoided.
The vehicle in the present application is generally a pure electric vehicle, and therefore, the remaining range refers to a range that can be supported by the remaining amount of electricity of the vehicle. The remaining distance is directly related to the remaining capacity, as well as to the road environment currently in operation, such as a congestion situation.
The first pushing module 30 is configured to determine the long-term reservation order and broadcast and push the long-term reservation order.
After the real-time single-trip vehicle is determined, whether the corresponding reserved travel order is a long-time reservation order or a short-time reservation order is determined through judgment of the reserved time information, the two reservation orders are divided according to the length of the reserved vehicle time pointed by the reserved time information and the current time, namely the long-time reservation order is judged through a preset time threshold, the time threshold can be one day or one week, and the time thresholds determined according to the principle are within the protection range of the application.
For the long-term reservation order in the real-time single-trip vehicle, because no conflict is generated with the current order state of the real-time single-trip vehicle, the real-time reservation order can be pushed to all the real-time single-trip vehicles in a broadcasting mode, and drivers of the real-time single-trip vehicles can receive the order or reject the order at any time.
The conflict filtering module 40 is used for eliminating real-time single-trip vehicles with conflict between the current real-time reservation list and the reservation time of the short-time reservation list.
For short-time reservation tickets, further filtering of real-time single-trip vehicles is required. If the time of a real-time single-trip vehicle conflicts with the time of the short-time reservation list, for example, the real-time single-trip vehicle cannot arrive at the position specified by the short-time reservation list in a short time, the real-time single-trip vehicle is rejected.
The time delay filtering module 50 is used for eliminating real-time single-stroke vehicles with overlong comprehensive order receiving time.
In order to avoid long-time waiting of passengers, real-time single-stroke vehicles with overlong comprehensive order receiving time need to be removed, and the vehicles with the comprehensive order receiving time exceeding a preset time length are removed during specific operation, wherein the preset time length is obtained by subtracting the current time from the reservation time of a short-time reservation order and adding a preset time length threshold value, and the preset time length threshold value can be determined according to actual conditions.
The optimization calculation module 60 is configured to perform calculation according to a greedy algorithm to obtain a target vehicle.
The method comprises the steps of performing optimization calculation on a reserved travel order and vehicle information of a selected real-time single-stroke vehicle according to a greedy algorithm, and finding out a real-time single-stroke vehicle which is most matched with the real-time travel order from a plurality of real-time single-stroke vehicles as a target vehicle.
The second pushing module 70 is used for sending the real-time travel order to the target vehicle.
After the target vehicle is determined, the corresponding real-time travel order is sent to the target vehicle, so that the target vehicle serves the passenger sending the order. Sending to the target vehicle actually means sending the real-time trip order to a mobile device on the target vehicle, such as a mobile phone held by a driver or a vehicle of the vehicle.
As can be seen from the above technical solutions, the embodiment provides a reservation order dispatching method based on a real-time single-trip vehicle, which is applied to a server of a travel taxi taking system, specifically, for acquiring a reservation travel order; acquiring a plurality of real-time single-stroke vehicles according to the real-time positions of the vehicles and the current real-time single-terminal position; judging whether the reserved travel order is a long-time reservation order or a short-time reservation order, and pushing the long-time reservation order to a plurality of real-time single-stroke vehicles in a broadcasting mode; removing real-time single-travel vehicles with the current real-time reservation list conflicting with the reservation time of the short-time reservation list; removing real-time single-trip vehicles with the comprehensive order receiving time being greater than a preset time length, wherein the preset time length is equal to the sum of the current time subtracted from the reservation time of the short-time reservation order and a preset time delay threshold value; optimizing and calculating vehicle information of the short-time reservation list and the real-time single-trip vehicle through a greedy algorithm, and obtaining a target vehicle from a plurality of real-time single-trip vehicles; and sending the real-time trip order to the target vehicle. Through the scheme, even under the condition that no idle trip vehicle exists currently, the reservation sheets can be distributed to the corresponding real-time single-trip vehicles, so that the use experience of a user is improved.
In addition, corresponding vehicles are selected from the vehicle set as target vehicles through a greedy algorithm for corresponding short-time reservation lists in the method and the system, and the lists are not simply sent based on the distance between the vehicles, so that the problem that no vehicles can be sent is solved, the overall efficiency is improved, and the service experience of users is correspondingly improved.
The embodiments in the present specification are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, apparatus, or computer program product. Accordingly, embodiments of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, embodiments of the invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
Embodiments of the present invention are described with reference to flowchart illustrations and/or block diagrams of methods, terminal devices (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing terminal to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing terminal, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing terminal to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing terminal to cause a series of operational steps to be performed on the computer or other programmable terminal to produce a computer implemented process such that the instructions which execute on the computer or other programmable terminal provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present invention have been described, additional variations and modifications of these embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the true scope of the embodiments of the invention.
Finally, it should also be noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or terminal that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or terminal. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or terminal apparatus that comprises the element.
The technical solutions provided by the present invention are described in detail above, and the principle and the implementation of the present invention are explained in this document by applying specific examples, and the descriptions of the above examples are only used to help understanding the method and the core idea of the present invention; meanwhile, for a person skilled in the art, according to the idea of the present invention, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present invention.
Claims (13)
1. The utility model provides a reservation order dispatching method based on real-time single-trip vehicle, is applied to the server of the system of taking a taxi of going out, its characterized in that, reservation order dispatching method includes the step:
acquiring an appointed travel order;
acquiring a plurality of real-time single-stroke vehicles according to the real-time positions of the vehicles and the current real-time single-terminal position;
judging whether the travel reservation order is a long-time reservation order or a short-time reservation order;
if the reserved travel order is the long-term reservation list, pushing the long-term reservation list to the plurality of real-time single-trip vehicles in a broadcasting mode;
if the reserved travel order is the short-time reservation order, then
Removing real-time single-travel vehicles with the current real-time order conflicting with the reservation time of the short-time reservation order; and/or the presence of a gas in the gas,
removing real-time single-stroke vehicles with the comprehensive order receiving time being greater than a preset time length, wherein the preset time length is equal to the sum of the current time subtracted from the appointment time of the short-time appointment order and a preset time delay threshold value;
optimizing and calculating the vehicle information of the short-time reservation list and the real-time single-trip vehicle through a greedy algorithm, and determining a target vehicle from the plurality of real-time single-trip vehicles;
and sending the short-time reservation list to the target vehicle.
2. The reservation order dispatching method of claim 1, wherein the obtaining of the real-time travel order comprises the steps of:
pulling all travel orders in a preset time length from an order pool of the server every other preset time length;
and selecting the reserved travel orders from all the travel orders according to the time parameters of the travel orders.
3. The reservation order dispatching method of claim 1, wherein said obtaining a plurality of real-time single-trip vehicles based on their real-time locations and their current real-time single-endpoint locations comprises the steps of:
acquiring real-time positions of a plurality of vehicles and current real-time single terminal positions;
and calculating the real-time distance between the real-time position and the current real-time single-end-point position, and determining the vehicle with the real-time distance smaller than a preset distance threshold value as the real-time single-travel vehicle.
4. The reservation order dispatching method of claim 3, wherein said obtaining a plurality of real-time single trip vehicles based on the real-time location of the vehicle and the current real-time single endpoint location further comprises the steps of:
and removing the real-time single-stroke vehicles of which the types are not matched with the specified vehicle type of the short-time reservation list from the plurality of real-time single-stroke vehicles.
5. The reservation order dispatching method of claim 3, wherein said obtaining a plurality of real-time single trip vehicles based on the real-time location of the vehicle and the current real-time single endpoint location further comprises the steps of:
and removing the real-time single-trip vehicles of which the drivers make the pre-specified rejection behaviors from the plurality of real-time single-trip vehicles.
6. The reservation order dispatching method of claim 3, wherein said obtaining a plurality of real-time single trip vehicles based on the real-time location of the vehicle and the current real-time single endpoint location further comprises the steps of:
and removing real-time single-trip vehicles with residual trips not matched with the actual trips of the short-time reservation list from the plurality of real-time single-trip vehicles.
7. The reservation order dispatching method of claim 1, wherein the optimal calculation of the vehicle information for the short-time reservation order and the real-time single-trip vehicle by a greedy algorithm comprises the steps of:
constructing a vehicle-order matrix, wherein the vehicle-order matrix comprises a vehicle set and a reservation order set and further comprises a distance parameter corresponding to each real-time single-trip vehicle in the vehicle set and each short-time reservation single-phase in the reservation order set, and the distance parameter is the reciprocal of the distance between the current position of the real-time single-trip vehicle subjected to normalization processing and the starting position of the short-time reservation order;
and selecting the target vehicle from the vehicle set by utilizing a greedy algorithm aiming at each short-time reservation list.
8. The utility model provides a reservation order group single device based on real-time single-stroke vehicle, is applied to the server of the system of taking a taxi of going out which characterized in that, reservation order group single device includes:
the order acquisition module is configured to acquire an appointed travel order;
a vehicle acquisition module configured to acquire a plurality of real-time single-trip vehicles according to real-time positions of the vehicles and current real-time single-terminal positions;
the first pushing module is configured to judge whether the reserved travel order is a long-time reservation order or a short-time reservation order, and if the reserved travel order is the long-time reservation order, the long-time reservation order is pushed to the plurality of real-time single-stroke vehicles in a broadcasting mode;
the conflict filtering module is configured to remove the real-time single-trip vehicle with the current real-time order conflicting with the reservation time of the short-time reservation order if the reserved travel order is the short-time reservation order;
the time delay filtering module is configured to reject real-time single-stroke vehicles with comprehensive order receiving time larger than preset time length, wherein the preset time length is equal to the sum of the current time subtracted from the appointment time of the short-time appointment order and a preset time delay threshold value;
the optimization calculation module is configured to perform optimization calculation on the short-time reservation list and the vehicle information of the real-time single-trip vehicle through a greedy algorithm, and obtain a target vehicle from the plurality of real-time single-trip vehicles;
a second push module configured to send the short-time reservation ticket to the target vehicle.
9. The reservation order dispatching device of claim 8, wherein the order acquisition module comprises:
the first obtaining unit is configured to pull all travel orders in a preset time length from an order pool of the server every other preset time length;
a first filtering unit configured to select the reserved travel orders from all the travel orders according to the time parameters of the travel orders.
10. The ordering device of claim 8, wherein said vehicle acquisition module comprises:
a second acquisition unit configured to acquire real-time positions of a plurality of vehicles and current real-time single-terminal positions;
and the second filtering unit is configured to calculate a real-time distance between the real-time position and the current real-time single-terminal position, and determine the vehicle with the real-time distance smaller than a preset distance threshold value as the real-time single-stroke vehicle.
11. The reservation order dispatching device of claim 10, wherein the vehicle acquisition module further comprises:
a third filtering unit configured to remove real-time one-trip vehicles of a type not matching the specified vehicle type of the short-time reservation ticket from the plurality of real-time one-trip vehicles.
12. The reservation order dispatching device of claim 10, wherein the vehicle acquisition module further comprises:
a fourth filtering unit configured to eliminate real-time single-trip vehicles, of which drivers make a predefined rejection, from the plurality of real-time single-trip vehicles.
13. The reservation order dispatching device of claim 10, wherein the vehicle acquisition module further comprises:
a fifth filtering unit configured to remove real-time one-trip vehicles, of which remaining trips do not match the actual trips of the short-time reservation ticket, from the plurality of real-time one-trip vehicles.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910770386.7A CN110853333A (en) | 2019-08-20 | 2019-08-20 | Reservation order dispatching method and device based on real-time single-stroke vehicle |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910770386.7A CN110853333A (en) | 2019-08-20 | 2019-08-20 | Reservation order dispatching method and device based on real-time single-stroke vehicle |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110853333A true CN110853333A (en) | 2020-02-28 |
Family
ID=69595475
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910770386.7A Withdrawn CN110853333A (en) | 2019-08-20 | 2019-08-20 | Reservation order dispatching method and device based on real-time single-stroke vehicle |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110853333A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2021031634A1 (en) * | 2019-08-20 | 2021-02-25 | 南京领行科技股份有限公司 | Continuous order dispatching method and apparatus for advance order based on real-time one-way vehicle |
| CN112884299A (en) * | 2021-01-29 | 2021-06-01 | 长沙市到家悠享家政服务有限公司 | Automatic order receiving method, equipment and medium |
-
2019
- 2019-08-20 CN CN201910770386.7A patent/CN110853333A/en not_active Withdrawn
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2021031634A1 (en) * | 2019-08-20 | 2021-02-25 | 南京领行科技股份有限公司 | Continuous order dispatching method and apparatus for advance order based on real-time one-way vehicle |
| CN112884299A (en) * | 2021-01-29 | 2021-06-01 | 长沙市到家悠享家政服务有限公司 | Automatic order receiving method, equipment and medium |
| CN112884299B (en) * | 2021-01-29 | 2024-04-26 | 长沙市到家悠享家政服务有限公司 | Automatic order receiving method, equipment and medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110570003A (en) | Reservation travel order dispatching method and device based on idle travel vehicle | |
| CN113095531A (en) | Order dispatching method and device | |
| CN110189006B (en) | Scheduling method and device for vehicle, computer equipment and storage medium thereof | |
| CN110852464A (en) | Reservation list interlinked dispatching method and device based on real-time single-stroke vehicle | |
| WO2016008391A1 (en) | Method and system for booking taxi for third party in online taxi hiring system | |
| CN109816128B (en) | Method, device and equipment for processing network taxi appointment orders and readable storage medium | |
| EP3262831B1 (en) | Telephone call placement | |
| CN111832788B (en) | Service information generation method, device, computer equipment and storage medium | |
| CN108537350A (en) | Network about vehicle Order splitting processing method and server | |
| CN110570002A (en) | Reservation list mixed interlinked dispatching method and device based on non-idle travel vehicle | |
| CN108734539A (en) | A kind of method, apparatus and system that automobile on-site maintenance service is provided | |
| CN108921762A (en) | A kind of vehicle mixed scheduling method, device and equipment | |
| CN111860902A (en) | Order processing method, device, equipment and computer readable storage medium | |
| CN110852463A (en) | Reservation list serial dispatching method and device based on idle-trip vehicle | |
| CN110853333A (en) | Reservation order dispatching method and device based on real-time single-stroke vehicle | |
| CN108399460A (en) | Network about vehicle Order splitting processing method and server | |
| WO2021031636A1 (en) | Real-time order travel vehicle-based real-time order assignment method and apparatus | |
| CN110956515A (en) | Order processing method and device, electronic equipment and computer storage medium | |
| CN112906980A (en) | Order processing method, device and system and readable storage medium | |
| CN107545319A (en) | A kind of transport power concocting method and device | |
| CN107437129B (en) | Reservation sheet processing method and server | |
| CN111178558B (en) | Network appointment order processing method and device, computer equipment and readable storage medium | |
| CN110191184B (en) | Duration information pushing method, device, equipment and medium | |
| CN117671995A (en) | Method and device for stopping vehicle, electronic equipment and readable storage medium | |
| CN113129102B (en) | Delayed order dispatching method and device, electronic equipment and 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 | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20200228 |
|
| WW01 | Invention patent application withdrawn after publication |