CN105608508A - Vehicle optimum route query method and system - Google Patents

Vehicle optimum route query method and system Download PDF

Info

Publication number
CN105608508A
CN105608508A CN201510996271.1A CN201510996271A CN105608508A CN 105608508 A CN105608508 A CN 105608508A CN 201510996271 A CN201510996271 A CN 201510996271A CN 105608508 A CN105608508 A CN 105608508A
Authority
CN
China
Prior art keywords
traffic
time
traffic flow
user
total
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
Application number
CN201510996271.1A
Other languages
Chinese (zh)
Inventor
赵雷
罗宜元
王真意
游燕桂
李优
黄峥
蔡红霞
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shanghai Dianji University
Original Assignee
Shanghai Dianji University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Shanghai Dianji University filed Critical Shanghai Dianji University
Priority to CN201510996271.1A priority Critical patent/CN105608508A/en
Publication of CN105608508A publication Critical patent/CN105608508A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047Optimisation of routes or paths, e.g. travelling salesman problem

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Game Theory and Decision Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Navigation (AREA)

Abstract

The present invention discloses a vehicle optimum route query method and system. The method comprises a step of creating a traffic flow database, a step of using a Baidu map to receive a starting point and an end point inputted by a user and obtaining all recommended candidate paths from the starting point and the end point, a step of receiving the query request time inputted by the user, a step of searching the traffic flow database according to the query request time inputted by the user, and calculating the total time needed in passing the above candidate paths and total average traffic flow in the query time according to an obtained query result, a step of outputting an optimal path according to the obtained total time and total average traffic flow. According to the method and system, the shortcoming that only recommended paths and approximate times can be provided in the Baidu map is solved, an accurate optimal route and traffic time are provided for clients, and the clients are allowed to make better travel plans.

Description

A kind of traffic optimal route querying method and system
Technical field
The present invention relates to electronic chart forecasting traffic flow and layout of roads technical field, particularly relate to a kind of baseIn traffic optimal route querying method and the system of traffic flow data storehouse and Baidu's map.
Background technology
The important function that current electronic chart software, especially Baidu's map etc. all provide is trafficCircuit query function. Be that user inputs starting point and ending point and selects the corresponding vehicles on map,Just can find recommended line, distance and estimated time etc. between 2. Because China is a populous nation,Therefore the path planning function that Baidu's map provides can greatly be convenient for people to plan of travel, be lifted out line efficiency.
But the softwares such as Baidu's map, in the time carrying out traffic route calculating, are not considered current traffic flowOn the impact of trip, provide the normally fixing time proximity of time from origin-to-destination. For example,Search for any time from Fudan University to People's Square, call a taxi time used and path, it is several that result is always fixedBar circuit, the time is also 23 minutes that fix. In fact, call a taxi by these roads one day different time sectionsThe road time used is all different, especially, in " peak " time period and " low ebb " time period, passes throughThese roads lead time used may differ half an hour even more than 1 hour. Therefore, hundredTime of providing of degree can only be as a reference, instead of a precise time value.
Summary of the invention
The deficiency existing for overcoming above-mentioned prior art, the present invention's object is to provide a kind of traffic optimum lineRoad querying method and system, it has solved only can provide recommended line and time proximity in existing Baidu mapShortcoming, provides more accurate optimal route and traffic time to client, thereby allows them make better tripPlan.
For reaching above-mentioned and other object, the present invention proposes a kind of traffic optimal route querying method, comprises as followsStep:
Step 1, creates traffic flow data storehouse;
Step 2, utilize Baidu map to receive the Origin And Destination of user's input, and obtain origin-to-destinationAll recommended candidate path;
Step 3, receives the inquiry request time that user inputs;
Step 4, the inquiry request time proposing according to user, search traffic flow data storehouse, and according to acquisitionQuery Result calculate query time through above-mentioned path candidate required by total time and total average trafficStream;
Step 5, according to the total time obtaining and total average traffic flow output optimal path.
Further, in step 5, export the path of total time and total traffic flow minimum as optimal path,And accurate traffic time and telecommunication flow information are offered to user.
Further, this traffic flow data storehouse is by every road on statistics each hour every day Baidu's mapThe magnitude of traffic flow and setting up by this road period used in this corresponding 1 hours.
Further, this traffic flow data storehouse by 1 year 365 days according to heavy traffic degree be divided into working day,Day off and festivals or holidays, three classification classifications, divided 24 hours every days on a time period according to heavy traffic degreeFor different classes of.
Further, in step 3, if do not receive user's input, give tacit consent to current time for looking intoAsk request time.
For achieving the above object, the present invention also provides a kind of traffic optimal route inquiry system, comprising:
Traffic flow data storehouse creation module, for creating traffic flow data storehouse;
Path candidate acquisition module, utilizes Baidu's map to receive the Origin And Destination of user's input, and has obtainedPoint is to all recommended candidate path of terminal;
Query time receiver module, for receiving the inquiry request time of user's input;
Computing module, the inquiry request time proposing according to user, search traffic flow data storehouse, and according to obtainingThe Query Result obtaining calculates at query time required by total time and total average friendship through above-mentioned path candidateThrough-flow;
Output module, according to the total time obtaining and total average traffic flow output optimal path.
Further, this output module is exported the path of total time and total traffic flow minimum as optimal path,And accurate traffic time and telecommunication flow information are offered to user.
Further, this traffic flow data storehouse is by every road on statistics each hour every day Baidu's mapThe magnitude of traffic flow and setting up by this road period used in this corresponding 1 hours.
Further, this traffic flow data storehouse by 1 year 365 days according to heavy traffic degree be divided into working day,Day off and festivals or holidays, three classification classifications, divided 24 hours every days on a time period according to heavy traffic degreeFor different classes of.
Further, if this query time receiver module does not receive user's input, give tacit consent to when currentBetween be the inquiry request time.
Compared with prior art, a kind of traffic optimal route querying method of the present invention and system have overcome existing hundredIn degree map, routine calculation only can provide the shortcoming of fixing transit time, adopts given circuit at same date notPut into traffic flow data storehouse with the statistics magnitude of traffic flow and the time used of time period, then based on Baidu groundIn the layout of roads of figure, determine under preset time by certain circuit institute by inquiry traffic flow data storehouseWith traffic time and the magnitude of traffic flow, thereby offer more precise time information and traffic flow information of client.
Brief description of the drawings
Fig. 1 is the flow chart of steps of a kind of traffic optimal route of the present invention querying method;
Fig. 2 is the system architecture diagram of a kind of traffic optimal route of the present invention inquiry system.
Detailed description of the invention
Below by specific instantiation accompanying drawings embodiments of the present invention, art technologyPersonnel can understand other advantage of the present invention and effect easily by content disclosed in the present specification. The present inventionAlso can be implemented or be applied by other different instantiation, the every details in this description also can baseIn different viewpoints and application, under spirit of the present invention, carry out various modifications and change not deviating from.
Fig. 1 is the flow chart of steps of a kind of traffic optimal route of the present invention querying method. As shown in Figure 1, originallyInvent a kind of traffic optimal route querying method, comprise the steps:
Step 101, creates traffic flow data storehouse.
The magnitude of traffic flow of every road on Baidu's map every day 24 hours each hour has been recorded in traffic flow data storehouseWith in this corresponding 1 hours by this road period used. For the capacity of reduction database, IIn storehouse, do not record the magnitude of traffic flow of each hour every day, but by 1 year 365 days according to heavy trafficDegree is divided into different classifications, as is divided into 3 classes: Monday~Friday, Saturday and Sunday and festivals or holidays are as 10.1,5.1, the Spring Festival etc. 24 hours one time was also divided into different classes of according to heavy traffic degree, as is divided into:0 o'clock to 6 o'clock, 7 to 10 points, 10 o'clock to 12 o'clock, 12 o'clock to 14 o'clock, 14 o'clock to 16 o'clock, 16 were extremely19 points, several classifications such as 19 o'clock to 24 o'clock. Therefore a similar traffic flow data table is as shown in table 1.Wherein, average traffic flow and can obtaining by statistics traffic flow historical data calculating mean value by the time,Or take artificial spot sampling to estimate to calculate. For example, establish Yangpu District, Shanghai and have 300 roads, poplarsIn traffic flow data table corresponding to Pu district, recording number is 300*3*7=6300 bar record. A similar Shanghai CityYangpu District traffic flow scale is in table 1.
Table 1. Yangpu District traffic flow scale
Step 102, utilize Baidu map to receive the Origin And Destination of user's input, and obtain origin-to-destinationAll recommended candidate path.
Step 103, receives the inquiry request time that user inputs, the query time that user wishes. Preferably,If do not receive user's input, giving tacit consent to current time is the inquiry request time.
Step 104, the inquiry request time proposing according to user, search traffic flow data storehouse, and according to acquisitionQuery Result calculate query time through above-mentioned path candidate required by total time and total average trafficStream. For example, it is required to People's Square from crossing, National Road, Handan road that user need to inquire about 8 of Sunday MorningsTime. User can first obtain the path of process, for example 3 sections by Baidu's map. And then useThe present invention's system queries, finds corresponding road section in the time that the magnitude of traffic flow at 7 o'clock to 9 o'clock weekend records and passes throughBetween be respectively 10 points, 5 points and 6 points, simple these times 21 points of obtaining of being added are to current trip instituteThe precise time comparatively needing.
Step 105, exports the path of total time and total traffic flow minimum as optimal path, and will hand over accuratelyLogical time and telecommunication flow information offer user.
Fig. 2 is the system architecture diagram of a kind of traffic optimal route of the present invention inquiry system. As shown in Figure 2, originallyInvent a kind of traffic optimal route inquiry system, comprising: traffic flow data storehouse creation module 201, path candidateAcquisition module 202, query time receiver module 203, computing module 204 and output module 205.
Wherein, traffic flow data storehouse creation module 201 is for creating traffic flow data storehouse. Specifically, hand overThrough-flow data-base recording on 24 hours each hour every day Baidu's map every road the magnitude of traffic flow and at thisIn corresponding 1 hours, pass through this road period used. For the capacity of reduction database, we are in storehouseIn do not record the magnitude of traffic flow of each hour every day, but 1 year 365 days are divided according to heavy traffic degreeBecome different classifications, as be divided into 3 classes: Monday~Friday, Saturday and Sunday and festivals or holidays are as 10.1,5.1, the springJoint etc. 24 hours one time was also divided into different classes of according to heavy traffic degree, as is divided into: 0 is arrived6 points, 7 to 10 points, 10 o'clock to 12 o'clock, 12 o'clock to 14 o'clock, 14 o'clock to 16 o'clock, 16 o'clock to 19 o'clock,Several classifications such as 19 o'clock to 24 o'clock. Therefore a similar traffic flow data table is as shown in table 1. Wherein, flatAll traffic flows and can obtaining by statistics traffic flow historical data calculating mean value by the time, or take peopleWork spot sampling is estimated and is calculated. For example, establish Yangpu District, Shanghai and have 300 roads, Yangpu District correspondenceTraffic flow data table in to record number be 300*3*7=6300 bar record.
Path candidate acquisition module 202 utilizes Baidu's map to receive the Origin And Destination of user's input, and obtainsAll recommended candidate path of origin-to-destination; Query time receiver module 203, for receiving user inputThe inquiry request time, the query time that user wishes. Preferably, if do not receive user's input,Giving tacit consent to current time is the inquiry request time; Computing module 204, the inquiry request time proposing according to user,Search traffic flow data storehouse, and calculate at query time through above-mentioned path candidate according to the Query Result obtainingRequired by total time and total average traffic flow; Output module 205, output total time and total traffic flow minimumPath as optimal path, and accurate traffic time and telecommunication flow information are offered to user.
In sum, a kind of traffic optimal route querying method of the present invention and system have overcome existing Baidu mapMiddle routine calculation only can provide the shortcoming of fixing transit time, adopts given circuit at different date and timesThe statistics magnitude of traffic flow and the time used of section are put into traffic flow data storehouse, then at the line based on Baidu's mapIn circuit planning, determine under preset time by the friendship used of certain circuit by inquiry traffic flow data storehouseLogical time and the magnitude of traffic flow, thus more precise time information and traffic flow information of client offered.
Above-described embodiment is illustrative principle of the present invention and effect thereof only, but not for limiting the present invention.Any those skilled in the art all can, under spirit of the present invention and category, carry out above-described embodimentModify and change. Therefore, the scope of the present invention, should be as listed in claims.

Claims (10)

1. a traffic optimal route querying method, comprises the steps:
Step 1, creates traffic flow data storehouse;
Step 2, utilize Baidu map to receive the Origin And Destination of user's input, and obtain origin-to-destinationAll recommended candidate path;
Step 3, receives the inquiry request time that user inputs;
Step 4, the inquiry request time proposing according to user, search traffic flow data storehouse, and according to acquisitionQuery Result calculate query time through above-mentioned path candidate required by total time and total average trafficStream;
Step 5, according to the total time obtaining and total average traffic flow output optimal path.
2. a kind of traffic optimal route querying method as claimed in claim 1, is characterized in that: in stepIn five, export the path of total time and total traffic flow minimum as optimal path, and by accurate traffic timeOffer user with telecommunication flow information.
3. a kind of traffic optimal route querying method as claimed in claim 1, is characterized in that: this trafficFlow database is by the magnitude of traffic flow of every road on statistics Baidu's map each hour every day with in this correspondence 1Set up by this road period used in individual hours.
4. a kind of traffic optimal route querying method as claimed in claim 3, is characterized in that: this trafficFlow database was divided into three of working day, day off and festivals or holidays by 1 year 365 days according to heavy traffic degreeClassification classification, was divided into different classes of by 24 hours every days according to heavy traffic degree on a time period.
5. a kind of traffic optimal route querying method as claimed in claim 1, is characterized in that: in stepIn three, if do not receive user's input, giving tacit consent to current time is the inquiry request time.
6. a traffic optimal route inquiry system, comprising:
Traffic flow data storehouse creation module, for creating traffic flow data storehouse;
Path candidate acquisition module, utilizes Baidu's map to receive the Origin And Destination of user's input, and has obtainedPoint is to all recommended candidate path of terminal;
Query time receiver module, for receiving the inquiry request time of user's input;
Computing module, the inquiry request time proposing according to user, search traffic flow data storehouse, and according to obtainingThe Query Result obtaining calculates at query time required by total time and total average friendship through above-mentioned path candidateThrough-flow;
Output module, according to the total time obtaining and total average traffic flow output optimal path.
7. a kind of traffic optimal route inquiry system as claimed in claim 6, is characterized in that: this outputThe path of module output total time and total traffic flow minimum is as optimal path, and by accurate traffic time andTelecommunication flow information offers user.
8. a kind of traffic optimal route inquiry system as claimed in claim 6, is characterized in that: this trafficFlow database is by the magnitude of traffic flow of every road on statistics Baidu's map each hour every day with in this correspondence 1Set up by this road period used in individual hours.
9. a kind of traffic optimal route inquiry system as claimed in claim 8, is characterized in that: this trafficFlow database was divided into three of working day, day off and festivals or holidays by 1 year 365 days according to heavy traffic degreeClassification classification, was divided into different classes of by 24 hours every days according to heavy traffic degree on a time period.
10. a kind of traffic optimal route inquiry system as claimed in claim 6, is characterized in that: this is looked intoIf inquiry time receiver module does not receive user's input, giving tacit consent to current time is the inquiry request time.
CN201510996271.1A 2015-12-25 2015-12-25 Vehicle optimum route query method and system Pending CN105608508A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510996271.1A CN105608508A (en) 2015-12-25 2015-12-25 Vehicle optimum route query method and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510996271.1A CN105608508A (en) 2015-12-25 2015-12-25 Vehicle optimum route query method and system

Publications (1)

Publication Number Publication Date
CN105608508A true CN105608508A (en) 2016-05-25

Family

ID=55988432

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510996271.1A Pending CN105608508A (en) 2015-12-25 2015-12-25 Vehicle optimum route query method and system

Country Status (1)

Country Link
CN (1) CN105608508A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109241206A (en) * 2017-06-30 2019-01-18 北京搜狗科技发展有限公司 A kind of route inquiry method and device

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101593424A (en) * 2009-07-10 2009-12-02 浙江大学 A kind of intelligent combination forecasting method for short-term traffic flow
CN102033892A (en) * 2009-09-30 2011-04-27 北京四通智能交通***集成有限公司 Method and system for generating historical standard data of traffic flow
CN102252687A (en) * 2011-07-06 2011-11-23 广东威创视讯科技股份有限公司 Method and device for acquiring fastest running path of vehicle
CN102265118A (en) * 2008-12-22 2011-11-30 弗提奥斯·K·里欧托普罗斯 Methodology and system for routing optimization in gps-based navigation, combining dynamic traffic data
CN102629418A (en) * 2012-04-09 2012-08-08 浙江工业大学 Fuzzy kalman filtering-based traffic flow parameter prediction method
CN104157142A (en) * 2014-08-27 2014-11-19 河海大学 Urban path travel time forecasting method based on floating vehicle data

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102265118A (en) * 2008-12-22 2011-11-30 弗提奥斯·K·里欧托普罗斯 Methodology and system for routing optimization in gps-based navigation, combining dynamic traffic data
CN101593424A (en) * 2009-07-10 2009-12-02 浙江大学 A kind of intelligent combination forecasting method for short-term traffic flow
CN102033892A (en) * 2009-09-30 2011-04-27 北京四通智能交通***集成有限公司 Method and system for generating historical standard data of traffic flow
CN102252687A (en) * 2011-07-06 2011-11-23 广东威创视讯科技股份有限公司 Method and device for acquiring fastest running path of vehicle
CN102629418A (en) * 2012-04-09 2012-08-08 浙江工业大学 Fuzzy kalman filtering-based traffic flow parameter prediction method
CN104157142A (en) * 2014-08-27 2014-11-19 河海大学 Urban path travel time forecasting method based on floating vehicle data

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109241206A (en) * 2017-06-30 2019-01-18 北京搜狗科技发展有限公司 A kind of route inquiry method and device

Similar Documents

Publication Publication Date Title
Chang et al. Estimating real-time traffic carbon dioxide emissions based on intelligent transportation system technologies
CN101361106B (en) Traffic information providing system using digital map for collecting traffic information and method thereof
WO2016127917A1 (en) Order pushing method and system
US20170032291A1 (en) Bus Planning Method Using Mobile Communication Data Mining
CN102968900B (en) Method for processing RFID (Radio Frequency Identification) traffic data
CN103065205A (en) Three-dimensional intelligent transportation junction passenger flow time-space analysis and prediction system
CN105387864A (en) Route planning device and method
CN101976505A (en) Traffic evaluation method and system
CN101836084A (en) A method and machine for generating map data and a method and navigation device for determining a route using map data
CN103323018A (en) Time-interval-based feature identification and fast search method for hotspot path
CN101814201A (en) Taxi fare calculation method and navigation device
CN110491158A (en) A kind of bus arrival time prediction technique and system based on multivariate data fusion
US11250031B2 (en) Method of predicting a traffic behaviour in a road system
Tiwari et al. Route prediction using trip observations and map matching
CN105096590B (en) Traffic information creating method and traffic information generating device
CN112579718A (en) Urban land function identification method and device and terminal equipment
Jiang et al. A multi-period analysis of taxi drivers' behaviors based on GPS trajectories
Li et al. Empirical study of travel time estimation and reliability
Hunter et al. Estimation of connected vehicle penetration rate on indiana roadways
US11670163B2 (en) Method of predicting a traffic behaviour in a road system
CN106447138A (en) Electronic map travelling time calculation method based on velocity matrix
Yan et al. A new method for real-time evaluation of urban traffic congestion: a case study in Xi’an, China
CN105547315A (en) Vehicle real time optimal traffic planning method and system
Wang et al. A GPS-based research on driving range and patterns of private passenger vehicle in Beijing
CN112579915B (en) Analysis method and device for trip chain

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
WD01 Invention patent application deemed withdrawn after publication
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20160525