CN110910202A - Order processing method and device - Google Patents
Order processing method and device Download PDFInfo
- Publication number
- CN110910202A CN110910202A CN201911013759.2A CN201911013759A CN110910202A CN 110910202 A CN110910202 A CN 110910202A CN 201911013759 A CN201911013759 A CN 201911013759A CN 110910202 A CN110910202 A CN 110910202A
- Authority
- CN
- China
- Prior art keywords
- path
- order
- car
- path distance
- determining
- 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.)
- Granted
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
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
- G06Q30/0635—Processing of requisition or of purchase orders
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/02—Reservations, e.g. for tickets, services or events
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- Finance (AREA)
- Development Economics (AREA)
- Accounting & Taxation (AREA)
- Theoretical Computer Science (AREA)
- Tourism & Hospitality (AREA)
- Entrepreneurship & Innovation (AREA)
- Human Resources & Organizations (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Traffic Control Systems (AREA)
Abstract
The embodiment of the invention provides an order processing method and device. The method comprises the following steps: receiving taxi appointment orders of at least two clients, and determining a first path distance, wherein the first path distance is the shortest car sharing path distance combining the taxi appointment orders; acquiring target paths of the taxi appointment order, and determining a second path distance, wherein the second path distance is the sum of the path distances of each target path; determining a carpooling parameter according to the first path distance and the second path distance; the carpooling parameter is the ratio of the difference value between the first path distance and the second path distance to the longest path in the target paths; and if the car sharing parameters meet the preset numerical value requirements, combining each car booking order into a target order. The embodiment of the invention solves the problem that in the prior art, the network appointment platform only compares the starting point and the ending point in the car sharing process and has limitation.
Description
Technical Field
The invention relates to the technical field of internet, in particular to an order processing method and device.
Background
In recent years, with the rapid development of the mobile internet industry, the new industry state of the traditional transportation and internet-integrated industry is developed vigorously, so that the network car-booking service (for short, the network car-booking) is just an important way for users to go out, the network car-booking can meet the use requirements of the users in different going-out scenes, the scale of the users is continuously and stably increased, the network car-booking can rapidly occupy a large amount of user markets in a short time, and great convenience is brought to the users to go out.
In the field of online taxi booking, the taxi pooling is taken as a combined travel mode, on one hand, convenience can be brought to the travel of a user, passenger riding cost is reduced, and on the other hand, vehicle resources can be reasonably allocated, so that the taxi pooling is approved by the user to a certain extent. However, in the prior art, in the car sharing process, the online car booking platform usually only compares the similarity of the routes, that is, only compares whether the starting point and the end point of the routes of two car sharing users are close or not; then, only considering whether the starting point and the end point are close or not does not completely apply to all scenes, such as the situation that the starting point and the end point are close but the journey is not relevant.
Therefore, only comparing the starting point and the end point has certain limitation.
Disclosure of Invention
The embodiment of the invention provides an order processing method and device, and aims to solve the problem that in the prior art, a network appointment platform only compares a starting point and an end point in a car sharing process and has limitation.
In one aspect, an embodiment of the present invention provides an order processing method, where the method includes:
receiving taxi appointment orders of at least two clients, and determining a first path distance, wherein the first path distance is the shortest car sharing path distance combining the taxi appointment orders;
acquiring target paths of the taxi appointment order, and determining a second path distance, wherein the second path distance is the sum of the path distances of each target path;
determining a carpooling parameter according to the first path distance and the second path distance; the carpooling parameter is the ratio of the difference value between the first path distance and the second path distance to the longest path in the target paths;
and if the car sharing parameters meet the preset numerical value requirements, combining each car booking order into a target order.
On the other hand, the embodiment of the invention also provides a taxi taking application processing device, which is applied to a server, and the device comprises:
the order receiving module is used for receiving car booking orders of at least two clients and determining a first path distance, wherein the first path distance is the shortest car pooling path distance for combining each car booking order;
the distance determining module is used for acquiring target paths of the car booking order and determining a second path distance, wherein the second path distance is the sum of the path distances of each target path;
the parameter determining module is used for determining car sharing parameters according to the first path distance and the second path distance; the carpooling parameter is the ratio of the difference value between the first path distance and the second path distance to the longest path in the target paths;
and the order combining module is used for combining each taxi booking order into a target order if the taxi sharing parameters meet the preset numerical value requirements.
In still another aspect, an embodiment of the present invention further provides an electronic device, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor implements the steps in the order processing method described above when executing the computer program.
In still another aspect, an embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when executed by a processor, the computer program implements the steps in the order processing method described above.
In the embodiment of the invention, a first path distance is determined by receiving the order of taxi appointment of at least two clients; acquiring a target path of the taxi appointment order and determining a second path distance; determining a carpooling parameter according to the first path distance and the second path distance; if the taxi sharing parameters meet the preset value requirements, merging each taxi appointment order into a target order, and characterizing the matching degree of the orders through the taxi sharing parameters, so that orders with low matching degree are prevented from being merged, and even the total mileage is longer.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments of the present invention will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to these drawings without inventive labor.
FIG. 1 is a flowchart illustrating steps of an order processing method according to an embodiment of the present invention;
FIG. 2 is one of exemplary scene graphs of an embodiment of the present invention;
FIG. 3 is a second exemplary scenario according to the embodiment of the present invention;
FIG. 4 is a third exemplary scenario of an embodiment of the present invention;
fig. 5 is a block diagram of a taxi taking application processing apparatus according to an embodiment of the present invention;
fig. 6 is a block diagram of an electronic device according to an embodiment of the present invention.
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 some, not all, embodiments of the present invention. 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.
It should be appreciated that reference throughout this specification to "one embodiment" or "an embodiment" means that a particular feature, structure or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Thus, the appearances of the phrases "in one embodiment" or "in an embodiment" in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
In various embodiments of the present invention, it should be understood that the sequence numbers of the following processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present invention.
Referring to fig. 1, an embodiment of the present invention provides an order processing method, and preferably, the present invention is applied to a network car booking server or a network car booking platform, where the server or the network car booking platform communicates with a client, receives a car booking order from the client, and allocates a vehicle for the car booking order.
The method comprises the following steps:
The server can be preset with an order sending period, and the order sending period can be minute-level or second-level time; and in each order dispatching period, summarizing the received car booking orders, and screening out the orders capable of sharing cars.
It will be appreciated that the client may provide a ride share option when the user places an order, or ask the user whether to accept ride shares; and if the user actively selects the car sharing option or feeds back to the client to receive the car sharing, the client sends a car booking order carrying preset car sharing instructions to the server.
The server receives taxi appointment orders carrying preset taxi sharing instructions, judges the mergeable orders meeting taxi sharing rules, determines taxi sharing paths after the orders are merged, wherein the taxi sharing paths comprise the starting point and the end point of the travel in each appointment order, and finally determines the shortest taxi sharing path distance of the shortest path in the taxi sharing paths.
In the embodiment of the present invention, the number of the merged appointment orders may be two or more.
And 102, acquiring target paths of the appointment order, and determining a second path distance, wherein the second path distance is the sum of the path distances of each target path.
The server acquires the target path of each car-booking order, and then sums the distances of the target paths of all the car-booking orders to obtain a second path distance.
For example, if the target route of the car-booking order a is d (a) and the target route of the car-booking order B is d (B), the second route distance is d (a) + d (B).
It will be appreciated that each appointment order may have multiple alternative routes in its journey, the target route being one of the alternative routes.
103, determining a carpooling parameter according to the first path distance and the second path distance; the carpooling parameter is the ratio of the difference value between the first path distance and the second path distance to the longest path in the target paths.
The car sharing parameters represent the ratio relation between the path distance (namely mileage, for vehicles) saved by the car sharing path and the longest path, and the matching degree of the order is represented through the car sharing parameters; the carpooling parameter is the ratio of the difference value between the first path distance and the second path distance to the longest path in the target paths; for example, taking two car sharing orders for car sharing as an example, the target path of the car sharing order a is D (a), the target path of the car sharing order B is D (B), and the car sharing path after combining the car sharing order a and the car sharing order B is D (a + B), the car sharing parameters are as follows:
wherein, P is the carpooling parameter, MAX [ D (A), D (B) ] is the longest path (distance) in the target paths; the difference between the first path distance and the second path distance is the path distance saved by the carpooling; and judging whether the effect of saving the mileage of the carpooling is obvious or not by comparing the ratio of the path distance saved by the carpooling with the longest path.
And 104, if the car sharing parameters meet the preset numerical value requirements, combining each car booking order into a target order.
If the car sharing parameters meet the preset value requirement, for example, the car sharing parameters are greater than a preset threshold, the preset threshold can be 10% or other positive numbers, and the greater the car sharing parameters are, the more significant the mileage saved by car sharing is represented; merging each taxi appointment order into a target order, namely a taxi sharing order; if the car booking orders are sent by passengers, dispatching the orders; and if the order sent by the driver exists in the order of the car appointment, namely the order is dispatched to the client side of the driver.
It can be understood that, for a user with a shorter path distance, that is, a user with a non-longest target path, the ratio of the saved path distance to the path of the user is necessarily greater than the P value, and the saving degree is necessarily higher than that of the longest path.
In this way, the server not only considers the starting point and the end point of the travel in the car booking order, but also considers the saving degree of the saved mileage relative to the longest path in the car pooling process; if the saving degree is larger, the orders can be merged; if the saving degree is very small, even the car sharing parameter is a negative value, for the user, the car sharing path is longer, the time consumption is longer, and the combination is not needed.
In the prior art, the carpooling process only considers a starting point and an end point, more than two paths are usually arranged between the starting point and the end point, the starting point and the end point are close to each other sometimes, but the paths are different, at the moment, the blind combination of orders is not suitable for users, even the total mileage is longer after the combination, and therefore, the comparison between the starting point and the end point only has certain defects.
As an example, regarding the matching degree of the car pool parameter characterization, see fig. 2 to 4, fig. 2 is example 1, fig. 3 is example 2, and fig. 4 is example 3;
referring to table 1 below, the path distances for each example are shown in table 1, in units of 10 kilometers for example;
table 1:
as shown in example 1 of FIG. 2, P < 0, the two appointment orders do not match, and D (A + B) extends the mileage relative to D (A) and D (B).
As shown in example 2 in fig. 3, P is 50%, and the two car-booking orders match; as shown in example 3 in fig. 4, P ═ 30%, the two car-booking orders match.
In the embodiment of the invention, a first path distance is determined by receiving taxi appointment orders of at least two clients; acquiring a target path of the taxi appointment order and determining a second path distance; determining a carpooling parameter according to the first path distance and the second path distance; if the taxi sharing parameters meet the preset numerical value requirements, merging each taxi appointment order into a target order, and characterizing the matching degree of the orders through the taxi sharing parameters, so that orders with low matching degree are prevented from being merged, and even the total mileage is longer; the embodiment of the invention solves the problem that in the prior art, the network appointment platform only compares the starting point and the ending point in the car sharing process and has limitation.
Optionally, in an embodiment of the present invention, the step of obtaining the target path of the car booking order and determining the second path distance includes:
judging whether a target path with the second path distance larger than the first path distance exists in the selectable paths of each taxi appointment order:
if yes, determining a second path distance according to the target path;
if not, determining that the car booking order does not meet the car pooling requirement.
Wherein, in the journey of each car booking order, a plurality of selectable paths may be provided, and the target path is one of the selectable paths; for example, for the appointment order a, the selectable paths include a1, a2, A3; for the appointment order B, the selectable paths comprise B1 and B2;
the second path distance is D (A) + D (B), the server judges whether at least one path A0 exists in the selectable paths of the car-booking order A and whether at least one path B0 exists in the selectable paths of the car-booking order B, and the condition that D (A0) + D (B0) is greater than the first path distance D (A + B) is met.
If yes, determining that the taxi appointment orders can be combined, executing a subsequent process, and determining a second path distance;
otherwise, determining that the car booking order does not meet the car pooling requirement, and ending the process.
Optionally, in this embodiment of the present invention, the step of determining the first path distance includes:
determining a car sharing path for combining each car booking order, wherein the car sharing path sequentially comprises a starting point part and an end point part, and the starting point part comprises a starting point of a car sharing travel in each car booking order; the end portion comprises an end of the ride share itinerary in each of the appointment orders;
and determining the shortest car sharing path distance in the car sharing paths.
Firstly, dividing starting points of the car sharing routes of all car booking orders into a set, namely a starting point part; then dividing all the end points into a set as an end point part; for example, for a car booking order a and a car booking order B; selecting one point from the starting point of the order A and the starting point of the order B as a starting point and the other point as a subsequent point according to the starting point and the end point of the order A and the starting point and the end point of the order B; then selecting one point from the end point of A and the end point of B as a third point, taking the other point as an end point, and calculating the plan according to the shortest path search plan of the GPS navigation of the electronic map, wherein the carpooling path can have several paths:
path one: a start point → B start point → a end point → B end point;
and a second route: a start point → B end point → a end point;
path three: b start → a end → B end;
and a fourth path: b start → a start → B end → a end;
and then screening the distance of a shortest path from the four paths to be used as the shortest car pooling path distance.
Optionally, in this embodiment of the present invention, each starting point and each ending point are included in the shortest car-sharing path distance, and the shortest car-sharing path distance does not repeatedly pass through the starting point and/or the ending point, that is, each starting point and each ending point should be included in the shortest car-sharing path, and each starting point or each ending point is not repeated in the whole route in sequence.
When judging whether the two car appointments can be matched or not, the time and the distance are concrete representation of the efficiency of one trip, the two trips are supposed to be combined firstly, the shortest path is calculated, and then the two trips are compared with the single paths of the two trips respectively.
In the embodiment of the invention, a first path distance is determined by receiving taxi appointment orders of at least two clients; acquiring a target path of the taxi appointment order and determining a second path distance; determining a carpooling parameter according to the first path distance and the second path distance; if the taxi sharing parameters meet the preset value requirements, merging each taxi appointment order into a target order, and characterizing the matching degree of the orders through the taxi sharing parameters, so that orders with low matching degree are prevented from being merged, and even the total mileage is longer.
The order processing method provided by the embodiment of the invention is described above by the server side, and the order processing device provided by the embodiment of the invention is described below with reference to the accompanying drawings.
Referring to fig. 5, an embodiment of the present invention provides an order processing apparatus, where the apparatus includes:
the order receiving module 501 is configured to receive car booking orders of at least two clients, and determine a first path distance, where the first path distance is a shortest car pooling path distance combining the car booking orders.
The server can be preset with an order sending period, and the order sending period can be minute-level or second-level time; and in each order dispatching period, summarizing the received car booking orders, and screening out the orders capable of sharing cars.
It will be appreciated that the client may provide a ride share option when the user places an order, or ask the user whether to accept ride shares; and if the user actively selects the car sharing option or feeds back to the client to receive the car sharing, the client sends a car booking order carrying preset car sharing instructions to the server.
The server receives taxi appointment orders carrying preset taxi sharing instructions, judges the mergeable orders meeting taxi sharing rules, determines taxi sharing paths after the orders are merged, wherein the taxi sharing paths comprise the starting point and the end point of the travel in each appointment order, and finally determines the shortest taxi sharing path distance of the shortest path in the taxi sharing paths.
In the embodiment of the present invention, the number of the merged appointment orders may be two or more.
A distance determining module 502, configured to obtain target paths of the car appointment order, and determine a second path distance, where the second path distance is a sum of path distances of each of the target paths.
The server acquires the target path of each car-booking order, and then sums the distances of the target paths of all the car-booking orders to obtain a second path distance.
For example, if the target route of the car-booking order a is d (a) and the target route of the car-booking order B is d (B), the second route distance is d (a) + d (B).
It will be appreciated that each appointment order may have multiple alternative routes in its journey, the target route being one of the alternative routes.
A parameter determining module 503, configured to determine a carpool parameter according to the first path distance and the second path distance; the carpooling parameter is the ratio of the difference value between the first path distance and the second path distance to the longest path in the target paths.
The car sharing parameters represent the ratio relation between the path distance (namely mileage, for vehicles) saved by the car sharing path and the longest path, and the matching degree of the order is represented through the car sharing parameters; the carpooling parameter is the ratio of the difference value between the first path distance and the second path distance to the longest path in the target paths; for example, taking two car sharing orders for car sharing as an example, the target path of the car sharing order a is D (a), the target path of the car sharing order B is D (B), and the car sharing path after combining the car sharing order a and the car sharing order B is D (a + B), the car sharing parameters are as follows:
wherein, P is the carpooling parameter, MAX [ D (A), D (B) ] is the longest path (distance) in the target paths; the difference between the first path distance and the second path distance is the path distance saved by the carpooling; and judging whether the effect of saving the mileage of the carpooling is obvious or not by comparing the ratio of the path distance saved by the carpooling with the longest path.
An order combining module 504, configured to combine each taxi appointment order into a target order if the taxi sharing parameters meet preset numerical requirements.
If the car sharing parameters meet the preset value requirement, for example, the car sharing parameters are greater than a preset threshold, the preset threshold can be 10% or other positive numbers, and the greater the car sharing parameters are, the more significant the mileage saved by car sharing is represented; merging each taxi appointment order into a target order, namely a taxi sharing order; if the car booking orders are sent by passengers, dispatching the orders; and if the order sent by the driver exists in the order of the car appointment, namely the order is dispatched to the client side of the driver.
It can be understood that, for a user with a shorter path distance, that is, a user with a non-longest target path, the ratio of the saved path distance to the path of the user is necessarily greater than the P value, and the saving degree is necessarily higher than that of the longest path.
In this way, the server not only considers the starting point and the end point of the travel in the car booking order, but also considers the saving degree of the saved mileage relative to the longest path in the car pooling process; if the saving degree is larger, the orders can be merged; if the saving degree is very small, even the car sharing parameter is a negative value, for the user, the car sharing path is longer, the time consumption is longer, and the combination is not needed.
In the prior art, the carpooling process only considers a starting point and an end point, more than two paths are usually arranged between the starting point and the end point, the starting point and the end point are close to each other sometimes, but the paths are different, at the moment, the blind combination of orders is not suitable for users, even the total mileage is longer after the combination, and therefore, the comparison between the starting point and the end point only has certain defects.
Optionally, in this embodiment of the present invention, the distance determining module 502 includes:
a judging submodule, configured to judge whether a target route having a distance between the second route and the first route greater than that of the first route exists in the selectable routes of each car-booking order:
if yes, determining a second path distance according to the target path;
if not, determining that the car booking order does not meet the car pooling requirement.
Optionally, in this embodiment of the present invention, the order receiving module 501 includes:
a route determination submodule, configured to determine a car pooling route for merging each car booking order, where the car pooling route sequentially includes a start point part and an end point part, and the start point part includes a start point of a car pooling stroke in each car booking order; the end portion comprises an end of the ride share itinerary in each of the appointment orders;
and the distance determining submodule is used for determining the shortest car sharing path distance in the car sharing paths.
Optionally, in this embodiment of the present invention, the shortest car pooling path distance includes each starting point and each ending point, and does not repeatedly pass through the starting point and/or the ending point.
Optionally, in the embodiment of the present invention, the car booking order carries a preset car pooling instruction.
The taxi taking application processing device provided by the embodiment of the invention can realize each process realized by the taxi taking application processing device in the method embodiments of fig. 1 to fig. 4, and is not repeated here for avoiding repetition.
In the embodiment of the invention, the order receiving module 501 receives the order of car booking of at least two clients and determines the first path distance; the distance determining module 502 obtains a target path of the car appointment order and determines a second path distance; the parameter determining module 503 determines the carpool parameter according to the first path distance and the second path distance; if the taxi sharing parameters meet the preset value requirements, the order merging module 504 merges each taxi appointment order into a target order, and the matching degree of the orders is characterized through the taxi sharing parameters, so that the orders with low matching degree are prevented from being merged, and even the total mileage is longer; the embodiment of the invention solves the problem that in the prior art, the network appointment platform only compares the starting point and the ending point in the car sharing process and has limitation.
On the other hand, the embodiment of the present invention further provides an electronic device, which includes a memory, a processor, a bus, and a computer program stored on the memory and executable on the processor, where the processor implements the steps in the order processing method when executing the program.
For example, fig. 6 shows a schematic physical structure diagram of an electronic device.
As shown in fig. 6, the electronic device may include: a processor (processor)610, a communication Interface (Communications Interface)620, a memory (memory)630 and a communication bus 640, wherein the processor 610, the communication Interface 620 and the memory 630 communicate with each other via the communication bus 640. The processor 610 may call logic instructions in the memory 630 to perform the following method:
receiving taxi appointment orders of at least two clients, and determining a first path distance, wherein the first path distance is the shortest car sharing path distance combining the taxi appointment orders;
acquiring target paths of the taxi appointment order, and determining a second path distance, wherein the second path distance is the sum of the path distances of each target path;
determining a carpooling parameter according to the first path distance and the second path distance; the carpooling parameter is the ratio of the difference value between the first path distance and the second path distance to the longest path in the target paths;
and if the car sharing parameters meet the preset numerical value requirements, combining each car booking order into a target order.
In addition, the logic instructions in the memory 630 may be implemented in software functional units and stored in a computer readable storage medium when the logic instructions are sold or used as independent products. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
In another aspect, an embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored, where the computer program is implemented to, when executed by a processor, perform the order processing method provided in the foregoing embodiments, for example, including:
receiving taxi appointment orders of at least two clients, and determining a first path distance, wherein the first path distance is the shortest car sharing path distance combining the taxi appointment orders;
acquiring target paths of the taxi appointment order, and determining a second path distance, wherein the second path distance is the sum of the path distances of each target path;
determining a carpooling parameter according to the first path distance and the second path distance; the carpooling parameter is the ratio of the difference value between the first path distance and the second path distance to the longest path in the target paths;
and if the car sharing parameters meet the preset numerical value requirements, combining each car booking order into a target order.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (10)
1. An order processing method, characterized in that the method comprises:
receiving taxi appointment orders of at least two clients, and determining a first path distance, wherein the first path distance is the shortest car sharing path distance combining the taxi appointment orders;
acquiring target paths of the taxi appointment order, and determining a second path distance, wherein the second path distance is the sum of the path distances of each target path;
determining a carpooling parameter according to the first path distance and the second path distance; the carpooling parameter is the ratio of the difference value between the first path distance and the second path distance to the longest path in the target paths;
and if the car sharing parameters meet the preset numerical value requirements, combining each car booking order into a target order.
2. The order processing method according to claim 1, wherein the step of obtaining the target path of the appointment order and determining the second path distance comprises:
judging whether a target path with the second path distance larger than the first path distance exists in the selectable paths of each taxi appointment order:
if yes, determining a second path distance according to the target path;
if not, determining that the car booking order does not meet the car pooling requirement.
3. The order processing method of claim 1, wherein the step of determining the first path distance comprises:
determining a car sharing path for combining each car booking order, wherein the car sharing path sequentially comprises a starting point part and an end point part, and the starting point part comprises a starting point of a car sharing travel in each car booking order; the end portion comprises an end of the ride share itinerary in each of the appointment orders;
and determining the shortest car sharing path distance in the car sharing paths.
4. The order processing method according to claim 3, wherein the shortest carpool path distance includes each of the start point and each of the end points, and does not repeatedly pass through the start point and/or the end point.
5. The order processing method according to claim 1, wherein the car booking order carries a preset car pooling indication.
6. An order processing apparatus, characterized in that the apparatus comprises:
the order receiving module is used for receiving car booking orders of at least two clients and determining a first path distance, wherein the first path distance is the shortest car pooling path distance for combining each car booking order;
the distance determining module is used for acquiring target paths of the car booking order and determining a second path distance, wherein the second path distance is the sum of the path distances of each target path;
the parameter determining module is used for determining car sharing parameters according to the first path distance and the second path distance; the carpooling parameter is the ratio of the difference value between the first path distance and the second path distance to the longest path in the target paths;
and the order combining module is used for combining each taxi booking order into a target order if the taxi sharing parameters meet the preset numerical value requirements.
7. The order processing apparatus of claim 6, wherein the distance determination module comprises:
a judging submodule, configured to judge whether a target route having a distance between the second route and the first route greater than that of the first route exists in the selectable routes of each car-booking order:
if yes, determining a second path distance according to the target path;
if not, determining that the car booking order does not meet the car pooling requirement.
8. The order processing apparatus of claim 6, wherein the order receiving module comprises:
a route determination submodule, configured to determine a car pooling route for merging each car booking order, where the car pooling route sequentially includes a start point part and an end point part, and the start point part includes a start point of a car pooling stroke in each car booking order; the end portion comprises an end of the ride share itinerary in each of the appointment orders;
and the distance determining submodule is used for determining the shortest car sharing path distance in the car sharing paths.
9. An electronic device comprising a processor, a memory and a computer program stored on the memory and executable on the processor, characterized in that the computer program, when executed by the processor, carries out the steps of the order processing method according to any of claims 1 to 5.
10. A computer-readable storage medium, characterized in that a computer program is stored on the computer-readable storage medium, which computer program, when being executed by a processor, carries out the steps of the order processing method according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911013759.2A CN110910202B (en) | 2019-10-23 | 2019-10-23 | Order processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911013759.2A CN110910202B (en) | 2019-10-23 | 2019-10-23 | Order processing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110910202A true CN110910202A (en) | 2020-03-24 |
| CN110910202B CN110910202B (en) | 2022-05-31 |
Family
ID=69815767
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911013759.2A Active CN110910202B (en) | 2019-10-23 | 2019-10-23 | Order processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110910202B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113361990A (en) * | 2021-05-25 | 2021-09-07 | 深圳依时货拉拉科技有限公司 | Freight car sharing method, computer readable storage medium and computer equipment |
| CN113792921A (en) * | 2021-09-06 | 2021-12-14 | 南京领行科技股份有限公司 | Taxi sharing method, device, server and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180053277A1 (en) * | 2016-03-08 | 2018-02-22 | Beijing Didi Infinity Technology And Development Co., Ltd. | Systems and methods for carpooling |
| CN108734361A (en) * | 2017-04-18 | 2018-11-02 | 北京嘀嘀无限科技发展有限公司 | Share-car order processing method and apparatus |
| CN110348589A (en) * | 2019-07-12 | 2019-10-18 | 北京平安快轿科技有限公司 | A kind of share-car method, apparatus, computer equipment and storage medium |
-
2019
- 2019-10-23 CN CN201911013759.2A patent/CN110910202B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180053277A1 (en) * | 2016-03-08 | 2018-02-22 | Beijing Didi Infinity Technology And Development Co., Ltd. | Systems and methods for carpooling |
| CN108734361A (en) * | 2017-04-18 | 2018-11-02 | 北京嘀嘀无限科技发展有限公司 | Share-car order processing method and apparatus |
| CN110348589A (en) * | 2019-07-12 | 2019-10-18 | 北京平安快轿科技有限公司 | A kind of share-car method, apparatus, computer equipment and storage medium |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113361990A (en) * | 2021-05-25 | 2021-09-07 | 深圳依时货拉拉科技有限公司 | Freight car sharing method, computer readable storage medium and computer equipment |
| CN113792921A (en) * | 2021-09-06 | 2021-12-14 | 南京领行科技股份有限公司 | Taxi sharing method, device, server and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110910202B (en) | 2022-05-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP7235647B2 (en) | Systems and methods for allocating pending orders | |
| CN109308540A (en) | A kind of distribution plan generation method of distribution vehicle, apparatus and system | |
| CN107919013B (en) | Get-on point processing method and server | |
| CN110348589B (en) | Car pooling method and device, computer equipment and storage medium | |
| CN112262418B (en) | Vehicle management system and vehicle management method | |
| CN111967928B (en) | Riding order processing method and device | |
| CN107844843B (en) | Order processing method and server | |
| CN107195175A (en) | A kind of order allocation method and system | |
| CN110910202B (en) | Order processing method and device | |
| CN108332765B (en) | Carpooling travel route generation method and device | |
| CN108780554A (en) | A kind of share-car method and system | |
| CN111899061A (en) | Order recommendation method, device, equipment and storage medium | |
| CN111861081A (en) | Order allocation method and device, electronic equipment and storage medium | |
| CN109670900A (en) | A kind of short-distance freight services order method for pushing and server | |
| CN110580576A (en) | Order distribution method and device | |
| CN110889738B (en) | Order distribution method and device | |
| CN111489214B (en) | Order allocation method, condition setting method, device and electronic equipment | |
| CN111860902A (en) | Order processing method, device, equipment and computer readable storage medium | |
| CN106558159B (en) | Carpooling method and device | |
| CN114372714A (en) | Automatic vehicle allocation method, device, equipment, medium and program product | |
| CN110570001B (en) | Travel order processing method and device and server | |
| CN111325436A (en) | Network appointment vehicle co-operation passenger matching method and system, storage medium and server | |
| CN113159353A (en) | Network appointment vehicle order distribution method and device and computer storage medium | |
| WO2021031636A1 (en) | Real-time order travel vehicle-based real-time order assignment method and apparatus | |
| CN111612286B (en) | Order distribution 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |