CN110544142A - Taxi taking method and equipment and terminal equipment - Google Patents
Taxi taking method and equipment and terminal equipment Download PDFInfo
- Publication number
- CN110544142A CN110544142A CN201910672011.7A CN201910672011A CN110544142A CN 110544142 A CN110544142 A CN 110544142A CN 201910672011 A CN201910672011 A CN 201910672011A CN 110544142 A CN110544142 A CN 110544142A
- Authority
- CN
- China
- Prior art keywords
- vehicle
- taxi
- network
- preset
- preset range
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 59
- 238000012790 confirmation Methods 0.000 claims abstract description 53
- 238000012545 processing Methods 0.000 claims description 13
- 238000013461 design Methods 0.000 description 18
- 238000010586 diagram Methods 0.000 description 6
- 230000004044 response Effects 0.000 description 4
- 238000012384 transportation and delivery Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000013439 planning Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- 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/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
- 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
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- Accounting & Taxation (AREA)
- General Business, Economics & Management (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Finance (AREA)
- Data Mining & Analysis (AREA)
- Development Economics (AREA)
- General Engineering & Computer Science (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Human Resources & Organizations (AREA)
- Primary Health Care (AREA)
- Tourism & Hospitality (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Traffic Control Systems (AREA)
Abstract
The embodiment of the invention provides a taxi taking method, taxi taking equipment and terminal equipment, wherein the taxi taking method comprises the following steps: the method comprises the steps of receiving a starting address and a destination address input by a user, judging whether available vehicles exist in a preset range of the starting address, wherein the preset range is an area range with the starting address as a starting point and a preset distance as a radius, if no available vehicles exist in the preset range, outputting prompt information of no available vehicles, if available vehicles exist in the preset range, generating and displaying a taxi calling confirmation page, and when a taxi calling instruction input by the user on the taxi calling confirmation page is received, generating a vehicle using order according to the starting address and the destination address, determining a target vehicle, and sending the vehicle using order to the target vehicle, so that the time for the user to wait for a taxi appointment driver to receive orders is effectively reduced, and the efficiency of dispatching orders is improved.
Description
Technical Field
the embodiment of the invention relates to the technical field of network taxi booking, in particular to a taxi taking method, taxi taking equipment and terminal equipment.
Background
Along with the development of intelligent equipment and mobile internet technology, the popularization of taxi taking software brings great convenience to people going out. The current taxi taking requirement is a common requirement of people in all levels of society.
In the prior art, when a user makes a taxi on taxi-taking software, the taxi-taking software can generate a corresponding taxi-taking order according to a taxi-taking demand input by the user and pushes the taxi-taking order to a network taxi appointment registered on the taxi-taking software, and a network taxi appointment driver judges whether to take a taxi according to the self condition.
however, the inventors found that at least the following problems exist in the prior art: after the order of using the car is pushed to the net car booking driver, the net car booking driver can judge whether to take the order according to the self condition, therefore, the condition that the net car booking driver takes the order after a long time possibly occurs, and the condition that the net car booking driver still does not take the order after a long time possibly occurs.
disclosure of Invention
The embodiment of the invention provides a taxi taking method, taxi taking equipment and terminal equipment, and aims to solve the problems that in the prior art, the time for a user to wait for a taxi appointment driver to receive a taxi is long, and the time of the user is wasted.
In a first aspect, an embodiment of the present invention provides a taxi taking method, including:
Receiving a starting address and a destination address input by a user, and judging whether an available vehicle exists in a preset range of the starting address, wherein the preset range is an area range taking the starting address as a starting point and a preset distance as a radius;
If no available vehicle exists in the preset range, outputting prompt information of the unavailable vehicle;
If the available vehicles exist in the preset range, generating and displaying a taxi calling confirmation page;
When a taxi calling instruction input by a user on the taxi calling confirmation page is received, generating a taxi-taking order according to the starting address and the destination address, and determining a target vehicle;
and sending the vehicle using order to the target vehicle.
In one possible design, the determining whether there are available vehicles within a preset range of the departure address includes:
Searching whether a network appointment exists in the preset range;
And if the network appointment vehicle does not exist in the preset range, determining that no available vehicle exists in the preset range.
In one possible design, after the searching whether there is a network appointment car within the preset range, the method further includes:
If the network appointment vehicle exists in the preset range, judging whether the network appointment vehicle in the preset range meets preset unavailable conditions;
If the network appointment vehicles in the preset range all meet the preset unavailable condition, determining that no available vehicle exists in the preset range;
And if the network appointment vehicle which does not meet the preset unavailable condition exists in the preset range, determining that the available vehicle exists in the preset range.
in one possible design, if there is an available vehicle in the preset range, generating and displaying a taxi calling confirmation page, including:
Acquiring first network appointment positions of all available vehicles;
selecting a first network car appointment with a position closest to the starting address according to the positions of the first network car appointments;
and locking the selected first network appointment vehicle within the preset locking time, and displaying the information of the locked first network appointment vehicle on the taxi calling confirmation page.
In one possible design, the determining a target vehicle when a taxi calling instruction input by a user in the taxi calling confirmation page is received includes:
When a taxi calling instruction input by a user on the taxi calling confirmation page is received, judging whether the locked first network taxi appointment exists or not;
And if the locked first network appointment vehicle exists, taking the locked first network appointment vehicle as the target vehicle.
In one possible design, the preset unavailable condition includes at least one of: the method comprises the steps of serving network car reservation, network car reservation with the electric quantity less than the preset electric quantity, locked network car reservation and network car reservation with the reserved car using time within the preset time range.
In one possible design, the taxi calling confirmation page includes at least one of: taxi taking cost, time to lock, vehicle to lock, arrival time.
In a second aspect, an embodiment of the present invention provides a taxi taking apparatus, including:
The available vehicle judging module is used for receiving a starting address and a destination address input by a user and judging whether an available vehicle exists in a preset range of the starting address, wherein the preset range is an area range taking the starting address as a starting point and a preset distance as a radius;
the first prompt output module is used for outputting prompt information of the unavailable vehicle if the unavailable vehicle does not exist in the preset range;
The confirmation page generating module is used for generating and displaying a taxi calling confirmation page if the available vehicles exist in the preset range;
the target vehicle determining module is used for generating a vehicle using order according to the departure address and the destination address and determining a target vehicle when a vehicle calling instruction input by a user on the vehicle calling confirmation page is received;
And the vehicle order processing module is used for sending the vehicle order to the target vehicle.
In one possible design, the available vehicle judgment module comprises a network appointment searching unit and a first processing unit;
The network appointment searching unit is used for searching whether a network appointment vehicle exists in the preset range;
The first processing unit is configured to determine that there is no available vehicle in the preset range if there is no network appointment vehicle in the preset range.
In one possible design, the available vehicle determination module further includes a second processing unit;
the second processing unit is configured to, after the searching for whether a network appointment vehicle exists within the preset range, determine whether the network appointment vehicle within the preset range meets a preset unavailable condition if the network appointment vehicle exists within the preset range;
If the network appointment vehicles in the preset range all meet the preset unavailable condition, determining that no available vehicle exists in the preset range;
and if the network appointment vehicle which does not meet the preset unavailable condition exists in the preset range, determining that the available vehicle exists in the preset range.
in one possible design, the confirmation page generation module is specifically configured to:
Acquiring first network appointment positions of all available vehicles;
selecting a first network car appointment with a position closest to the starting address according to the positions of the first network car appointments;
And locking the selected first network appointment vehicle within the preset locking time, and displaying the information of the locked first network appointment vehicle on the taxi calling confirmation page.
In one possible design, the target vehicle determination module is specifically configured to:
when a taxi calling instruction input by a user on the taxi calling confirmation page is received, judging whether the locked first network taxi appointment exists or not;
and if the locked first network appointment vehicle exists, taking the locked first network appointment vehicle as the target vehicle.
In one possible design, the preset unavailable condition includes at least one of: the method comprises the steps of serving network car reservation, network car reservation with the electric quantity less than the preset electric quantity, locked network car reservation and network car reservation with the reserved car using time within the preset time range.
In one possible design, the taxi calling confirmation page includes at least one of: taxi taking cost, time to lock, vehicle to lock, arrival time.
in a third aspect, an embodiment of the present invention provides a terminal device, including: at least one processor and memory;
The memory stores computer-executable instructions;
The at least one processor executes computer-executable instructions stored by the memory, causing the at least one processor to perform the taxi taking method of any one of the first aspects.
In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium, where a computer executes instructions, and when a processor executes the computer to execute the instructions, the taxi taking method according to any one of the first aspect is implemented.
The method, the equipment and the terminal equipment provided by the embodiment of the invention directly prompt the user that no available vehicle exists after determining that no available vehicle exists in the preset range of the starting address input by the user, inform the user that no available vehicle exists nearby in advance, determine whether a network car booking driver accepts the order according to the prompt, and carry out other arrangement according to the prompt, thereby reducing the time for waiting for the order of the network car booking driver by the user, effectively reducing the invalid waiting time of the user, determine the target vehicle after determining that the available vehicle exists in the preset range and receiving the car calling instruction input by the user, send the car order generated according to the starting address and the target address input by the user to the target vehicle, and reduce the time for waiting for the order of the network car booking driver without selecting whether to accept the order by the network car booking driver, and improves the efficiency of dispatching orders.
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, and 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 these drawings without creative efforts.
fig. 1 is a first flowchart of a taxi taking method according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a taxi-taking page provided by an embodiment of the invention;
Fig. 3 is a schematic diagram of a taxi calling confirmation page provided in the embodiment of the present invention;
fig. 4 is a second flowchart of a taxi taking method according to an embodiment of the present invention;
Fig. 5 is a first schematic structural diagram of the taxi taking device provided by the embodiment of the invention;
Fig. 6 is a schematic diagram of a hardware structure of a terminal 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 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.
The terms "first," "second," "third," "fourth," and the like in the description and in the claims, as well as in the drawings, if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are, for example, capable of operation in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
in the prior art, when a user makes a real-time taxi-taking on taxi-taking software, the taxi-taking software generates a corresponding taxi-taking order according to taxi-taking requirements input by the user, wherein the taxi-taking requirements comprise a departure address and a destination address, the taxi-taking order is a real-time order and is not an appointment order, the generated taxi-taking order is pushed to a taxi appointment registered on the taxi-taking software, and a taxi appointment driver selects whether to take a taxi according to self conditions. Because the network car booking is selected to receive the order, the situation that the network car booking receives the order only after a long time is likely to occur, and the situation that the network car booking driver still does not receive the order after the long time is also likely to occur, namely, the mode that the network car booking driver selects whether to receive the order may cause that the time for the user to wait for the network car booking driver to receive the order is longer, the time of the user is wasted, and the user is unclear whether to receive the order by the network car booking driver in the process of waiting for the network car booking driver to receive the order.
The method aims at the problems in the prior art, and the method for taking the car is provided, before a car order is generated, a user is informed whether available cars exist, namely whether the user has a network car booking driver to take orders is informed in advance, when no available car exists, the user is prompted that no available car exists nearby, the user is informed whether the network car booking driver has the orders or not in advance, the condition that the user waits for a long time and the network car booking driver still does not take orders is avoided, the invalid waiting time of the user is reduced, when the available cars exist, the car booking order is directly generated according to a destination address and a departure address and sent to a selected target car, the target car orders are taken, the direct dispatching of the car order is realized, the network car booking driver does not need to select whether the orders are taken again, the time for the user to wait for the network car booking driver to take the orders is reduced, and the efficiency of dispatching the cars is improved. The technical solution of the present invention will be described in detail below with specific examples. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments.
Fig. 1 is a first flowchart of a taxi taking method according to an embodiment of the present invention, where an execution subject of the embodiment may be a taxi taking terminal, as shown in fig. 1, the method according to the embodiment may include:
s101, receiving a starting address and a destination address input by a user, and judging whether an available vehicle exists in a preset range of the starting address, wherein the preset range is an area range taking the starting address as a starting point and a preset distance as a radius.
in this embodiment, when a departure address and a destination address input by a user on a taxi taking page (as shown in fig. 2) are received, a taxi taking order corresponding to the user is not immediately generated according to the departure address and the destination address, but whether available vehicles exist in a preset range of the departure address is determined, that is, whether available vehicles exist in a range near the departure address is determined.
Optionally, after receiving the departure address and the destination address input by the user on the taxi taking page, the taxi taking terminal generates a corresponding virtual order, and then determines whether an available vehicle exists in a preset range of the departure address in the virtual order.
the preset range is an area range with the starting address as a starting point and the preset distance as a radius.
The process of judging whether available vehicles exist in the preset range of the departure address may be as follows: and searching whether the network appointment vehicle exists in a preset range. And if the network appointment vehicle does not exist in the preset range, determining that the available vehicle does not exist in the preset range.
In this embodiment, whether a network appointment vehicle exists in the preset range of the departure address is searched, and if the network appointment vehicle does not exist in the preset range, it is determined that no available vehicle exists in the preset range of the departure address.
Wherein the network appointment is a vehicle which is registered on the taxi taking terminal.
if the network appointment vehicle exists in the preset range, whether the network appointment vehicle in the preset range is available or not needs to be judged through a preset unavailable condition, and the specific judgment process can be as follows: if the network appointment vehicle exists in the preset range, whether the network appointment vehicle in the preset range meets preset unavailable conditions is judged. And if the network appointment vehicles in the preset range all accord with the preset unavailable conditions, determining that no available vehicle exists in the preset range. And if the network appointment vehicle which does not accord with the preset unavailable condition exists in the preset range, determining that the available vehicle exists in the preset range.
In this embodiment, when there is a network appointment car within the preset range of the departure address, it is respectively determined whether each network appointment car within the preset range meets a preset unavailable condition, and if all network appointment cars within the preset range meet the preset unavailable condition, it is determined that there is no available car within the preset range. And if the network appointment vehicle which does not accord with the preset unavailable condition exists in the preset range, determining that the available vehicle exists in the preset range.
Wherein the preset unavailable condition comprises at least one of the following conditions: the method comprises the steps of serving network car reservation, network car reservation with the electric quantity less than the preset electric quantity, locked network car reservation and network car reservation with the reserved car using time within the preset time range.
The network appointment vehicle in service is a network appointment vehicle which is serving other users, namely the network appointment vehicle in service is sending the other users to the destinations corresponding to the other users.
The electric network car booking system comprises a power supply, a network car booking system, a power supply management system and a power supply management system, wherein the power supply is smaller than the preset power.
The locked network appointment vehicle is the network appointment vehicle locked by other users, namely the network appointment vehicle corresponding to other users is locked.
the reserved vehicle using time in the reserved order received by the network reservation vehicle within the preset time range is within the preset time range, wherein the difference value between the time within the preset time range and the current time is within a preset difference value range, for example, whether available time is 11:00 within the preset range is judged, the available time is taken as the current time, the preset difference value range is-30 to 30, the preset time range is 10:30 to 11:30, and if the reserved vehicle using time in the reserved order received by one network reservation vehicle within the preset range is 10:45, the corresponding preset vehicle using time of the network reservation vehicle is within the preset time range.
In this embodiment, when the preset unavailability condition only includes one unavailability condition, it is sufficient to determine whether the second network appointment car satisfies the unavailability condition, and if yes, determine that the second network appointment car is an unavailable car, and if not, determine that the second network appointment car is an available car. When the preset unavailability condition includes a plurality of unavailability conditions, if the second network appointment vehicle satisfies at least one unavailability condition of the preset unavailability conditions, the second network appointment vehicle is determined to be an unavailable vehicle, if the second network appointment vehicle does not satisfy any unavailability condition of the preset unavailability conditions, the second network appointment vehicle is determined to be an available vehicle, for example, the preset unavailability conditions include two unavailability conditions of the network appointment vehicle in service and the network appointment vehicle with the electric quantity smaller than the preset electric quantity, when the second network appointment vehicle is the network appointment vehicle in service, the second network appointment vehicle is determined to be an unavailable vehicle, and when the second network appointment vehicle is neither the network appointment vehicle in service nor the network appointment vehicle with the electric quantity smaller than the preset electric quantity, the second network appointment vehicle is determined to be an available vehicle.
In order to avoid the situation that although the electric quantity of the second network car appointment is larger than or equal to the preset electric quantity, the second network car appointment still cannot reach the destination due to the fact that the current distance of the second network car appointment is far away from the starting address input by the user, when the electric quantity of the second network car appointment is determined to be larger than or equal to the preset electric quantity, further judgment is carried out, namely the distance between the current position of the second network car appointment and the starting address output by the user is obtained, the electric quantity required by the second network car appointment to travel the distance is obtained, whether the electric quantity of the second network car appointment is smaller than the electric quantity required by the second network car appointment to travel the distance is judged, and if the electric quantity required by the second network car appointment to travel the distance is smaller than the electric quantity required by the second network car appointment, the second network car appointment cannot reach the starting address is determined to be an unavailable vehicle.
When the electric quantity required by the distance traveled by the second network car appointment is obtained, the electric quantity corresponding to the distance can be directly inquired from the preset electric quantity distance table, the unit electric quantity corresponding to the second network car appointment can also be obtained, and then the electric quantity required by the distance traveled by the second network car appointment is calculated according to the distance and the unit electric quantity.
the unit electric quantity is the electric quantity required by the second network car appointment running for a unit kilometer, and when the unit electric quantity corresponding to the second network car appointment is obtained, the unit electric quantity is required to be obtained according to the vehicle type of the second network car appointment.
the second network appointment vehicle is any one network appointment vehicle within a preset range.
And S102, if no available vehicle exists in the preset range, outputting prompt information of the unavailable vehicle.
in this embodiment, when it is determined that there is no available vehicle in the preset range, the prompt information of the unavailable vehicle is output to inform the user that there is no available vehicle in the range near the departure address, and after the user sees the prompt information, the user can perform other arrangements, so as to avoid the situation that the user waits for a long time and still has no network reservation for receiving orders, and avoid the user from performing invalid waiting.
The output prompt information can be displayed on the pop-up window, namely, after the fact that no available vehicle exists in the preset range is determined, one pop-up window pops up, and the pop-up window displays the prompt information of the unavailable vehicle.
after the prompt information of the unavailable vehicle is output, if the user still chooses to call the vehicle continuously, the target vehicle is determined according to the preset real-time order dispatching rule, and the user may need to wait for a long time before having a network to order the driver of the vehicle.
and S103, if available vehicles exist in the preset range, generating and displaying a taxi calling confirmation page.
in this embodiment, if there is an available vehicle in the preset range of the departure address, a taxi calling confirmation page is generated and displayed, that is, the taxi calling page shown in fig. 2 jumps to the taxi calling confirmation page shown in fig. 3.
As shown in fig. 3, the taxi calling confirmation page includes locked vehicle information, and the process of displaying the locked vehicle information on the taxi calling confirmation page may be as follows: the method comprises the steps of obtaining first network car booking positions of all available vehicles, selecting a first network car booking with the position closest to a starting address according to each first network car booking position, locking the selected first network car booking within preset locking time, and displaying information of the locked first network car booking on a car calling confirmation page.
in this embodiment, available vehicles within a preset range are used as first network appointment vehicles, first network appointment positions corresponding to the first network appointment vehicles within the preset range are obtained, first distances between the first network appointment vehicles and departure addresses are calculated according to the first network appointment vehicle positions and the departure addresses, the first distances are sorted in a descending order, the first network appointment vehicle corresponding to the smallest first distance is used as a locked vehicle, information of the locked vehicle is displayed on a vehicle calling confirmation page, namely the first network appointment vehicle closest to the departure address at the preset position is locked, and the information of the locked first network appointment vehicle is displayed on the vehicle calling confirmation page.
And the locked first network appointment car cannot receive the car taking orders of other users within the preset locking time. The vehicle using order comprises a real-time order or a reservation order with preset vehicle using time in the preset locking time.
Wherein, the page for confirming calling the car can also comprise at least one of the following: taxi fee, lock time, lock vehicle, arrival time, as shown in fig. 3.
the taxi-taking fee is the fee required for arriving at the destination address from the starting address, and if the user has the coupon, the taxi-taking fee can be the difference obtained by subtracting the coupon denomination from the fee required for arriving at the destination address from the starting address.
The lock time is the remaining lock time, which is displayed in real time, for example, the preset lock time is 5 minutes, and after one minute, the lock time is displayed on the taxi calling confirmation page for 4 minutes.
Wherein the locked vehicle is locked vehicle information, the vehicle information including at least one of: the model, the color and the license plate number of the vehicle.
The arrival time is the time required by the locked network appointment vehicle to arrive at the departure address from the current position of the locked network appointment vehicle, and is calculated in real time according to the current position of the locked network appointment vehicle.
After the preset locking time, the locked first network appointment vehicle is unlocked, and the unlocked first network appointment vehicle can normally receive orders.
And S104, when a taxi calling instruction input by the user on the taxi calling confirmation page is received, generating a taxi taking order according to the starting address and the destination address, and determining the target vehicle.
In the present embodiment, after the user confirms the information displayed on the taxi calling confirmation page, the taxi calling command is input on the taxi calling confirmation page, for example, the immediate taxi calling button is clicked on the taxi calling confirmation page shown in fig. 3. After a taxi calling instruction input by a user on a taxi calling confirmation page is received, a taxi using order is generated according to a starting address and a destination address input by the user, and if the locked first network taxi reservation is not unlocked, the locked first network taxi reservation is determined to be a target taxi, and the target taxi is a taxi dispatching taxi, namely a taxi receiving taxi using order.
In this embodiment, after a departure address and a destination address input by a user are received, a corresponding virtual order is generated, then whether an available vehicle exists is judged according to the virtual order, if an available vehicle exists, a locked vehicle is selected from the available vehicles, after a taxi calling instruction input by the user is received, an actual taxi using order is generated based on the virtual order, if the locked vehicle is not unlocked, that is, the vehicle is still in a locked state, the taxi using order can be directly sent to the locked vehicle, so that before an actual taxi using order is generated, the taxi dispatching vehicle can be directly determined, and the problem that in the prior art, after relevant taxi taking software generates a taxi using order according to a taxi using requirement input by the user, the taxi dispatching vehicle is searched for by the user for a long time, so that the user waits for a taxi dispatching vehicle for a long time, and waits for a taxi taking order for a contract by the user, after the virtual order is generated, the corresponding order delivery vehicle is searched according to the virtual order, and after the order for taking the vehicle is generated, the order for taking the vehicle can be sent to the order delivery vehicle, so that the time for a user to wait for determining the order delivery vehicle can be reduced, the time for the user to wait for the order delivery vehicle to be contracted by the network is reduced, and the user experience is improved.
after the corresponding vehicle order is generated according to the virtual order, the related information of the virtual order is deleted.
After a taxi calling instruction input by a user on a taxi calling confirmation page is received, a taxi using order is generated according to a starting address and a destination address input by the user, if the locked first network taxi appointment is unlocked, namely the preset locking time is exceeded, the generation time corresponding to the taxi using order is obtained, and a target taxi is determined according to a preset real-time dispatching rule.
The specific process of determining the target vehicle according to the preset real-time order dispatching rule comprises the following steps: and judging whether a to-be-processed order exists in the third network appointment, wherein the to-be-processed order comprises reserved vehicle-using time, and if the to-be-processed order does not exist, the third network appointment is determined to be a dispatchable vehicle if the to-be-processed order does not exist, and the reserved vehicle-using time of the third network appointment is not a vehicle-using order after the generation time.
The order to be processed is a reserved order of the reserved vehicle-using time after the generation time. The reserved order is a vehicle taking order reserved for starting at a reserved time by the user, and generally comprises a starting address, a destination address and reserved vehicle taking time, wherein the reserved vehicle taking time is the reserved starting time of the user.
if the reserved order to be processed exists, acquiring estimated ending time corresponding to the vehicle using order and acquiring a next order corresponding to a third network car reservation, calculating first time, wherein the first time is the time required for driving from a destination address in the vehicle using order to a starting address in the next order, determining the first estimated time according to the first time, the estimated ending time and the appointed early arrival time in the next order, judging whether the first estimated time is earlier than the reserved vehicle using time corresponding to the next order, and if the first estimated time is earlier than the reserved vehicle using time corresponding to the next order, determining the third network car reservation as a dispatchable network car reservation.
The estimated ending time is the time for completing the vehicle order and is determined according to the generation time corresponding to the vehicle order, the departure address and the destination address of the vehicle order. The specific determination process is as follows: and predicting the time required by the vehicle to travel from the starting address to the destination address, and calculating the sum of the time and the generation time to obtain predicted ending time.
The next order is an order which is after the reserved vehicle using time is generated and is closest to the generated time, the appointed early arrival time in the next order is the time which is appointed by the user and needs to be arrived in advance by the network appointment vehicle, for example, the reserved vehicle using time is 9:30, the appointed early arrival time is 15 minutes, and the network appointment vehicle needs to arrive at the departure address in 9: 15. The appointed advanced arrival time can be greater than or equal to 0, when the appointed advanced arrival time is 0, the appointed advanced arrival time indicates that the network taxi does not need to arrive at a starting address in the next order in advance, the appointed advanced arrival time is equivalent to a parameter of the next network taxi not including the advanced arrival time, the first estimated time is determined only according to the first time and the estimated ending time, and then whether the third network taxi is a dispatchable network taxi is determined according to the first estimated time.
the third network appointment system is any network appointment registered on the taxi taking terminal and not currently in service.
in this embodiment, the sum of the first time, the estimated end time and the appointed advanced arrival time in the next order is calculated to obtain the first estimated time, that is, the time of actually arriving at the departure address in the next order, and whether the first estimated time is earlier than the reserved car using time corresponding to the next order is determined, for example, the first time is 10 minutes, the estimated end time is 8:10, the first appointed advanced arrival time in the next order is 5 minutes, the reserved car using time corresponding to the next order is 8:30, and the time of actually arriving at the departure address in the next order is 8: 25.
In this embodiment, when the sum of the first time, the estimated ending time and the designated advanced arrival time in the next order is earlier than the reserved car taking time in the next order, that is, when the first estimated time is earlier than the reserved car taking time input by the user, it indicates that there is no order time conflict between the next order of the third network car appointment and the car taking order, and the third network car appointment may complete the next order as about, and take the third network car appointment as the dispatchable network car appointment.
And when the sum of the first time, the estimated ending time and the appointed early arrival time in the next order is earlier than the reserved vehicle using time in the next order, the fact that the next order of the third network appointment vehicle and the vehicle using order have order time conflict is shown, the third network appointment vehicle cannot complete the next order as much as possible, and the third network appointment vehicle is taken as the non-dispatchable network appointment vehicle.
In the embodiment, the obtained dispatchable vehicle can successfully complete the generated vehicle order, the situations of late arrival, front and back order time conflict and the like can be avoided, the situation of order conflict caused by the fault of the journey planning of the network car booking driver can be avoided, and the default risk of the network car booking driver can be reduced.
In order to improve the vehicle operation scheduling efficiency and reduce the empty mileage of the vehicle, the actual advance arrival time corresponding to each dispatchable vehicle can be obtained after the dispatchable vehicles are obtained, the reservation influence factor corresponding to each dispatchable vehicle is calculated according to the actual advance arrival time corresponding to each dispatchable vehicle, the priority corresponding to each dispatchable vehicle is calculated according to the running time, the running distance and the reservation influence factor corresponding to each dispatchable vehicle, the dispatchable vehicle with the highest priority is taken as the target vehicle, the empty mileage of the target vehicle approaching to the target reservation address is filled with the useful vehicle order, the empty mileage of the target vehicle is reduced, and the order dispatching efficiency and the vehicle operation scheduling efficiency are improved.
The driving time is the time required for driving the dispatchable network car booking from the current position to the departure address in the car order, and the driving distance is the distance between the departure address in the car order and the current position of the first network car booking.
The reservation influence factor corresponding to the dispatchable vehicle can be calculated through the following formula:
Wherein ω is a reservation impact factor corresponding to the dispatchable network car booking, θ is an actual advanced arrival time corresponding to the dispatchable network car booking, t is a preset time, a1 is a first preset value, a2 is a second preset value, and A3 is a third preset value.
Alternatively, a1 is 0.97, a2 is 0.012, A3 is 0.0007, and t is 30.
And calculating the corresponding priority of each dispatchable vehicle according to the corresponding travel time, travel distance and reservation influence factor of each dispatchable vehicle as follows:
Wherein eta is the priority corresponding to the first network appointment. Alpha is a first preset weight. B1 is a fourth predetermined value. And D is the driving distance. Beta is a second preset weight. B2 is a fifth predetermined value. T is the travel time. And gamma is a third preset weight. Omega is the reservation influence factor corresponding to the first network car appointment.
Alternatively, α is 0.1, B1 is 10, β is 0.3, B2 is 10, and γ is 0.6.
The above-mentioned a1, a2, A3, α, B1, β, B2 and γ are analytically determined by the relevant researchers according to the actual order data, and are corrected as the order data are accumulated, so as to ensure the accuracy of the priority calculation.
Optionally, the dispatchable vehicles may be sorted according to the order of their priorities, the order of the vehicle corresponding to the user is sequentially sent to the sorted dispatchable vehicles according to the sorted dispatchable vehicles, and if there is a received dispatchable vehicle, the received dispatchable vehicle is determined to be the target vehicle.
In order to reduce the time for a user to wait for a taxi pick-up of a taxi appointment driver, a preset number of dispatchable vehicles can be selected from the sorted dispatchable vehicles as target vehicles each time, for example, the dispatchable vehicles with the row names of 1 to 5 are selected as the target vehicles for the first time, the user orders are respectively sent to the selected target vehicles, if no dispatchable vehicle for the taxi pick-up exists, the dispatchable vehicles with the row names of 6 to 10 are selected as the target vehicles, and so on, when the order is closed after the preset times are selected or after the preset taxi pick-up time elapses, and prompt information that the driver nearby is busy is input.
In the embodiment, the reservation influence factor corresponding to each dispatchable network appointment is determined according to the actual early arrival time corresponding to each dispatchable network appointment, namely, the consistency between the accepted vehicle orders and the vehicle orders corresponding to each dispatchable network appointment is determined, the priority of each dispatchable network appointment is determined according to the consistency, the vehicle orders are sent to the accepted vehicle orders and the dispatchable network appointments with the proper consistency, so that the dispatchable network appointments do not need to wait for a long time to finish other orders to be processed, the consistency between the orders is improved, the vehicle operation efficiency is improved, the continuity exists among the orders, the vehicles can drive in a targeted manner when finishing the vehicle orders, and the empty driving distance of the vehicles can be reduced.
And S105, sending the vehicle using order to the target vehicle.
in the embodiment, the order for using the vehicle is generated according to the departure address and the destination address, namely the generated order for using the vehicle comprises the departure address and the destination address, the generated order for using the vehicle is sent to the determined target vehicle, and the target vehicle receives the order, so that the order is directly dispatched, the time for a user to wait for the order of a vehicle reserving driver on the network to receive the order is reduced, and the efficiency of dispatching the order is improved.
As can be seen from the above description, by determining whether there is an available vehicle within the preset range of the departure address input by the user, after determining that no available vehicle exists in the preset range, directly prompting the user that no available vehicle exists, informing the user that no available vehicle exists nearby in advance, determining whether a web taxi appointment driver takes an order or not by the user according to the prompt, and other arrangements are carried out according to the prompt, the time for the user to wait for the order receiving of the taxi appointment driver on the network is reduced, the invalid waiting time of the user is effectively reduced, the method comprises the steps of determining that available vehicles exist in a preset range, determining a target vehicle after receiving a taxi calling instruction input by a user, sending a taxi taking order generated according to a starting address and a destination address input by the user to the target vehicle, and reducing time for waiting for taxi taking by the taxi appointment driver by the user without the need of selecting whether to take the taxi or not by the taxi appointment driver, and improving taxi dispatching efficiency.
When the preset lockout time has not been exceeded, the target vehicle may be determined based on the locked first network appointment, which is described in detail below with reference to a particular embodiment.
Fig. 4 is a second flowchart of a taxi taking method according to an embodiment of the present invention, which illustrates in detail a specific implementation process of determining a target vehicle according to a locked first network appointment based on the embodiment of fig. 1, and as shown in fig. 4, the method includes:
S401, receiving a starting address and a destination address input by a user, and judging whether an available vehicle exists in a preset range of the starting address, wherein the preset range is an area range taking the starting address as a starting point and a preset distance as a radius.
S402, if no available vehicle exists in the preset range, outputting prompt information of the unavailable vehicle.
And S403, if available vehicles exist in the preset range, generating and displaying a taxi calling confirmation page.
The specific implementation of S401 to S403 in this embodiment is similar to S101 and S103 in the above embodiment, and is not described here again.
S404, when a taxi calling instruction input by a user on the taxi calling confirmation page is received, generating a taxi calling order according to the starting address and the destination address, and judging whether the locked first network taxi appointment exists or not.
in this embodiment, when a taxi calling instruction input by a user on a taxi calling confirmation page is received, whether the locked first network taxi appointment still exists or not is determined by judging whether the preset locking time is exceeded or not, that is, whether the first network taxi appointment still exists or not is determined. If the preset locking time is not exceeded, the locked first network car reservation is determined to be still locked, namely still exist, and if the preset locking time is exceeded, the locked first network car reservation is determined to be unlocked and does not exist.
After the locked first network taxi appointment is determined to exist, in order to avoid the problem that the taxi dispatching fails due to the fact that the locked first network taxi appointment cannot normally receive the user order sent by the taxi taking terminal, a call signal can be sent to the locked first network taxi appointment, and if a response call signal returned by the locked first network taxi appointment is received within the preset response time, the locked first network taxi appointment is determined to normally receive the taxi. And if the response calling information returned by the locked first network appointment vehicle is not received within the preset response time, determining that the locked first network appointment vehicle cannot normally receive the order, and selecting the target vehicle according to a preset real-time order dispatching rule.
and S405, if the locked first network appointment vehicle exists, taking the locked first network appointment vehicle as a target vehicle.
In this embodiment, after determining that the locked first network appointment exists, the locked first network appointment is taken as a target vehicle which can receive orders.
And S406, sending the vehicle using order to the target vehicle.
The specific implementation of S406 in this embodiment is similar to S105 in the above embodiment, and is not described here again.
in this embodiment, after the locked first network appointment is determined to exist, the locked first network appointment is taken as the target vehicle, that is, the network appointment closest to the departure address input by the user is taken as the order-receiving vehicle, so that the vehicle can quickly arrive at the departure address, the waiting time of the user is reduced, and the user experience is improved.
Fig. 5 is a first schematic structural diagram of the taxi taking apparatus according to the embodiment of the present invention, as shown in fig. 5, the taxi taking apparatus 500 according to the embodiment may include: available vehicle judging module 501, first prompt output module 502, confirmation page generating module 503, target vehicle determining module 504 and in-vehicle order processing module 505.
the available vehicle determining module 501 is configured to receive a starting address and a destination address input by a user, and determine whether an available vehicle exists within a preset range of the starting address, where the preset range is an area range with the starting address as a starting point and a preset distance as a radius.
The first prompt output module 502 is configured to output a prompt message of an unavailable vehicle if the available vehicle does not exist within a preset range.
The confirmation page generating module 503 is configured to generate and display a vehicle-calling confirmation page if there is an available vehicle within the preset range.
and the target vehicle determining module 504 is configured to generate a vehicle order according to the departure address and the destination address and determine a target vehicle when a vehicle calling instruction input by the user on the vehicle calling confirmation page is received.
and a vehicle order processing module 505 for sending the vehicle order to the target vehicle.
In one possible design, the available vehicle judgment module includes a network appointment searching unit and a first processing unit.
and the network appointment vehicle searching unit is used for searching whether a network appointment vehicle exists in a preset range.
The first processing unit is used for determining that no available vehicle exists in the preset range if no network appointment vehicle exists in the preset range.
In one possible design, the available vehicle determination module further includes a second processing unit.
And the second processing unit is used for judging whether the network appointment vehicle in the preset range meets the preset unavailable condition or not if the network appointment vehicle exists in the preset range after searching whether the network appointment vehicle exists in the preset range or not.
and if the network appointment vehicles in the preset range all accord with the preset unavailable conditions, determining that no available vehicle exists in the preset range.
And if the network appointment vehicle which does not accord with the preset unavailable condition exists in the preset range, determining that the available vehicle exists in the preset range.
In one possible design, the confirmation page generation module is specifically configured to:
A first network appointment location is obtained for all available vehicles.
and selecting the first network car appointment with the position closest to the starting address according to the positions of the first network car appointments.
And locking the selected first network appointment vehicle within the preset locking time, and displaying the information of the locked first network appointment vehicle on a vehicle calling confirmation page.
In one possible design, the target vehicle determination module is specifically configured to:
And when a taxi calling instruction input by a user on a taxi calling confirmation page is received, judging whether the locked first network taxi appointment exists or not.
And if the locked first network appointment vehicle exists, taking the locked first network appointment vehicle as a target vehicle.
in one possible design, the preset unavailability condition includes at least one of: the method comprises the steps of serving network car reservation, network car reservation with the electric quantity less than the preset electric quantity, locked network car reservation and network car reservation with the reserved car using time within the preset time range.
in one possible design, the taxi cab confirmation page includes at least one of: taxi taking cost, time to lock, vehicle to lock, arrival time.
The taxi taking equipment provided by the embodiment of the invention can realize the taxi taking method of the embodiment, the realization principle and the technical effect are similar, and the details are not repeated.
Fig. 6 is a schematic diagram of a hardware structure of a terminal device according to an embodiment of the present invention. As shown in fig. 6, the terminal device 600 provided in the present embodiment includes: at least one processor 601 and memory 602. The processor 601 and the memory 602 are connected by a bus 603.
In a specific implementation process, the at least one processor 601 executes the computer-executable instructions stored in the memory 602, so that the at least one processor 601 executes the taxi taking method in the foregoing method embodiment.
for a specific implementation process of the processor 601, reference may be made to the above method embodiments, which implement the principle and the technical effect similarly, and details of this embodiment are not described herein again.
in the embodiment shown in fig. 6, it should be understood that the Processor may be a Central Processing Unit (CPU), other general purpose processors, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with the present invention may be embodied directly in a hardware processor, or in a combination of the hardware and software modules within the processor.
The memory may comprise high speed RAM memory and may also include non-volatile storage NVM, such as at least one disk memory.
the bus may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, an Extended ISA (EISA) bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, the buses in the figures of the present application are not limited to only one bus or one type of bus.
the embodiment of the invention also provides a computer-readable storage medium, wherein a computer execution instruction is stored in the computer-readable storage medium, and when a processor executes the computer execution instruction, the taxi taking method of the embodiment of the method is realized.
The computer-readable storage medium may be implemented by any type of volatile or non-volatile memory device or combination thereof, such as Static Random Access Memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic or optical disk. Readable storage media can be any available media that can be accessed by a general purpose or special purpose computer.
An exemplary readable storage medium is coupled to the processor such the processor can read information from, and write information to, the readable storage medium. Of course, the readable storage medium may also be an integral part of the processor. The processor and the readable storage medium may reside in an Application Specific Integrated Circuits (ASIC). Of course, the processor and the readable storage medium may also reside as discrete components in the apparatus.
Those of ordinary skill in the art will understand that: all or a portion of the steps of implementing the above-described method embodiments may be performed by hardware associated with program instructions. The program may be stored in a computer-readable storage medium. When executed, the program performs steps comprising the method embodiments described above; and the aforementioned storage medium includes: various media that can store program codes, such as ROM, RAM, magnetic or optical disks.
finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.
Claims (10)
1. A taxi taking method is characterized by comprising the following steps:
receiving a starting address and a destination address input by a user, and judging whether an available vehicle exists in a preset range of the starting address, wherein the preset range is an area range taking the starting address as a starting point and a preset distance as a radius;
If no available vehicle exists in the preset range, outputting prompt information of the unavailable vehicle;
If the available vehicles exist in the preset range, generating and displaying a taxi calling confirmation page;
When a taxi calling instruction input by a user on the taxi calling confirmation page is received, generating a taxi-taking order according to the starting address and the destination address, and determining a target vehicle;
And sending the vehicle using order to the target vehicle.
2. the method of claim 1, wherein the determining whether there are available vehicles within a preset range of the departure address comprises:
searching whether a network appointment exists in the preset range;
And if the network appointment vehicle does not exist in the preset range, determining that no available vehicle exists in the preset range.
3. The method of claim 2, wherein after said searching for the presence of a network appointment vehicle within the preset range, further comprising:
If the network appointment vehicle exists in the preset range, judging whether the network appointment vehicle in the preset range meets preset unavailable conditions;
If the network appointment vehicles in the preset range all meet the preset unavailable condition, determining that no available vehicle exists in the preset range;
and if the network appointment vehicle which does not meet the preset unavailable condition exists in the preset range, determining that the available vehicle exists in the preset range.
4. The method of claim 3, wherein if there are available vehicles within the predetermined range, generating and displaying a taxi calling confirmation page comprises:
Acquiring first network appointment positions of all available vehicles;
selecting a first network car appointment with a position closest to the starting address according to the positions of the first network car appointments;
and locking the selected first network appointment vehicle within the preset locking time, and displaying the information of the locked first network appointment vehicle on the taxi calling confirmation page.
5. the method of claim 4, wherein determining a target vehicle upon receiving a taxi-calling instruction input by a user on the taxi-calling confirmation page comprises:
when a taxi calling instruction input by a user on the taxi calling confirmation page is received, judging whether the locked first network taxi appointment exists or not;
And if the locked first network appointment vehicle exists, taking the locked first network appointment vehicle as the target vehicle.
6. The method according to any one of claims 3 to 5, wherein the preset unavailability condition comprises at least one of: the method comprises the steps of serving network car reservation, network car reservation with the electric quantity less than the preset electric quantity, locked network car reservation and network car reservation with the reserved car using time within the preset time range.
7. The method of any of claims 1 to 5, wherein the taxi cab confirmation page comprises at least one of: taxi taking cost, time to lock, vehicle to lock, arrival time.
8. A taxi taking apparatus, comprising:
The available vehicle judging module is used for receiving a starting address and a destination address input by a user and judging whether an available vehicle exists in a preset range of the starting address, wherein the preset range is an area range taking the starting address as a starting point and a preset distance as a radius;
The first prompt output module is used for outputting prompt information of the unavailable vehicle if the unavailable vehicle does not exist in the preset range;
The confirmation page generating module is used for generating and displaying a taxi calling confirmation page if the available vehicles exist in the preset range;
The target vehicle determining module is used for generating a vehicle using order according to the departure address and the destination address and determining a target vehicle when a vehicle calling instruction input by a user on the vehicle calling confirmation page is received;
And the vehicle order processing module is used for sending the vehicle order to the target vehicle.
9. a terminal device, comprising: at least one processor and memory;
The memory stores computer-executable instructions;
The at least one processor executing the computer-executable instructions stored by the memory causes the at least one processor to perform the taxi taking method of any one of claims 1-7.
10. A computer-readable storage medium having computer-executable instructions stored thereon, which when executed by a processor, implement the taxi taking method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910672011.7A CN110544142A (en) | 2019-07-24 | 2019-07-24 | Taxi taking method and equipment and terminal equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910672011.7A CN110544142A (en) | 2019-07-24 | 2019-07-24 | Taxi taking method and equipment and terminal equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110544142A true CN110544142A (en) | 2019-12-06 |
Family
ID=68709864
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910672011.7A Pending CN110544142A (en) | 2019-07-24 | 2019-07-24 | Taxi taking method and equipment and terminal equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110544142A (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111723988A (en) * | 2020-06-18 | 2020-09-29 | 南京领行科技股份有限公司 | Payment prompting method, device, equipment and storage medium for online taxi appointment orders |
| CN112360560A (en) * | 2020-10-29 | 2021-02-12 | 陕西陕煤曹家滩矿业有限公司 | Coal mine underground vehicle scheduling and monitoring system |
| CN112561379A (en) * | 2020-12-23 | 2021-03-26 | 湖南师范大学 | Regional network taxi appointment-oriented scheduling method |
| CN113033849A (en) * | 2021-03-30 | 2021-06-25 | 满帮信息咨询有限公司 | Reserved vehicle matching method and system, electronic device and storage medium |
| CN113177821A (en) * | 2021-04-28 | 2021-07-27 | 北京趣拿软件科技有限公司 | Information processing method, device and system, and computer readable storage medium |
| CN113177825A (en) * | 2021-05-11 | 2021-07-27 | 深圳优地科技有限公司 | Safe taxi taking method and device and computer readable storage medium |
| CN113837601A (en) * | 2021-09-23 | 2021-12-24 | 小马国炬(上海)科技有限公司 | Vehicle tracking method, device, equipment and storage medium |
| CN114422580A (en) * | 2021-12-03 | 2022-04-29 | 浙江吉利控股集团有限公司 | Information processing method and device, electronic equipment and storage medium |
| CN115131113A (en) * | 2022-09-01 | 2022-09-30 | 中航信移动科技有限公司 | Order information generation method, storage medium and electronic equipment |
| CN115439196A (en) * | 2022-11-09 | 2022-12-06 | 浙江云针信息科技有限公司 | Unmanned vehicle order receiving method and device, storage medium and terminal |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103198653A (en) * | 2013-04-23 | 2013-07-10 | 杭州九树网络科技有限公司 | Intelligent taxi calling system and application method |
| CN109426872A (en) * | 2017-08-25 | 2019-03-05 | 北京嘀嘀无限科技发展有限公司 | Net about vehicle order allocation method and terminal |
| CN109886440A (en) * | 2019-01-08 | 2019-06-14 | 平安科技（深圳）有限公司 | Net about vehicle control method, device, computer equipment and storage medium |
| WO2019128477A1 (en) * | 2017-12-28 | 2019-07-04 | Beijing Didi Infinity Technology And Development Co., Ltd. | Systems and methods for assigning service requests |
-
2019
- 2019-07-24 CN CN201910672011.7A patent/CN110544142A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103198653A (en) * | 2013-04-23 | 2013-07-10 | 杭州九树网络科技有限公司 | Intelligent taxi calling system and application method |
| CN109426872A (en) * | 2017-08-25 | 2019-03-05 | 北京嘀嘀无限科技发展有限公司 | Net about vehicle order allocation method and terminal |
| WO2019128477A1 (en) * | 2017-12-28 | 2019-07-04 | Beijing Didi Infinity Technology And Development Co., Ltd. | Systems and methods for assigning service requests |
| CN109886440A (en) * | 2019-01-08 | 2019-06-14 | 平安科技（深圳）有限公司 | Net about vehicle control method, device, computer equipment and storage medium |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111723988A (en) * | 2020-06-18 | 2020-09-29 | 南京领行科技股份有限公司 | Payment prompting method, device, equipment and storage medium for online taxi appointment orders |
| CN111723988B (en) * | 2020-06-18 | 2022-06-14 | 南京领行科技股份有限公司 | Payment prompting method, device, equipment and storage medium for online taxi appointment orders |
| CN112360560B (en) * | 2020-10-29 | 2023-09-12 | 陕西陕煤曹家滩矿业有限公司 | Underground coal mine vehicle dispatching and supervising system |
| CN112360560A (en) * | 2020-10-29 | 2021-02-12 | 陕西陕煤曹家滩矿业有限公司 | Coal mine underground vehicle scheduling and monitoring system |
| CN112561379A (en) * | 2020-12-23 | 2021-03-26 | 湖南师范大学 | Regional network taxi appointment-oriented scheduling method |
| CN113033849A (en) * | 2021-03-30 | 2021-06-25 | 满帮信息咨询有限公司 | Reserved vehicle matching method and system, electronic device and storage medium |
| CN113033849B (en) * | 2021-03-30 | 2024-02-27 | 满帮信息科技有限公司 | Reserved vehicle matching method, reserved vehicle matching system, electronic equipment and storage medium |
| CN113177821A (en) * | 2021-04-28 | 2021-07-27 | 北京趣拿软件科技有限公司 | Information processing method, device and system, and computer readable storage medium |
| CN113177825A (en) * | 2021-05-11 | 2021-07-27 | 深圳优地科技有限公司 | Safe taxi taking method and device and computer readable storage medium |
| CN113837601A (en) * | 2021-09-23 | 2021-12-24 | 小马国炬(上海)科技有限公司 | Vehicle tracking method, device, equipment and storage medium |
| CN114422580B (en) * | 2021-12-03 | 2024-02-02 | 浙江吉利控股集团有限公司 | Information processing method, device, electronic equipment and storage medium |
| CN114422580A (en) * | 2021-12-03 | 2022-04-29 | 浙江吉利控股集团有限公司 | Information processing method and device, electronic equipment and storage medium |
| CN115131113A (en) * | 2022-09-01 | 2022-09-30 | 中航信移动科技有限公司 | Order information generation method, storage medium and electronic equipment |
| CN115439196A (en) * | 2022-11-09 | 2022-12-06 | 浙江云针信息科技有限公司 | Unmanned vehicle order receiving method and device, storage medium and terminal |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110544142A (en) | Taxi taking method and equipment and terminal equipment | |
| US11386359B2 (en) | Systems and methods for managing a vehicle sharing facility | |
| JP7542208B2 (en) | Information processing method and information processing system | |
| US11392861B2 (en) | Systems and methods for managing a vehicle sharing facility | |
| US10021243B2 (en) | Telephone call placement | |
| CN106203652A (en) | A kind of hire a car method based on the system WEB reservation of hiring a car estimating electricity | |
| CN111080048A (en) | Order dispatching method and device for reserving order of taxi taking, electronic equipment and storage medium | |
| CN115900744A (en) | Charging path planning method and device and server | |
| CN106203657A (en) | A kind of reservation based on system APP of hiring a car estimating electricity is hired a car method | |
| CN108921762A (en) | A kind of vehicle mixed scheduling method, device and equipment | |
| CN110472836A (en) | Net about vehicle order processing method, equipment and terminal device | |
| CN112529487B (en) | Vehicle scheduling method, device and storage medium | |
| CN111105546B (en) | Instant reservation method for vehicle service | |
| CN112017001A (en) | Network appointment vehicle type recommendation method and device, electronic equipment and storage medium | |
| CN112669116A (en) | Order processing method and device, electronic equipment and readable storage medium | |
| CN114118493A (en) | Optimization method for cost generated when passengers do not get on bus | |
| JP7250369B2 (en) | Method and server for managing mobile rechargeable battery pools for multiple stations | |
| CN110286968A (en) | Notice system and notification method | |
| CN113129102B (en) | Delayed order dispatching method and device, electronic equipment and storage medium | |
| CN110458310A (en) | Net about vehicle order processing method, equipment and terminal device | |
| CN111178597B (en) | Car pooling order line generation method and device | |
| CN110751532B (en) | Resource allocation method and device | |
| CN114254785A (en) | Method for improving order receiving efficiency of taxi booking driver | |
| CN113408952A (en) | Driver motivation judgment method | |
| CN113240897A (en) | Vehicle scheduling method, system 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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20191206 |
|
| RJ01 | Rejection of invention patent application after publication |