CN106709847A - Taxi information pushing method and system - Google Patents
Taxi information pushing method and system Download PDFInfo
- Publication number
- CN106709847A CN106709847A CN201611060065.0A CN201611060065A CN106709847A CN 106709847 A CN106709847 A CN 106709847A CN 201611060065 A CN201611060065 A CN 201611060065A CN 106709847 A CN106709847 A CN 106709847A
- Authority
- CN
- China
- Prior art keywords
- data
- distance
- section
- sum
- cell
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 12
- 101100517648 Saccharomyces cerevisiae (strain ATCC 204508 / S288c) NUM1 gene Proteins 0.000 claims description 6
- 101100129590 Schizosaccharomyces pombe (strain 972 / ATCC 24843) mcp5 gene Proteins 0.000 claims description 6
- 238000007619 statistical method Methods 0.000 abstract 1
- 230000002354 daily effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 239000006185 dispersion Substances 0.000 description 1
- 230000003203 everyday effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Classifications
-
- G06Q50/40—
-
- 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
Abstract
The invention provides a taxi information pushing method and system. The method comprises the steps of performing statistical analysis on short-distance travel demands, medium-distance travel demands and long-distance travel demands of a starting road segment and a terminating road segment; and in any traffic community A, further analyzing the short-distance demand, the medium-distance demand and the long-distance demand, in the community A, of the starting road segment in all data, thereby obtaining a sum A of short-distance demands of all road segments in the community, a sum A of medium-distance demands of all the road segments in the community, and a sum A of long-distance demands of all the road segments in the community, wherein the sum A of the short-distance demands of all the road segments in the community is a short-distance travel demand of the community, the sum A of the medium-distance demands of all the road segments in the community is a medium-distance travel demand of the community, the sum A of the long-distance demands of all the road segments in the community is a long-distance travel demand of the community, a total demand quantity is the sum of the short-distance travel demands, medium-distance travel demands and long-distance travel demands, and the proportions of the short-distance travel demands, the medium-distance travel demands and the long-distance travel demands in the total demand quantity are corresponding probabilities. Therefore, taxi information is pushed according to the probabilities, and reasonable and scientific scheduling is realized.
Description
Technical field
The present invention relates to public transport field, in particular to a kind of taxi information method for pushing and system.
Background technology
The quantity of urban taxi along with information-based high speed development also increasing sharply, but the row of traditional taxi
The backwardness relatively of industry management brings a variety of disadvantages：Efficiency is low, costly, poor real, scheduling dispersion, the wasting of resources, industry
Arrested Development.Although and the citizen in many cities are reacting the difficult problem called a taxi, especially in trip peak period such as early night shift
Period, citizen cry 'kill it' car hardly possible everyday, but are observed from this GPS, but the empty taxi that this time period on the way runs
Still it is not within minority, how effectively to organize, traffic control is carried out, reasonable analysis could realize more efficient dynamic management, section
Learn configuration.
The content of the invention
Present invention aim at a kind of taxi information method for pushing is provided, comprise the following steps：
Step1：Daily 00:00:00, take out all data of the previous day in circuit table of hiring a car；
Step2：It was divided into 24 periods by one day, finds the vehicle data in all p periods in data, be i.e. serial number is 0
All markings of cars are unvisit if sequence is then 1 since 1 within the p periods by the data correspondence time, are found order and are compiled
The data of number first, this time other data of going on a journey also are taken out；
Step3：The vehicle of any unvisit is taken, labeled as visit, the data of serial number first is found, corresponding road section is
A, mileage is dis_o, finds the data of the lower serial number the last item of same carrying times numbering, corresponding road section B, and mileage is
Dis_d, then A to B sections record once go on a journey, trip distance subtracts dis_o for dis_d；The step is repeated, until all vehicles
Labeled as visit；
Step4：Statistics any two goes out the trip requirements NUM that line number is the starting point section O and terminal section D between section, leads to
The distance of calculated each trip is crossed, the starting point section and terminal section short distance trip requirements NUM1 is counted, midway trip is needed
NUM2, long-distance trip requirements NUM3 are asked, in saving it in AY_RESULT_TAXI_LINK_DEMOND；
Step5：Current t, the corresponding period is p, and nearly 30 days institutes are taken from Table A Y_RESULT_TAXI_ORDER_DEMOND
Sometimes segment number is the data of p, and starting point cell ZONE_O is determined by starting point section, and terminal cell ZONE_ is determined by terminal section
D, then the trip requirements of starting point cell to terminal cell are all starting point sections in ZONE_O cells, and correspondence terminal section exists
Trip requirements sum in ZONE_D cells；Trip probability then be between ZONE_O and ZONE_D trip requirements with it is all with
ZONE_O is the ratio of the trip requirements sum of starting point cell, and data are stored in AY_RESULT_TAXI_OFFER_OD_DATA；
Step6：Current t, the corresponding period is p, is taken from AY_RESULT_TAXI_ORDER_DEMOND nearly 30 days and owned
When segment number be the data of p, to any traffic zone A, in all data, in the short distance demand of A cells, midway needs in starting point section
Ask, long-distance demand is taken out, all section short distance demand sum A are the short distance trip requirements NUM1 of the cell in the cell, should
All section midway demand sum A are the short distance trip requirements NUM2 of the cell in cell, all long-distance need in section in the cell
The short distance trip requirements NUM3 that sum A is the cell is sought, demand sum is three sum NUM, and three accounts for the ratio between demand sum and is
Corresponding probability.
As long as it should be appreciated that all combinations of aforementioned concepts and the extra design for describing in greater detail below are at this
A part for the subject matter of the disclosure is can be viewed as in the case that the design of sample is not conflicting.In addition, required guarantor
All combinations of the theme of shield are considered as a part for the subject matter of the disclosure.
Can be more fully appreciated with from the following description present invention teach that foregoing and other aspect, embodiment and spy
Levy.The feature and/or beneficial effect of other additional aspects such as illustrative embodiments of the invention will in the following description
It is obvious, or by according to present invention teach that specific embodiment practice in learn.
Specific embodiment
In order to know more about technology contents of the invention, it is described as follows especially exemplified by specific embodiment.
Embodiment of the disclosure must not be intended to include all aspects of the invention.It should be appreciated that presented hereinbefore is various
Design and embodiment, and describe in more detail below those design and implementation method can in many ways in it is any one
Plant to implement, because design disclosed in this invention and embodiment are not limited to any implementation method.In addition, the present invention is public
Some aspects opened can be used alone, or otherwise any appropriately combined be used with disclosed by the invention.
A kind of embodiments in accordance with the present invention, taxi information method for pushing, comprise the following steps：
Step1：Daily 00:00:00, take out all data of the previous day in circuit table of hiring a car；
Step2：It was divided into 24 periods by one day, finds the vehicle data in all p periods in data, be i.e. serial number is 0
All markings of cars are unvisit if sequence is then 1 since 1 within the p periods by the data correspondence time, are found order and are compiled
The data of number first, this time other data of going on a journey also are taken out；
Step3：The vehicle of any unvisit is taken, labeled as visit, the data of serial number first is found, corresponding road section is
A, mileage is dis_o, finds the data of the lower serial number the last item of same carrying times numbering, corresponding road section B, and mileage is
Dis_d, then A to B sections record once go on a journey, trip distance subtracts dis_o for dis_d；The step is repeated, until all vehicles
Labeled as visit；
Step4：Statistics any two goes out the trip requirements NUM that line number is the starting point section O and terminal section D between section, leads to
The distance of calculated each trip is crossed, the starting point section and terminal section short distance trip requirements NUM1 is counted, midway trip is needed
NUM2, long-distance trip requirements NUM3 are asked, in saving it in AY_RESULT_TAXI_LINK_DEMOND；
Step5：Current t, the corresponding period is p, and nearly 30 days institutes are taken from Table A Y_RESULT_TAXI_ORDER_DEMOND
Sometimes segment number is the data of p, and starting point cell ZONE_O is determined by starting point section, and terminal cell ZONE_ is determined by terminal section
D, then the trip requirements of starting point cell to terminal cell are all starting point sections in ZONE_O cells, and correspondence terminal section exists
Trip requirements sum in ZONE_D cells；Trip probability then be between ZONE_O and ZONE_D trip requirements with it is all with
ZONE_O is the ratio of the trip requirements sum of starting point cell, and data are stored in AY_RESULT_TAXI_OFFER_OD_DATA；
Step6：Current t, the corresponding period is p, is taken from AY_RESULT_TAXI_ORDER_DEMOND nearly 30 days and owned
When segment number be the data of p, to any traffic zone A, in all data, in the short distance demand of A cells, midway needs in starting point section
Ask, long-distance demand is taken out, all section short distance demand sum A are the short distance trip requirements NUM1 of the cell in the cell, should
All section midway demand sum A are the short distance trip requirements NUM2 of the cell in cell, all long-distance need in section in the cell
The short distance trip requirements NUM3 that sum A is the cell is sought, demand sum is three sum NUM, and three accounts for the ratio between demand sum and is
Corresponding probability, so as to push taxi information according to the probability, realizes reasonable and scientific dispatch.
The invention further relates to a kind of taxi information supplying system, including：
At least one processor；
Memory；
Wherein, the memory is arranged for the data and program module that storage is used for processor, described program module bag
Include the programmed instruction for performing preceding method.
Although the present invention is disclosed above with preferred embodiment, so it is not limited to the present invention.Skill belonging to of the invention
Has usually intellectual in art field, without departing from the spirit and scope of the present invention, when can be used for a variety of modifications and variations.Cause
This, protection scope of the present invention ought be defined depending on those as defined in claim.
Claims (2)
1. a kind of taxi information method for pushing, it is characterised in that comprise the following steps：
Step1：Daily 00:00:00, take out all data of the previous day in circuit table of hiring a car；
Step2：It was divided into 24 periods by one day, finds the vehicle data in all p periods in data, be i.e. serial number is 0
All markings of cars are unvisit if sequence is then 1 since 1 within the p periods by the data correspondence time, are found order and are compiled
The data of number first, this time other data of going on a journey also are taken out；
Step3：The vehicle of any unvisit is taken, labeled as visit, the data of serial number first is found, corresponding road section is
A, mileage is dis_o, finds the data of the lower serial number the last item of same carrying times numbering, corresponding road section B, and mileage is
Dis_d, then A to B sections record once go on a journey, trip distance subtracts dis_o for dis_d；The step is repeated, until all vehicles
Labeled as visit；
Step4：Statistics any two goes out the trip requirements NUM that line number is the starting point section O and terminal section D between section, leads to
The distance of calculated each trip is crossed, the starting point section and terminal section short distance trip requirements NUM1 is counted, midway trip is needed
NUM2, long-distance trip requirements NUM3 are asked, in saving it in AY_RESULT_TAXI_LINK_DEMOND；
Step5：Current t, the corresponding period is p, and nearly 30 days institutes are taken from Table A Y_RESULT_TAXI_ORDER_DEMOND
Sometimes segment number is the data of p, and starting point cell ZONE_O is determined by starting point section, and terminal cell ZONE_ is determined by terminal section
D, then the trip requirements of starting point cell to terminal cell are all starting point sections in ZONE_O cells, and correspondence terminal section exists
Trip requirements sum in ZONE_D cells；Trip probability then be between ZONE_O and ZONE_D trip requirements with it is all with
ZONE_O is the ratio of the trip requirements sum of starting point cell, and data are stored in AY_RESULT_TAXI_OFFER_OD_DATA；
Step6：Current t, the corresponding period is p, is taken from AY_RESULT_TAXI_ORDER_DEMOND nearly 30 days and owned
When segment number be the data of p, to any traffic zone A, in all data, in the short distance demand of A cells, midway needs in starting point section
Ask, long-distance demand is taken out, all section short distance demand sum A are the short distance trip requirements NUM1 of the cell in the cell, should
All section midway demand sum A are the short distance trip requirements NUM2 of the cell in cell, all long-distance need in section in the cell
The short distance trip requirements NUM3 that sum A is the cell is sought, demand sum is three sum NUM, and three accounts for the ratio between demand sum and is
Corresponding probability.
2. a kind of taxi information supplying system, it is characterised in that including：
At least one processor；
Memory；
Wherein, the memory is arranged for the data and program module that storage is used for processor, described program module bag
Include the programmed instruction of the method for performing preceding claims 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611060065.0A CN106709847B (en) | 2016-11-28 | 2016-11-28 | Taxi information pushing method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611060065.0A CN106709847B (en) | 2016-11-28 | 2016-11-28 | Taxi information pushing method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106709847A true CN106709847A (en) | 2017-05-24 |
| CN106709847B CN106709847B (en) | 2021-12-10 |
Family
ID=58934801
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611060065.0A Active CN106709847B (en) | 2016-11-28 | 2016-11-28 | Taxi information pushing method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106709847B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112561330A (en) * | 2020-12-16 | 2021-03-26 | 北京嘀嘀无限科技发展有限公司 | Method and device for generating scheduling instruction, electronic equipment and medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102110362A (en) * | 2011-02-01 | 2011-06-29 | 世纪战斧节能环保技术（北京）有限公司 | Method and system for processing travel route planning |
| CN103116825A (en) * | 2013-01-29 | 2013-05-22 | 江苏省邮电规划设计院有限责任公司 | Intelligent city management system |
| CN105185116A (en) * | 2015-09-15 | 2015-12-23 | 广州地理研究所 | Construction method of network-intensive type mini-passenger car travel demand thermodynamic diagram |
| CN105352522A (en) * | 2015-12-04 | 2016-02-24 | 中兴软创科技股份有限公司 | Position real-time updating-based vehicle-mounted navigation device and method |
-
2016
- 2016-11-28 CN CN201611060065.0A patent/CN106709847B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102110362A (en) * | 2011-02-01 | 2011-06-29 | 世纪战斧节能环保技术（北京）有限公司 | Method and system for processing travel route planning |
| CN103116825A (en) * | 2013-01-29 | 2013-05-22 | 江苏省邮电规划设计院有限责任公司 | Intelligent city management system |
| CN105185116A (en) * | 2015-09-15 | 2015-12-23 | 广州地理研究所 | Construction method of network-intensive type mini-passenger car travel demand thermodynamic diagram |
| CN105352522A (en) * | 2015-12-04 | 2016-02-24 | 中兴软创科技股份有限公司 | Position real-time updating-based vehicle-mounted navigation device and method |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112561330A (en) * | 2020-12-16 | 2021-03-26 | 北京嘀嘀无限科技发展有限公司 | Method and device for generating scheduling instruction, electronic equipment and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106709847B (en) | 2021-12-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103413437B (en) | Method and system for identifying road intersection steering based on vehicle data collection | |
| CN104260724B (en) | Vehicle intelligent predictive control system and method | |
| CN106600027A (en) | Urban traffic carbon emission measurement and calculation system, and measurement and calculation method | |
| CN103198645B (en) | Rush hour bus route station jumping running method based on passenger trip distribution | |
| CN110135632A (en) | PHEV adaptive optimal energy management method based on routing information | |
| CN103544834B (en) | Objective tactful selection method sought by a kind of taxi based on GPS track | |
| CN101295326B (en) | Method for generating OD matrix based on GPS data, traffic simulation method thereof | |
| CN103278833A (en) | Line recommendation system and method based on Beidou satellite/GPS (global positioning system) data | |
| CN109118770A (en) | A kind of road section capacity method for digging based on Traffic monitoring data | |
| CN105427620A (en) | Taxi operation data-based illegal-operating vehicle identification method | |
| Karbowski et al. | Vehicle energy management optimization through digital maps and connectivity | |
| CN106157621A (en) | A kind of Intelligent Road based on data analysis management system | |
| CN106709847A (en) | Taxi information pushing method and system | |
| CN109145401B (en) | Method, system and terminal equipment for calculating emission list of motor vehicle | |
| DE102012210454A1 (en) | Method for providing data for electronic horizon for e.g. navigation apparatus of motor car, involves merging parameters from group of vehicles to data packet for electronic horizon when group of vehicles, comprises two other vehicles | |
| Rietveld | Policy responses in the Netherlands | |
| Aboushaqrah et al. | Life cycle sustainability assessment of sport utility vehicles: The case for Qatar | |
| CN110164133A (en) | Festivals or holidays freeway network traffic efficiency appraisal procedure, electronic equipment, medium | |
| Pandyaswargo et al. | Global distribution and readiness status of artificial intelligence application on mobility projects | |
| Macheret et al. | Intelligent transport systems: analysis of the current state and prospects of development | |
| Wang et al. | Cellular automation model for analyzing capacity of branch road section | |
| Norbakyah et al. | myBas driving cycle for Kuala Terengganu city. | |
| Gritsenko et al. | Prospects and opportunities for using foreign experience for the development of intellectual transportation systems in Ukraine | |
| Zhou et al. | New Application of Improved Dynamic Programming Algorithm in Traffic Engineering System | |
| CN110211386A (en) | A kind of highway vehicle type classification method based on non-parametric test |
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 | ||
| CB02 | Change of applicant information |
Address after: 210012 room 627, Ning Shuang Road, Yuhuatai District, Nanjing, Jiangsu, 627 Applicant after: Ho whale cloud computing Polytron Technologies Inc Address before: 210012 No. 68 Bauhinia Road, Yuhuatai District, Jiangsu, Nanjing Applicant before: ZTEsoft Technology Co., Ltd. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |