CN110852463A - Reservation list serial dispatching method and device based on idle-trip vehicle - Google Patents
Reservation list serial dispatching method and device based on idle-trip vehicle Download PDFInfo
- Publication number
- CN110852463A CN110852463A CN201910770928.0A CN201910770928A CN110852463A CN 110852463 A CN110852463 A CN 110852463A CN 201910770928 A CN201910770928 A CN 201910770928A CN 110852463 A CN110852463 A CN 110852463A
- Authority
- CN
- China
- Prior art keywords
- order
- reservation
- idle
- vehicle
- short
- 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
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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- 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
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- Development Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Educational Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a reservation list chain dispatching method and device based on idle travel vehicles, which are applied to a server of a travel taxi taking system, in particular to acquisition of a reservation travel order; acquiring a plurality of idle-travel vehicles; 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 idle-trip vehicles in a broadcasting mode; optimizing and calculating the vehicle information of the short-time reservation list and the idle-trip vehicles through a greedy algorithm, and obtaining target vehicles from a plurality of idle-trip vehicles; and sequentially sending a plurality of non-conflicting short-time reservation sheets to the target vehicle. According to the scheme, even under the condition that the current idle travel vehicle already accepts the reserved travel order, the order can be received again, the order receiving rate is improved, and therefore the use experience of a user is improved.
Description
Technical Field
The invention relates to the technical field of network booking, in particular to a reservation list interlink dispatching method and device based on idle-trip vehicles.
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 network reservation taxi provides transportation service for passengers by a mode of ordering and receiving orders through the network. The network taxi appointment is a short name of a network taxi appointment.
When the vehicle is in a peak time period such as on-duty and off-duty, almost all vehicles are in a service state, and for an order which is a reserved travel order and does not need to provide services immediately, if a corresponding idle-trip vehicle can receive a plurality of orders, the order taking rate of the reserved travel order is inevitably improved, and therefore the service experience of a user can be improved.
Disclosure of Invention
In view of this, the invention provides a reservation list interlinked order dispatching method and device based on idle trip vehicles, so as to improve the service experience of users.
In order to solve the problems, the invention discloses an reservation single-chain order dispatching method based on idle-trip vehicles, 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 idle-travel vehicles;
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 idle-journey vehicles in a broadcasting mode, and returning the long-term reservation order which is not received within a preset time length to an order pool of the server;
if the reserved travel order is the short-time reservation list, optimizing and calculating the short-time reservation list and the vehicle information of the idle-trip vehicles through a greedy algorithm, and obtaining target vehicles from the idle-trip vehicles;
and sequentially sending a plurality of non-conflicting short-time reservation sheets to the target vehicle.
Optionally, the obtaining of the reserved travel order includes:
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.
Optionally, the acquiring a plurality of idle-trip vehicles includes:
acquiring all vehicles in the preset range according to the position information of the reserved travel order;
and selecting the idle-trip vehicles from the vehicles according to the passenger carrying state of each vehicle.
Optionally, the sequentially sending a plurality of non-conflicting short-time reservation tickets to the target vehicle includes:
if the target vehicle does not receive any reservation list at present, directly pushing the short-time reservation list to the target vehicle;
and if the target vehicle receives the short-time reservation list, only pushing the short-time reservation list which does not conflict with the received short-time reservation list to the target vehicle.
Optionally, before the step of performing optimization calculation on the short-time reservation list and the vehicle information of the idle-trip vehicle through a greedy algorithm, the method further includes the steps of:
and eliminating the idle travel vehicles with the types which are not matched with the specified vehicle type of the short-time reservation list from the plurality of idle travel vehicles.
Optionally, before the step of performing optimization calculation on the short-time reservation list and the vehicle information of the idle-trip vehicle through a greedy algorithm, the method further includes the steps of:
and eliminating the idle-trip vehicles of which the drivers send out the rejection information from the plurality of idle-trip vehicles.
The optimization calculation of the short-time reservation list and the vehicle information of the idle-trip vehicle through a greedy algorithm comprises the following steps:
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 the distance between each idle 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 idle trip vehicle subjected to normalization processing and the starting position of the short-time reservation single phase;
and selecting the target vehicle from the vehicle set by utilizing a greedy algorithm aiming at each short-time reservation list.
The utility model provides a reservation list links and sends an order device based on idle stroke vehicle, is applied to the server of the system of taking a taxi of going out, reservation list sends an order device and includes:
the order acquisition module is configured to acquire an appointed travel order;
a vehicle acquisition module configured to acquire a plurality of idle trip vehicles;
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-term reservation order, pushing the long-term reservation order to the idle-journey vehicles in a broadcasting mode, and returning the long-term reservation order which is not received within a preset time length to an order pool of the server;
the optimization calculation module is configured to perform optimization calculation on the short-time reservation order and the vehicle information of the idle-trip vehicle through a greedy algorithm if the reserved travel order is the short-time reservation order, and obtain a target vehicle from the idle-trip vehicles;
the second pushing module is configured to sequentially send a plurality of non-conflicting short-time reservation tickets to the target vehicle.
Optionally, the order obtaining module includes:
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.
Optionally, the vehicle obtaining module includes:
the second acquisition unit is configured to acquire all vehicles in the preset range according to the position information of the reserved travel order;
and the second filtering unit is configured to select the idle-trip vehicles according to the passenger carrying state of each vehicle.
Optionally, the second pushing module includes:
a first pushing unit configured to directly push the short-time reservation ticket to the target vehicle if the target vehicle does not currently receive any reservation ticket;
a second pushing unit configured to push only the short-term reservation ticket that does not conflict with the already accepted short-term reservation ticket to the target vehicle if the target vehicle has accepted the short-term reservation ticket.
Optionally, the method further includes:
the first filtering module is configured to remove idle-trip vehicles with types which are not matched with the specified vehicle types of the short-time reservation list from the plurality of idle-trip vehicles before the optimization calculation step of the vehicle information of the short-time reservation list and the idle-trip vehicles through a greedy algorithm.
Optionally, the method further includes:
and the second filtering module is configured to remove idle-trip vehicles of which drivers send out rejection information from the plurality of idle-trip vehicles before the step of optimizing and calculating the short-time reservation list and the vehicle information of the idle-trip vehicles through a greedy algorithm.
According to the technical scheme, the invention provides a reservation order chain dispatching method and device based on idle trip vehicles, which are applied to a server of a trip taxi taking system, in particular to acquisition of a reservation trip order; acquiring a plurality of idle-travel vehicles; 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 idle-trip vehicles in a broadcasting mode; optimizing and calculating the vehicle information of the short-time reservation list and the idle-trip vehicles through a greedy algorithm, and obtaining target vehicles from a plurality of idle-trip vehicles; and sequentially sending a plurality of non-conflicting short-time reservation sheets to the target vehicle. According to the scheme, even under the condition that the current idle travel vehicle already accepts the reserved travel order, the order can be received again, the order receiving rate is improved, and therefore the use experience of a user is improved.
And the corresponding target vehicle is selected according to the corresponding reserved travel order through a greedy algorithm, and the free travel vehicles which are possible to receive orders are subjected to general calculation, instead of simply being dispatched based on the distance or in an order grabbing mode, so that the maximum order dispatching matching under the constraint condition of minimizing the total receiving time/distance is realized, the problem of overall efficiency in an order dispatching mode and an order grabbing mode based on the distance is solved, and the service experience of a user is 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 flowchart of an reservation list chain dispatching method based on idle trip vehicles according to an embodiment of the present application;
fig. 2 is a block diagram of an reservation order serial dispatching device based on idle 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 reservation list chain dispatching method based on an idle-trip vehicle according to an embodiment of the present application.
As shown in fig. 1, the reservation order chained order dispatching method provided by the embodiment is applied to a server of a travel taxi taking system, and is used for ordering passengers and providing an order dispatching scheme for dispatching taxi vehicles. The idle-trip vehicle refers to a contracted vehicle belonging to the trip taxi taking system and is in an idle state at the current time. The reservation list interlinking 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 length, such as every 2 seconds, wherein the travel orders comprise real-time travel orders and reserved travel orders, and judging whether a specific travel order is a real-time travel order or a reserved travel order through reserved vehicle using time, namely judging through time parameters in the travel orders; and after all the travel orders in the time period are pulled, judging according to the time parameters in the travel orders, and selecting all the reserved travel orders from the travel orders through judgment.
And S2, acquiring a plurality of idle-trip vehicles.
That is, in the case of determining the position information of issuing the reserved travel order, the idle-trip vehicle within the preset range based on the position information, that is, the vehicle not providing service for any passenger, is acquired according to the position information. 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.
In the process of obtaining a plurality of idle-trip vehicles, all vehicles in the preset range are obtained according to the position information, namely all vehicles signed with the trip taxi taking system in the preset range are obtained; and then, judging according to the service state of each vehicle, and selecting the vehicle with the idle trip from the vehicles.
In addition, in the process of acquiring a plurality of idle-trip vehicles, the method further comprises a part or all of the following steps, and the sequence of the following steps does not represent the sequence.
And S01, removing idle travel vehicles of which the types are not matched with the appointed vehicle type of the reserved travel order.
Generally, sometimes, a travel order issued by a passenger provides a vehicle type required by the passenger, that is, the vehicle type requirement is included, and if the requirement of the passenger cannot be met, the use experience of the passenger is reduced, so that after all idle-trip vehicles are determined, all idle-trip vehicles are filtered according to a designated vehicle type in the travel order, if one or some vehicles are not matched with the designated vehicle type, the vehicles are removed, and then optimization calculation is performed, so that the vehicle type definitely rejected by the passenger can be prevented from participating in calculation.
In addition, step S4 in the present application may include the following steps.
And S02, removing the idle-trip vehicles of which the drivers do the pre-specified rejection.
After all the vehicles on the idle trip are determined, if drivers of the vehicles make a preset rejection behavior, if the drivers of the vehicles have no reason to reject the orders or make a certain number of rejection lines 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 the trip orders to influence the vehicles of passengers can be avoided.
And S3, judging the long-time reservation order and broadcasting and pushing the long-time reservation order.
After the idle-trip vehicle is determined, whether the corresponding reserved travel order is a long-time reservation list or a short-time reservation list is determined through judgment of reserved time information, the long-time reservation list and the short-time reservation list are divided according to the length of reserved vehicle time pointed by the reserved time information from the current time, namely the long-time reservation list and the short-time reservation list are judged through a preset time threshold, the time threshold can be one day or one week, and the time threshold determined according to the principle is within the protection range of the application.
For the long reservation order in the idle trip vehicle, because no conflict is generated with the current order state of the idle trip vehicle, the long reservation order can be pushed to all the idle trip vehicles in a broadcasting mode, and the drivers of the idle trip vehicles can receive or reject the order at any time.
In addition, for the broadcasted long-term reservation order, if the order is not accepted within a preset time length, such as 1 second, 10 seconds, 60 seconds, 100 seconds or a time length between the above values or other time lengths, the long-term reservation order which is not accepted is returned to the order pool of the server.
And S4, calculating according to a greedy algorithm to obtain the target vehicle.
The reserved travel order and the vehicle information of the selected idle travel vehicle are optimized and calculated according to a greedy algorithm, and the idle travel vehicle which is most matched with the short-time reserved order is found out from the idle travel vehicles and serves as the 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 idle-trip vehicles D according to the distance of the departure position of the short-time reservation order. The reservation order 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 order and the current position of each idle-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 order and the corresponding idle-trip vehicle, and the parameters are specifically shown in table 1.
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 idle-trip vehicle and distance parameters between the corresponding short-time reservation list and the corresponding idle-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. For a particular problem, to determine whether it has the property of greedy selection, we must prove that the greedy selection made at each step ultimately yields 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 S5, sequentially sending the non-conflicting short-time reservation tickets to the target vehicle.
After the target vehicle is determined, a plurality of non-conflicting short-time reservation tickets are sequentially sent to the target vehicle so that the target vehicle serves the passenger sending the order. The non-conflict here means that the time of the short reservation ticket does not conflict. Sending to the target vehicle actually means sending the reserved trip order to a mobile device on the target vehicle, such as a mobile phone held by the driver.
Specifically, when a target vehicle has not accepted any short-term reservation ticket, a short-term reservation ticket may be pushed to the target vehicle; if a target vehicle receives the short-time reservation list, the time of the subsequent short-time reservation list is compared with the time of the short-time reservation list received by the former vehicle, if the time of the subsequent short-time reservation list is not in conflict, the short-time reservation list is pushed to the target vehicle, and if the time of the subsequent short-time reservation list is not in conflict, the short-time reservation list is not pushed.
According to the technical scheme, the reservation order serial dispatching method based on the idle trip vehicle is applied to a server of a trip taxi taking system, and specifically, a reservation trip order is obtained; acquiring a plurality of idle-travel vehicles; 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 idle-trip vehicles in a broadcasting mode; optimizing and calculating the vehicle information of the short-time reservation list and the idle-trip vehicles through a greedy algorithm, and obtaining target vehicles from a plurality of idle-trip vehicles; and sequentially sending a plurality of non-conflicting short-time reservation sheets to the target vehicle. According to the scheme, even under the condition that the current idle travel vehicle already accepts the reserved travel order, the order can be received again, the order receiving rate is improved, and therefore the use experience of a user is improved.
And the corresponding target vehicle is selected according to the corresponding reserved travel order through a greedy algorithm, and the free travel vehicles which are possible to receive orders are subjected to general calculation, instead of simply being dispatched based on the distance or in an order grabbing mode, so that the maximum order dispatching matching under the constraint condition of minimizing the total receiving time/distance is realized, the problem of overall efficiency in an order dispatching mode and an order grabbing mode based on the distance is solved, and the service experience of a user is improved.
Example two
Fig. 2 is a block diagram of an reservation order serial dispatching device based on idle trip vehicles according to an embodiment of the present application.
As shown in fig. 2, the reservation sheet interlinked dispatching device provided in this embodiment is applied to a server of an outgoing taxi system, and can be understood as a functional module of an actual electronic device or server, which is used for ordering passengers and providing a dispatching scheme for dispatching taxi vehicles. The idle-trip vehicle refers to a contracted vehicle belonging to the trip taxi taking system and is in an idle state at the current time. The reservation sheet interlinked order sending device specifically comprises an order obtaining module 10, a vehicle obtaining module 20, a first pushing module 30, an optimization calculation module 40 and a second pushing module 50.
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 sending out the corresponding order, the passenger generally sends out electronic information to the 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 real-time travel orders and reserved travel orders, the order obtaining module herein specifically includes a first obtaining unit and a first filtering unit.
The first obtaining unit is used for pulling all travel orders generated in the time period from the order pool of the server every preset time length, such as every 2 seconds, wherein the travel orders include 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 judged through reserved vehicle using time, namely, the specific travel order can be judged through time parameters in the travel orders; the first filtering unit is used for judging according to the time parameters in the travel orders after the first obtaining unit pulls all the travel orders in the period of time, and selecting all the reserved travel orders from the travel orders through judgment.
The vehicle obtaining module 20 is configured to obtain a plurality of idle-trip vehicles within a preset range according to the position information.
That is, in the case of determining the position information of issuing the reserved travel order, the idle-trip vehicle within the preset range based on the position information, that is, the vehicle not providing service for any passenger, is acquired according to the position information. 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 obtaining unit and a second filtering unit, wherein in the process of obtaining a plurality of idle-trip vehicles, the second obtaining unit is used for obtaining all vehicles in the preset range according to the position information, namely obtaining all vehicles in the preset range, which are signed with the trip taxi taking system; the second filtering unit is used for judging according to the service state of each vehicle and selecting the vehicles in the idle travel from the service states.
In addition, the vehicle acquisition module in this application still includes third filter unit and/or fourth filter unit.
And the third filtering unit is used for eliminating idle travel vehicles of which the types are not matched with the appointed vehicle type of the reserved travel order before the optimization calculation module calculates according to the greedy algorithm.
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.
And the fourth filtering unit is used for eliminating idle-trip vehicles of which drivers send out rejection information before the optimization calculation module calculates according to the greedy algorithm.
After all the vehicles on the idle trip are determined, if the driver of the vehicle has the history of the rejection, such as the previous rejection or a certain number of rejection lines within a certain time, the vehicle can be removed, and then optimization calculation is carried out, so that the problem that the use of the passenger is influenced by pushing the reserved travel order by the vehicle with the problem can be avoided.
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 idle-trip vehicle is determined, whether the corresponding reserved travel order is a long-time reservation list or a short-time reservation list is determined through judgment of reserved time information, the long-time reservation list and the short-time reservation list are divided according to the length of reserved vehicle time pointed by the reserved time information from the current time, namely the long-time reservation list and the short-time reservation list are judged through a preset time threshold, the time threshold can be one day or one week, and the time threshold determined according to the principle is within the protection range of the application.
For the long reservation order in the idle trip vehicle, because no conflict is generated with the current order state of the idle trip vehicle, the long reservation order can be pushed to all the idle trip vehicles in a broadcasting mode, and the drivers of the idle trip vehicles can receive or reject the order at any time.
In addition, for the broadcasted long-term reservation order, if the order is not accepted within a preset time length, such as 1 second, 10 seconds, 60 seconds, 100 seconds or a time length between the above values or other time lengths, the long-term reservation order which is not accepted is returned to the order pool of the server.
And the optimization calculation module 40 is used for calculating according to a greedy algorithm to obtain the target vehicle.
The method comprises the steps of performing optimization calculation on a reserved travel order and vehicle information of selected idle travel vehicles according to a greedy algorithm, and finding out the idle travel vehicle which is most matched with the reserved travel order from a plurality of idle travel vehicles to serve as a target vehicle.
The second pushing module 50 is configured to sequentially send non-conflicting short-time reservation tickets to the target vehicle.
After the target vehicle is determined, a plurality of non-conflicting short-time reservation tickets are sequentially sent to the target vehicle so that the target vehicle serves the passenger sending the order. The non-conflict here means that the time of the short reservation ticket does not conflict. Sending to the target vehicle actually means sending the reserved trip order to a mobile device on the target vehicle, such as a mobile phone held by the driver.
Specifically, the module comprises a first pushing unit and a second pushing unit, wherein the first pushing unit is used for pushing a short-time reservation list to a target vehicle when the target vehicle does not accept any short-time reservation list; and the second pushing unit compares the time of the subsequent short-time reservation order with the time of the short-time reservation order which is accepted by the former when a target vehicle already accepts the short-time reservation order, pushes the short-time reservation order to the target vehicle if the short-time reservation order does not conflict with the short-time reservation order, and does not push the short-time reservation order if the short-time reservation order conflicts with the short-time reservation order.
According to the technical scheme, the reservation order serial dispatching method based on the idle trip vehicle is applied to a server of a trip taxi taking system, and specifically, a reservation trip order is obtained; acquiring a plurality of idle-travel vehicles; 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 idle-trip vehicles in a broadcasting mode; optimizing and calculating the vehicle information of the short-time reservation list and the idle-trip vehicles through a greedy algorithm, and obtaining target vehicles from a plurality of idle-trip vehicles; and sequentially sending a plurality of non-conflicting short-time reservation sheets to the target vehicle. According to the scheme, even under the condition that the current idle travel vehicle already accepts the reserved travel order, the order can be received again, the order receiving rate is improved, and therefore the use experience of a user is improved.
And the corresponding target vehicle is selected according to the corresponding reserved travel order through a greedy algorithm, and the free travel vehicles which are possible to receive orders are subjected to general calculation, instead of simply being dispatched based on the distance or in an order grabbing mode, so that the maximum order dispatching matching under the constraint condition of minimizing the total receiving time/distance is realized, the problem of overall efficiency in an order dispatching mode and an order grabbing mode based on the distance is solved, and the service experience of a user is 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 present 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 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. Also, 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 like elements in a process, method, article, or terminal 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 list links and sends the folk prescription method based on idle stroke vehicle, is applied to the server of the system of taking a bus of trip, its characterized in that, reservation list links and sends the folk prescription method and includes the step:
acquiring an appointed travel order;
acquiring a plurality of idle-travel vehicles;
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 idle-journey vehicles in a broadcasting mode, and returning the long-term reservation order which is not received within a preset time length to an order pool of the server;
if the reserved travel order is the short-time reservation list, optimizing and calculating the short-time reservation list and the vehicle information of the idle-trip vehicles through a greedy algorithm, and obtaining target vehicles from the idle-trip vehicles;
and sequentially sending a plurality of non-conflicting short-time reservation sheets to the target vehicle.
2. The reservation sheet chaining order dispatching method as recited in claim 1, wherein said obtaining a reservation travel order comprises:
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 single-gang dispatching method of claim 1, wherein the obtaining a plurality of idle trip vehicles comprises:
acquiring all vehicles in the preset range according to the position information of the reserved travel order;
and selecting the idle-trip vehicles from the vehicles according to the passenger carrying state of each vehicle.
4. The reservation single-gang dispatching method of claim 3, wherein the obtaining a plurality of idle trip vehicles further comprises the steps of:
and eliminating the idle travel vehicles with the types which are not matched with the specified vehicle type of the short-time reservation list from the plurality of idle travel vehicles.
5. The reservation single-gang dispatching method of claim 3, wherein the obtaining a plurality of idle trip vehicles further comprises the steps of:
and eliminating the idle-trip vehicles of which the drivers make the pre-specified rejection behaviors from the plurality of idle-trip vehicles.
6. The reservation sheet chaining order dispatching method as claimed in claim 1, wherein said sequentially sending a plurality of non-conflicting plurality of short-time reservation sheets to said target vehicle comprises:
if the target vehicle does not receive any reservation list at present, directly pushing the short-time reservation list to the target vehicle;
and if the target vehicle receives the short-time reservation list, only pushing the short-time reservation list which does not conflict with the received short-time reservation list to the target vehicle.
7. The reservation ticket chaining and dispatching method as claimed in claim 1, wherein said optimal calculation of vehicle information for said short-time reservation ticket and said idle 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 idle 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 idle trip vehicle subjected to normalization processing and the starting position of the short-time reservation single phase;
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 list links and sends an order device based on idle stroke vehicle, is applied to the server of trip system of taking a car, its characterized in that, reservation list sends an order device and includes:
the order acquisition module is configured to acquire an appointed travel order;
a vehicle acquisition module configured to acquire a plurality of idle trip vehicles;
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-term reservation order, pushing the long-term reservation order to the idle-journey vehicles in a broadcasting mode, and returning the long-term reservation order which is not received within a preset time length to an order pool of the server;
the optimization calculation module is configured to perform optimization calculation on the short-time reservation order and the vehicle information of the idle-trip vehicle through a greedy algorithm if the reserved travel order is the short-time reservation order, and obtain a target vehicle from the idle-trip vehicles;
the second pushing module is configured to sequentially send a plurality of non-conflicting short-time reservation tickets to the target vehicle.
9. The reservation sheet interlinked dispatching device according to claim 8, wherein said order acquisition module includes:
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 reservation menu chaining order device of claim 8, wherein said vehicle acquisition module comprises:
the second acquisition unit is configured to acquire all vehicles in the preset range according to the position information of the reserved travel order;
and the second filtering unit is configured to select the idle-trip vehicles according to the passenger carrying state of each vehicle.
11. The reservation sheet looping dispatching device of claim 10, further comprising:
a third filtering unit configured to remove the idle trip vehicles of which the types do not match with the specified vehicle type of the short-time reservation list from the plurality of idle trip vehicles.
12. The reservation sheet looping dispatching device of claim 10, further comprising:
and the fourth filtering unit is configured to remove the idle trip vehicles of which the drivers send out the rejection information from the plurality of idle trip vehicles.
13. The reservation menu chaining-and-dispatching device of claim 8, wherein said second push module comprises:
a first pushing unit configured to directly push the short-time reservation ticket to the target vehicle if the target vehicle does not currently receive any reservation ticket;
a second pushing unit configured to push only the short-term reservation ticket that does not conflict with the already accepted short-term reservation ticket to the target vehicle if the target vehicle has accepted the short-term reservation ticket.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910770928.0A CN110852463A (en) | 2019-08-20 | 2019-08-20 | Reservation list serial dispatching method and device based on idle-trip vehicle |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910770928.0A CN110852463A (en) | 2019-08-20 | 2019-08-20 | Reservation list serial dispatching method and device based on idle-trip vehicle |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110852463A true CN110852463A (en) | 2020-02-28 |
Family
ID=69595303
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910770928.0A Withdrawn CN110852463A (en) | 2019-08-20 | 2019-08-20 | Reservation list serial dispatching method and device based on idle-trip vehicle |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110852463A (en) |
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 |
| CN113033849A (en) * | 2021-03-30 | 2021-06-25 | 满帮信息咨询有限公司 | Reserved vehicle matching method and system, electronic device and storage medium |
| WO2022071882A1 (en) * | 2020-10-01 | 2022-04-07 | Grabtaxi Holdings Pte. Ltd. | Communications server apparatus and method for allocating resources to service requests related to a shared economy on-demand service or asset provision |
-
2019
- 2019-08-20 CN CN201910770928.0A patent/CN110852463A/en not_active Withdrawn
Cited By (4)
| 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 |
| WO2022071882A1 (en) * | 2020-10-01 | 2022-04-07 | Grabtaxi Holdings Pte. Ltd. | Communications server apparatus and method for allocating resources to service requests related to a shared economy on-demand service or asset provision |
| CN113033849A (en) * | 2021-03-30 | 2021-06-25 | 满帮信息咨询有限公司 | Reserved vehicle matching method and system, electronic device and storage medium |
| CN113033849B (en) * | 2021-03-30 | 2024-02-27 | 满帮信息科技有限公司 | Reserved vehicle matching method, reserved vehicle matching system, electronic equipment and storage 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 | |
| CN110852464A (en) | Reservation list interlinked dispatching method and device based on real-time single-stroke vehicle | |
| CN110852463A (en) | Reservation list serial dispatching method and device based on idle-trip vehicle | |
| CN107919013B (en) | Get-on point processing method and server | |
| CN108399460B (en) | Network taxi booking order distribution processing method and server | |
| CN109448422B (en) | Parking lot management method and related device | |
| CN110570002A (en) | Reservation list mixed interlinked dispatching method and device based on non-idle travel vehicle | |
| CN106997577A (en) | A kind of order strategy dynamic adjusting method and device | |
| CN115796319A (en) | Charging pile reservation method, device, equipment and computer readable storage medium | |
| CN112906980A (en) | Order processing method, device and system and readable storage medium | |
| CN110853333A (en) | Reservation order dispatching method and device based on real-time single-stroke vehicle | |
| CN110570100A (en) | Real-time order dispatching method and device based on real-time single-stroke vehicle | |
| CN113159353A (en) | Network appointment vehicle order distribution method and device and computer storage medium | |
| CN113129102B (en) | Delayed order dispatching method and device, electronic equipment and storage medium | |
| CN110909240A (en) | License plate number selection data processing method and device | |
| CN111178558B (en) | Network appointment order processing method and device, computer equipment and readable storage medium | |
| CN114493236A (en) | Service vehicle assignment method, service vehicle assignment device, service vehicle assignment apparatus, service vehicle assignment medium, and program product | |
| CN113723642A (en) | Vertical circulation parking control system and working method thereof | |
| CN113192355A (en) | Terminal management method and device for electronic stop board | |
| CN112950319B (en) | Method and system for processing network taxi appointment orders | |
| CN114048945A (en) | Order dispatching method and device without starting point, electronic equipment and storage medium | |
| CN110830568A (en) | Method and device for acquiring user order information of electronic license plate | |
| CN117875460A (en) | Play list response method, device, computer equipment and medium | |
| CN117765765A (en) | Non-motor vehicle parking management method based on Internet of things |
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 |