CN108764698A - A kind of method and system of share-car information alert - Google Patents
A kind of method and system of share-car information alert Download PDFInfo
- Publication number
- CN108764698A CN108764698A CN201810502246.7A CN201810502246A CN108764698A CN 108764698 A CN108764698 A CN 108764698A CN 201810502246 A CN201810502246 A CN 201810502246A CN 108764698 A CN108764698 A CN 108764698A
- Authority
- CN
- China
- Prior art keywords
- car
- user
- share
- information
- friend
- 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 73
- 230000015654 memory Effects 0.000 claims description 22
- 230000005540 biological transmission Effects 0.000 claims description 12
- 238000004364 calculation method Methods 0.000 claims description 4
- 230000004044 response Effects 0.000 description 24
- 238000010586 diagram Methods 0.000 description 17
- 238000013459 approach Methods 0.000 description 16
- 238000004891 communication Methods 0.000 description 8
- 230000006870 function Effects 0.000 description 7
- 238000012545 processing Methods 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 5
- 230000006399 behavior Effects 0.000 description 4
- 230000000694 effects Effects 0.000 description 4
- 208000021760 high fever Diseases 0.000 description 4
- 238000000638 solvent extraction Methods 0.000 description 4
- 238000004458 analytical method Methods 0.000 description 3
- 238000004590 computer program Methods 0.000 description 2
- VJYFKVYYMZPMAB-UHFFFAOYSA-N ethoprophos Chemical compound CCCSP(=O)(OCC)SCCC VJYFKVYYMZPMAB-UHFFFAOYSA-N 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 102000006822 Agouti Signaling Protein Human genes 0.000 description 1
- 108010072151 Agouti Signaling Protein Proteins 0.000 description 1
- 208000019901 Anxiety disease Diseases 0.000 description 1
- SAZUGELZHZOXHB-UHFFFAOYSA-N acecarbromal Chemical compound CCC(Br)(CC)C(=O)NC(=O)NC(C)=O SAZUGELZHZOXHB-UHFFFAOYSA-N 0.000 description 1
- 230000036506 anxiety Effects 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 239000004744 fabric Substances 0.000 description 1
- 238000003384 imaging method Methods 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 230000000630 rising effect Effects 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
- 238000012549 training Methods 0.000 description 1
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
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/02—Reservations, e.g. for tickets, services or events
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/109—Time management, e.g. calendars, reminders, meetings or time accounting
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Tourism & Hospitality (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Development Economics (AREA)
- Health & Medical Sciences (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Data Mining & Analysis (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention discloses a kind of method and system of share-car information alert.The method includes：Obtain the share-car request of user；Share-car request is sent to server；The information of server is received, the progress information of the share-car request is shown and dynamically update and finds the status information for spelling friend for user；The progress information of the share-car request at least reflects user's estimated waiting time.Method provided by the invention can make user recognize the progress information of share-car and the status information of share-car in time, allow users to more patiently wait for and welcome the emperor vehicle, and user is avoided to cancel share-car request.
Description
Technical field
The present invention relates to Public Transport Service technical field more particularly to a kind of share-car information cuing method and systems.
Background technology
Now with townie development, the anxiety of taxi resource and rising steadily for expense, share-car oneself through at
For a popular trip mode.Share-car trip allows multiple shared transportation services of trip individual, makes full use of the carrying of vehicle
Amount, can further decrease travel cost, mitigate relevant traffic pollution and problems of energy consumption.
When user by the share-car software of client send out share-car request when, system needs take some time for
Family, which is found, spells friend.If user is ready to wait for more time, system be user find spell friend (go together with user when share-car its
He passenger) success rate will greatly promote.Accordingly, it is desirable to provide a kind of share-car information cuing method, extends user and is ready as possible
To wait for share-car success the time it takes, and then improve share-car success rate.
Invention content
The invention mainly relates to a kind of share-car information cuing method, system and devices.Specifically include the following aspects：
In a first aspect, the present invention discloses a kind of share-car information cuing methods.This method includes：The share-car for obtaining user is asked
It asks；Share-car request is sent to server；Receive the information of server, show and dynamically update that the share-car asks into
Journey information and the status information that spelling friend is found for user；The progress information of the share-car request at least reflects that user is estimated and waits for
Duration.
In some embodiments, the status information includes at least at least one candidate spelling friend's determined for the user
Identification information and the candidate matching degree for spelling friend；The matching degree at least reflects the candidate direct route journey for spelling friend and the user
Degree.
In some embodiments, the user includes the duration and/or use that the estimated waiting of user is sent a car estimated waiting time
Family is estimated to wait for the duration dispatched a car.
In some embodiments, it shows and the progress information for dynamically updating the share-car request further comprises：In terms of falling
When mode show the progress information.
In some embodiments, the share-car information cuing method further include receive and display server push welcome the emperor vehicle
Information of vehicles and its location information.
Second aspect, the present invention discloses a kind of share-car information presentation systems.The system includes：Acquisition module, for obtaining
Take the share-car request at family；Transmission module, for share-car request to be sent to server；Receiving module, for receiving clothes
The information of business device；Display module, for show and dynamic update server push the share-car ask progress information and
The status information for spelling friend is found for user；The progress information of the share-car request at least reflects user's estimated waiting time.
In some embodiments, the status information includes at least at least one candidate spelling friend's determined for the user
Identification information and the candidate matching degree for spelling friend；The matching degree at least reflects the candidate direct route journey for spelling friend and the user
Degree.
In some embodiments, the user includes the duration and/or use that the estimated waiting of user is sent a car estimated waiting time
Family is estimated to wait for the duration dispatched a car.
In some embodiments, the display module is additionally operable to show the progress information in a manner of countdown.
In some embodiments, the display module be additionally operable to display server push welcome the emperor vehicle information of vehicles and
Its location information.
The third aspect, the present invention discloses a kind of share-car information presentation devices.The device include at least one processor with
And at least one processor；At least one processor is for storing computer instruction；At least one processor is used for
At least partly instruction in the computer instruction is executed to realize as described in any one of described share-car information cuing method
Operation.
Fourth aspect, the present invention discloses a kind of computer readable storage mediums.The storage medium storage computer refers to
It enables, the behaviour as described in any one of described share-car information cuing method is realized when the computer instruction is executed by processor
Make.
5th aspect, the present invention discloses a kind of share-car information cuing methods.This method includes：The share-car for obtaining user is asked
It asks；At least one, which is found, for the user spells friend；It progress information that the share-car is asked and is found for the user and spells friend
Status information be sent to client in real time；The progress information of the share-car request at least reflects user's estimated waiting time.
In some embodiments, the status information includes at least at least one candidate spelling friend's determined for the user
Identification information and the candidate matching degree for spelling friend；The matching degree at least reflects the candidate direct route journey for spelling friend and the user
Degree.
In some embodiments, the user includes that user is expected to wait for send a car duration and/or user estimated waiting time
It is expected that waiting for duration of dispatching a car.
In some embodiments, described to include at least one spelling friend of user searching：In the estimated waiting of the user
Duration of dispatching a car is interior to find at least one spelling friend for the user.
In some embodiments, the share-car information cuing method further includes：It is expected to wait for duration of sending a car reaching user
Before, it is that vehicle is welcomed the emperor in user's determination after searching out at least one spelling friend for the user；Alternatively, estimated etc. reaching user
After duration of sending a car, is determined for the user and welcome the emperor vehicle；The information of vehicles for welcoming the emperor vehicle and location information are sent to
The client.
In some embodiments, the share-car information cuing method further includes：Further include：Vehicle location letter is welcomed the emperor in acquisition
Breath；After determining that welcoming the emperor vehicle reaches the departure place in share-car request, when meeting arbitrary condition, sent out to driver terminal
Vehicle instructs：User is estimated to wait for duration arrival of dispatching a car, or searches out at least one for the user and spell friend.
In some embodiments, user is estimated waits for a length of fixed duration when dispatching a car；Alternatively, when the estimated waiting of user is dispatched a car
Departure place in the long request to the share-car is related.
In some embodiments, user is estimated waits for a length of fixed duration when sending a car；Alternatively, when the estimated waiting of user is sent a car
Length is at least related at least one of following information：The supply and demand ratio of departure place in the share-car request or user send out spelling
The position of vehicle request and the distance between the departure place in share-car request；The supply and demand ratio of departure place is departure place a certain range region
Current share-car order number in interior currently available number of vehicles divided by the region.
6th aspect, a kind of share-car information presentation system of present disclosure.The system includes：Acquisition module, for obtaining
The share-car of user is asked；Friendly matching module is spelled, friend is spelled for finding at least one for the user；Transmission module is used for institute
The status information stated the progress information of share-car request and find spelling friend for the user is sent to client in real time；The share-car
The progress information of request at least reflects user's estimated waiting time.
In some embodiments, the status information includes at least at least one candidate spelling friend's determined for the user
Identification information and the candidate matching degree for spelling friend；The matching degree at least reflects the candidate direct route journey for spelling friend and the user
Degree.
In some embodiments, the user includes that user is expected to wait for send a car duration and/or user estimated waiting time
It is expected that waiting for duration of dispatching a car.
In some embodiments, friendly matching module is spelled to be additionally operable in estimated wait in duration of dispatching a car of the user be the use
It finds at least one and spells friend in family.
In some embodiments, the share-car information presentation system further includes module of sending a car, for reach user estimated
Waiting is sent a car before duration, is that vehicle is welcomed the emperor in user's determination after searching out at least one spelling friend for the user；Alternatively, up to
After sending a car duration to the estimated waiting of user, is determined for the user and welcome the emperor vehicle；The transmission module is additionally operable to welcome the emperor described
The information of vehicles and location information of vehicle are sent to the client.
In some embodiments, the share-car information presentation system further includes control module of dispatching a car；The acquisition module is used
Vehicle position information is welcomed the emperor in acquisition；It is described dispatch a car control module for when determine welcome the emperor vehicle reach share-car ask in setting out
Behind ground, when meeting arbitrary condition, departure instructions are sent out to driver terminal：User is estimated to wait for duration arrival of dispatching a car, or is
The user searches out at least one and spells friend.
In some embodiments, user is estimated waits for a length of fixed duration when dispatching a car；Alternatively, when the estimated waiting of user is dispatched a car
Departure place in the long request to the share-car is related.
In some embodiments, user is estimated waits for a length of fixed duration when sending a car；Alternatively, when the estimated waiting of user is sent a car
Length is at least related at least one of following information：The supply and demand ratio of departure place in the share-car request or user send out spelling
The position of vehicle request and the distance between the departure place in share-car request；The supply and demand ratio of departure place is departure place a certain range region
Current share-car order number in interior currently available number of vehicles divided by the region.
7th aspect, the present invention discloses a kind of share-car information presentation devices.The device include at least one processor with
And at least one processor；At least one processor is for storing computer instruction；At least one processor is used for
At least partly instruction in the computer instruction is executed to realize as described in any one of described share-car information cuing method
Operation.
Eighth aspect, the present invention discloses a kind of computer readable storage mediums.The storage medium storage computer refers to
It enables, the behaviour as described in any one of described share-car information cuing method is realized when the computer instruction is executed by processor
Make.
9th aspect, a kind of method for duration of dispatching a car the present invention discloses estimated waiting of determining user.This includes：It obtains
The share-car of user is asked；Departure place in being asked based on share-car determines that the estimated waiting of user is dispatched a car duration；User is estimated to be waited for
A length of server finds the maximum time that user spells friend when dispatching a car.
In some embodiments, it is described asked based on share-car in departure place determine that the estimated waiting of user is dispatched a car duration packet
It includes：Determine the region belonging to the departure place；Based on the region, determines that the user is estimated and wait for duration of dispatching a car.
In some embodiments, it is described asked based on share-car in departure place determine that the estimated waiting of user is dispatched a car duration packet
It includes：It determines the approach rate of the departure place, be combined into rate, supply and demand ratio and response rate；Determine position when user sends out share-car request
To the distance of the departure place；Based on the approach rate, it is combined at least one of rate, supply and demand ratio, response rate and distance information,
User is calculated to be expected to wait for duration of dispatching a car；The approach rate of departure place is that the history share-car sent out in a certain range region of departure place is ordered
Singular mesh removes the order number by way of the departure place in the history share-car order；The rate that is combined into of departure place is to be set out with described
Ground is as the sum of the successful share-car order number of share-car divided by the history share-car order in the history share-car order of departure place；
The supply and demand ratio of departure place is the currently available number of vehicles in a certain range region of departure place divided by the current share-car in the region
Order number；The response rate of departure place is the number accepted an order in history share-car order using the departure place as departure place
The sum of mesh divided by the history share-car order.
Tenth aspect, a kind of system for duration of dispatching a car the present invention discloses estimated waiting of determining user.The system includes：
Acquisition module, the share-car for obtaining user are asked；Determining module determines user's for the departure place in being asked based on share-car
It is expected that waiting for duration of dispatching a car；User is estimated to wait for a length of server when dispatching a car to find the maximum time that user spells friend.
In some embodiments, the determining module is additionally operable to：Determine the region belonging to the departure place；Based on the area
Domain determines that the user is estimated and waits for duration of dispatching a car.
In some embodiments, the determining module is additionally operable to：It determines the approach rate of the departure place, be combined into rate, supply and demand
Than and response rate；Determine that the distance of position to the departure place when user sends out share-car request is based on the approach rate, is combined into
At least one of rate, supply and demand ratio, response rate and distance information calculates user and is expected to wait for duration of dispatching a car；The approach of departure place
Rate is by way of the order number of the departure place divided by set out in the history share-car order that sends out in a certain range region of departure place
The history share-car order number sent out in ground a certain range region；The rate that is combined into of departure place is using the departure place as departure place
History share-car order in the sum of the successful share-car order number of share-car divided by the history share-car order；The supply and demand of departure place
Than for the currently available number of vehicles in a certain range region of departure place divided by the current share-car order number in the region；It sets out
The response rate on ground is the number accepted an order in history share-car order using the departure place as departure place divided by described goes through
The sum of history share-car order.
Tenth on the one hand, a kind of device for duration of dispatching a car the present invention discloses estimated waiting of determining user.The device packet
Include at least one processor and at least one processor；At least one processor is for storing computer instruction；It is described
At least one processor is used to execute at least partly instructing in the computer instruction and such as determines that user's is estimated to realize
Operation described in any one of method of duration to be dispatched a car.
12nd aspect, the present invention discloses a kind of computer readable storage mediums.The storage medium stores computer
Instruction, when the computer instruction is executed by processor realize as determine user estimated waiting dispatch a car duration method in times
Operation described in meaning one.
Description of the drawings
Fig. 1 be according to some embodiments of the present invention shown in a kind of schematic diagram of on-demand service system；
Fig. 2 is the block diagram of the exemplary computer device of the dedicated system for realizing technical solution of the present invention；
Fig. 3 is the block diagram of the EXEMPLARY MOBILE DEVICE of the dedicated system for realizing technical solution of the present invention；
Fig. 4 be according to some embodiments of the present invention shown in a kind of flow diagram of share-car information cuing method；
Fig. 5 be according to some embodiments of the present invention shown in a kind of functional block diagram of share-car information presentation device；
Fig. 6 be according to some embodiments of the present invention shown in another share-car information cuing method flow diagram；
Fig. 7 be according to some embodiments of the present invention shown in another share-car information presentation device functional block diagram；
Fig. 8 be according to some embodiments of the present invention shown in a kind of estimated waiting of determining user dispatch a car the method for duration
Flow diagram；
Fig. 9 be according to some embodiments of the present invention shown in a kind of determining user estimated waiting growth device when dispatching a car
Functional block diagram.
Specific implementation mode
It is required in being described below to embodiment to make in order to illustrate more clearly of the technical solution of embodiments herein
Attached drawing is briefly described.It should be evident that the accompanying drawings in the following description is only some examples or the implementation of the application
Example, for those of ordinary skill in the art for, without creative efforts, can also be according to these attached drawings
The application is applied to other similar scenes.Unless being explained obviously or separately, identical label generation in figure from language environment
The identical structure or operation of table.
As shown in the application and claims, unless context clearly prompts exceptional situation, " one ", "one", " one
The words such as kind " and/or "the" not refer in particular to odd number, may also comprise plural number.It is, in general, that term " comprising " only prompts to wrap with "comprising"
Include clearly identify the step of and element, and these steps and element do not constitute one it is exclusive enumerate, method or equipment
May also include other step or element.
Although the application in system according to an embodiment of the present application certain module or unit be made that various references,
However, any amount of disparate modules or unit can be used and be operated on client and/or server.The module is only
It is illustrative, and the different aspect of the system and method can use disparate modules.
Flow chart used herein is used for illustrating the operation performed by system according to an embodiment of the present application.It should
Understand, before or operation below not necessarily accurately carry out in sequence.On the contrary, can be handled according to inverted order or simultaneously
Various steps.It is also possible to during other operations are added to these, or remove a certain step from these processes or count step behaviour
Make.
Embodiments herein can be applied to different transportation systems, and different transportation systems includes but not limited to land
The combination of one or more of ground, ocean, Aeronautics and Astronautics etc..For example, taxi, special train, windward driving, bus, generation drive, fire
Vehicle, motor-car, high ferro, ship, aircraft, fire balloon, the unpiloted vehicles, receive/send express delivery etc. and apply management and/or point
The transportation system matched.The different embodiment application scenarios of the application include but not limited to webpage, browser plug-in, client, determine
The combination of one or more of system processed, enterprises analysis system, artificial intelligence robot etc..It should be understood that this
The application scenarios of the system and method for application are only some examples or embodiment of the application, for the ordinary skill of this field
For personnel, without creative efforts, the application can also be applied to according to these attached drawings other similar
Scene.For example, other similar guiding user's shutdown systems.
" passenger " described herein, " passenger end ", " user ", " user terminal ", " customer ", " demander ", " service needs
The person of asking ", " consumer ", " consumer ", " use demand person " etc. can be interchanged, and refer to one for needing or ordering service
Side can be personal, can also be tool.Similarly, " driver " described herein, " driver end ", " supplier ", " supply
Person ", " ISP ", " server ", " service side " etc. are also that can be interchanged, and refer to providing service or assisting to provide clothes
Individual, tool or other entities of business etc..In addition, " user " described herein can be one for needing or ordering service
Side can also be the service that provides or assist to provide a side of service.
Fig. 1 be according to some embodiments of the present invention shown in a kind of schematic diagram of on-demand service system.
On-demand service system 100 may include server 110, network 120, passenger end 130, driver end 140 and memory
150。
Server 110 can be local, can also be long-range.Server 110 may include for executing instruction (journey
Sequence code), and be that different share-car users determines waiting time by certain algorithm.
In some embodiments, server 110 can be used for carrying out analysis processing to the information of collection to generate analysis knot
The system of fruit.Server 110 can be a terminal device, can also be a server, can also be server farm.Institute
It can be centralized, such as data center to state server farm.The server farm can also be distributed, such as divide
Cloth system.
Passenger end 130 refers to individual, tool or other entities of issuing service order.In some embodiments, passenger
End 130 is the passenger's end subscriber for sending out share-car request.In some embodiments, passenger end 130 includes but not limited to desktop computer
The group of one or more of 130-1, laptop 130-2, the built-in device 130-3 of motor vehicle, mobile device 130-4 etc.
It closes.
Driver end 140 is individual, tool or other entities for executing Service Order.In some embodiments, Si Jiduan
140 be the driver's end subscriber for receiving passenger and sending out share-car request.In some embodiments, driver end 140 includes but not limited to platform
One kind in formula computer 140-1, laptop 140-2, the built-in device 140-3 of motor vehicle, mobile device 140-4 etc. or
Several combinations.Server 110 can directly access the data information that access is stored in memory 150, can also directly pass through
Network 120 accesses the information of access user 130/140.
Memory 150 can refer to the equipment with store function.Memory 150 is mainly used for storage from passenger end 130
And/or the data collected of driver end 140 and on-demand service system 100 work in the various data that generate.Memory 150 can be
Local, can also be long-range.The connection or communication of other intermodules of system database Yu system can be wired, also may be used
To be wireless.
Network 120 can provide the channel of information exchange.Network 120 can be single network, can also be multiple network
Combination.Network 120 can include but is not limited to LAN, wide area network, common network, dedicated network, WLAN, virtual
The combination of one or more of network, city Metropolitan Area Network (MAN), public switch telephone network etc..Network 120 may include a variety of nets
Network access point, such as wired or wireless access point, base station (such as 120-1,120-2) or network exchange point, are made by the above access point
Data source connects network 120 and sends information by network.
Fig. 2 is the block diagram of the exemplary computer device 200 of the dedicated system for realizing technical solution of the present invention.
As shown in Fig. 2, computing device 200 may include processor 210, memory 220,230 and of input/output interface
Communication port 240.
Processor 210 can execute computations (program code) and execute the on-demand service system 100 that the present invention describes
Function.The computations may include that (function refers to for program, object, component, data structure, process, module and function
Specific function described in the present invention).For example, processor 210 can handle other any components from on-demand service system 100
The image or text data of acquisition.In some embodiments, processor 210 may include microcontroller, microprocessor, simplify finger
Enable collection computer (RISC), application-specific integrated circuit (ASIC), using specific instruction set processor (ASIP), central processing unit
(CPU), graphics processing unit (GPU), physical processing unit (PPU), micro controller unit, digital signal processor (DSP), existing
Field programmable gate array (FPGA), advanced risc machine (ARM), programmable logic device and it is able to carry out one or more functions
Any circuit and processor etc. or its arbitrary combine.Only for explanation, the computing device 200 in Fig. 2 only describes at one
Device is managed, but should be noted that the computing device 200 in the present invention can also include multiple processors.
Memory 220 can store the data/information obtained from any other component of on-demand service system 100.One
In a little embodiments, memory 220 may include that mass storage, removable memory, volatibility read and write memory
With read-only memory (ROM) etc. or its arbitrary combine.Exemplary mass storage may include that disk, CD and solid-state are driven
Dynamic device etc..Removable memory may include flash drive, floppy disk, CD, storage card, compact disk and tape etc..Volatibility
It may include random access memory (RAM) to read and write memory.RAM may include dynamic ram (DRAM), double-speed
Rate synchronous dynamic ram (DDR SDRAM), static state RAM (SRAM), thyristor RAM (T-RAM) and zero capacitance (Z-RAM) etc..
ROM, which may include mask rom (MROM), programming ROM (PROM), erasable programmable ROM (PEROM), electric erasable, to be compiled
Journey ROM (EEPROM), CD ROM (CD-ROM) and digital versatile disc ROM etc..
Input/output interface 230 can be used for inputting or output signal, data or information.In some embodiments, defeated
Enter/output interface 230 can be such that user is contacted with on-demand service system 100.In some embodiments, input/output connects
Mouth 230 may include input unit and output device.Exemplary input device may include keyboard, mouse, touch screen and Mike
Wind etc. or its arbitrary combination.Exemplary output device may include display equipment, loud speaker, printer, projecting apparatus etc. or its
Arbitrary combination.Exemplary display devices may include liquid crystal display (LCD), based on light emitting diode (LED) display,
Flat-panel monitor, flexible displays, television equipment, cathode-ray tube (CRT) etc. or its arbitrary combination.Communication port 240 can
To be connected to network so that data communicate.The connection can be the combination of wired connection, wireless connection or both.Wired connection
May include cable, optical cable or telephone wire etc. or its arbitrary combination.Wireless connection may include bluetooth, Wi-Fi, WiMax,
WLAN, ZigBee, mobile network (for example, 3G, 4G or 5G etc.) etc. or its arbitrary combination.In some embodiments, communication port
240 can be standardized port, such as RS232, RS485.In some embodiments, communication port 240 can specially be designed
Port.For example, communication port 240 can be designed according to digital imagery and medical communication agreement (DICOM).
Fig. 3 is the block diagram of the EXEMPLARY MOBILE DEVICE 300 of the dedicated system for realizing technical solution of the present invention.
As shown in figure 3, the mobile device 300 may include communications platform 310, display 320, graphics processor
(GPU) 330, central processing unit (CPU) 340, input/output interface 350, memory 360, memory 370 etc..In some implementations
In example, operating system 361 (e.g., iOS, Android, Windows Phone etc.) and application program 362 can be from memories 370
It is loaded into memory 360, to be executed by CPU340.Application program 362 may include browser or be used for from on-demand service system
System 100 receive imagings, graphics process, audio or other relevant informations application program.
In order to realize various modules, unit and its function described in the present invention, computing device or mobile device can be with
Hardware platform as one or more components described in the invention.These computers or the hardware element of mobile device, behaviour
It is conventional to make system and programming language substantially, and can fit these technologies after these technologies familiar to the person skilled in the art
It should be in on-demand service system described in the invention.Computer with user interface elements can be used to implement personal computer
(PC) or other kinds of work station or terminal device, if suitably programmed, computer can also act as server.
Fig. 4 be according to some embodiments of the present invention shown in a kind of share-car information cuing method 400 flow diagram.
Share-car information cuing method 400 can be realized by passenger end 130 (or client).
Step 401, the share-car request of user is obtained.
Passenger end 130 (for example, mobile phone) can obtain share-car request input by user.Share-car request may include but unlimited
In departure place, destination, the time for sending out share-car request, send out share-car request when position, number of passengers etc..
Step 402, share-car request is sent to server.
Passenger end 130 can ask the share-car to be sent to server 110 by network 120.
Step 403, the information of server is received, shows and dynamically update the progress information of the share-car request and to use
Find the status information for spelling friend in family.
Passenger end 130 can receive the information of the transmission of server 110；Simultaneously dynamic can be shown on the interface at passenger end 130
It updates the progress information of the share-car request and finds the status information for spelling friend for user.Wherein, share-car request into
Journey information at least reflects user's estimated waiting time.It shows and the progress information for dynamically updating the share-car request further wraps
It includes：The progress information is shown in a manner of countdown.
In some implementations, to be that user is estimated estimated waiting time wait for the duration sent a car and/or user estimated etc. to user
Duration etc. to be dispatched a car.In other embodiments, user can also be estimated other nodes of waiting of user estimated waiting time
Duration, such as：Driver reaches this node of departure place in share-car request.
User is estimated wait for send a car when a length of passenger end 130 interface on show user need waiting how long server
110 start the duration sent a car for the user.In one embodiment, user is estimated waits for the when a length of user to send a car to send out share-car
Duration at the time of starting to send a car for it to server 110 at the time of request, for example, 1 point after user sends out share-car request
After clock terminates, server 110 can send a car for user.In another embodiment, user is estimated waits for the duration sent a car can be with
Be at the time of server 110 receives share-car request to server 110 start for the user send a car between the moment when
It is long, such as send a car for user after 50 seconds after server 110 receives user's share-car request.In another embodiment,
User is estimated to wait for the duration sent a car to can also be that current time starts to send a car between the moment for the user to server 110
Duration.For example, come this duration of Dynamic Announce by way of countdown on client screen, will be sent for you such as after 50 seconds
Vehicle.
User is estimated to wait for a length of user when dispatching a car to need how long waiting can set out.In one embodiment, user is pre-
It is set out the moment (that is, dispatching a car at the time of meter waits for the when a length of user to dispatch a car to send out share-car request to welcoming the emperor after vehicle is connected to user
Moment) duration.For example, user distributes share-car request 8: 10,8 points of the interface display at passenger end 130 goes out for 15 minutes on time
Hair.In another embodiment, when the duration that the estimated waiting of user is dispatched a car can be that server 110 receives the share-car request
User is carved into set out the duration at moment.In another embodiment, user is estimated waits for the duration dispatched a car to can also be current time
Set out the duration at moment to user.For example, come this duration of Dynamic Announce by way of countdown on client screen, such as
Client shows that 4 points were set out after 37 seconds.
In some embodiments, the status information can be the number for being user's matching candidate spelling friend, example
Such as " having matched spelling friend 5 times for you ", it has been found that it is candidate spell friend's number, such as " found 7 candidates that can be gone together all the way
Spelling friend ", the candidate identification information for spelling friend and/or the candidate spell the matching degree etc. of friend.The matching degree at least reflects candidate spelling
The friendly direct route degree with the user.Wherein, identification information can be the candidate head portrait or id information for spelling friend's registration.For example,
The interface at passenger end 130 can show the candidate head portrait for spelling friend's registration and candidate spell friend and user direct route degree (for example,
55%) direct route degree is.
In some embodiments, dynamically updating the status information can be：At current time, client display is candidate to spell friend
Head image information, location information and the matching degree 75% of A, the candidate head image information for spelling friend B of subsequent time client switching display,
Location information and matching degree 82%, then candidate head image information, the location information for spelling friend C of subsequent time client switching display
And matching degree 95% etc..After spelling friendly determine, client display screen no longer handoff candidate spelling friend, but the spelling that will eventually determine
Friendly information is shown always.
In other embodiments, can also share-car process at any time propulsion, accelerate the candidate switch speed for spelling friendly information.
In some embodiments, the share-car information cuing method 400 further include receive and display server push connect
The information of vehicles and its location information driven.For example, being found after user is expected that duration of sending a car is waited for reach or for user
After having arrived at least one spelling friend, license plate number, vehicle, color of vehicle etc. are welcomed the emperor in display on the client, and are welcomed the emperor vehicle and arrived
The routing information of the departure place, cartographic information etc..
Fig. 5 be according to some embodiments of the present invention shown in a kind of functional block diagram of share-car information presentation device.
Share-car information presentation device 500 can be realized by passenger end 130 (or client).For convenience of description, share-car information
Suggestion device 500 is referred to as share-car information presentation system.
Share-car information presentation device 500 may include acquisition module 510, transmission module 520, receiving module 530 and display
Module 540.
Acquisition module 510, the share-car for obtaining user are asked.
Transmission module 520, for share-car request to be sent to server.
Receiving module 530, the information for receiving server.
Display module 540, for show and dynamic update server push the share-car ask progress information and
The status information for spelling friend is found for user.The progress information of the share-car request at least reflects user's estimated waiting time.
In some embodiments, the status information includes at least at least one candidate spelling friend's determined for the user
Identification information and the candidate matching degree for spelling friend；The matching degree at least reflects the candidate direct route journey for spelling friend and the user
Degree.
In some embodiments, the user includes the duration sent a car with the estimated waiting of user, user estimated waiting time
It is expected that waiting for the duration dispatched a car and/or the estimated duration etc. for waiting for driver to reach the departure place of user.
In some embodiments, the display module 540 is additionally operable to show the progress information in a manner of countdown.
In some embodiments, the display module 540 is additionally operable to the vehicle letter for welcoming the emperor vehicle of display server push
Breath and its location information.
In some embodiments, share-car information presentation device 500 may include at least one processor and at least one
Memory；At least one processor is for storing computer instruction；At least one processor by execute it is described based on
At least partly instructing to realize share-car information cuing method as described in Figure 4 in the instruction of calculation machine.
In some embodiments, the present invention relates to a kind of computer readable storage medium, the storage medium storage calculates
Machine instructs, and share-car information cuing method as described in Figure 4 is realized when the computer instruction is executed by processor.
It should be noted that above-mentioned modules can be the software module realized by computer instruction.
Fig. 6 be according to some embodiments of the present invention shown in another share-car information cuing method 600 flow signal
Figure.
Share-car information cuing method 600 can be realized by server 110.
Step 601, the share-car request of user is obtained.
The share-car that server 110 can obtain the user that passenger end 130 is sent by network 120 is asked.Share-car request can
With include but not limited to departure place, destination, the time for sending out share-car request, send out share-car request when position etc..
Step 602, it is that the user finds at least one spelling friend.
Server 110 can be that the user finds at least one spelling friend.It can be existing to find the method for spelling friend for user
There is any matching process in technology, details are not described herein.For example, server 110 can determine user departure place to destination
Between guidance path and spell friendly departure place to the guidance path registration between destination the direct route that determines user with spell friend
Degree, and then direct route degree is greater than the set value, such as 90%, candidate to spell friend friendly as the spelling of the user.
Step 603, the status information that the progress information share-car asked and being found for the user spells friend is real-time
It is sent to client.
Server 110 can be spelled by progress information that network 120 asks the share-car and being found for the user
The status information of friend is sent to client (i.e. passenger end 130) in real time.The progress information of the share-car request at least reflects user
It is expected that waiting time.
In some embodiments, the progress information of the share-car request at least reflects user's estimated waiting time.The use
Family estimated waiting time, which includes that user is estimated, waits for the duration and/or user is estimated waits for duration etc. of dispatching a car of sending a car.It is asked about share-car
Progress information is asked to may refer to elaborating in Fig. 4 related descriptions.
In some embodiments, user is it is expected that it can be to fix duration, such as 6 minutes to wait for duration of dispatching a car；Alternatively, root
Departure place in being asked according to the share-car determines that corresponding user is estimated and waits for duration of dispatching a car.User is determined about according to departure place
It is expected that the more contents for duration of dispatching a car is waited for may refer to elaborating in Fig. 8 related descriptions.
In some embodiments, user is estimated waits for a length of fixed duration when sending a car, such as 1 minute；Alternatively, user is estimated etc.
Duration to be sent a car is at least related at least one of following information：The supply and demand ratio of departure place in the share-car request, or use
The position and the distance between the departure place in share-car request that family sends out share-car request.Wherein, the supply and demand ratio of departure place is to set out
The current share-car order number in currently available number of vehicles divided by the region in ground a certain range region.For example, serious lack
When vehicle can be used less, user is estimated to wait for duration of sending a car longer；When vehicle can be used less, user is estimated to be waited for a length of 1 when sending a car
Minute；Supply and demand is bigger, and when vehicle can be used more, user's estimated waiting is 2 minutes a length of when sending a car；It is prodigious cold for supply and demand ratio
Door region, user's estimated waiting are 30 seconds a length of when sending a car.In further embodiments, when the position that user sends out share-car request is arrived
The distance of departure place is longer, because user reaches departure place and needs to take more time, therefore user is it is expected that when obtaining sending a car
Length can be appropriately extended.
Server 110 can spell friendly situation, position, traffic information for welcoming the emperor vehicle etc. periodically or non-periodically according to finding
Update share-car request progress information, and be pushed to the client of the user.For example, server 110 can be according to above-mentioned
Situation is estimated to user to wait for the duration and/or user is estimated that duration of dispatching a car is waited for be adjusted of sending a car, and such as extends or shortens, and i.e.
When be sent to client and show.Only as an example, having happened suddenly on the way traffic thing when welcome the emperor the departure place that driver goes to share-car to ask
Therefore anticipating user can be waited for duration of dispatching a car to extend to 7 minutes by original 5 minutes by server 110.In another example server
110 do not adjust that predetermined user is estimated to wait for the duration and/or user is estimated waits for duration of dispatching a car of sending a car, only by this two
The countdown residual time length of kind duration is sent to client and shows in real time.
In some embodiments, the status information can be the number for being user's matching candidate spelling friend,
It is found that it is candidate spell friend's number, candidate spells the identification information of friend and the candidate matching degree etc. for spelling friend.The matching degree
At least candidate direct route degree for spelling friend and the user of reflection.Wherein, identification information can be the candidate head portrait for spelling friend's registration or
Person's id information.For example, the interface at passenger end 130 can show that the candidate head portrait for spelling friend's registration and the candidate spell friend and user's
Direct route degree (for example, direct route degree is 55%).
The process of the screening spelling friend when finding spelling friend for user is sent to client and shown by server 110.It is appreciated that
For first, server 110 is the matching degree for determining other users and the user from other share-cars request, and matching degree is big
In given threshold, such as 70% or more, other users spell friend as the candidate of the user.The candidate information for spelling friend is sent to
The client of the user, server 110 continually looks for candidate spelling friend later, and the higher candidate friendly information of spelling of matching degree is pushed away
Client is given, and so on, until determining a final spelling friend, and the information for spelling friend is pushed to client.For example, clothes
Business device 110 is that user searches out a candidate friend A, and the candidate head image information for spelling friend A (can be adjusted from server database
Take), location information (can be obtained by the client of spelling friend), matching degree 75% be pushed to the client of the user, under
One moment server 110 is that user has searched out another one candidate spelling friend B, and the candidate head image information for spelling friend B, position are believed
Breath and matching degree 82% are pushed to client, then subsequent time server 110 believes the candidate head image information for spelling friend C, position
Breath and matching degree 95% are pushed to described subscription client etc..After spelling friend and determining, what server 110 will eventually determine
It spells friendly information and is pushed to the subscription client, and stop finding and spell friend.
In some embodiments, described to include at least one spelling friend of user searching：In the estimated waiting of the user
Duration of dispatching a car is interior to find at least one spelling friend for the user.It is to be understood that being expected to wait for duration work of dispatching a car by the user
It is the maximum time that user finds spelling friend for server.For example, after welcoming the emperor vehicle arrival departure place and connecting the user, clothes
Business device 110 does not find suitable spelling friend also, and welcoming the emperor vehicle will not dispatch a car, and server 110 can also continue to as the user at this time
It finds and spells friend.It waits for duration of dispatching a car to have arrived at if user is estimated, even if server 110 does not find spelling friend also, welcomes the emperor vehicle then
It can set out, without waiting for.
In some embodiments, the share-car information cuing method 600 further includes：
Step 604, before reaching user and being expected to wait for duration of sending a car, it is after searching out at least one spelling friend for the user
The user, which determines, welcomes the emperor vehicle；Alternatively, after reaching user and being expected to wait for duration of sending a car, is determined for the user and welcome the emperor vehicle
?.
It is to be understood that if server fails to find suitable spelling friend, and the time is also not up to estimated wait for of user and sends
Vehicle duration, server 110 will not send a car, but continue as user and find spelling friend.
In some embodiments, before reaching user and being expected to wait for duration of sending a car, server 110 is successfully just the use
Family searches out at least one and spells friend.At this point, server 110, which can be the stroke determination that the user and spelling friend form, welcomes the emperor vehicle
?.
In some embodiments, if user reaches rear server 110 estimated waiting time and do not find suitable spelling friend yet,
It is then that vehicle is welcomed the emperor in user determination immediately.
Assign the method for welcoming the emperor vehicle that can use any one method of sending a car in the prior art for user, it is no longer superfluous herein
State its detailed process.Step 605, the information of vehicles for welcoming the emperor vehicle and location information are sent to the client.
The information of vehicles for welcoming the emperor vehicle and location information can be sent to described by server 110 by network 120
Client.In some embodiments, the share-car information cuing method 600 further includes：
Step 606, it obtains and welcomes the emperor vehicle position information.
Server 110 can obtain the location information for welcoming the emperor vehicle by network 120.
Step 607, after determining that welcoming the emperor vehicle reaches the departure place in share-car request, when meeting arbitrary condition, to
Driver terminal sends out departure instructions：User is estimated to wait for duration arrival of dispatching a car, or searches out at least one for the user and spell friend.
In some embodiments, after welcoming the emperor the departure place that vehicle reaches in share-car request, and user is it is expected that when waiting is dispatched a car
Length arrived, and server 110 will send out departure instructions to driver terminal (i.e. driver end 140).
In some embodiments, welcome the emperor vehicle reach share-car request in departure place after, and for the user search out to
Few one is spelled friend, and server 110 will send out departure instructions to driver terminal (i.e. driver end 140).
Fig. 7 be according to some embodiments of the present invention shown in another share-car information presentation device functional block diagram.
Share-car information presentation device 700 can be realized by server 110.For convenience of description, share-car information presentation device 700
It is referred to as share-car information presentation system.
Share-car information presentation device 700 may include acquisition module 710, spell friendly matching module 720 and transmission module 730.
Acquisition module 710, the share-car for obtaining user are asked.
Friendly matching module 720 is spelled, friend is spelled for finding at least one for the user.
Transmission module 730, the progress information for asking the share-car and the state for user searching spelling friend
Information is sent to client in real time.The progress information of the share-car request at least reflects user's estimated waiting time.
In some embodiments, the status information includes at least at least one candidate spelling friend's determined for the user
Identification information and the candidate matching degree for spelling friend；The matching degree at least reflects the candidate direct route journey for spelling friend and the user
Degree.
In some embodiments, the user includes that user is expected to wait for send a car duration and/or user estimated waiting time
It is expected that waiting for duration of dispatching a car.
In some embodiments, friendly matching module 720 is spelled to be additionally operable to be expected to wait in duration of dispatching a car for institute in the user
It states user and finds at least one spelling friend.
In some embodiments, share-car information presentation device 700 further includes module of sending a car, for reach user estimated etc.
It is that vehicle is welcomed the emperor in user's determination after searching out at least one spelling friend for the user before duration to be sent a car；Alternatively, reaching
The estimated waiting of user is sent a car after duration, is determined for the passenger and is welcomed the emperor vehicle.The transmission module 730 is additionally operable to welcome the emperor described
The information of vehicles and location information of vehicle are sent to the client.
In some embodiments, share-car information presentation device 700 also further includes control module of dispatching a car；The acquisition module
710 welcome the emperor vehicle position information for obtaining；It is described dispatch a car control module for when determine welcome the emperor vehicle reach share-car ask in
Departure place after, when meeting arbitrary condition, departure instructions are sent out to driver terminal：User is estimated to wait for the when of dispatching a car to grow to
It reaches, or searches out at least one for the user and spell friend.
In some embodiments, user is estimated waits for a length of fixed duration when dispatching a car；Alternatively, when the estimated waiting of user is dispatched a car
Departure place in the long request to the share-car is related.
In some embodiments, user is estimated waits for a length of fixed duration when sending a car；Alternatively, when the estimated waiting of user is sent a car
Length is at least related at least one of following information：The supply and demand ratio of departure place in the share-car request or user send out spelling
The position of vehicle request and the distance between the departure place in share-car request；The supply and demand ratio of departure place is departure place a certain range region
Current share-car order number in interior currently available number of vehicles divided by the region.
In some embodiments, share-car information presentation device 700 may include at least one processor and at least one
Memory；At least one processor is for storing computer instruction；At least one processor by execute it is described based on
At least partly instructing to realize share-car information cuing method as described in Figure 6 in the instruction of calculation machine.
In some embodiments, the present invention relates to a kind of computer readable storage medium, the storage medium storage calculates
Machine instructs, and share-car information cuing method as described in Figure 6 is realized when the computer instruction is executed by processor.
It should be noted that above-mentioned modules can be the software module realized by computer instruction.
User is estimated to wait for duration of dispatching a car to can be fixed (for example, 6 minutes), can also regard the specific feelings of share-car request
Condition determines the duration.
Fig. 8 be according to some embodiments of the present invention shown in a kind of estimated waiting of determining user dispatch a car the method for duration
800 flow diagram.
Determine that the dispatch a car method 800 of duration of the estimated waiting of user can be realized by server 110.
Step 801, the share-car request of user is obtained.
The share-car that server 110 can obtain the user that passenger end 130 is sent by network 120 is asked.Share-car request can
With include but not limited to departure place, destination, the time for sending out share-car request, send out share-car request when position etc..
Step 802, the departure place in being asked based on share-car determines that the estimated waiting of user is dispatched a car duration.Wherein, user is pre-
Meter waits for a length of server when dispatching a car to find the maximum time that user spells friend.
It is directed to step 802, the departure place in being asked based on share-car determines that the estimated waiting of user is dispatched a car duration, of the invention
Embodiment provides two kinds of implementation methods.
The first implementation method includes：
Step S11 determines the region belonging to the departure place.
Specifically, city can be divided into different regions by server 110 in advance.By taking Beijing as an example, Beijing can
To be divided into Haidian District, Changping District, Shunyi District etc..In another example can by mode of transportation by Beijing be divided into metro area,
Railway station region, aircraft field areas and bus station region etc..
Server 110 may further determine that out the area belonging to the departure place of user after determining the departure place of user
Domain.
It should be noted that above with respect to the description that Beijing is divided into different zones, only it is used as and illustrates and retouch
It states conveniently, the application can not be limited within the scope of illustrated embodiment.It is suchlike that city is divided into different zones
Method, within the protection domain of the application.
Step S12 is based on the region, determines that the user is estimated and waits for duration of dispatching a car.
Specifically, different regions presets different estimated waitings and dispatches a car duration.Server 110 is pre-set not
Region together corresponds to respective it is expected that waiting for duration of dispatching a car.
By taking Beijing as an example, Beijing is divided into Haidian District, Changping District, Shunyi District etc..Haidian District is corresponding estimated etc.
Wait duration of dispatching a car be 6 minutes, Changping District it is corresponding it is estimated wait for dispatch a car when 5 minutes a length of, Shunyi District it is corresponding estimated etc. pending
Vehicle duration corresponds to 7 minutes etc..When the departure place of the user is Zhong Guan-cun subway station, server 110 can be determined described
The departure place of user belongs to Haidian District.Further, server 110 can determine the Haidian District belonging to the departure place of the user
Corresponding estimated waiting is 6 minutes a length of when dispatching a car.
In another example Beijing is divided into metro area, railway station region, aircraft field areas and bus station by mode of transportation
Region etc..The corresponding estimated waiting in metro area is 6 minutes a length of when dispatching a car, railway station region is corresponding is expected to wait for duration of dispatching a car
For 9 minutes, aircraft field areas it is corresponding it is estimated wait for dispatch a car when a length of 15 minutes it is corresponding with bus station region estimated etc. pending
A length of 10 minutes when vehicle.When the departure place of the user is Beijing railway station, server 110 can determine the user's
Departure place belongs to railway station region.Further, server 110 can determine the railway station belonging to the departure place of the user
The corresponding estimated waiting in region is 9 minutes a length of when dispatching a car.
Second of implementation method include：
Step S21 determines the approach rate of the departure place, is combined into rate, supply and demand ratio and response rate.
Wherein, the approach rate (p1) of departure place be in a certain range region of departure place in the history share-car order that sends out by way of
The history share-car order number (m1) sent out in the order number (m2) of the departure place divided by departure place a certain range region, i.e.,
P1=m2/m1；Departure place is combined into rate (p2) for share-car success in the history share-car order using the departure place as departure place
Share-car order number (n2) divided by the history share-car order sum (n1), i.e. p2=n2/n1；The supply and demand ratio of departure place
(p3) it is the currently available number of vehicles (c2) in a certain range region of departure place divided by the current share-car order numbers in the region
Mesh (c1), i.e. p3=c2/c1；The response rate (p4) of departure place is in the history share-car order using the departure place as departure place
The sum (n1) of the number (d1) divided by the history share-car order accepted an order, i.e. p4=d1/n1.
Step S22, determine user send out share-car request when position to the departure place distance.
Specifically, passenger end 130 (for example, mobile terminal 130-4) can be determined described by built-in GPS device
User sends out position when share-car request.Server 110 can be obtained the user by network 120 and be sent out when share-car is asked
Position.Further, server 110 can determine the position to the departure place when user sends out share-car request
Distance (p5).
Step S23 based on the approach rate, is combined at least one of rate, supply and demand ratio, response rate and distance information, meter
User is calculated to be expected to wait for duration of dispatching a car.
In some embodiments, the method that machine learning may be used, by the above- mentioned information of different location in historical data
And it is waited for when the share-car in these places in historical data and dispatches a car or find the duration for spelling friend as training data to machine mould
Type is trained, and trained model can accurately calculate user according to the relevant information of the departure place in current share-car request
It is expected that waiting for duration of dispatching a car.
In further embodiments, server 110 can be based on the approach rate, be combined into rate and be expected apart from user is calculated
Waiting is dispatched a car duration.For example, approach rate, be combined into rate and the position when user sends out share-car request to the departure place away from
From different weights can be corresponded to.It is w2 and described that the corresponding weight of approach rate (p1), which is w1, is combined into the corresponding weight of rate (p2)
The corresponding weight of distance (p5) of position to the departure place when user sends out share-car request is w3.The user is estimated to be waited for
Duration of dispatching a car can be calculated by following formula：
User is estimated to wait for the duration=p1*w1+p2*w2+p5*w3 (1) that dispatches a car
When approach rate (p1), be combined into rate (p2) or the position when user sends out share-car request to the departure place away from
When bigger from (p5), duration is dispatched a car in the estimated waiting of the user will be longer.For example, the position when the user sends out share-car request
Set the departure place distance (p5) it is bigger when, user reaches the time that the departure place is spent will be longer, and the user is pre-
Duration is dispatched a car in meter waiting will be longer, to more easily share-car success.
In some embodiments, when server 110 can be dispatched a car based on supply and demand ratio and the estimated waiting of response rate calculating user
It is long.For example, share-car scene partitioning can be in advance different scene types by server 110.For example, being based on supply and demand ratio and response
Rate, server 110 is by other scenes such as share-car scene partitioning imbalance of supply and demand scene, high fever scene, low-heat scene and unexpected winner scenes
Type.
When supply and demand ratio and response rate meet condition 1 simultaneously, share-car scene is imbalance of supply and demand scene.For example, working as supply and demand ratio
When being less than second threshold less than first threshold and response rate, share-car scene is imbalance of supply and demand scene.
When supply and demand ratio and response rate meet condition 2 simultaneously, share-car scene is high fever scene.For example, when supply and demand ratio is more than
First threshold is less than third threshold value and response rate when being more than that second threshold is less than four threshold values, and share-car scene is high fever scene.
When supply and demand ratio and response rate meet condition 3 simultaneously, share-car scene is low-heat scene.For example, when supply and demand ratio is more than
Third threshold value is less than the 5th threshold value and response rate when being more than that the 4th threshold value is less than six threshold values, and share-car scene is low-heat scene.
When supply and demand ratio and response rate meet condition 4 simultaneously, share-car scene is unexpected winner scene.For example, when supply and demand ratio is more than
5th threshold value is less than the 7th threshold value and response rate when being more than that the 6th threshold value is less than eight threshold values, and share-car scene is unexpected winner scene.
When supply and demand ratio and response rate are unsatisfactory for condition 1 to 4 simultaneously, share-car scene is other scenes.
In some embodiments, the first threshold, third threshold value, the 5th threshold value and the 7th threshold value gradually increase, described
Second threshold, the 4th threshold value, the 6th threshold value and the 8th threshold value gradually increase.
Different share-car scene types corresponds to respective it is expected that waiting for duration of dispatching a car.For example, imbalance of supply and demand scene is corresponding
It is expected that t2 minutes a length of, low-heat scene when t1 minutes a length of, the corresponding estimated waiting of high fever scene is dispatched a car when dispatching a car is waited for correspond to
Estimated waiting corresponding with unexpected winner scene estimated wait for when dispatching a car a length of t4 minute and other scenes for a length of t3 minutes when dispatching a car
Type corresponding estimated waiting is t5 minutes a length of when dispatching a car.
When the response rate (p4) of the supply and demand ratio (p3) of the departure place and the departure place meets corresponding condition, service
Device 110 can determine the share-car scene type belonging to the departure place.
Further, based on the share-car scene type belonging to the departure place, when determining that the estimated waiting of the user is dispatched a car
It is long.
Specifically, based on the share-car scene type belonging to the departure place, server 110 can determine the departure place institute
The share-car scene type of category is corresponding to be expected to wait for duration of dispatching a car.For example, the share-car scene type belonging to the departure place is
When low-heat scene, the user estimated waiting is t3 minutes a length of when dispatching a car.
It should be noted that above with respect to being different types of description by share-car scene partitioning, only as illustrating and
Description is convenient, the application can not be limited within the scope of illustrated embodiment.It is suchlike by share-car scene partitioning be not
The method of same type, within the protection domain of the application.
Fig. 9 be according to some embodiments of the present invention shown in a kind of determining user estimated waiting growth device when dispatching a car
Functional block diagram.
Determine that growth device 900 can be realized by server 110 when the estimated waiting of user is dispatched a car.For convenience of description, it determines
Growth device 900 is referred to as determining that the estimated waiting of user is dispatched a car the system of duration when the estimated waiting of user is dispatched a car.
Determine that growth device 900 may include acquisition module 910 and determining module 920 when the estimated waiting of user is dispatched a car.
Acquisition module 910, the share-car for obtaining user are asked.
Determining module 920 determines that the estimated waiting of user is dispatched a car duration for the departure place in being asked based on share-car.User
It is expected that a length of server 110 when dispatching a car is waited for find the maximum time that user spells friend.
In some embodiments, the determining module 910 is additionally operable to：Determine the region belonging to the departure place；Based on institute
Region is stated, determines that the user is estimated and waits for duration of dispatching a car.
In some embodiments, the determining module is additionally operable to：It determines the approach rate of the departure place, be combined into rate, supply and demand
Than and response rate；Determine user send out share-car request when position to the departure place distance；Based on the approach rate, it is combined into
At least one of rate, supply and demand ratio, response rate and distance information calculates user and is expected to wait for duration of dispatching a car.Wherein, departure place
Approach rate be in a certain range region of departure place in the history share-car order that sends out by way of the order number of the departure place divided by
The history share-car order number sent out in a certain range region of departure place；The rate that is combined into of departure place is using the departure place as going out
Send out the sum of the successful share-car order number of share-car divided by the history share-car order in the history share-car order on ground；Departure place
Supply and demand ratio is the currently available number of vehicles in a certain range region of departure place divided by the current share-car order number in the region；
The response rate of departure place is the number accepted an order in the history share-car order using the departure place as departure place divided by institute
State the sum of history share-car order.
In some embodiments, determine that growth device 900 may include at least one processing when the estimated waiting of user is dispatched a car
Device and at least one processor；At least one processor is for storing computer instruction；At least one processor
For executing at least partly instructing to realize share-car information cuing method as described in Figure 8 in the computer instruction.
In some embodiments, the present invention relates to a kind of computer readable storage medium, the storage medium storage calculates
Machine instructs, and share-car information cuing method as described in Figure 8 is realized when the computer instruction is executed by processor.
It should be noted that above-mentioned modules can be the software module realized by computer instruction.
Modules and unit as described above it is not necessary to, for those skilled in the art,
After solving teachings herein and principle, all may without departing substantially from this technology principle, structure, to the system carry out form and
Various modifications and variations in details, modules can in any combination, or be constituted subsystem and be connect with other modules, and this
A little modifications and variations are still within claims hereof protection domain.
The advantageous effect that the embodiment of the present application may be brought includes but not limited to：User can recognize in time share-car into
Journey information and the status information of share-car allow users to more patiently wait for and welcome the emperor vehicle, avoid user from cancelling share-car and ask
It asks.It should be noted that the different issuable advantageous effects of embodiment are different, in different embodiments, it is possible to create
Advantageous effect can be the combination of any of the above one or more, can also be other it is any can obtainable advantageous effect.
It will be understood by those skilled in the art that embodiments herein can be provided as method, system or computer program product.
Therefore, complete hardware embodiment, complete software embodiment or embodiment combining software and hardware aspects can be used in the application
Form.It is deposited moreover, the application can be used to can be used in the computer that one or more wherein includes computer usable program code
The shape for the computer program product implemented on storage media (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.)
Formula.
Claims (30)
1. a kind of share-car information cuing method, which is characterized in that including：
Obtain the share-car request of user；
Share-car request is sent to server；
The information of server is received, shows and dynamically updates the progress information of the share-car request and found for user and spell friend's
Status information；
The progress information of the share-car request at least reflects user's estimated waiting time.
2. according to the method described in claim 1, it is characterized in that, the status information includes at least as user determination
At least one candidate identification information for spelling friend and the candidate matching degree for spelling friend；
The matching degree at least reflects the candidate direct route degree for spelling friend and the user.
3. according to the method described in claim 1, it is characterized in that, the user includes the estimated waiting of user estimated waiting time
The duration that the duration sent a car and/or the estimated waiting of user are dispatched a car.
4. according to the method described in claim 3, it is characterized in that, showing and dynamically updating the progress information of the share-car request
Further comprise：
The progress information is shown in a manner of countdown.
5. according to the method described in claim 1, it is characterized in that, further include receive and display server push welcome the emperor vehicle
Information of vehicles and its location information.
6. a kind of share-car information presentation system, which is characterized in that including：
Acquisition module, the share-car for obtaining user are asked；
Transmission module, for share-car request to be sent to server；
Receiving module, the information for receiving server；
Display module, the progress information and sought for user that the share-car for showing and dynamically updating server push is asked
Look for the status information for spelling friend；
The progress information of the share-car request at least reflects user's estimated waiting time.
7. system according to claim 6, which is characterized in that the status information includes at least as user determination
At least one candidate identification information for spelling friend and the candidate matching degree for spelling friend；
The matching degree at least reflects the candidate direct route degree for spelling friend and the user.
8. system according to claim 6, which is characterized in that the user, which includes that user is estimated estimated waiting time, to be waited for
The duration that the duration sent a car and/or the estimated waiting of user are dispatched a car.
9. system according to claim 8, which is characterized in that the display module is additionally operable to show in a manner of countdown
The progress information.
10. system according to claim 6, which is characterized in that the display module is additionally operable to display server push
Welcome the emperor the information of vehicles and its location information of vehicle.
11. a kind of share-car information presentation device, which is characterized in that including described device include at least one processor and at least
One memory；
At least one processor is for storing computer instruction；
At least one processor is used to execute at least partly instruction in the computer instruction to realize such as claim 1
Operation described in any one of~5.
12. a kind of computer readable storage medium, which is characterized in that the storage medium stores computer instruction, when the meter
The operation as described in any one of Claims 1 to 5 is realized in the instruction of calculation machine when being executed by processor.
13. a kind of share-car information cuing method, which is characterized in that including：
Obtain the share-car request of user；
At least one, which is found, for the user spells friend；
It is found by progress information that the share-car is asked and for the user and spells the status information of friend and be sent to client in real time；
The progress information of the share-car request at least reflects user's estimated waiting time.
14. according to the method for claim 13, which is characterized in that the status information includes at least to be determined for the user
At least one candidate identification information for spelling friend and the candidate matching degree for spelling friend；
The matching degree at least reflects the candidate direct route degree for spelling friend and the user.
15. according to the method for claim 13, which is characterized in that the user includes that user is estimated etc. estimated waiting time
Duration to be sent a car and/or user are expected to wait for duration of dispatching a car.
16. according to the method for claim 15, which is characterized in that described to find at least one spelling friend's packet for the user
It includes：
It is that the user finds at least one spelling friend in estimated wait in duration of dispatching a car of the user.
17. according to the method for claim 15, which is characterized in that further include：
It is user's determination after searching out at least one spelling friend for the user before reaching user and being expected to wait for duration of sending a car
Welcome the emperor vehicle；Alternatively, after reaching user and being expected to wait for duration of sending a car, is determined for the user and welcome the emperor vehicle；
The information of vehicles for welcoming the emperor vehicle and location information are sent to the client.
18. according to the method for claim 17, which is characterized in that further include：
Vehicle position information is welcomed the emperor in acquisition；
After determining that welcoming the emperor vehicle reaches the departure place in share-car request, when meeting arbitrary condition, sent out to driver terminal
Departure instructions：
User is estimated to wait for duration arrival of dispatching a car, or searches out at least one for the user and spell friend.
19. according to the method for claim 15, which is characterized in that user is estimated to wait for a length of fixed duration when dispatching a car；
Wait for duration of dispatching a car related to the departure place in share-car request alternatively, user is estimated.
20. according to the method for claim 15, which is characterized in that user is estimated to wait for a length of fixed duration when sending a car；
Wait for duration of sending a car at least related at least one of following information alternatively, user is estimated：In the share-car request
The position and the distance between the departure place in share-car request that the supply and demand ratio of departure place or user send out share-car request；
The supply and demand ratio of departure place is current in currently available number of vehicles divided by the region in a certain range region of departure place
Share-car order number.
21. a kind of share-car information presentation system, which is characterized in that including：
Acquisition module, the share-car for obtaining user are asked；
Friendly matching module is spelled, friend is spelled for finding at least one for the user；
Transmission module, the status information that progress information for asking the share-car and being found for the user spells friend are real-time
It is sent to client；
The progress information of the share-car request at least reflects user's estimated waiting time.
22. system according to claim 21, which is characterized in that the status information includes at least to be determined for the user
At least one candidate identification information for spelling friend and the candidate matching degree for spelling friend；
The matching degree at least reflects the candidate direct route degree for spelling friend and the user.
23. system according to claim 21, which is characterized in that the user includes that user is estimated etc. estimated waiting time
Duration to be sent a car and/or user are expected to wait for duration of dispatching a car.
24. system according to claim 23, which is characterized in that the friendly matching module of spelling is additionally operable to estimated etc. in the user
At least one is found for the user spell friend in duration to be dispatched a car.
25. system according to claim 23, which is characterized in that further include module of sending a car, for reach user estimated
Waiting is sent a car before duration, is that vehicle is welcomed the emperor in user's determination after searching out at least one spelling friend for the user；Alternatively, up to
After sending a car duration to the estimated waiting of user, is determined for the user and welcome the emperor vehicle；
The transmission module is additionally operable to the information of vehicles for welcoming the emperor vehicle and location information being sent to the client.
26. system according to claim 25, which is characterized in that further include control module of dispatching a car；
The acquisition module welcomes the emperor vehicle position information for obtaining；
The control module of dispatching a car is for after determining that welcoming the emperor vehicle reaches the departure place in share-car request, meeting arbitrary item
When part, departure instructions are sent out to driver terminal：
User is estimated to wait for duration arrival of dispatching a car, or searches out at least one for the user and spell friend.
27. system according to claim 23, which is characterized in that user is estimated to wait for a length of fixed duration when dispatching a car；
Wait for duration of dispatching a car related to the departure place in share-car request alternatively, user is estimated.
28. system according to claim 23, which is characterized in that user is estimated to wait for a length of fixed duration when sending a car；
Wait for duration of sending a car at least related at least one of following information alternatively, user is estimated：In the share-car request
The position and the distance between the departure place in share-car request that the supply and demand ratio of departure place or user send out share-car request；
The supply and demand ratio of departure place is current in currently available number of vehicles divided by the region in a certain range region of departure place
Share-car order number.
29. a kind of share-car information presentation device, which is characterized in that including described device include at least one processor and at least
One memory；
At least one processor is for storing computer instruction；
At least one processor is used to execute at least partly instruction in the computer instruction to realize such as claim
Operation described in any one of 13~20.
30. a kind of computer readable storage medium, which is characterized in that the storage medium stores computer instruction, when the meter
The operation as described in any one of claim 13~20 is realized in the instruction of calculation machine when being executed by processor.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810502246.7A CN108764698A (en) | 2018-05-23 | 2018-05-23 | A kind of method and system of share-car information alert |
| PCT/CN2019/088066 WO2019223745A1 (en) | 2018-05-23 | 2019-05-23 | Methods and systems for informing a user of carpooling information |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810502246.7A CN108764698A (en) | 2018-05-23 | 2018-05-23 | A kind of method and system of share-car information alert |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108764698A true CN108764698A (en) | 2018-11-06 |
Family
ID=64005108
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810502246.7A Pending CN108764698A (en) | 2018-05-23 | 2018-05-23 | A kind of method and system of share-car information alert |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN108764698A (en) |
| WO (1) | WO2019223745A1 (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109948819A (en) * | 2019-03-29 | 2019-06-28 | 徐州蓝湖信息科技有限公司 | A kind of share-car method and device based on block chain |
| WO2019223745A1 (en) * | 2018-05-23 | 2019-11-28 | Beijing Didi Infinity Technology And Development Co., Ltd. | Methods and systems for informing a user of carpooling information |
| CN111563638A (en) * | 2019-02-13 | 2020-08-21 | 北京嘀嘀无限科技发展有限公司 | Network car booking request processing method and device, server and storage medium |
| CN111739329A (en) * | 2020-05-29 | 2020-10-02 | 腾讯科技（深圳）有限公司 | Travel route generation method, travel route generation device, storage medium, and server |
| CN111861650A (en) * | 2020-07-09 | 2020-10-30 | 北京嘀嘀无限科技发展有限公司 | Information display method, first service request terminal, system and electronic equipment |
| CN111858788A (en) * | 2019-11-26 | 2020-10-30 | 北京嘀嘀无限科技发展有限公司 | Method and system for recommending taxi-sharing boarding points |
| CN111882384A (en) * | 2020-07-09 | 2020-11-03 | 北京嘀嘀无限科技发展有限公司 | Timing control method and system |
| CN112016988A (en) * | 2019-05-28 | 2020-12-01 | 丰田自动车株式会社 | Information processing apparatus, information processing method, and storage medium |
| CN112561164A (en) * | 2020-12-16 | 2021-03-26 | 北京嘀嘀无限科技发展有限公司 | Car pooling service providing method and device and electronic equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103685504A (en) * | 2013-12-11 | 2014-03-26 | 南京大学 | Car sharing system based on Android platform and working method of car sharing system based on Android platform |
| CN104268664A (en) * | 2014-10-22 | 2015-01-07 | 浙江翼信科技有限公司 | Method and device for recommending carpooling route |
| CN107491825A (en) * | 2016-06-13 | 2017-12-19 | 滴滴（中国）科技有限公司 | A kind of about car processing method and system |
| CN108009650A (en) * | 2017-03-29 | 2018-05-08 | 北京嘀嘀无限科技发展有限公司 | Net about car service request processing method, device and server |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107798403A (en) * | 2016-09-07 | 2018-03-13 | 北京嘀嘀无限科技发展有限公司 | A kind of share-car order processing method, server, terminal device and system |
| CN107871172A (en) * | 2016-09-26 | 2018-04-03 | 北京嘀嘀无限科技发展有限公司 | A kind of share-car method and device |
| CN108009651A (en) * | 2017-08-16 | 2018-05-08 | 北京嘀嘀无限科技发展有限公司 | Order processing method, apparatus, terminal device and computer-readable recording medium |
| CN108764698A (en) * | 2018-05-23 | 2018-11-06 | 北京嘀嘀无限科技发展有限公司 | A kind of method and system of share-car information alert |
-
2018
- 2018-05-23 CN CN201810502246.7A patent/CN108764698A/en active Pending
-
2019
- 2019-05-23 WO PCT/CN2019/088066 patent/WO2019223745A1/en active Application Filing
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103685504A (en) * | 2013-12-11 | 2014-03-26 | 南京大学 | Car sharing system based on Android platform and working method of car sharing system based on Android platform |
| CN104268664A (en) * | 2014-10-22 | 2015-01-07 | 浙江翼信科技有限公司 | Method and device for recommending carpooling route |
| CN107491825A (en) * | 2016-06-13 | 2017-12-19 | 滴滴（中国）科技有限公司 | A kind of about car processing method and system |
| CN108009650A (en) * | 2017-03-29 | 2018-05-08 | 北京嘀嘀无限科技发展有限公司 | Net about car service request processing method, device and server |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019223745A1 (en) * | 2018-05-23 | 2019-11-28 | Beijing Didi Infinity Technology And Development Co., Ltd. | Methods and systems for informing a user of carpooling information |
| CN111563638A (en) * | 2019-02-13 | 2020-08-21 | 北京嘀嘀无限科技发展有限公司 | Network car booking request processing method and device, server and storage medium |
| CN109948819A (en) * | 2019-03-29 | 2019-06-28 | 徐州蓝湖信息科技有限公司 | A kind of share-car method and device based on block chain |
| CN112016988A (en) * | 2019-05-28 | 2020-12-01 | 丰田自动车株式会社 | Information processing apparatus, information processing method, and storage medium |
| CN111858788A (en) * | 2019-11-26 | 2020-10-30 | 北京嘀嘀无限科技发展有限公司 | Method and system for recommending taxi-sharing boarding points |
| CN111739329A (en) * | 2020-05-29 | 2020-10-02 | 腾讯科技（深圳）有限公司 | Travel route generation method, travel route generation device, storage medium, and server |
| CN111739329B (en) * | 2020-05-29 | 2021-11-02 | 腾讯科技（深圳）有限公司 | Travel route generation method, travel route generation device, storage medium, and server |
| CN111861650A (en) * | 2020-07-09 | 2020-10-30 | 北京嘀嘀无限科技发展有限公司 | Information display method, first service request terminal, system and electronic equipment |
| CN111882384A (en) * | 2020-07-09 | 2020-11-03 | 北京嘀嘀无限科技发展有限公司 | Timing control method and system |
| WO2022007839A1 (en) * | 2020-07-09 | 2022-01-13 | 北京嘀嘀无限科技发展有限公司 | Information display method, first service request terminal, system and electronic device |
| CN112561164A (en) * | 2020-12-16 | 2021-03-26 | 北京嘀嘀无限科技发展有限公司 | Car pooling service providing method and device and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2019223745A1 (en) | 2019-11-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108764698A (en) | A kind of method and system of share-car information alert | |
| TWI761738B (en) | Systems, methods and non-transitory computer readable medium for performing location-based actions | |
| CN103531025B (en) | A kind of share-car method utilizing line sectionalizing method to carry out match information | |
| TWI735292B (en) | A method for providing a route for a journey from a source location to a target location | |
| CN108090603A (en) | The method and system of vehicle group is managed for automatic driving vehicle | |
| JP2020515951A (en) | System and method for allocating vehicles for on-demand services | |
| CN109062928A (en) | A kind of method and system that prompt recommendation is got on the bus a little | |
| CN108780554A (en) | A kind of share-car method and system | |
| CN109859459A (en) | A kind of automatic Pilot bus dispatching optimization method | |
| CN110050300A (en) | Traffic congestion monitoring system and method | |
| CN108701404A (en) | Share-car method and system | |
| CN109313845A (en) | For providing the system and method for navigation routine | |
| CN110431573A (en) | The system and method for Order splitting optimization | |
| WO2014091674A1 (en) | Transportation plan creation support apparatus and transportation plan creation support method | |
| CN107067707A (en) | A kind of bus operation and passenger's trip optimization system | |
| CN109791731A (en) | A kind of method and system for estimating arrival time | |
| CN110945557B (en) | System and method for determining estimated time of arrival | |
| EP2808832A1 (en) | Iterative public transit scoring | |
| CN109313774A (en) | A kind of method and system showing on-demand service vehicle information | |
| CN108332765B (en) | Carpooling travel route generation method and device | |
| CN108573315A (en) | A kind of prompt message determines method, system and computer readable storage medium | |
| CN109948874A (en) | Share-car order allocation method and system | |
| GB2499795A (en) | Routing in a network, based on travel and waiting time | |
| CN106682972A (en) | Cloud multi-road-point matching designated driving method, cloud multi-road-point matching designated driving system, cloud server and client | |
| CN108225359A (en) | The method and relevant device of a kind of path planning |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20181106 |