CN113592599A - Taxi sharing method based on positioning information, electronic equipment and readable storage medium - Google Patents
Taxi sharing method based on positioning information, electronic equipment and readable storage medium Download PDFInfo
- Publication number
- CN113592599A CN113592599A CN202110881451.0A CN202110881451A CN113592599A CN 113592599 A CN113592599 A CN 113592599A CN 202110881451 A CN202110881451 A CN 202110881451A CN 113592599 A CN113592599 A CN 113592599A
- Authority
- CN
- China
- Prior art keywords
- taxi
- passenger
- point
- constraint
- time
- 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
- 238000000034 method Methods 0.000 title claims abstract description 32
- 230000009191 jumping Effects 0.000 claims description 3
- 238000012544 monitoring process Methods 0.000 claims description 3
- 238000011176 pooling Methods 0.000 claims description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0645—Rental transactions; Leasing transactions
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
-
- 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/0639—Item locations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Accounting & Taxation (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Finance (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Databases & Information Systems (AREA)
- Development Economics (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Human Resources & Organizations (AREA)
- Primary Health Care (AREA)
- Tourism & Hospitality (AREA)
- Navigation (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention provides a taxi sharing method based on positioning information, electronic equipment and a readable storage medium. The method comprises the following steps: acquiring the current position of a taxi and the riding demand information of all passengers waiting for getting on the taxi within a preset operation range; constructing an empowerment directed graph model by taking the current position of a taxi, a passenger departure point, a passenger destination point and an urban road intersection as nodes; determining the shortest distance between the current position of the taxi and the departure point of each passenger according to the weighted directed graph model; determining a taxi sharing scheme of a taxi under a preset riding constraint condition, wherein the riding constraint condition comprises the following steps: time constraint and target point constraint; the passenger can be guaranteed to take a car and arrive on time through time constraint and target point constraint, and meanwhile, the taxi can be guaranteed to select the target driving point closest to the passenger all the time, and detour is avoided, so that passenger car sharing experience is effectively improved, and enthusiasm of a driver for car sharing is improved.
Description
Technical Field
The invention relates to the technical field of traffic, in particular to a taxi sharing method based on positioning information, electronic equipment and a readable storage medium.
Background
At present on the one hand because most taxi drivers do not have the consciousness of scientific planning driving route, can not make the profit the biggest when having practiced thrift the cost as far as possible, on the other hand, have the passenger in the taxi usually under, even have the surplus seat in the car, the driver can not select to carry on other passengers again, this not only can cause the waste of resource, also can make passenger latency overlength, single car spending is higher, influence passenger's experience by bus.
Although some car sharing methods exist in the prior art, the methods often result in that passengers cannot arrive at destinations in time due to too long riding time caused by car sharing, so that the traveling experience of the passengers is influenced, or drivers often detour due to car sharing, the driving mileage is too long, the income of the drivers is reduced on the contrary, and the enthusiasm of the drivers for car sharing is influenced.
Disclosure of Invention
The invention aims to provide a taxi sharing method based on positioning information, electronic equipment and a readable storage medium, which can improve the experience of passenger sharing and improve the enthusiasm of drivers for sharing.
In order to achieve the purpose, the invention provides a taxi sharing method based on positioning information, which comprises the following steps:
step S1, obtaining the current position of a taxi and the riding demand information of all passengers waiting for getting on the taxi within a preset operation range, wherein the riding demand information comprises a passenger departure point, a passenger destination point and the departure time of the passenger;
step S2, constructing a weighted directed graph model by taking the current position of a taxi, a passenger departure point, a passenger destination point and an urban road intersection as nodes, wherein the path weight between the nodes in the weighted directed graph model is a positive value, and the numerical value is the actual distance between the two nodes;
step S3, determining the shortest distance between the current position of the taxi and the departure point of each passenger according to the weighted directed graph model;
step S4, determining a taxi sharing scheme of a taxi under a preset riding constraint condition, wherein the riding constraint condition comprises the following steps: time constraint and target point constraint;
the time constraint is used for ensuring that the taxi can be picked up to the passenger before the departure time of the passenger and the passenger is delivered to the destination point within the riding time which can be accepted by the passenger, and the destination point constraint is used for ensuring that the taxi always selects the passenger departure point or the passenger destination point which is closest to the taxi as the target driving point on the premise of meeting the time constraint.
Specifically, the time constraints in step S4 include a departure time constraint, a carpool time constraint, and an arrival time constraint; the step S4 specifically includes:
step S41, determining the passenger meeting the preset departure time constraint as the passenger capable of being carried by the taxi;
step S42, taking the passenger closest to the current position of the taxi as the passenger of the taxi;
step S43, determining the passengers meeting the preset car sharing time constraint in the rest un-loaded passengers as the passengers capable of being continuously loaded by the taxi;
step S44, determining the next target driving point of the taxi according to the preset target point constraint, wherein the preset target point constraint is as follows: respectively calculating the distance between the destination point of the taxi which has received the passenger and the current position of the taxi and the distance between the departure point of the passenger which can be continuously received by the taxi and the current position of the taxi, and selecting a point closest to the destination point as a target driving point; if the target driving point is the destination point of the passenger on the taxi, continuing to step S45, and if the target driving point is the departure point of the passenger on the taxi, jumping to step S46;
step S45, the taxi drives to the destination point of the received passenger, the number of passengers on the taxi is judged after the passenger arriving at the destination point gets off the taxi, if the number of the passengers is less than 1, the step S41 is returned, otherwise, the step S43 is returned;
step S46, determining whether the departure point of the passenger who can continuously take the taxi is taken as the target driving point again according to the preset arrival time constraint;
if the preset arrival time constraint is met, the taxi is driven to the departure point of the passenger capable of continuously carrying, the number of the passengers on the taxi is judged after the passengers get on the taxi, if the number of the passengers is less than 4, the step S43 is returned, and if the number of the passengers is more than or equal to 4, the step S47 is continued;
if the preset arrival time constraint is not met, continuing to step S47;
and S47, the taxi drives to the destination point which has received the passenger and the one closest to the current position of the taxi, and the step S43 is returned after the passenger arriving at the destination point gets off the taxi.
Specifically, the current position of the taxi is obtained through a positioning device preset on the taxi.
Specifically, the positioning device is a GPS positioning device or a beidou positioning device.
Specifically, the departure time constraint is:
tstart+l(sj)/V＞tj start
wherein, tstartIs the current time, l(s)j) Is the shortest distance from the current position of the taxi to the departure point of the jth passenger, V is the running speed of the taxi, tj startJ is the departure time of the jth passenger, and j is a positive integer;
specifically, the carpooling time constraint is as follows:
tx start-ty start-txy run＞0
wherein, tx startDeparture time, t, for the last passenger on the taxiy startThe departure time of the y-th passenger, txy runFrom the departure point of a passenger on the taxi to the y-th passengerThe time length required by the shortest path between the starting points, wherein y is a positive integer;
specifically, the arrival time constraint is:
wherein, Δ taIndicating the time, dist(s), at which the passenger on the taxi has taken the carx-sx+1) The shortest distance from the current position of the taxi to the departure point of the passenger who can continue to take the taxi is represented, V is the driving speed of the taxi, dist(s)x+1-ea) Indicating the shortest distance, dist(s), from the departure point of a passenger whose taxi can continue to pick up the passenger to the destination point of the passenger who has picked up the passengerx-ea) Representing the shortest distance, Δ t, from the current position of the taxi to the destination point of the picked-up passengera extraIndicating the length of margin time that the passenger on the taxi can accept.
Specifically, the step S4 further includes the following steps:
and monitoring the stop order-picking information in the process of executing the steps S41 to S47, stopping executing the steps S41 to S47 when the stop order-picking information is received, and sequentially delivering the picked passengers to the destination points according to the distance between the destination points of the picked passengers and the current position of the taxi.
The invention also provides electronic equipment which comprises a processor, a memory and a program or an instruction which is stored on the memory and can run on the processor, wherein the program or the instruction realizes the taxi sharing method based on the positioning information when being executed by the processor.
The invention also provides a readable storage medium, wherein a program or an instruction is stored on the readable storage medium, and when the program or the instruction is executed by a processor, the positioning information-based taxi sharing method is realized.
The invention has the beneficial effects that: the invention provides a taxi sharing method based on positioning information, which comprises the following steps: step S1, obtaining the current position of a taxi and the riding demand information of all passengers waiting for getting on the taxi within a preset operation range, wherein the riding demand information comprises a passenger departure point, a passenger destination point and the departure time of the passenger; step S2, constructing a weighted directed graph model by taking the current position of a taxi, a passenger departure point, a passenger destination point and an urban road intersection as nodes, wherein the path weight between the nodes in the weighted directed graph model is a positive value, and the numerical value is the actual distance between the two nodes; step S3, determining the shortest distance between the current position of the taxi and the departure point of each passenger according to the weighted directed graph model; step S4, determining a taxi sharing scheme of a taxi under a preset riding constraint condition, wherein the riding constraint condition comprises the following steps: time constraint and target point constraint; the time constraint is used for ensuring that a taxi can be loaded to a passenger before the departure time of the passenger and the passenger can be delivered to a destination point within the riding time that the passenger can accept, the destination point constraint is used for ensuring that the taxi always selects the passenger departure point or the passenger destination point which is closest to the passenger in the premise of meeting the time constraint as a target driving point, the passenger can take a bus and arrive at a destination on time through the time constraint and the destination point constraint, and meanwhile, the taxi can always select the target driving point which is closest to the passenger in the distance to avoid detour, so that the passenger sharing experience is effectively improved, and the enthusiasm of the driver for sharing the taxi is improved.
Drawings
For a better understanding of the nature and technical aspects of the present invention, reference should be made to the following detailed description of the invention, taken in conjunction with the accompanying drawings, which are provided for purposes of illustration and description and are not intended to limit the invention.
In the drawings, there is shown in the drawings,
FIG. 1 is a flow chart of a taxi sharing method based on positioning information according to the present invention;
fig. 2 is a flowchart of step S4 of the method for sharing a taxi based on positioning information according to the present invention;
fig. 3 is a schematic diagram of step S3 of the method for sharing a taxi based on positioning information according to the present invention;
fig. 4 is a schematic diagram of an electronic device of the present invention.
Detailed Description
To further illustrate the technical means and effects of the present invention, the following detailed description is given with reference to the preferred embodiments of the present invention and the accompanying drawings.
Referring to fig. 1, the present invention provides a taxi pooling method based on positioning information, including the following steps:
and step S1, obtaining the current position of the taxi and the riding demand information of all passengers waiting for getting on the taxi within a preset operation range, wherein the riding demand information comprises a passenger departure point, a passenger destination point and the departure time of the passenger.
Specifically, the current position of the taxi is obtained through a positioning device preset on the taxi.
Specifically, the positioning device is a GPS positioning device or a beidou positioning device.
Further, the riding demand information also comprises the margin duration which can be accepted by the passenger.
And S2, constructing a weighted directed graph model by taking the current position of the taxi, the departure point of the passenger, the destination point of the passenger and the urban road intersection as nodes, wherein the path weight between the nodes in the weighted directed graph model is a positive value, and the numerical value is the actual distance between the two nodes.
And step S3, determining the shortest distance between the current position of the taxi and the departure point of each passenger according to the weighted directed graph model.
Specifically, the step S3 determines the shortest distance between the current position of the taxi and the departure point of each passenger through Dijkstra + heal algorithm.
For example, as shown in fig. 3, the current position of the taxi in fig. 3 is node 1, the starting point of the passenger to be calculated is node 4, and then the step S3 is converted into determining the shortest distance between node 1 and node 4 by Dijkstra + heap algorithm, first, determining the distance between node 2 and node 3 directly connected to node 1, selecting node 2 with the closest distance 2 as the closest node, then, calculating the distance from node 1 to node 3 directly and the distance from node 1 to node 3 via node 2, finally selecting the path from node 1 to node 3 with shorter distance, then, calculating the distance from node 1 to node 4 via node 2 and node 3, and the distance from node 1 to node 4 via node 3, finally determining the closest path from node 1 to node 4 as the distance from node 1 to node 4 via node 3, the distance is 5.
Step S4, determining a taxi sharing scheme of a taxi under a preset riding constraint condition, wherein the riding constraint condition comprises the following steps: time constraint and target point constraint;
the time constraint is used for ensuring that the taxi can be picked up to the passenger before the departure time of the passenger and the passenger is delivered to the destination point within the riding time which can be accepted by the passenger, and the destination point constraint is used for ensuring that the taxi always selects the passenger departure point or the passenger destination point which is closest to the taxi as the target driving point on the premise of meeting the time constraint.
Specifically, the time constraints in step S4 include a departure time constraint, a carpool time constraint, and an arrival time constraint; the step S4 specifically includes:
and step S41, determining the passenger meeting the preset departure time constraint as the passenger capable of being carried by the taxi.
Specifically, the departure time constraint is:
tstart+l(sj)/V＞tj start
wherein, tstartIs the current time, l(s)j) Is the shortest distance from the current position of the taxi to the departure point of the jth passenger, V is the running speed of the taxi, tj startJ is the departure time of the jth passenger, and j is a positive integer;
step S42, taking the passenger closest to the current position of the taxi as the passenger of the taxi;
specifically, if no passenger in step S41 satisfies the preset departure time constraint, the passenger closest to the current position of the taxi is directly selected in step S42 as the picked-up passenger of the taxi.
Step S43, determining the passengers meeting the preset car sharing time constraint in the rest un-loaded passengers as the passengers capable of being continuously loaded by the taxi;
specifically, the carpooling time constraint is as follows:
tx start-ty start-txy run＞0
wherein, tx startDeparture time, t, for the last passenger on the taxiy startThe departure time of the y-th passenger, txy runThe time required by the shortest path from the departure point of the passenger which is loaded to the departure point of the y-th passenger on the taxi is up, and y is a positive integer;
specifically, if no passenger in step S43 meets the preset car-sharing time constraint, the passenger closest to the current position of the taxi is directly selected in step S43 as the passenger whose taxi can continue to take the taxi.
Step S44, determining the next target driving point of the taxi according to the preset target point constraint, wherein the preset target point constraint is as follows: respectively calculating the distance between the destination point of the taxi which has received the passenger and the current position of the taxi and the distance between the departure point of the passenger which can be continuously received by the taxi and the current position of the taxi, and selecting a point closest to the destination point as a target driving point; if the target driving point is the destination point of the passenger on the taxi, continuing to step S45, and if the target driving point is the departure point of the passenger on the taxi, jumping to step S46;
step S45, the taxi drives to the destination point of the received passenger, the number of passengers on the taxi is judged after the passenger arriving at the destination point gets off the taxi, if the number of the passengers is less than 1, the step S41 is returned, otherwise, the step S43 is returned;
step S46, determining whether the departure point of the passenger who can continuously take the taxi is taken as the target driving point again according to the preset arrival time constraint;
if the preset arrival time constraint is met, the taxi is driven to the departure point of the passenger capable of continuously carrying, the number of the passengers on the taxi is judged after the passengers get on the taxi, if the number of the passengers is less than 4, the step S43 is returned, and if the number of the passengers is more than or equal to 4, the step S47 is continued;
if the preset arrival time constraint is not met, continuing to step S47;
and S47, the taxi drives to the destination point which has received the passenger and the one closest to the current position of the taxi, and the step S43 is returned after the passenger arriving at the destination point gets off the taxi.
Specifically, the arrival time constraint is:
wherein, Δ taIndicating the time, dist(s), at which the passenger on the taxi has taken the carx-sx+1) The shortest distance from the current position of the taxi to the departure point of the passenger who can continue to take the taxi is represented, V is the driving speed of the taxi, dist(s)x+1-ea) Indicating the shortest distance, dist(s), from the departure point of a passenger whose taxi can continue to pick up the passenger to the destination point of the passenger who has picked up the passengerx-ea) Representing the shortest distance, Δ t, from the current position of the taxi to the destination point of the picked-up passengera extraIndicating the length of margin time that the passenger on the taxi can accept.
Specifically, the step S4 further includes the following steps:
and monitoring the stop order-picking information in the process of executing the steps S41 to S47, stopping executing the steps S41 to S47 when the stop order-picking information is received, and sequentially delivering the picked passengers to the destination points according to the distance between the destination points of the picked passengers and the current position of the taxi.
Referring to fig. 4, the present invention further provides an electronic device, which includes a processor 20, a memory 10, and a program or an instruction stored in the memory 10 and executable on the processor 20, wherein the program or the instruction, when executed by the processor 20, implements the method for taxi sharing based on positioning information.
In addition, the invention also provides a readable storage medium, wherein a program or instructions are stored on the readable storage medium, and when the program or instructions are executed by a processor, the positioning information-based taxi sharing method is realized.
In summary, the present invention provides a taxi sharing method based on positioning information, which includes the following steps: step S1, obtaining the current position of a taxi and the riding demand information of all passengers waiting for getting on the taxi within a preset operation range, wherein the riding demand information comprises a passenger departure point, a passenger destination point and the departure time of the passenger; step S2, constructing a weighted directed graph model by taking the current position of a taxi, a passenger departure point, a passenger destination point and an urban road intersection as nodes, wherein the path weight between the nodes in the weighted directed graph model is a positive value, and the numerical value is the actual distance between the two nodes; step S3, determining the shortest distance between the current position of the taxi and the departure point of each passenger according to the weighted directed graph model; step S4, determining a taxi sharing scheme of a taxi under a preset riding constraint condition, wherein the riding constraint condition comprises the following steps: time constraint and target point constraint; the time constraint is used for ensuring that a taxi can be loaded to a passenger before the departure time of the passenger and the passenger can be delivered to a destination point within the riding time that the passenger can accept, the destination point constraint is used for ensuring that the taxi always selects the passenger departure point or the passenger destination point which is closest to the passenger in the premise of meeting the time constraint as a target driving point, the passenger can take a bus and arrive at a destination on time through the time constraint and the destination point constraint, and meanwhile, the taxi can always select the target driving point which is closest to the passenger in the distance to avoid detour, so that the passenger sharing experience is effectively improved, and the enthusiasm of the driver for sharing the taxi is improved.
As described above, it will be apparent to those skilled in the art that other various changes and modifications may be made based on the technical solution and concept of the present invention, and all such changes and modifications are intended to fall within the scope of the appended claims.
Claims (10)
1. A taxi sharing method based on positioning information is characterized by comprising the following steps:
step S1, obtaining the current position of a taxi and the riding demand information of all passengers waiting for getting on the taxi within a preset operation range, wherein the riding demand information comprises a passenger departure point, a passenger destination point and the departure time of the passenger;
step S2, constructing a weighted directed graph model by taking the current position of a taxi, a passenger departure point, a passenger destination point and an urban road intersection as nodes, wherein the path weight between the nodes in the weighted directed graph model is a positive value, and the numerical value is the actual distance between the two nodes;
step S3, determining the shortest distance between the current position of the taxi and the departure point of each passenger according to the weighted directed graph model;
step S4, determining a taxi sharing scheme of a taxi under a preset riding constraint condition, wherein the riding constraint condition comprises the following steps: time constraint and target point constraint;
the time constraint is used for ensuring that the taxi can be picked up to the passenger before the departure time of the passenger and the passenger is delivered to the destination point within the riding time which can be accepted by the passenger, and the destination point constraint is used for ensuring that the taxi always selects the passenger departure point or the passenger destination point which is closest to the taxi as the target driving point on the premise of meeting the time constraint.
2. The method of sharing a taxi of claim 1, wherein the time constraints of step S4 include a departure time constraint, a sharing time constraint, and an arrival time constraint; the step S4 specifically includes:
step S41, determining the passenger meeting the preset departure time constraint as the passenger capable of being carried by the taxi;
step S42, taking the passenger closest to the current position of the taxi as the passenger of the taxi;
step S43, determining the passengers meeting the preset car sharing time constraint in the rest un-loaded passengers as the passengers capable of being continuously loaded by the taxi;
step S44, determining the next target driving point of the taxi according to the preset target point constraint, wherein the preset target point constraint is as follows: respectively calculating the distance between the destination point of the taxi which has received the passenger and the current position of the taxi and the distance between the departure point of the passenger which can be continuously received by the taxi and the current position of the taxi, and selecting a point closest to the destination point as a target driving point; if the target driving point is the destination point of the passenger on the taxi, continuing to step S45, and if the target driving point is the departure point of the passenger on the taxi, jumping to step S46;
step S45, the taxi drives to the destination point of the received passenger, the number of passengers on the taxi is judged after the passenger arriving at the destination point gets off the taxi, if the number of the passengers is less than 1, the step S41 is returned, otherwise, the step S43 is returned;
step S46, determining whether the departure point of the passenger who can continuously take the taxi is taken as the target driving point again according to the preset arrival time constraint;
if the preset arrival time constraint is met, the taxi is driven to the departure point of the passenger capable of continuously carrying, the number of the passengers on the taxi is judged after the passengers get on the taxi, if the number of the passengers is less than 4, the step S43 is returned, and if the number of the passengers is more than or equal to 4, the step S47 is continued;
if the preset arrival time constraint is not met, continuing to step S47;
and S47, the taxi drives to the destination point which has received the passenger and the one closest to the current position of the taxi, and the step S43 is returned after the passenger arriving at the destination point gets off the taxi.
3. The method according to claim 1, wherein the current position of the taxi is obtained by a positioning device preset on the taxi.
4. The method of claim 3, wherein the positioning device is a GPS positioning device or a Beidou positioning device.
5. The method of claim 2, wherein the departure time constraint is:
tstart+l(sj)/V＞tj start
wherein, tstartIs the current time, l(s)j) Is the shortest distance from the current position of the taxi to the departure point of the jth passenger, V is the running speed of the taxi, tj startJ is the departure time of the jth passenger, and is a positive integer.
6. The method of claim 2, wherein the taxi sharing time constraint is:
tx start-ty start-txy run＞0
wherein, tx startDeparture time, t, for the last passenger on the taxiy startThe departure time of the y-th passenger, txy runThe time required for the shortest path from the departure point of the passenger which is loaded on the taxi to the departure point of the y-th passenger is finished, and y is a positive integer.
7. The method of claim 2, wherein the time of arrival constraint is:
wherein, Δ taIndicating the time, dist(s), at which the passenger on the taxi has taken the carx-sx+1) Indicating to taxi from current position of taxiThe shortest distance of departure point of a passenger that the vehicle can continue to pick up, V being the speed of travel of the taxi, dist(s)x+1-ea) Indicating the shortest distance, dist(s), from the departure point of a passenger whose taxi can continue to pick up the passenger to the destination point of the passenger who has picked up the passengerx-ea) Representing the shortest distance, Δ t, from the current position of the taxi to the destination point of the picked-up passengera extraIndicating the length of margin time that the passenger on the taxi can accept.
8. The method for taxi sharing based on the positioning information, as claimed in claim 2, wherein the step S4 further comprises the steps of:
and monitoring the stop order-picking information in the process of executing the steps S41 to S47, stopping executing the steps S41 to S47 when the stop order-picking information is received, and sequentially delivering the picked passengers to the destination points according to the distance between the destination points of the picked passengers and the current position of the taxi.
9. An electronic device comprising a processor, a memory, and a program or instructions stored on the memory and executable on the processor, the program or instructions when executed by the processor implementing the location information based taxi pooling method of any of claims 1-8.
10. A readable storage medium storing thereon a program or instructions which, when executed by a processor, implement the location information based taxi sharing method according to any one of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110881451.0A CN113592599B (en) | 2021-08-02 | Taxi sharing method based on positioning information, electronic equipment and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110881451.0A CN113592599B (en) | 2021-08-02 | Taxi sharing method based on positioning information, electronic equipment and readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113592599A true CN113592599A (en) | 2021-11-02 |
| CN113592599B CN113592599B (en) | 2024-05-31 |
Family
ID=
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104408910A (en) * | 2014-11-24 | 2015-03-11 | 无锡清华信息科学与技术国家实验室物联网技术中心 | Taxi-sharing scheduling method beneficial to multiple parties |
| CN104992044A (en) * | 2015-05-26 | 2015-10-21 | 深圳大学 | Optimal multi-meeting-point route searching method and apparatus applied to real-time ridesharing |
| CN105678054A (en) * | 2015-12-30 | 2016-06-15 | 深圳大学 | Optimal multi-convergence meeting point path search method and apparatus based on A star strategy |
| CN108805992A (en) * | 2018-06-11 | 2018-11-13 | 石家庄铁道大学 | A kind of taxi pooling system, method |
| WO2019153193A1 (en) * | 2018-02-08 | 2019-08-15 | 深圳前海达闼云端智能科技有限公司 | Taxi operation monitoring method, device, storage medium, and system |
| CN110222786A (en) * | 2019-06-14 | 2019-09-10 | 深圳大学 | Dynamic share-car method and system based on trip information |
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104408910A (en) * | 2014-11-24 | 2015-03-11 | 无锡清华信息科学与技术国家实验室物联网技术中心 | Taxi-sharing scheduling method beneficial to multiple parties |
| CN104992044A (en) * | 2015-05-26 | 2015-10-21 | 深圳大学 | Optimal multi-meeting-point route searching method and apparatus applied to real-time ridesharing |
| CN105678054A (en) * | 2015-12-30 | 2016-06-15 | 深圳大学 | Optimal multi-convergence meeting point path search method and apparatus based on A star strategy |
| WO2019153193A1 (en) * | 2018-02-08 | 2019-08-15 | 深圳前海达闼云端智能科技有限公司 | Taxi operation monitoring method, device, storage medium, and system |
| CN108805992A (en) * | 2018-06-11 | 2018-11-13 | 石家庄铁道大学 | A kind of taxi pooling system, method |
| CN110222786A (en) * | 2019-06-14 | 2019-09-10 | 深圳大学 | Dynamic share-car method and system based on trip information |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10215576B2 (en) | Energy-optimized vehicle route selection | |
| CN104931063B (en) | Path planning method | |
| CN114581180B (en) | Charging station recommendation method, charging pile state determination method and device | |
| US8504295B2 (en) | Preserving assigned carpools after a cancellation | |
| CN108873905A (en) | Automatic driving vehicle control method, automatic driving vehicle and readable storage medium storing program for executing | |
| CN102639960B (en) | Vehicle-borne information processor and driving supporting device | |
| CN105973252A (en) | Method for route planning and terminal | |
| CN113415288B (en) | Sectional type longitudinal vehicle speed planning method, device, equipment and storage medium | |
| CN111985662A (en) | Network car booking method and device, electronic equipment and storage medium | |
| CN111882107B (en) | Driver and passenger matching method based on automatic driving shared taxi system | |
| CN106875734A (en) | A kind of method and device for pushing parking route | |
| JP2009104415A (en) | Vehicle travel history information provision system | |
| US11914384B2 (en) | Energy consumption estimation device and energy consumption estimation method | |
| CN113379159B (en) | Taxi driver passenger searching route recommendation method based on gray model and Markov decision process | |
| CN108573314B (en) | Carpooling time determination method, system, computer device and computer storage medium | |
| WO2021031636A1 (en) | Real-time order travel vehicle-based real-time order assignment method and apparatus | |
| CN112106021A (en) | Method and device for providing vehicle navigation simulation environment | |
| JP7327491B2 (en) | Delivery candidate proposal system, delivery candidate proposal terminal and delivery candidate proposal program | |
| CN102735242B (en) | Branch point diagram display system | |
| CN113592599A (en) | Taxi sharing method based on positioning information, electronic equipment and readable storage medium | |
| CN116307580A (en) | Method and device for scheduling capacity, electronic equipment and storage medium | |
| CN114402344A (en) | Order management method and device applied to electric automobile | |
| CN113592599B (en) | Taxi sharing method based on positioning information, electronic equipment and readable storage medium | |
| CN110753917A (en) | Data processing method for realizing multi-hop car pooling | |
| CN115375030A (en) | Vehicle route planning method, device, equipment and computer readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant |