CN108710969A - A kind of intelligent paths planning method of tourism - Google Patents
A kind of intelligent paths planning method of tourism Download PDFInfo
- Publication number
- CN108710969A CN108710969A CN201810364804.8A CN201810364804A CN108710969A CN 108710969 A CN108710969 A CN 108710969A CN 201810364804 A CN201810364804 A CN 201810364804A CN 108710969 A CN108710969 A CN 108710969A
- Authority
- CN
- China
- Prior art keywords
- path
- sight spot
- tourism
- cost
- intelligent
- 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 30
- 239000002131 composite material Substances 0.000 claims abstract description 23
- 238000011156 evaluation Methods 0.000 claims abstract description 16
- 150000001875 compounds Chemical class 0.000 claims abstract description 4
- 238000004364 calculation method Methods 0.000 claims description 4
- 238000010408 sweeping Methods 0.000 claims description 4
- 238000004445 quantitative analysis Methods 0.000 abstract description 3
- 238000005516 engineering process Methods 0.000 description 5
- 238000013461 design Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 3
- 238000005259 measurement Methods 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 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
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- 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/10—Services
- G06Q50/14—Travel agencies
Landscapes
- Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Game Theory and Decision Science (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of intelligent paths planning methods of tourism, including：1, artificial to determine optional sight spot of playing of playing；2, client is according to 1 optional sight spot of playing, the selected sight spot for wanting to play；3, Baidu map SDK calls Baidu's public transport route search, obtains the length and time cost information of all feasible paths；4, in conjunction with the user's evaluation path data of platform, actually enter data of the compound multiple-factor cost as path rule are generated, generate multiple-factor composite cost table；5, the calculating that intelligent path planning is carried out using compressive state dynamic programming algorithm, obtains outbound path.The tourism intelligence paths planning method of the present invention is more bonded user and actually uses scene, and the circuit obtained is more humane, scientific, being capable of quantitative analysis, the corresponding route planning of generation.Path dynamic generation time cost is high, conveniently, even if in the case of no network, as long as having downloaded arrangement path in advance, and is suitable for various tourism planning occasions.
Description
Technical field
The present invention relates to smart travel technical field more particularly to a kind of intelligent paths planning methods of tourism.
Background technology
Travelling route refers to being managed by tourism to enable traveller to obtain maximum appreciation effect with the shortest time
Department utilizes several tourist spots of traffic lines series connection or tourist city（Town）It is formed by the reasonable trend with certain characteristic.
According to different criteria for classifications, travelling route can be divided into a variety of different types：
（1）By the distance of travelling route, short distance travelling route, intermediate range travelling route, long haul travel line can be divided into；
（2）Whole by travelling route calculates travel time, can be divided into tourism trip line on the one, tourism trip line on the two, travel within 3rd
Swim line and Duo tourism trip lines；
（3）By the property of travelling route, common sightseeing tour line and special-topic tourism line can be divided into；
（4）By travelling route to the size of tourist's attractived region, international tourism can be divided into and swim line.Trip in national travelling route and area
Swim line；
（5）By the space layout form of travelling route, reciprocation type travelling route, single-channels can be divided at 2（Single line is through）Trip
Swim line, ring channel-type（Annular pass-through formula）Travelling route, single hinge type（Single-point axis-spoke）Travelling route, more hinge types（Multiple spot axis spoke
Formula）Travelling route and network distribution type travelling route.
Existing various tourism paths planning methods are mainly manifested in following aspect there are some drawbacks：
1. free walker tourist's actual practice
Compare clearly route in order to still have in other places, generally requires a large amount of information collection work.It is past after collection
Toward actually travel during, it is possible to the case where detouring.It can not be well to time cost, path length cost
Control enumerates all situations and unrealistic, more tour pal's choosings because the case where seeming the route planning at multiple sight spots by manpower
It selects the experience with reference to forefathers, look into the ways such as strategy.Or be only determined before setting out go to which sight spot and sight spot it
Between do not determine sequentially, do not formulate the route of control time cost, and probably either detoured by tape error road.
2. the current way of travel agency and the route planning of free walker tourist and the specific practice of adjustment.
The path design of the actually present design for complete tourism route, more sight spots is often conducted a sightseeing tour and travel agency
Experience and interest relations carry out corresponding stroke design.It is full for whole time cost, path length cost, past tourist
The factors such as meaning degree, the consideration for the progress entirety that is not considered into directly, in other words, the considerations of for route more
It is to set out for the empirical angle of people.This process needs a large amount of experiences before travel agency's either traveller's planning and travelling
The collection and judgement of person oneself.The time cost for making route is very high, the calculating that each key factor could not be quantified.More
When, being in the push for road conditions can plan route according to driver, can not rule out erroneous judgement of the driver to road conditions.And
And tour guide can be according to current stroke or be that a friendly situation does some dynamic adjustment and cancels or increase some sight spots
The way of the so-called route planning of some app on the market.
3. planning of the existing software to path
Existing software actually manually secures sight spot and visit sequence to a path planning at scenic spot in market, is not to lead to
It crosses algorithm and carries out dynamic Route Generation, this method does not support passenger to change the dynamic in the selection of sight spot.Only true
Navigation between two sight spots is provided in the case of alignment road, fixed sight spot.There is no account for it to all paths
Afterwards preferentially.It is practical and not smart enough.And passenger is not experienced to the process for taking into account coordinates measurement in Path selection specifically
In the middle of.
Invention content
In view of the drawbacks described above of the prior art, technical problem to be solved by the invention is to provide a kind of intelligent roads of tourism
Diameter planing method, so as to solve the deficiencies in the prior art.
To achieve the above object, the present invention provides a kind of intelligent paths planning method of tourism, include the following steps：
Step 1, artificial determining optional sight spot of playing of playing；
Step 2, client are according to the optional sight spot of playing of step 1, the selected sight spot for wanting to play；
Step 3, Baidu map SDK call Baidu's public transport route search, obtain all feasible paths length and when
Between cost information；
Step 4, the user's evaluation path data in conjunction with platform generate compound multiple-factor cost actually entering as path rule
Data generate multiple-factor composite cost table；
Step 5, the calculating that intelligent path planning is carried out using compressive state dynamic programming algorithm, obtain outbound path.
A kind of above-mentioned tourism intelligence paths planning method, the step 4 are specially：
System background calls synchronization call syncGetUserScore (int mapIndex, int startIndex, int
EndIndex), it is currently with which scenic spot, startIndex and endIndex correspondences by incoming parameter mapIndex determinations
The index value of starting point and target point, in this way request to system background user's evaluation average mark, be multiplied by 0.1 add before
Length value at cost, obtain multiple multiple-factor composite cost values, insert in multiple-factor composite cost table.
A kind of above-mentioned tourism intelligence paths planning method, the step 5 are specially：
Step 51, the multiple-factor composite cost table generated according to the step 4 generate all subsets of sight spot collection；
Step 52, from left to right, since small subset Si, traverses big subset Si, is calculated as follows：
It is overlapped operation not in the element ej of subset Si to all, finds out minimum value after superposition, and after recording the superposition
Minimum value, while the minimum value for recording the value is the referred to as lastMap tables as obtained from which sub- result of calculation；
When the sweeping subset in step 53, after computation face, use history as a result, the exactly scale is smaller of front
It is superimposed minimum value result；
Step 54 show that sequence is gone sight-seeing at complete sight spot by lastMap tables, and by the sequence, generating tourist can see in app
The real visit sequence arrived.
A kind of above-mentioned tourism intelligence paths planning method, visit sequence supports offline download and offline in the step 54
Path planning navigates.
A kind of above-mentioned tourism intelligence paths planning method, the i-th row jth arranges in the multiple-factor composite cost table, generation
To the multiple-factor composite cost value at j-th of sight spot, the element on diagonal line is 0 at table i-th of sight spot.
The beneficial effects of the invention are as follows：
The tourism intelligence paths planning method of the present invention is more bonded user and actually uses scene, and the circuit obtained is more humane：
1. in the factor generates settlement process, evaluation points of the user to path itself are added.It is not only in route selection
The factors such as length of time, and system is also added in the user's evaluation factor.
2. path dynamic generation time cost is high, conveniently, corresponding demand can be quickly generated in conjunction with actual conditions
Path.
3. even if beneath no network the case where, as long as having downloaded arrangement path in advance.
4. without determining generation route according to concrete application main body.Either small scenic spot or an entire city conduct
It plays object, corresponding route can be generated.And specific different application objects are set with the different vehicles.Either
This technology is cooperated with scenic spot or be and city, regional cooperation all there is no problem.
It, being capable of quantitative analysis, the corresponding route rule of generation 5. coordinates measurement is not simple with respect to science leans on experience
It draws.
The technique effect of the design of the present invention, concrete structure and generation is described further below with reference to attached drawing, with
It is fully understood from the purpose of the present invention, feature and effect.
Description of the drawings
Fig. 1 is flow chart of the method for the present invention.
Specific implementation mode
As shown in Figure 1, a kind of intelligent paths planning method of tourism, includes the following steps：
Step 1, artificial determining optional sight spot of playing of playing；
Step 2, client are according to the optional sight spot of playing of step 1, the selected sight spot for wanting to play；
Step 3, Baidu map SDK call Baidu's public transport route search, obtain all feasible paths length and when
Between cost information；
Step 4, the user's evaluation path data in conjunction with platform generate compound multiple-factor cost actually entering as path rule
Data generate multiple-factor composite cost table；
Step 5, the calculating that intelligent path planning is carried out using compressive state dynamic programming algorithm, obtain outbound path.
In the present embodiment, the step 4 is specially：
System background calls synchronization call syncGetUserScore (int mapIndex, int startIndex, int
EndIndex), it is currently with which scenic spot, startIndex and endIndex correspondences by incoming parameter mapIndex determinations
The index value of starting point and target point, in this way request to system background user's evaluation average mark, be multiplied by 0.1 add before
Length value at cost, obtain multiple multiple-factor composite cost values, insert in multiple-factor composite cost table.
In the present embodiment, the step 5 is specially：
Step 51, the multiple-factor composite cost table generated according to the step 4 generate all subsets of sight spot collection；
Step 52, from left to right, since small subset Si, traverses big subset Si, is calculated as follows：
It is overlapped operation not in the element ej of subset Si to all, finds out minimum value after superposition, and after recording the superposition
Minimum value, while the minimum value for recording the value is the referred to as lastMap tables as obtained from which sub- result of calculation；
When the sweeping subset in step 53, after computation face, use history as a result, the exactly scale is smaller of front
It is superimposed minimum value result；
Step 54 show that sequence is gone sight-seeing at complete sight spot by lastMap tables, and by the sequence, generating tourist can see in app
The real visit sequence arrived.
Sequence is gone sight-seeing in the present embodiment, in the step 54 supports offline download and the navigation of offline path planning.
In the present embodiment, the i-th row jth arranges in the multiple-factor composite cost table, represents i-th of sight spot to j-th of scape
The multiple-factor composite cost value of point, the element on diagonal line are 0.
The method that a specific embodiment illustrates the present invention is given below, mainly includes the following steps：
1st step, the optional sight spot manually determined are：The magnificent squares Shi Zhengmen, China Shi Kongzi are as sculpture, hall of the libraries Hua Shi, China
Teacher's Cultural Square.Some sight spots that the above sight spot can manually be planned when being using Hua Shi as scenic spot.（If by wide
State is and not quite alike directly as scenic spot, and the optional sight spot that may manually determine can be again：Guangzhou Zoo, Beijing
Road shopping mall, martyrs' park, The Chen Clan Temple etc..）
2nd step, tourist select according to time of oneself interest before visit first few minutes are either gone sight-seeing, may teacher to China
Cultural Square is less interested, then just only have selected magnificent Shi Kongzi as sculpture, hall of the libraries Hua Shi, the China squares Shi Zhengmen this
Three sight spots, do not include into all sight spots.3rd step system background is called the inspection of Baidu's public transport path
Rope all calls the masstransitSearch functions in Baidu map API between any two sight spot, uses
OnGetMassTransitRouteResult obtains the route search result of readjustment.In this example, since previous step is swum
Visitor has selected 3 sight spots（Magnificent Shi Kongzi is as sculpture, hall of the libraries Hua Shi, the China squares Shi Zhengmen）, also just there are 6 routes to examine
Rope（Magnificent Shi Kongzi is as sculpture --- hall of the libraries Hua Shi（It is two-way）, China Shi Kongzi is as sculpture --- the magnificent squares Shi Zhengmen（It is double
To）, hall of the libraries Hua Shi --- the magnificent squares Shi Zhengmen（It is two-way））Obtain the value of 6 time span costs（Unit is km）.
4th step, system background call synchronization call syncGetUserScore (int mapIndex, int
StartIndex, int endIndex), by incoming parameter mapIndex determinations be currently with which scenic spot,
StartIndex and endIndex corresponds to the index value of starting point and target point, and the user of request to system background comments in this way
Valence average mark, wherein user itself seem that initial value is 1 (for maximum value) in software platform to the evaluation points in path, are used
Family can carry out individually a section path when terminating to navigate the evaluation of 5 stars, the evaluation of 5 stars correspond to 1,0.8,0.6,
0.4,0.2,0 score value, and its average value is calculated, using average value as user's evaluation.
Then, user's evaluation be multiplied by 0.1 add before length value at cost, obtain 6 multiple-factor composite cost values, insert
In multiple-factor composite cost table.（Table the i-th row jth arranges, and first, ij is that sight spot is suitable in the sight spot that tourist selectes respectively
Sequence, example China Shi Kongzi are 1 as sculpture is hall of the libraries 0, Hua Shi, and the magnificent squares Shi Zhengmen are 2.Secondly, the i-th row jth row,
I-th of sight spot is represented to the multiple-factor composite cost value at j-th of sight spot, the element on diagonal line is 0）
The calculating section of 5th step, intelligent path planning.When 4 step we have been able to obtain a composite factor at
This table.Then, all subset Si of sight spot collection are generated, are exactly in this example（{},{0},{1},{2},{0,1},{0,2},{1,2},
{ 0,1,2 }, we are directly indicated with positional value of each sight spot in tourist selectes sight spot to simplify, behind be also such）.From a left side
To the right side, since small subset Si, big subset Si is traversed, is calculated as follows：
It is overlapped operation not in the element ej of subset Si to all, finds out minimum value after superposition, and after recording the superposition
Minimum value.(and which sub- result of calculation is the minimum value for recording the value simultaneously be as obtained from, we term it lastMap
Table)
The result that history can be used when the sweeping subset in face after computation be exactly the superposition of the scale is smaller of front most
Small value result.This process, that is, Dynamic Programming.And wherein can indicate subset with a kind of representation method being called compressive state,
It can accelerate the speed of service calculated in code level.
Then it show that sequence is gone sight-seeing at complete sight spot by lastMap tables, by the sequence, generates tourist's energy in app
The real visit sequence seen（Magnificent Shi Kongzi is as sculpture --- hall of the libraries Hua Shi --- magnificent squares Shi Zhengmen）, tourist this
Storing path can be pressed when a, app can be locally stored in using json as the data of format, and file name is
localPath.json.Have recorded mapIndex（Scenic spot indexes）:int , view（Sight spot）:{viewIndex（Sight spot sequence
Number）:Int, viewName (sight spot name):Int }, sequence（Sight spot sequence number sequence）:[int,int,…int]}.From
In the case of line, as long as the offline map that tourist has also carried out internal system in advance is downloaded, then can be carried out offline
Route planning navigation.Even if beneath no network the case where, as long as having downloaded arrangement path in advance.
In conclusion the tourism intelligence paths planning method of the present invention, which is more bonded user, actually uses scene, obtain
Circuit is more humane：
1. in the factor generates settlement process, evaluation points of the user to path itself are added.It is not only in route selection
The factors such as length of time, and system is also added in the user's evaluation factor.
2. path dynamic generation time cost is high, conveniently, corresponding demand can be quickly generated in conjunction with actual conditions
Path.
3. even if beneath no network the case where, as long as having downloaded arrangement path in advance.
4. without determining generation route according to concrete application main body.Either small scenic spot or an entire city conduct
It plays object, corresponding route can be generated.And specific different application objects are set with the different vehicles.Either
This technology is cooperated with scenic spot or be and city, regional cooperation all there is no problem.
It, being capable of quantitative analysis, the corresponding route rule of generation 5. coordinates measurement is not simple with respect to science leans on experience
It draws.
The preferred embodiment of the present invention has been described in detail above.It should be appreciated that those skilled in the art without
It needs creative work according to the present invention can conceive and makes many modifications and variations.Therefore, all technologies in the art
Personnel are available by logical analysis, reasoning, or a limited experiment on the basis of existing technology under this invention's idea
Technical solution, all should be in the protection domain being defined in the patent claims.
Claims (5)
1. a kind of intelligent paths planning method of tourism, which is characterized in that include the following steps：
Step 1, artificial determining optional sight spot of playing of playing；
Step 2, client are according to the optional sight spot of playing of step 1, the selected sight spot for wanting to play；
Step 3, Baidu map SDK call Baidu's public transport route search, obtain all feasible paths length and when
Between cost information；
Step 4, the user's evaluation path data in conjunction with platform generate compound multiple-factor cost actually entering as path rule
Data generate multiple-factor composite cost table；
Step 5, the calculating that intelligent path planning is carried out using compressive state dynamic programming algorithm, obtain outbound path.
2. the intelligent paths planning method of a kind of tourism as described in claim 1, it is characterised in that：The step 4 is specially：
System background calls synchronization call syncGetUserScore (int mapIndex, int startIndex, int
EndIndex), it is currently with which scenic spot, startIndex and endIndex correspondences by incoming parameter mapIndex determinations
The index value of starting point and target point, in this way request to system background user's evaluation average mark, be multiplied by 0.1 add before
Length value at cost, obtain multiple multiple-factor composite cost values, insert in multiple-factor composite cost table.
3. a kind of tourism intelligence paths planning method as described in claim 1, which is characterized in that the step 5 is specially：
Step 51, the multiple-factor composite cost table generated according to the step 4 generate all subsets of sight spot collection；
Step 52, from left to right, since small subset Si, traverses big subset Si, is calculated as follows：
It is overlapped operation not in the element ej of subset Si to all, finds out minimum value after superposition, and after recording the superposition
Minimum value, while the minimum value for recording the value is the referred to as lastMap tables as obtained from which sub- result of calculation；
When the sweeping subset in step 53, after computation face, use history as a result, the exactly scale is smaller of front
It is superimposed minimum value result；
Step 54 show that sequence is gone sight-seeing at complete sight spot by lastMap tables, and by the sequence, generating tourist can see in app
The real visit sequence arrived.
4. the intelligent paths planning method of a kind of tourism as claimed in claim 3, it is characterised in that：Sequence is gone sight-seeing in the step 54
It is disbursed from the cost and expenses and holds offline download and the navigation of offline path planning.
5. the intelligent paths planning method of a kind of tourism as described in claim 1, it is characterised in that：The multiple-factor composite cost
The i-th row jth arranges in table, represents i-th of sight spot to the multiple-factor composite cost value at j-th of sight spot, the element on diagonal line is
0。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810364804.8A CN108710969A (en) | 2018-04-23 | 2018-04-23 | A kind of intelligent paths planning method of tourism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810364804.8A CN108710969A (en) | 2018-04-23 | 2018-04-23 | A kind of intelligent paths planning method of tourism |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108710969A true CN108710969A (en) | 2018-10-26 |
Family
ID=63866896
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810364804.8A Pending CN108710969A (en) | 2018-04-23 | 2018-04-23 | A kind of intelligent paths planning method of tourism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108710969A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110458368A (en) * | 2019-08-18 | 2019-11-15 | 中国科学院科技战略咨询研究院 | A kind of nomadic paths planning method of Forage-Livestock Balance based on network flow |
| CN114819469A (en) * | 2022-02-24 | 2022-07-29 | 北京清华同衡规划设计研究院有限公司 | Intelligent tourism planning and designing method and system based on big data |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104574233A (en) * | 2014-12-29 | 2015-04-29 | 中国地质大学（武汉） | Internet-based convenient tourism service platform |
| CN104808661A (en) * | 2015-03-05 | 2015-07-29 | 安徽师范大学 | Tourism route planning method |
| CN105574708A (en) * | 2015-12-10 | 2016-05-11 | 北京创鑫旅程网络技术有限公司 | Travel route planning method and apparatus |
| CN106203646A (en) * | 2016-06-29 | 2016-12-07 | 厦门趣处网络科技有限公司 | Customize stroke commending system and method |
| CN107423837A (en) * | 2017-04-12 | 2017-12-01 | 宁夏丝路风情旅游网络股份有限公司 | The Intelligent planning method and system of tourism route |
| CN107844523A (en) * | 2017-10-12 | 2018-03-27 | 江苏鸿信系统集成有限公司 | The position converting system of double coordinate-systems based on GPS and hand-drawing map |
| CN107862420A (en) * | 2017-12-13 | 2018-03-30 | 广东机场白云信息科技有限公司 | Intelligent stroke planning method and system |
-
2018
- 2018-04-23 CN CN201810364804.8A patent/CN108710969A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104574233A (en) * | 2014-12-29 | 2015-04-29 | 中国地质大学（武汉） | Internet-based convenient tourism service platform |
| CN104808661A (en) * | 2015-03-05 | 2015-07-29 | 安徽师范大学 | Tourism route planning method |
| CN105574708A (en) * | 2015-12-10 | 2016-05-11 | 北京创鑫旅程网络技术有限公司 | Travel route planning method and apparatus |
| CN106203646A (en) * | 2016-06-29 | 2016-12-07 | 厦门趣处网络科技有限公司 | Customize stroke commending system and method |
| CN107423837A (en) * | 2017-04-12 | 2017-12-01 | 宁夏丝路风情旅游网络股份有限公司 | The Intelligent planning method and system of tourism route |
| CN107844523A (en) * | 2017-10-12 | 2018-03-27 | 江苏鸿信系统集成有限公司 | The position converting system of double coordinate-systems based on GPS and hand-drawing map |
| CN107862420A (en) * | 2017-12-13 | 2018-03-30 | 广东机场白云信息科技有限公司 | Intelligent stroke planning method and system |
Non-Patent Citations (1)
| Title |
|---|
| 汪林林 等: "基于动态规划算法的矢量压缩方法研究与改进", 《计算机应用》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110458368A (en) * | 2019-08-18 | 2019-11-15 | 中国科学院科技战略咨询研究院 | A kind of nomadic paths planning method of Forage-Livestock Balance based on network flow |
| CN110458368B (en) * | 2019-08-18 | 2023-01-17 | 中国科学院科技战略咨询研究院 | Grass and livestock balance nomadic path planning method based on network flow |
| CN114819469A (en) * | 2022-02-24 | 2022-07-29 | 北京清华同衡规划设计研究院有限公司 | Intelligent tourism planning and designing method and system based on big data |
| CN114819469B (en) * | 2022-02-24 | 2022-10-21 | 北京清华同衡规划设计研究院有限公司 | Intelligent tourism planning and designing method and system based on big data |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10677604B1 (en) | Continuously updatable computer-generated routes with continuously configurable virtual bus stops for passenger ride-sharing of a fleet of ride-sharing vehicles and computer transportation systems and computer-implemented methods for use thereof | |
| US11255673B2 (en) | Technology for sharing GPS navigation information | |
| CN103620345B (en) | Route is provided by information gathering and retrieval | |
| AU2016298981A1 (en) | Method and system for determining transport service fee | |
| CN107247718A (en) | Update method and device, the navigation system and server of a kind of map datum | |
| CN103426139B (en) | System and method for matching and pairing co-passengers | |
| US9250075B2 (en) | Generating travel time data | |
| CN103620640A (en) | Customized travel route system | |
| CN106803402A (en) | Intelligent guide guide system and method based on the classification display of map pantograph ratio | |
| CN110648027B (en) | Self-driving tour digital line interactive generation system and working method thereof | |
| WO2007148378A1 (en) | Route search system, route search server, terminal, and route search method | |
| CN108225357A (en) | User guidance system | |
| CN105973263A (en) | Navigation method and navigation device | |
| CN103994771A (en) | Scenic region intelligent navigation application system and using method thereof | |
| CN106931985A (en) | Scenic spot intelligent planning tourist guide path system and method based on hand-drawing map | |
| CN106534384A (en) | Method, device and system for optimizing path of shared bicycle | |
| CN103884349A (en) | Evaluation-based navigation method | |
| CN108710969A (en) | A kind of intelligent paths planning method of tourism | |
| CN109708646A (en) | A kind of express delivery cabinet finding method, device, equipment and storage medium | |
| CN106940190A (en) | Navigation drawing drawing method, navigation picture draw guider and navigation system | |
| CN101169330B (en) | Vehicular navigation device using single branched graph | |
| CN113188545B (en) | Offline mobile terminal AR indoor navigation method and system | |
| CN107895392B (en) | Time map drawing method | |
| CN111862657B (en) | Method and device for determining road condition information | |
| Kuonen | Estimating greenhouse gas emissions from travel–a GIS-based study |
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: 20181026 |