CN105551236B - Vehicle dispatching method and vehicle dispatch system - Google Patents
Vehicle dispatching method and vehicle dispatch system Download PDFInfo
- Publication number
- CN105551236B CN105551236B CN201610037654.0A CN201610037654A CN105551236B CN 105551236 B CN105551236 B CN 105551236B CN 201610037654 A CN201610037654 A CN 201610037654A CN 105551236 B CN105551236 B CN 105551236B
- Authority
- CN
- China
- Prior art keywords
- place
- destination
- chauffeur
- vehicle
- departure place
- 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.)
- Active
Links
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/20—Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles
- G08G1/202—Dispatching vehicles on the basis of a location, e.g. taxi dispatching
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Traffic Control Systems (AREA)
Abstract
A kind of vehicle dispatching method provided by the invention, including：The chauffeur request of user is received, the chauffeur request bag includes departure place and destination；The chauffeur that the departure place to the destination are sent to vehicle in use is asked；Asked for the chauffeur that there is no response more than the scheduled time, user's stroke based on the destination and departure place is decomposed into multistage riding route；Multiple chauffeurs are sent according to the multistage riding route to the vehicle in use to ask；And the response of the chauffeur request is received, and the response is sent to the user.By the way that the intelligence of user's stroke is decomposed, to realize that user's strokes are completed in the collaboration of multiple vehicles in use, it can solve the problems, such as that a part of user calls a taxi difficulty.
Description
Technical field
The present invention relates to intelligent transportation field, and in particular, to a kind of vehicle dispatching method and vehicle dispatch system.
Background technology
Internet vehicle call platform utilizes mobile Internet feature, by line with being blended under line, from initial rank of calling a taxi
Section changes the mode of the visitor such as traditional driver, driver is got user's in time to getting off using fare is paid on line
Call a taxi demand, and according to wish order, save driver and link up cost with user, optimize the experience of calling a taxi of user, reduction rate of empty ride,
Farthest saving department multiplies both sides' resource and time.
But when user carries out calling service in certain areas, due to rare for the vehicle called a taxi, it can only often pass through
Platform is subsidized, the mode of user's price markup can just call driver.Since user, platform consider respective cost, it is unwilling
At will raised the price or subsidized, driver result in user and call a taxi difficulty due to consideration that the factor such as backhaul is also unwilling to make a price reduction.
Publication No. CN103531025A discloses a kind of system that share-car is realized using route segments method, for car owner
Possibility travel route, the share-car of its travel route peripheral extent request is sent to the car owner, to facilitate share-car.The invention energy
A part of user is enough solved to call a taxi difficult problem.But due to being asked dependent on the share-car with same road segment, and the time also must
It must match, therefore, the problem of calling a taxi of some users from far-off regions still can not solve with this solution completely.
The content of the invention
In view of this, the present invention provides a kind of vehicle dispatching method and vehicle dispatch system, to solve the above problems.
According to the first aspect of the invention, there is provided a kind of vehicle dispatching method, including：Receive the chauffeur request of user, institute
State chauffeur request bag and include departure place and destination；The chauffeur that the departure place to the destination are sent to vehicle in use is asked；
Ask, will be decomposed based on user's stroke of the destination and departure place for the chauffeur that there is no response more than the scheduled time
For multistage riding route；Multiple chauffeurs are sent according to the multistage riding route to the vehicle in use to ask；And receive institute
The response of chauffeur request is stated, and the response is sent to the user.
Preferably, it is described user's stroke is decomposed into multistage riding route to include：Calculate the departure place and destination it
Between the first place；And by riding route between the departure place and destination be decomposed into the departure place to the first place with
And first place to destination two sections of riding routes.
Preferably, first place calculated between the departure place and destination includes：Obtained according to historical data
The place of arrival most as the successful chauffeur of origin using the departure place between the departure place and destination are used as
Two places；According to historical data obtain between the departure place and destination using the destination as place of arrival success
The most origin of car is as the 3rd place；And using the central point in second place and the 3rd place as described first
Place.
Preferably, first place calculated between the departure place and destination includes：Obtain the ground of vehicle in use
Manage information；And using the most intensive central point of the vehicle in use as first place.
Preferably, the multiple chauffeurs requests of the transmission include：After previous chauffeur request is done, the latter chauffeur is sent
Request.
Preferably, the multiple chauffeurs requests of the transmission include：According to the ground for completing the vehicle in use that previous chauffeur is asked
Information is managed, sends the latter chauffeur request.
Preferably, the chauffeur request of transmission respectively includes：The departure place is calculated to the optimal road in first place
The running time of line；And send chauffeur request of the departure place to first place and the institute after the running time
The chauffeur for stating the first place to the destination is asked.
Preferably, using the geography information of the user, the departure place of the user is obtained.
According to the second aspect of the invention, there is provided a kind of vehicle dispatch system, including：Receiving module, for receiving user
Chauffeur request, the chauffeur request bag includes departure place and destination；First sending module, the chauffeur for receiving user please
Ask, the chauffeur request bag includes departure place and destination；Decomposing module, for there is no response for more than the scheduled time
Chauffeur is asked, and user's stroke based on the destination and departure place is decomposed into multistage riding route；Second sending module, is used
Asked in sending multiple chauffeurs to the vehicle in use according to the multistage riding route；And the 3rd sending module, for connecing
The response of the chauffeur request is received, and the response is sent to the user.
Preferably, the decomposing module includes：First computing unit, for calculating between the departure place and destination
First place；First component units, for riding route between the departure place and destination to be decomposed into the departure place extremely
First place and two sections of riding routes of first place to the destination.
Preferably, the first computing unit includes：According to historical data obtain between the departure place and destination with institute
The most place of arrival of successful chauffeur that departure place is origin is stated as the second place；Go out according to obtaining historical data
The origins most as the successful chauffeur of place of arrival using the destination between hair ground and destination are used as the 3rd place；
And using the central point in second place and the 3rd place as first place.
Preferably, the first computing unit includes：Obtain the geography information of current vehicle in use；And by the vehicle in use
Most intensive central point is as first place.
Preferably, the geography information for the vehicle in use that the second sending module is asked according to the previous chauffeur of completion, after transmission
One chauffeur request.
Preferably, second sending module calculate the departure place to first place optimal route when driving
Between；And send chauffeur request of the departure place to first place and first place after the running time
Chauffeur to the destination is asked.
A kind of vehicle dispatching method provided by the invention, including：The chauffeur request of user is received, the chauffeur request includes
Departure place and destination；The chauffeur that the departure place to the destination are sent to vehicle in use is asked；For more than pre- timing
Between there is no the chauffeur request of response, user's stroke based on the destination and departure place is decomposed into multistage and is ridden road
Line；Multiple chauffeurs are sent according to the multistage riding route to the vehicle in use to ask；And receive the chauffeur request
Response, and the response is sent to the user.By the way that the intelligence of user's stroke is decomposed, to realize that multiple vehicles in use are assisted
With user's stroke is completed, it can solve the problems, such as that a part of user calls a taxi difficulty.
Brief description of the drawings
By referring to description of the following drawings to the embodiment of the present invention, above-mentioned and other purpose of the invention, feature and
Advantage will be apparent from, in the accompanying drawings：
Fig. 1 is the flow chart of vehicle dispatching method according to embodiments of the present invention；
Fig. 2 a and 2b are the flow charts of vehicle dispatching method according to another embodiment of the present invention；
Fig. 3 is the structure chart of vehicle dispatch system according to embodiments of the present invention.
Embodiment
Below based on embodiment, present invention is described, but the present invention is not restricted to these embodiments.Under
It is detailed to describe some specific detail sections in the literary detailed description to the present invention.Do not have for a person skilled in the art
The description of these detail sections can also understand the present invention completely.In order to avoid obscuring the essence of the present invention, known method, mistake
Journey, flow do not describe in detail.In addition attached drawing is not necessarily drawn to scale.
Flow chart, block diagram in attached drawing illustrate the possible system frame of the system of the embodiment of the present invention, method, apparatus
Frame, function and operation, the square frame on flow chart and block diagram can represent a module, program segment or only one section of code, institute
It is all the executable instruction for realizing regulation logic function to state module, program segment and code.It should also be noted that described realize rule
Determining the executable instruction of logic function can reconfigure, so as to generate new module and program segment.Therefore attached drawing square frame with
And square frame order is used only to the process and step of preferably diagram embodiment, without should be in this, as the limit to invention itself
System.
Fig. 1 is the flow chart of vehicle dispatching method according to embodiments of the present invention.Vehicle dispatching method described in Fig. 1 includes
Step 101- steps 106.
In a step 101, the chauffeur request of user is received.In this step, user is received to send by mobile terminal
Chauffeur is asked.The request of calling a taxi includes departure place, destination and request time.
In a step 102, the chauffeur for sending departure place to destination is asked.System sends departure place to mesh to vehicle in use
Ground chauffeur request, and wait to be answered.
In step 103, judge whether not receive response more than the scheduled time.In this step, if in setting
The interior response for whether being connected to any one vehicle in use, then perform step 104.
At step 104, user's stroke is decomposed into multistage riding route.According to departure place and the geographical position of destination
Put, user's stroke of departure place to destination is divided into some sections of strokes.A variety of decomposition methods can be taken.For example, to set out
Ground to the landmark in the region of destination as transfer place, by user's stroke be divided into departure place to transfer place and
Transfer place is to two sections of destination stroke.Or the subway position in user's stroke carries out distance decomposition, asked in follow-up chauffeur
During failure, subway can be taken and arrived at.
It should be understood by those skilled in the art that the segmentation in this step is not by departure place and mesh only only in accordance with geography information
The route on ground be briefly divided into two sections or several sections, but need to consider the facility of driver and passenger, to facilitate transaction as far as possible
Mode decompose route.
In step 105, multiple chauffeurs are sent respectively according to multistage riding route to ask.Ridden road according to above-mentioned multistage
Line, peritropous vehicle in use send the corresponding chauffeur request of every section of riding route.The chauffeur request can be synchronous transmission
Or asynchronous transmission.If chauffeur request is sent at the same time, then need to estimate the deadline of previous chauffeur request, with
Between this is determined at the beginning of the latter chauffeur request.If asynchronous transmission chauffeur is asked, can be asked in previous chauffeur
When, next chauffeur request is just sent, the geographical location of a vehicle in use can also be monitored in real time, according to geographical position
Put and determine when to send next chauffeur request.
In step 106, the response of chauffeur request is received, and response is sent to user.In this step, operation is received
The response that vehicle asks above-mentioned chauffeur, and response is sent to user.
Fig. 1 the embodiment described, by the way that route of user is divided into some sections of riding routes, realizes multiple vehicle in use collaborations
A request of calling a taxi is completed, solves the problems, such as that user calls a taxi difficulty in remote point with this.
Fig. 2 a and 2b are the flow charts of vehicle dispatching method according to another embodiment of the present invention, including step 201- steps
211。
In step 201, the chauffeur request of user is received.Departure place and destination are included in the chauffeur request bag.
In this step, Client-initiated chauffeur request is received.In a preferred embodiment, by installed in user
The App (application program) of mobile phone terminal, gets user's GPS geodatas, so as to obtain the departure place A of user.
In step 202, the chauffeur request of A to B is sent.Chauffeur request is sent to periphery vehicle in use, and is waited to be answered.
In step 203, judge whether not receive response more than the scheduled time.If do not received in preset time
To response, then step 204 is performed.
In step 204, it is the popular pick-up point C in AB regions according to historical data calculated diameter.
Specifically, by user departure place A and destination B lines, circle Q is drawn using AB as diameter, by the center of circle of AB lines midpoint,
According to history success order and current riding time, get and called a taxi in circle Q using place A as starting point, successfully record
Most destination A1.By getting in circle Q using place B as destination, successfully call a taxi and record most departure place B1.Will
Point A1 and B1 lines, the destination and departure place for being respectively two sections of riding routes of user with A1B1 lines midpoint C, i.e. user first from
Departure place A is to purpose C, then from departure place C to destination B.
In step 205, the running time T of the optimal route and optimal route between AC is calculated.According to geography information
The optimal route of AC and CB are calculated, the time T of AC travelings is estimated by historical data.
In step 206, the chauffeur request of the CB after AC and current time T is sent.Peritropous vehicle in use is sent
The request, i.e. stroke after the stroke in current time from A to C, and time T from C to B by bus of two.
In step 207, judge whether not receive response more than the scheduled time.If do not received in preset time
To response, then step 208 is performed, otherwise perform step 211.
In a step 208, according to the most pick-up point C1 of the vehicle in the range of vehicle geographic information analysis AB.
Specifically, by user departure place A and destination B lines, circle Q is drawn using AB as diameter, by the center of circle of AB lines midpoint,
According to the App in driver mobile phone, the region that middle vehicle in use is most in round Q is got, the central point in the region is made
For place C1.
In step 209, optimal travel route and the running time T1 of AC1 is calculated.According to geography information calculate AC and
The optimal route of CB, the time T1 of AC travelings is estimated according to historical data.
In step 210, the chauffeur request of the C1B after AC1 and current time T1 is sent.Peritropous driver sends respectively
The request, i.e. stroke after the stroke in current time from A to C1, and time T1 from C1 to B by bus of two.
In step 211, the response of chauffeur request is received, and response is sent to user.
Fig. 2 the embodiment described, there is provided two kinds of modes for obtaining transfer place：First way is successfully ordered according to history
It is single to calculate transfer place；The second way obtains transfer place by the geography information of current vehicle in use, and in the first side
After formula failure, continue to decompose route of user by the second way, various ways solve the problems, such as that user calls a taxi difficulty.
In another preferred embodiment, ask for the chauffeur that there is no response more than the scheduled time, repeatedly hold
Row decomposes route of user, sends multiple chauffeur requests and receives the response of chauffeur request, and response is sent to the user
The step of.
It will be understood to those skilled in the art that the route of user of departure place to destination is divided into multistage riding route bag
Include but be not limited to above-mentioned example illustrative embodiments, other modes, for example, according to market on the way or the ground of landmark
Position Design riding route is managed, also should be within the scope of protection of the invention.
Corresponding with above-mentioned vehicle dispatching method, the present invention provides a kind of vehicle dispatch system, as shown in Figure 3.Vehicle scheduling
System 30 includes receiving module 301, the first sending module 302, decomposing module 303, the second sending module 304 and the 3rd and sends mould
Block 305.
Receiving module 301 is used for the chauffeur request for receiving user, and the chauffeur request bag includes departure place and destination.
The chauffeur that first sending module 302 is used to send departure place to destination is asked.
Decomposing module 303 be used for be directed to exceed the scheduled time there is no response chauffeur request, will be based on destination and
User's stroke of departure place is decomposed into multistage riding route.
Second sending module 304 is used to send multiple chauffeurs requests respectively according to multistage riding route.
3rd sending module 305 is used for the response for receiving chauffeur request, and response is sent to the user.
In a preferred embodiment, decomposing module 303 includes：First computing unit, for calculating the departure place
The first place between destination；First component units, for riding route between the departure place and destination to be decomposed
For two sections of riding routes of the departure place to first place and first place to the destination.
In a preferred embodiment, the first computing unit includes：The departure place and mesh are obtained according to historical data
Ground between the place of arrival most as the successful chauffeur of origin using the departure place be used as the second place；According to history
Data obtain the starting points most as the successful chauffeur of place of arrival using the destination between the departure place and destination
Point is used as the 3rd place；And using the central point in second place and the 3rd place as first place.
In a preferred embodiment, the first computing unit includes：Obtain the geography information of current vehicle in use；And
Using the most intensive central point of the vehicle in use as first place.
In a preferred embodiment, the second sending module sends the latter after previous chauffeur request is done
Chauffeur is asked.
In a preferred embodiment, the second sending module is according to the ground for completing the vehicle in use that previous chauffeur is asked
Information is managed, sends the latter chauffeur request.
In a preferred embodiment, second sending module calculates the departure place to first place most
Major path and running time；And send the departure place to first place chauffeur request and the running time it
The chauffeur of first place afterwards to the destination is asked.
It will be understood by those skilled in the art that the modules or unit of the system according to the present invention can by hardware,
Firmware or software are realized.The coded program that software various programming languages such as including using JAVA, C/C++/C#, SQL are formed.
Although the step of providing the embodiment of the present invention in method and method legend and the order of step, the step is realized
The executable instruction of defined logic function can reconfigure, so as to generate new step.The order of the step should not yet
This is limited only to the step order in the method and method legend, can need to be adjusted at any time according to function.
Such as some steps therein are performed parallel or according to reverse order.
System and a method according to the invention can be deployed on single or multiple servers.For example, can will be different
Module is disposed on a different server respectively, forms private server.Alternatively, can the distributed deployment on multiple servers
Identical functional unit, module or system, to mitigate load pressure.The server includes but not limited in same LAN
And pass through multiple PC machine of Internet connections, PC server, rolling reamer machine, supercomputer etc..
The foregoing is merely the preferred embodiment of the present invention, is not intended to limit the invention, for those skilled in the art
For, the present invention can have various modifications and changes.All any modifications made within spirit and principles of the present invention, be equal
Replace, improve etc., it should all be included in the protection scope of the present invention.
Claims (10)
1. a kind of vehicle dispatching method, including：
The chauffeur request of user is received, the chauffeur request bag includes departure place and destination；
The chauffeur that the departure place to the destination are sent to vehicle in use is asked；
Asked for the chauffeur that there is no response more than the scheduled time, by user's stroke based on the destination and departure place
It is decomposed into multistage riding route；
Multiple chauffeurs are sent according to the multistage riding route to the vehicle in use to ask；And
The response of the chauffeur request is received, and the response is sent to the user.
2. vehicle dispatching method according to claim 1, wherein, it is described that user's stroke is decomposed into multistage riding route bag
Include：
Calculate the first place between the departure place and destination；And
Riding route between the departure place and destination is decomposed into the departure place to the first place and the first place extremely
Two sections of riding routes of destination.
3. vehicle dispatching method according to claim 2, wherein, it is described calculate between the departure place and destination the
One place includes：
The successful chauffeur using the departure place as origin between the departure place and destination is obtained according to historical data
Most place of arrival is as the second place；
The successful chauffeur using the destination as place of arrival between the departure place and destination is obtained according to historical data
Most origins is as the 3rd place；And
Using the central point in second place and the 3rd place as first place.
4. vehicle dispatching method according to claim 2, wherein, it is described calculate between the departure place and destination the
One place includes：
Obtain the geography information of vehicle in use；And
Using the most intensive central point of the vehicle in use as first place.
5. vehicle dispatching method according to claim 1, wherein, the multiple chauffeurs requests of transmission include：
After previous chauffeur request is done, the latter chauffeur request is sent.
6. vehicle dispatching method according to claim 1, wherein, the multiple chauffeurs requests of transmission include：
According to the geography information for completing the vehicle in use that previous chauffeur is asked, the latter chauffeur request is sent.
7. according to claim 2 to 4 any one of them vehicle dispatching method, wherein, it is described according to the multistage riding route
Sending multiple chauffeur requests to the vehicle in use includes：
The departure place is calculated to the running time of the optimal route in first place；And
Send the departure place to first place chauffeur request and the running time after first place to
The chauffeur request of the destination.
8. a kind of vehicle dispatch system, including：
Receiving module, the chauffeur for receiving user are asked, and the chauffeur request bag includes departure place and destination；
First sending module, the chauffeur for receiving user are asked, and the chauffeur request bag includes departure place and destination；
Decomposing module, for being asked for the chauffeur that there is no response more than the scheduled time, will be based on the destination and go out
User's stroke on hair ground is decomposed into multistage riding route；
Second sending module, is asked for sending multiple chauffeurs to vehicle in use according to the multistage riding route；And
3rd sending module, for receiving the response of the chauffeur request, and is sent to the user by the response.
9. vehicle dispatch system according to claim 8, wherein, the decomposing module includes：
First computing unit, for calculating the first place between the departure place and destination；
First component units, for riding route between the departure place and destination to be decomposed into the departure place to described
One place and two sections of riding routes of first place to the destination.
10. vehicle dispatch system according to claim 9, wherein, the first computing unit includes：Obtained according to historical data
The place of arrival most as the successful chauffeur of origin using the departure place between the departure place and destination are used as
Two places；According to historical data obtain between the departure place and destination using the destination as place of arrival success
The most origin of car is as the 3rd place；And using the central point in second place and the 3rd place as described first
Place.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610037654.0A CN105551236B (en) | 2016-01-20 | 2016-01-20 | Vehicle dispatching method and vehicle dispatch system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610037654.0A CN105551236B (en) | 2016-01-20 | 2016-01-20 | Vehicle dispatching method and vehicle dispatch system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105551236A CN105551236A (en) | 2016-05-04 |
| CN105551236B true CN105551236B (en) | 2018-05-11 |
Family
ID=55830406
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610037654.0A Active CN105551236B (en) | 2016-01-20 | 2016-01-20 | Vehicle dispatching method and vehicle dispatch system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105551236B (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108023919A (en) * | 2016-10-28 | 2018-05-11 | 北京嘀嘀无限科技发展有限公司 | A kind of boarding position recommends method and device, server |
| CN107063285A (en) * | 2017-04-25 | 2017-08-18 | 杭州纳戒科技有限公司 | With city trip service implementing method, device and system |
| CN106971248A (en) * | 2017-04-25 | 2017-07-21 | 杭州纳戒科技有限公司 | It is segmented share-car method, apparatus and system |
| US10380711B2 (en) * | 2017-06-01 | 2019-08-13 | GM Global Technology Operations LLC | System and method for rideshare vehicle chaining |
| WO2019061129A1 (en) * | 2017-09-28 | 2019-04-04 | Beijing Didi Infinity Technology And Development Co., Ltd. | Systems and methods for evaluating scheduling strategy associated with designated driving services |
| CN110968796B (en) * | 2018-09-29 | 2023-03-21 | 北京嘀嘀无限科技发展有限公司 | Information pushing method and device and electronic equipment |
| CN110516830B (en) * | 2019-08-23 | 2023-06-20 | 青岛海尔科技有限公司 | Control method of intelligent home operating system and intelligent home operating system |
| CN112308990A (en) * | 2020-10-30 | 2021-02-02 | 熊斌 | Car pooling transfer service segmentation settlement platform and method |
| CN113744552B (en) * | 2021-09-17 | 2022-12-30 | 中科美络科技股份有限公司 | Bus scheduling method and device based on vehicle cloud interaction |
| CN114049701B (en) * | 2021-10-09 | 2023-11-14 | 广汽本田汽车有限公司 | Automobile driving method, device and storage medium |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103971507B (en) * | 2013-01-30 | 2017-06-13 | 国民技术股份有限公司 | A kind of car service method, car service platform and system |
| CN103218769A (en) * | 2013-03-19 | 2013-07-24 | 王兴健 | Taxi order allocation method |
| CN103531025B (en) * | 2013-11-08 | 2015-11-18 | 宁波市康惠网络科技有限公司 | A kind of share-car method utilizing line sectionalizing method to carry out match information |
| WO2015072984A1 (en) * | 2013-11-13 | 2015-05-21 | Empire Technology Development Llc | Dispatch of automated external defibrillators |
| JP6295088B2 (en) * | 2014-01-21 | 2018-03-14 | シャープ株式会社 | Dispatch system |
| CN104616490A (en) * | 2015-02-17 | 2015-05-13 | 北京九五智驾信息技术股份有限公司 | Car sharing method |
-
2016
- 2016-01-20 CN CN201610037654.0A patent/CN105551236B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN105551236A (en) | 2016-05-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105551236B (en) | Vehicle dispatching method and vehicle dispatch system | |
| CN110189006B (en) | Scheduling method and device for vehicle, computer equipment and storage medium thereof | |
| CN107919013B (en) | Get-on point processing method and server | |
| CN101383089B (en) | Vehicle matching scheduling system and method | |
| CN103531025B (en) | A kind of share-car method utilizing line sectionalizing method to carry out match information | |
| CN1295663C (en) | Method and control means for route planning in mass transport system | |
| CN109673162A (en) | For providing the method and apparatus of transportation service information | |
| CN105279955B (en) | A kind of share-car method and apparatus | |
| JP2004362271A (en) | Ride sharing riding system, riding information processor and ride sharing riding method | |
| CN106470236B (en) | Methods, devices and systems of calling a taxi based on mobile terminal | |
| CN111461485A (en) | Task allocation method, device, equipment and computer readable storage medium | |
| CN105431882A (en) | Context-aware distributive taxi cab dispatching | |
| CN102426780A (en) | Paging system used for summoning taxis and paging method thereof | |
| CN107248273B (en) | Response method for wheelchair-sitting passenger | |
| CN106097702A (en) | Intelligent traffic dispatching method and system | |
| CN103198652B (en) | Taxi operation business management system and method based on mobile internet | |
| CN103164751A (en) | Indefinite station non-fixed-line public traffic operation system and operation method | |
| CN207037909U (en) | It is a kind of that the autonomous commuting regular bus intelligent management system for preengaging function of registering is had based on network | |
| CN111144684A (en) | Vehicle scheduling system, server and information processing method | |
| CN103281676A (en) | Instant messaging system and method for taxi | |
| CN103310629A (en) | Taxi calling system based on cloud computing mobile phone intelligent traffic | |
| CN113393137B (en) | Scheduling sharing system based on Internet of vehicles | |
| CN110472912A (en) | A kind of net about vehicle provides express delivery with the method and system of city delivery service | |
| JP2019082863A (en) | Vehicle share assisting system | |
| CN106250995A (en) | A kind of electric motor coach operation system based on global optimization and method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |