CN111678530A - Carpooling path determination method and device - Google Patents
Carpooling path determination method and device Download PDFInfo
- Publication number
- CN111678530A CN111678530A CN202010504123.4A CN202010504123A CN111678530A CN 111678530 A CN111678530 A CN 111678530A CN 202010504123 A CN202010504123 A CN 202010504123A CN 111678530 A CN111678530 A CN 111678530A
- Authority
- CN
- China
- Prior art keywords
- path
- end point
- determining
- marked
- marked end
- 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
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3407—Route searching; Route guidance specially adapted for specific applications
- G01C21/3438—Rendez-vous, i.e. searching a destination where several users can meet, and the routes to this destination for these users; Ride sharing, i.e. searching a route such that at least two users can share a vehicle for at least part of the route
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a method and a device for determining a carpooling path, wherein the method comprises the following steps: receiving a car sharing request of a plurality of users, wherein the users are located at the same starting point; according to the car sharing request of each user, marking the end point of each user, and determining a plurality of marked end points; and circularly executing the following steps until no marked end point exists, and determining one or more target paths: determining a plurality of shortest paths of N-1 marked end points in the path, wherein N is the maximum number of car sharing people; determining a target path according to a plurality of shortest paths of N-1 marked end points of the path; and unmarking each marked end point contained in the target path. The invention can reduce detour and reduce the car sharing cost of users.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to a carpooling path determining method and device.
Background
The existing car sharing application is developed for the public, users participating in car sharing have different backgrounds and different travel routes, and mostly start from different starting points and reach different end points, so that when a car sharing path is determined, only whether the routes of different users are matched or not is considered, and the car sharing path can be determined as long as the routes of different users are partially matched. One possible scenario is that when a plurality of users located at the same starting point drive a car, the travel routes are partially matched with each other, and when the carpool path is determined based on the route matching method, a large number of detours are caused, so that the overall carpool of the plurality of users is high.
In view of the above problems, no effective solution has been proposed.
Disclosure of Invention
The embodiment of the invention provides a carpooling path determining method, which is used for optimizing a carpooling path and reducing carpooling cost and comprises the following steps:
receiving a car sharing request of a plurality of users, wherein the users are located at the same starting point;
according to the car sharing request of each user, marking the end point of each user, and determining a plurality of marked end points;
and circularly executing the following steps until no marked end point exists, and determining one or more target paths:
determining a plurality of shortest paths of N-1 marked end points in the path, wherein N is the maximum number of car sharing people;
determining a target path according to a plurality of shortest paths of N-1 marked end points of the path;
and unmarking each marked end point contained in the target path.
The embodiment of the invention provides a carpooling path determining device, which is used for optimizing a carpooling path and reducing the carpooling cost, and comprises the following components:
the device comprises a request receiving module, a sharing module and a sharing module, wherein the request receiving module is used for receiving the car sharing requests of a plurality of users, and the users are positioned at the same starting point;
the marking module is used for marking the end point of each user according to the car sharing request of each user and determining a plurality of marked end points;
a target path determination module, configured to perform the following steps in a loop until there is no marked end point, and determine one or more target paths:
determining a plurality of shortest paths of N-1 marked end points in the path, wherein N is the maximum number of car sharing people;
determining a target path according to a plurality of shortest paths of N-1 marked end points of the path;
and unmarking each marked end point contained in the target path.
The embodiment of the invention also provides computer equipment which comprises a memory, a processor and a computer program which is stored on the memory and can run on the processor, wherein the processor realizes the carpooling path determining method when executing the computer program.
The embodiment of the invention also provides a computer readable storage medium, and the computer readable storage medium stores a computer program for executing the car-sharing path determining method.
The embodiment of the invention comprises the following steps: receiving a car sharing request of a plurality of users, wherein the users are located at the same starting point; according to the car sharing request of each user, marking the end point of each user, and determining a plurality of marked end points; and circularly executing the following steps until no marked end point exists, and determining one or more target paths: determining a plurality of shortest paths of N-1 marked end points in the path, wherein N is the maximum number of car sharing people; determining a target path according to a plurality of shortest paths of N-1 marked end points of the path; and unmarking each marked end point contained in the target path. The invention can carry out the integral optimization of the carpooling path on the basis of the starting point and a plurality of end points for a plurality of users positioned at the same starting point, can reduce detours and reduce the carpooling cost of the users.
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. In the drawings:
FIG. 1 is a schematic diagram of a flow of a carpool path determination method in an embodiment of the invention;
FIG. 2 is a schematic diagram of a starting point and a plurality of ending points according to an embodiment of the present invention;
FIG. 3 is a diagram illustrating the shortest path between destination A, B, D and 1 marked destination in accordance with an embodiment of the present invention;
FIG. 4 is a diagram illustrating the shortest path between destination E and 1 marked destination in the embodiment of the present invention;
FIG. 5 is a diagram illustrating the shortest path between destination C and 1 marked destination in the embodiment of the present invention;
FIG. 6 is a diagram illustrating the shortest path between destination A, B, D and 2 marked destinations in accordance with an embodiment of the present invention;
FIG. 7 is a diagram illustrating the shortest path between end point E and 2 marked end points in the path according to an embodiment of the present invention;
FIG. 8 is a diagram illustrating the shortest path between destination C and 2 marked destinations in accordance with an embodiment of the present invention;
fig. 9 is a schematic diagram of a structure of a car pooling path determining device in the embodiment of the 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 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. As used hereinafter, the term "unit" or "module" may be a combination of software and/or hardware that implements a predetermined function. Although the means described in the embodiments below are preferably implemented in software, an implementation in hardware, or a combination of software and hardware is also possible and contemplated.
In order to solve the technical problem that a large number of detours are caused when a plurality of users located at the same starting point drive a car by the existing car pooling method based on route matching, and the overall car pooling of the plurality of users is high, an embodiment of the invention provides a car pooling path determining method for optimizing a car pooling path and reducing car pooling cost, fig. 1 is a schematic diagram of a flow of the car pooling path determining method in the embodiment of the invention, and as shown in fig. 1, the method comprises the following steps:
step 101: receiving a car sharing request of a plurality of users, wherein the users are located at the same starting point;
step 102: according to the car sharing request of each user, marking the end point of each user, and determining a plurality of marked end points;
step 103: and circularly executing the following steps until no marked end point exists, and determining one or more target paths:
step 104: determining a plurality of shortest paths of N-1 marked end points in the path, wherein N is the maximum number of car sharing people;
step 105: determining a target path according to a plurality of shortest paths of N-1 marked end points of the path;
step 106: and unmarking each marked end point contained in the target path.
As shown in fig. 1, an embodiment of the present invention is implemented by: receiving a car sharing request of a plurality of users, wherein the users are located at the same starting point; according to the car sharing request of each user, marking the end point of each user, and determining a plurality of marked end points; and circularly executing the following steps until no marked end point exists, and determining one or more target paths: determining a plurality of shortest paths of N-1 marked end points in the path, wherein N is the maximum number of car sharing people; determining a target path according to a plurality of shortest paths of N-1 marked end points of the path; and unmarking each marked end point contained in the target path. The invention can carry out the integral optimization of the carpooling path on the basis of the starting point and a plurality of end points for a plurality of users positioned at the same starting point, can reduce detours and reduce the carpooling cost of the users.
In one embodiment, multiple users in step 101 have the same preset tag.
In specific implementation, when a plurality of users located at the same starting point drive, specific positions of the starting point and a plurality of end points can be determined according to car sharing requests of the plurality of users, and a time length from the starting point to each end point can also be determined, wherein the plurality of users have the same preset tag, and the same preset tag can be, for example: the multiple users belong to employees of the same enterprise, the multiple users belong to female employees of the same enterprise, the multiple users have relatives or friends, and the like, the preset tags of the users can be carried in the car sharing requests of the users, and the isolation in social groups can be realized through the preset tags. One possible scenario is that a plurality of users belonging to the same enterprise make a taxi integrally after overtime, the names of the enterprises are carried in the taxi sharing requests of the users, the users belonging to the same enterprise can be isolated from other users according to the names of the enterprises in the taxi sharing requests, and taxi sharing paths are only established for the users belonging to the same enterprise, so that the taxi sharing paths can be integrally optimized, detours are reduced, the taxi sharing cost of the users is reduced, the reimbursement cost of the enterprises is further reduced, and the taxi sharing cost of the users belonging to the same enterprise is facilitated.
In specific implementation, in step 102, according to a car-sharing request of each user, a plurality of marked end points may be marked for an end point of each user, and the purpose of determining the plurality of marked end points is to determine whether to execute a loop in subsequent step 103, in step 103, it may be determined whether a marked end point exists, and if so, step 104, step 105, and step 106 may be executed in a loop until no marked end point exists, and a plurality of target paths may be determined, and the plurality of target paths are determined as car-sharing paths.
In one embodiment, step 104, determining the shortest paths to N-1 marked end points of the route may include:
step 1041: sorting the marked end points according to the distance from the marked end points to the starting point from near to far;
step 1042: and (3) circularly executing the following steps until i is equal to N-1, and determining a plurality of shortest paths of N-1 marked end points of the path:
step 1043: for each marked end point, determining the shortest path of the marked end point in the i marked end points of the path according to the shortest path of each marked end point arranged before the marked end point in the i-1 marked end points of the path; let i equal i + 1.
In specific implementation, in step 1041, each marked end point may be sorted according to the distance from the marked end point to the start point from the near to the far, respectively, and fig. 2 is a schematic diagram of the start point and a plurality of end points in the embodiment of the present invention, as shown in fig. 2, the start point in fig. 2 is a company, the marked end points are an end point a, an end point B, an end point C, an end point D, and an end point E, respectively, each end point corresponds to one user, and the 5 end points may be sorted according to the distance from the marked end point to the company from the near to the far, respectively, to: and calculating the time consumption from the starting point to each end point, as shown in table 1, and calculating the time consumption between each end point for the subsequent steps.
TABLE 1 time consumption from the start to the respective end
| Company(s) | Time consuming company to each endpoint |
| |
5 |
| End point D | 7 |
| |
8 |
| End point E | 9 |
| End point C | 11 |
Then, in step 1042, let i be 1, and step 1043 is executed in a loop manner, and for each marked end point, according to the shortest path of each marked end point arranged before the marked end point when the marked end point is at i-1 marked end points of the route, the shortest path of the marked end point at i marked end points of the route is determined; and (3) determining the shortest paths of the N-1 marked end points of the path until i is equal to i +1 and until i is equal to N-1.
A specific example is given below to facilitate understanding of the above step 1042 and step 1043.
Setting the maximum number of car pooling allowed to be N to 3, where i to 1, and for each marked end point, according to the sorting in step 1041, determining the shortest path of the marked end point in the route 1 according to the shortest paths of the marked end points arranged before the marked end point in the route 0 to the marked end points (the shortest path of the route 0 to the marked end points is the shortest path from the company to each end point in table 1), including:
fig. 3 is a schematic diagram of the shortest path of the end point A, B, D when traversing 1 marked end point in the embodiment of the present invention, as shown in fig. 3, for the end point a, since the end point a is the end point closest to the company, and there is no need to traverse other end points, the shortest path of the end point a when traversing 1 marked end point does not exist; for end point D, the end point that is ranked before end point D is only end point a, so the shortest path for end point D to pass through 1 marked end point is: company → end a → end D, consuming 5+3 ═ 8; for endpoint B, endpoints that are ranked before endpoint B include: end point a, end point D, therefore end point B has two options: company → end point a → end point B, consuming 5+4 ═ 9; company → end point D → end point B, which takes 7+4 to 11, and selects the route with shorter time consumption, i.e. the shortest route when end point B is routed to 1 marked end point: company → terminal a → terminal B.
Fig. 4 is a schematic diagram of the shortest path of the end point E when the path runs through 1 marked end point in the embodiment of the present invention, as shown in fig. 4, for the end point E, the end point arranged before the end point E includes: end point a, end point D, end point B, therefore end point E has three options: company → end point a → end point E, consuming 5+5 ═ 10; company → end point D → end point E, consuming 7+2 ═ 9; company → end point B → end point E, time consuming: 8+2 ═ 10; the shortest path with shorter time consumption is selected, namely the shortest path when the end point E approaches 1 marked end point is as follows: company → end point D → end point E.
Fig. 5 is a schematic diagram of the shortest path between end point C and 1 marked end point of the path in the embodiment of the present invention, and as shown in fig. 5, for end point C, the end point arranged before end point C includes: end point a, end point D, end point B, end point E, so end point C has four options: company → end a → end C, taking 5+8 to 13; company → end point D → end point C, which takes 7+7 to 14; company → end point B → end point C, which takes 8+4 to 12; company → end point E → end point C, takes 9+4 to 13, and selects the route with shorter time consumption, i.e. the shortest route when end point C is routed to 1 marked end point: company → terminal B → terminal C.
Thus, the shortest path of each marked end point in the route 1 marked end point is determined, and the shortest paths of the route 1 marked end points are sorted into table 1, so as to obtain table 2 as follows:
TABLE 2 shortest Path and time consumption for 1 marked end Point
After i is equal to i +1 and i is equal to 2, executing the determination condition in step 1042, and continuing the loop, according to the above sorting, for each marked end point, determining the shortest path of the marked end point in the route 2 marked end points according to the shortest path of each marked end point arranged before the marked end point in the route 1 marked end point, including:
fig. 6 is a schematic diagram of the shortest path when the end point A, B, D is routed to 2 marked end points in the embodiment of the present invention, as shown in fig. 6, for the end point a, since the end point a is the end point closest to the company, and there is no need to route to other end points, the shortest path when the end point a is routed to 2 marked end points does not exist; for the end point D, the end point arranged before the end point D is only the end point A, so the end point D also has no shortest path when the end points are marked by 2 paths; for end point B, the shortest path for each end point ranked before end point B when route 1 has marked end point is only one, company → end point a → end point D, so the shortest path for end point B when route 2 has marked end points is: company → end point a → end point D → end point B, takes 8+4 to 12.
Fig. 7 is a schematic diagram of the shortest path between end point E and 2 marked end points in the route according to the embodiment of the present invention, as shown in fig. 7, for end point E, the shortest path between each end point arranged before end point E and 1 marked end point in the route has two, namely, company → end point a → end point D and company → end point a → end point B, and therefore, end point E has two choices: company → end point a → end point D → end point E, which takes 8+2 to 10; company → end point a → end point B → end point E, which takes 9+2 to 11, and selects a route which takes a shorter time, so the shortest route when end point E approaches 2 marked end points is: company → end point a → end point D → end point E.
Fig. 8 is a schematic diagram of the shortest path between end point C and 2 marked end points in the route according to the embodiment of the present invention, and as shown in fig. 8, for end point C, the shortest paths between end points arranged before end point C and 1 marked end point in the route have: company → endpoint a → endpoint D, company → endpoint a → endpoint B and company → endpoint D → endpoint E, therefore, there are three choices for endpoint C: company → end point a → end point D → end point C, which takes 8+7 to 15; company → end point a → end point B → end point C, which takes 9+4 to 13; company → end point D → end point E → end point C, the time consumption is 9+4 ═ 13, at this time, two routes take the same time, and a better route can be selected according to the detour degree of the two routes, therefore, the shortest route when end point C is reached by 2 marked end points is: company → end point D → end point E → end point C.
Thus, the shortest path of each marked end point in the path 2 marked end points is determined, and the shortest paths of the path 2 marked end points are sorted into table 3, so as to obtain table 3 as follows:
TABLE 3 shortest Path and time consumption for 2 marked endpoints
If i is equal to i +1, i is equal to 3, and if i is equal to N, the determining condition in step 1042 is executed, and the loop is stopped, so as to obtain the shortest paths of N-1 marked end points in the path in table 3. It should be noted that, N set in this embodiment is 3 people, and in an actual situation, the number of N may be set according to customer requirements, for example, if N is 4 people, it is further necessary to continue to calculate the shortest paths passing through 3 marked end points, and a specific calculation process is similar to the above steps, and is not described here again.
In one embodiment, the step 105 of determining a target path according to the shortest paths of N-1 marked end points of the route may include:
step 1051: respectively determining the priority of each shortest path for a plurality of shortest paths of the N-1 paths with marked end points;
step 1052: and determining the shortest path with the highest priority in the shortest paths as a target path.
In one embodiment, the priority of each shortest path in 1051 above may include:
for any shortest path, determining a first time length required by all end points of the shortest path from a starting point and a second time length required by the end point which is farthest from the starting point in the shortest path from the starting point;
and determining the priority of the shortest path according to the difference between the first time length and the second time length.
In particular, after determining the shortest paths of N-1 marked end points of the path, for example, 3 shortest paths in table 3: company → a → D → B, company → a → D → E and company → D → E → C, since the same user may not walk multiple paths at the same time, it is necessary to select a better path among the multiple paths, in step 1051, the priority of each shortest path may be determined, and the priority of each shortest path may be determined, for example: for the shortest path of company → a → D → B, first calculating a first time duration required for company → a → D → B, then calculating a second time duration required for company → B, and determining the priority of the shortest path according to the difference between the first time duration and the second time duration, wherein the smaller the difference is, the less detours are indicated, the higher the priority is, otherwise, the lower the priority is, in step 1042, the shortest path with the highest priority among the shortest paths may be determined as the target path, for example: the company → A → D → E has the highest priority and the least detour, and the company → A → D → E can be determined as a target path.
In one embodiment, after unmarking, in step 106, each marked end point included on the target path, the method further includes:
and when the number of the remaining marked end points is less than the maximum allowed carpooling number, determining the number of the remaining marked end points as the maximum allowed carpooling number.
In specific implementation, in step 106, since a user only walks a route, after a target route is determined, all marked end points included in the target route need to be unmarked, for example, after a company → a → D → E is determined as a target route, the end points a, D and E are unmarked, and the marked end points remaining after unmarked only leave two end points B and C, but N is 3 people, and the marked end points are always in an unsolved state when steps 103 to 106 are executed in a loop, therefore, the maximum number of car pool allowed people needs to be set to 2, and then step 103 to step 106 is executed in a loop to obtain another target route company → B → C, and the specific process of determining the company → B → C is the same as the concept of determining the company → a → D → E, and is not described herein again. After unmarking endpoints B and C, if no marked endpoints exist, the loop is stopped.
Based on the same inventive concept, the embodiment of the invention also provides a car pooling path determining device, such as the following embodiments. Because the principle of solving the problems of the carpool path determining device is similar to that of the carpool path determining method, the implementation of the device can refer to the implementation of the method, and repeated details are not repeated. As used hereinafter, the term "unit" or "module" may be a combination of software and/or hardware that implements a predetermined function. Although the means described in the embodiments below are preferably implemented in software, an implementation in hardware, or a combination of software and hardware is also possible and contemplated.
An embodiment of the present invention provides a car pooling path determining device, configured to optimize a car pooling path and reduce car pooling cost, where fig. 9 is a schematic diagram of a structure of the car pooling path determining device in the embodiment of the present invention, and as shown in fig. 9, the device includes:
the request receiving module 01 is used for receiving car sharing requests of a plurality of users, wherein the users are located at the same starting point;
the marking module 02 is used for marking the end point of each user according to the car sharing request of each user and determining a plurality of marked end points;
a target path determining module 03, configured to perform the following steps in a loop until there is no marked end point, and determine one or more target paths:
determining a plurality of shortest paths of N-1 marked end points in the path, wherein N is the maximum number of car sharing people;
determining a target path according to a plurality of shortest paths of N-1 marked end points of the path;
and unmarking each marked end point contained in the target path.
In one embodiment, the target path determining module 03 is specifically configured to:
sorting the marked end points according to the distance from the marked end points to the starting point from near to far;
and (3) circularly executing the following steps until i is equal to N-1, and determining a plurality of shortest paths of N-1 marked end points of the path:
for each marked end point, determining the shortest path of the marked end point in the i marked end points of the path according to the shortest path of each marked end point arranged before the marked end point in the i-1 marked end points of the path;
let i equal i + 1.
In one embodiment, the target path determining module 03 is specifically configured to:
after each marked end point included on the target path is unmarked, when the number of the remaining marked end points is less than the maximum allowed carpooling number, the number of the remaining marked end points is determined as the maximum allowed carpooling number.
In one embodiment, the target path determining module 03 is specifically configured to:
respectively determining the priority of each shortest path for a plurality of shortest paths of the N-1 paths with marked end points;
and determining the shortest path with the highest priority in the shortest paths as a target path.
In one embodiment, the target path determination module 03 is further configured to:
for any shortest path, determining a first time length required by all end points of the shortest path from a starting point and a second time length required by the end point which is farthest from the starting point in the shortest path from the starting point;
and determining the priority of the shortest path according to the difference between the first time length and the second time length.
In one embodiment, multiple users have the same preset tag.
The embodiment of the invention also provides computer equipment which comprises a memory, a processor and a computer program which is stored on the memory and can run on the processor, wherein the processor realizes the carpooling path determining method when executing the computer program.
The embodiment of the invention also provides a computer readable storage medium, and the computer readable storage medium stores a computer program for executing the car-sharing path determining method.
In summary, the embodiment of the present invention provides: receiving a car sharing request of a plurality of users, wherein the users are located at the same starting point; according to the car sharing request of each user, marking the end point of each user, and determining a plurality of marked end points; and circularly executing the following steps until no marked end point exists, and determining one or more target paths: determining a plurality of shortest paths of N-1 marked end points in the path, wherein N is the maximum number of car sharing people; determining a target path according to a plurality of shortest paths of N-1 marked end points of the path; and unmarking each marked end point contained in the target path. The invention can carry out the integral optimization of the carpooling path on the basis of the starting point and a plurality of end points for a plurality of users positioned at the same starting point, can reduce detours and reduce the carpooling cost of the users.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, 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, 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.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (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 apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, 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 apparatus 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 apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The above is only a preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and variations of the embodiment of the present invention may occur to those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. A carpooling path determination method is characterized by comprising the following steps:
receiving a car sharing request of a plurality of users, wherein the users are located at the same starting point;
according to the car sharing request of each user, marking the end point of each user, and determining a plurality of marked end points;
and circularly executing the following steps until no marked end point exists, and determining one or more target paths:
determining a plurality of shortest paths of N-1 marked end points in the path, wherein N is the maximum number of car sharing people;
determining a target path according to a plurality of shortest paths of N-1 marked end points of the path;
and unmarking each marked end point contained in the target path.
2. The method of claim 1, wherein determining the plurality of shortest paths to N-1 marked end points of the way comprises:
sorting the marked end points according to the distance from the marked end points to the starting point from near to far;
and (3) circularly executing the following steps until i is equal to N-1, and determining a plurality of shortest paths of N-1 marked end points of the path:
for each marked end point, determining the shortest path of the marked end point in the i marked end points of the path according to the shortest path of each marked end point arranged before the marked end point in the i-1 marked end points of the path;
let i equal i + 1.
3. The method of claim 1, wherein after unmarking each marked end point contained on the target path, further comprising:
and when the number of the remaining marked end points is less than the maximum allowed carpooling number, determining the number of the remaining marked end points as the maximum allowed carpooling number.
4. The method of claim 1, wherein determining a destination path based on the shortest paths of N-1 marked end points of the N-1 traversals comprises:
respectively determining the priority of each shortest path for a plurality of shortest paths of the N-1 paths with marked end points;
and determining the shortest path with the highest priority in the shortest paths as a target path.
5. The method of claim 4, wherein determining the priority of each shortest path comprises:
for any shortest path, determining a first time length required by all end points of the shortest path from a starting point and a second time length required by the end point which is farthest from the starting point in the shortest path from the starting point;
and determining the priority of the shortest path according to the difference between the first time length and the second time length.
6. The method of claim 1, further comprising: the plurality of users have the same preset tag.
7. A carpool path determination device, comprising:
the device comprises a request receiving module, a sharing module and a sharing module, wherein the request receiving module is used for receiving the car sharing requests of a plurality of users, and the users are positioned at the same starting point;
the marking module is used for marking the end point of each user according to the car sharing request of each user and determining a plurality of marked end points;
a target path determination module, configured to perform the following steps in a loop until there is no marked end point, and determine one or more target paths:
determining a plurality of shortest paths of N-1 marked end points in the path, wherein N is the maximum number of car sharing people;
determining a target path according to a plurality of shortest paths of N-1 marked end points of the path;
and unmarking each marked end point contained in the target path.
8. The apparatus of claim 7, wherein the target path determination module is specifically configured to:
sorting the marked end points according to the distance from the marked end points to the starting point from near to far;
and (3) circularly executing the following steps until i is equal to N-1, and determining a plurality of shortest paths of N-1 marked end points of the path:
for each marked end point, determining the shortest path of the marked end point in the i marked end points of the path according to the shortest path of each marked end point arranged before the marked end point in the i-1 marked end points of the path;
let i equal i + 1.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method of any one of claims 1 to 6 when executing the computer program.
10. A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program for executing the method of any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010504123.4A CN111678530B (en) | 2020-06-05 | 2020-06-05 | Carpooling path determination method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010504123.4A CN111678530B (en) | 2020-06-05 | 2020-06-05 | Carpooling path determination method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111678530A true CN111678530A (en) | 2020-09-18 |
| CN111678530B CN111678530B (en) | 2022-02-11 |
Family
ID=72435102
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010504123.4A Active CN111678530B (en) | 2020-06-05 | 2020-06-05 | Carpooling path determination method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111678530B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113299111A (en) * | 2021-05-21 | 2021-08-24 | 杭州华尔科技有限公司 | Underground garage vehicle searching method, system and storage medium thereof |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102506851A (en) * | 2011-10-31 | 2012-06-20 | 东软集团股份有限公司 | Navigation device and navigation method |
| CN104715296A (en) * | 2015-04-08 | 2015-06-17 | 北京航空航天大学 | Transportation hub-based method for designing and achieving taxi carpooling mechanism |
| CN104933855A (en) * | 2015-05-28 | 2015-09-23 | 成都亿邻通科技有限公司 | Method for providing combined car-pooling |
| CN106228266A (en) * | 2016-07-25 | 2016-12-14 | 成都云科新能汽车技术有限公司 | A kind of electric motor coach operation system based on global optimization |
| CN107101643A (en) * | 2017-04-10 | 2017-08-29 | 浙江工业大学 | Car pooling matching method |
| US9939280B2 (en) * | 2014-04-03 | 2018-04-10 | Palo Alto Research Incorporated | Computer-implemented system and method for dynamic travel coordination |
| CN109115234A (en) * | 2018-07-06 | 2019-01-01 | 上海博泰悦臻电子设备制造有限公司 | Vehicle, vehicle device equipment and its air navigation aid based on Dijkstra's algorithm |
| CN109583605A (en) * | 2017-09-29 | 2019-04-05 | 北京嘀嘀无限科技发展有限公司 | Share-car method and device, computer equipment and readable storage medium storing program for executing |
-
2020
- 2020-06-05 CN CN202010504123.4A patent/CN111678530B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102506851A (en) * | 2011-10-31 | 2012-06-20 | 东软集团股份有限公司 | Navigation device and navigation method |
| US9939280B2 (en) * | 2014-04-03 | 2018-04-10 | Palo Alto Research Incorporated | Computer-implemented system and method for dynamic travel coordination |
| CN104715296A (en) * | 2015-04-08 | 2015-06-17 | 北京航空航天大学 | Transportation hub-based method for designing and achieving taxi carpooling mechanism |
| CN104933855A (en) * | 2015-05-28 | 2015-09-23 | 成都亿邻通科技有限公司 | Method for providing combined car-pooling |
| CN106228266A (en) * | 2016-07-25 | 2016-12-14 | 成都云科新能汽车技术有限公司 | A kind of electric motor coach operation system based on global optimization |
| CN107101643A (en) * | 2017-04-10 | 2017-08-29 | 浙江工业大学 | Car pooling matching method |
| CN109583605A (en) * | 2017-09-29 | 2019-04-05 | 北京嘀嘀无限科技发展有限公司 | Share-car method and device, computer equipment and readable storage medium storing program for executing |
| CN109115234A (en) * | 2018-07-06 | 2019-01-01 | 上海博泰悦臻电子设备制造有限公司 | Vehicle, vehicle device equipment and its air navigation aid based on Dijkstra's algorithm |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113299111A (en) * | 2021-05-21 | 2021-08-24 | 杭州华尔科技有限公司 | Underground garage vehicle searching method, system and storage medium thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111678530B (en) | 2022-02-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10655975B2 (en) | System and method for routing optimization | |
| US20200041288A1 (en) | Method of planning travel route, planning server, and storage medium | |
| US8799184B2 (en) | Method and system for determining an optimal low fare for a trip | |
| US20180137526A1 (en) | Business operations assistance device and business operations assistance method using contract cancellation prediction | |
| US20130024227A1 (en) | Information processing technique for determining traveling route | |
| AitZai et al. | A branch and bound and parallel genetic algorithm for the job shop scheduling problem with blocking | |
| CN111678530B (en) | Carpooling path determination method and device | |
| US20150356491A1 (en) | Workforce optimization by improved provision of job performance plan | |
| WO2014099083A1 (en) | Asset assignment having unique skills and/or capabilities | |
| JP2008033433A (en) | Method for assigning property to be patrolled and system for assigning property to be patrolled using the same | |
| CN109582445A (en) | Message treatment method, device, electronic equipment and computer readable storage medium | |
| CN112415953B (en) | Scheduling method and device of elevator | |
| CN114611755A (en) | Hybrid meta-heuristic algorithm-based optimal path determination method for traveling salesman | |
| CN108694544B (en) | Order scheduling processing method and device | |
| CN111833119A (en) | Order allocation method and device, electronic equipment and storage medium | |
| JP2022021873A (en) | Information processor, method for processing information, and program | |
| US12014316B2 (en) | Automatically planning delivery routes using clustering | |
| Costa et al. | In-route task selection in spatial crowdsourcing | |
| CN110516902B (en) | Intelligent scheduling method, intelligent scheduling device, computer system and readable storage medium | |
| CN111612286B (en) | Order distribution method and device, electronic equipment and storage medium | |
| CN110909072B (en) | Data table establishment method, device and equipment | |
| CN112862212B (en) | Multi-AGV (automatic guided vehicle) scheduling method, device and equipment based on improved sparrow search algorithm | |
| CN110033145B (en) | Financial sharing job order separating method and device, equipment and storage medium | |
| CN114781972A (en) | Method, device, equipment and medium for determining cargo transportation scheme | |
| KR101764026B1 (en) | Simulation based Pre-Planning Method and System for Optimizing the Transport on National and International Events |
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 |