CN107862401A - A kind of method for optimizing route and system of scenic spot bicycle - Google Patents
A kind of method for optimizing route and system of scenic spot bicycle Download PDFInfo
- Publication number
- CN107862401A CN107862401A CN201710808773.6A CN201710808773A CN107862401A CN 107862401 A CN107862401 A CN 107862401A CN 201710808773 A CN201710808773 A CN 201710808773A CN 107862401 A CN107862401 A CN 107862401A
- Authority
- CN
- China
- Prior art keywords
- module
- path
- scenic spot
- optimal path
- route
- 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
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
- G07—CHECKING-DEVICES
- G07F—COIN-FREED OR LIKE APPARATUS
- G07F17/00—Coin-freed apparatus for hiring articles; Coin-freed facilities or services
- G07F17/0042—Coin-freed apparatus for hiring articles; Coin-freed facilities or services for hiring of objects
- G07F17/0057—Coin-freed apparatus for hiring articles; Coin-freed facilities or services for hiring of objects for the hiring or rent of vehicles, e.g. cars, bicycles or wheelchairs
Abstract
The present invention provides a kind of method for optimizing route of scenic spot bicycle, including：Obtain the current position of scenic spot bicycle；Obtain the destination locations that will be sailed for；Using current location as origin, destination locations are terminal, obtain all paths from origin to terminal；Determine optimal path.The present invention also provides a kind of path optimizing system of scenic spot bicycle, including：Client, server end, the client and server end communication connection.The method for optimizing route and system of scenic spot bicycle in the present invention, on the one hand, facilitate visitor to go sightseeing, avoid wasting time because route is unfamiliar with；On the other hand, management of the scenic spot to visitor and the investigation to tour and statistics are facilitated, to facilitate scenic spot to provide more quality service as visitor.
Description
Technical field
The present invention relates to shared technical field of transportation, a kind of method for optimizing route more particularly, to scenic spot bicycle and it is
System.
Background technology
In life, the larger scenic spot of some floor spaces can be equipped with sightseeing bicycle, to facilitate visitor more easily control to go sight-seeing scape
Area, enjoy tourism enjoyment.However, during bike riding goes sight-seeing scenic spot, often due to being unfamiliar with to scenic spot, and can not look for
To the sight seeing route of riding of optimization, cause visitor to lose time, scenic spot can not be gone sight-seeing with optimal sight seeing route, influence visitor
Visit experience.
So, it is necessary to propose a kind of method for optimizing route and system of scenic spot bicycle.Passenger is facilitated to be seen with optimal route
Light, avoid, because scenic spot route is unfamiliar with around detour, losing time.
The content of the invention
In view of above-mentioned the deficiencies in the prior art, it is necessary to propose a kind of method for optimizing route and system of scenic spot bicycle.This
The purpose to be realized of invention is：On the one hand, facilitate visitor to go sightseeing, avoid wasting time because route is unfamiliar with；On the other hand,
Facilitate management of the scenic spot to visitor and the investigation to tour and statistics, to facilitate scenic spot to provide more thoughtful clothes as visitor
Business.
The present invention provides following technical scheme：
The present invention provides a kind of method for optimizing route of scenic spot bicycle, including：
Obtain the current position of scenic spot bicycle；
Obtain the destination locations that will be sailed for；
Using current location as origin, destination locations are terminal, obtain all paths from origin to terminal；
Determine optimal path.
Wherein, the method for determining optimal path includes：
Calculate each path length；
The most short path of path length is defined as optimal path.
Wherein, it is ensured that method of the scenic spot solo running on optimal path includes：
The most short optimal path of acquisition approach length；
Route is prompted in fork on the road；
Judge whether to travel by optimal path；
If it is not, optimal path is planned again, if so, continuing to travel.
Wherein, the method for determining optimal path includes：
It is paths ordering according to the beautiful scenery degree in each path；
The highest that will sort is as optimal path.
Wherein, it is ensured that method of the scenic spot solo running on optimal path includes：
Obtain landscape sequence highest optimal path；
Route is prompted in fork on the road；
Judge whether to travel by optimal path；
If it is not, optimal path is planned again, if so, continuing to travel.
The present invention also provides a kind of path optimizing system of scenic spot bicycle, including：Client, server end, the client
End and server end communication connection.The client includes main control module, position acquisition module, terminal selecting module, road
Footpath acquisition module, the first memory module, display module, payment module, communication module, the position acquisition module, terminal selection
Module, path acquisition module, the first memory module, display module, payment module, communication module are electric with the main control module respectively
Property connection, the power module is used to for the client provide electric energy.The server end includes navigation module, path planning
Module, computing module, order module, the second memory module, the server end is used for planning and navigation to path, and passes through
The communication module is sent to the client.
Wherein, the server end includes well historical data statistical module, for history layout data, historical navigation number
Counted according to, history using data.
Wherein, the payment module includes：Mobile payment module for mobile payment, for supplement payment with money supplement branch with money
Pay module, the auto deduction module for auto deduction.
Wherein, the computing module is included by calculating the distance computing module of distance, based on the expense of computational costs
Calculate module, the beautiful scenery degree computing module of beautiful scenery degree is calculated for counting.
Wherein, the communication modes of the communication module are wireless communication mode.
Compared with prior art, the present invention has the advantages that：
The method for optimizing route and system of scenic spot bicycle in the present invention, on the one hand, facilitate visitor to go sightseeing, avoid because not
It is familiar with route and wastes time；On the other hand, management of the scenic spot to visitor and the investigation to tour and statistics are facilitated, with side
Just scenic spot provides more quality service for visitor.
Brief description of the drawings
Fig. 1 is the schematic flow sheet of bicycle method for optimizing route in scenic spot in the present invention；
Fig. 2 is a kind of schematic flow sheet that optimal path is obtained in the present invention；
Fig. 3 is a kind of schematic flow sheet that method of the scenic spot solo running on optimal path is ensured in the present invention；
Another schematic flow sheet of optimal path is obtained in Fig. 4 present invention；
Fig. 5 is another schematic flow sheet that method of the scenic spot solo running on optimal path is ensured in the present invention；
Fig. 6 is a kind of block diagram of bicycle path optimizing system in scenic spot in the present invention；
Fig. 7 is another block diagram of bicycle path optimizing system in scenic spot in the present invention；
Fig. 8 is the composition frame chart of payment module in the present invention；
Fig. 9 is the composition frame chart of computing module in the present invention.
Embodiment
Embodying the exemplary embodiment of feature of present invention and advantage will describe in detail in the specification more than.It should be understood that
It is that the present invention can have various changes in different embodiments, it is neither departed from the scope of the present invention, and therein
Illustrate and illustrate to be treated as purposes of discussion in itself, and be not used to the limitation present invention.
Below in conjunction with accompanying drawing, the present invention is further described.
The method for optimizing route of scenic spot bicycle, the present invention provides two preferred embodiments, to the path optimization of scenic spot bicycle
Method is illustrated and illustrated.
Fig. 1 is the schematic flow sheet of bicycle method for optimizing route in scenic spot in the present invention.As shown in figure 1, scape in the present embodiment
The method for optimizing route of area's bicycle comprises the following steps.
Step S01：Obtain the current position of scenic spot bicycle.The position of scenic spot bicycle can be any one position in scenic spot
Put, obtained by positioning.
Step S02：Obtain the destination locations that will be sailed for.Destination locations obtain again after need to inputting, and destination locations are
Any position in scenic spot in addition to the starting point obtained.
Step S03：Using current location as origin, destination locations are terminal, obtain all paths from origin to terminal.
According to the position of beginning and end, all roads from origin-to-destination are obtained.It is it should be noted that all in the present embodiment
Path is all roads from origin-to-destination, does not wrap and passes through the modes such as lawn, pond, is referred to from the good bicycle of construction of scenic spot
Exercised on road and arrive terminal.
Step S04：Determine optimal path.By obtain starting point, terminal, scenic spot road, so as to passing through certain condition
Screening determines optimal path.
Two preferred embodiments are provided in the present invention, to ensure to determine optimal path and ensure scenic spot solo running optimal
On path.
The first preferred embodiment, the length of passage path determine the method for optimal path and ensure scenic spot solo running
Method on optimal path：
As shown in Fig. 2 Fig. 2 is a kind of schematic flow sheet that optimal path is obtained in the present invention.Determined most in the present embodiment
The method of shortest path comprises the following steps：
Step S01：Obtain the current position of scenic spot bicycle.The position of scenic spot bicycle can be any one position in scenic spot
Put, obtained by positioning.
Step S02：Obtain the destination locations that will be sailed for.Destination locations obtain again after need to inputting, and destination locations are
Any position in scenic spot in addition to the starting point obtained.
Step S03：Using current location as origin, destination locations are terminal, obtain all paths from origin to terminal.
According to the position of origin and terminal, all roads from origin to terminal are obtained.It is it should be noted that all in the present embodiment
Path is all roads from origin to terminal, does not wrap and passes through the modes such as lawn, pond, is referred to from the good bicycle of construction of scenic spot
Exercised on road and arrive terminal.
Step S14：Calculate each path length.After all paths from origin to terminal are got, Che Meitiao roads are calculated
The length in footpath.The mode of calculating is adds up each segmented paths in each paths, to obtain the overall length per paths
Degree.
Step S15：The most short path of path length is defined as optimal path.Calculate obtain each path length it
Afterwards, the length in each path is ranked up, after sequence, the most short path of path length is defined as optimal path.
Show as shown in figure 3, Fig. 3 is a kind of flow that method of the scenic spot solo running on optimal path is ensured in the present invention
It is intended to.Ensure that method of the scenic spot solo running on optimal path comprises the following steps in the present embodiment：
Step S01：Obtain the current position of scenic spot bicycle.The position of scenic spot bicycle can be any one position in scenic spot
Put, obtained by positioning.
Step S02：Obtain the destination locations that will be sailed for.Destination locations obtain again after need to inputting, and destination locations are
Any position in scenic spot in addition to the starting point obtained.
Step S03：Using current location as origin, destination locations are terminal, obtain all paths from origin to terminal.
According to the position of origin and terminal, all roads from origin to terminal are obtained.It is it should be noted that all in the present embodiment
Path is all roads from origin to terminal, does not wrap and passes through the modes such as lawn, pond, is referred to from the good bicycle of construction of scenic spot
Exercised on road and arrive terminal.
Step S24：Acquisition approach length is most short for optimal path.Getting all paths from origin to terminal
Afterwards, the length in each path is sorted, and acquisition approach is most short, is travelled as optimal path, and according to optimal path.
Step S25：Driving path is prompted in fork on the road.In ride, if running into fork on the road, scenic spot is single
Car reminds visitor, selects the turnout traveling on optimal path.
Step S26：Judge whether to travel according to optimal path.If so, continue step S27；If it is not, walked more than then repeating
Suddenly.In ride, by obtaining current location, optimal path is contrasted, it is determined whether travelled according to optimal path, if
Travelled according to optimal path, then continue next step.Travelled if not according to optimal path, then repeatedly above procedure, with
Current location is origin, and destination is terminal, obtains optimal path according to the method described above again, and judge again in fork on the road
Whether travel on optimal path.
Step S27：Continue to travel.If traveling then continues to travel, when running into fork on the road on optimal path
Wait, performed again according to the above method.
The present embodiment is that the length of passage path obtains optimal path, and when driving, it is according to this acquisition optimal
The method in path, constantly optimize the driving path of scenic spot bicycle according to current location, to obtain optimal path, it is ensured that scenic spot is single
Car is travelled on optimal path.
Second of embodiment, the beautiful scenery degree of passage path on the way determine the method for optimal path and to ensure scenic spot
Method of the solo running on optimal path.
As shown in figure 4, another schematic flow sheet of optimal path is obtained in Fig. 4 present invention.Obtained most in the present embodiment
The method of shortest path comprises the following steps：
Step S01：Obtain the current position of scenic spot bicycle.The position of scenic spot bicycle can be any one position in scenic spot
Put, obtained by positioning.
Step S02：Obtain the destination locations that will be sailed for.Destination locations obtain again after need to inputting, and destination locations are
Any position in scenic spot in addition to the starting point obtained.
Step S03：Using current location as origin, destination locations are terminal, obtain all paths from origin to terminal.
According to the position of origin and terminal, all roads from origin to terminal are obtained.It is it should be noted that all in the present embodiment
Path is all roads from origin to terminal, does not wrap and passes through the modes such as lawn, pond, is referred to from the good bicycle of construction of scenic spot
Exercised on road and arrive terminal.
Step S34：It is paths ordering according to the beautiful scenery degree in each path.Obtain all paths from origin to terminal
Afterwards, then sight spot on each path is obtained, and the landscape at sight spot is given a mark, landscape is better, and fraction is higher.Count each path
The fraction at upper sight spot, and be ranked up according to fraction, and sorted according to the height of score.
Step S35：The highest that will sort is as optimal path.After being sorted according to score height, the path of highest scoring is true
It is set to the most beautiful path of landscape, this path is defined as optimal path.
As shown in figure 5, Fig. 5 is another flow that method of the scenic spot solo running on optimal path is ensured in the present invention
Schematic diagram.Ensure that method of the scenic spot solo running on optimal path comprises the following steps in the present embodiment：
Step S01：Obtain the current position of scenic spot bicycle.The position of scenic spot bicycle can be any one position in scenic spot
Put, obtained by positioning.
Step S02：Obtain the destination locations that will be sailed for.Destination locations obtain again after need to inputting, and destination locations are
Any position in scenic spot in addition to the starting point obtained.
Step S03：Using current location as origin, destination locations are terminal, obtain all paths from origin to terminal.
According to the position of origin and terminal, all roads from origin to terminal are obtained.It is it should be noted that all in the present embodiment
Path is all roads from origin to terminal, does not wrap and passes through the modes such as lawn, pond, is referred to from the good bicycle of construction of scenic spot
Exercised on road and arrive terminal.
Step S44：Obtain landscape sequence highest optimal path.After obtaining all paths from origin to terminal, then obtain
The sight spot on each path is taken, and the landscape at sight spot is given a mark, landscape is better, and fraction is higher.Count sight spot on each path
Fraction, and be ranked up according to fraction, and sorted according to the height of score.After being sorted according to score height, highest scoring
Path is defined as the most beautiful path of landscape, and this path is defined as into optimal path.
Step S25：Driving path is prompted in fork on the road.In ride, if running into fork on the road, scenic spot is single
Car reminds visitor, selects the turnout traveling on optimal path.
Step S26：Judge whether to travel according to optimal path.If so, continue step S27；If it is not, walked more than then repeating
Suddenly.In ride, by obtaining current location, optimal path is contrasted, it is determined whether travelled according to optimal path, if
Travelled according to optimal path, then continue next step.Travelled if not according to optimal path, then repeatedly above procedure, with
Current location is origin, and destination is terminal, obtains optimal path according to the method described above again, and judge again in fork on the road
Whether travel on optimal path.
Step S27：Continue to travel.If traveling then continues to travel, when running into fork on the road on optimal path
Wait, performed again according to the above method.
The present embodiment is that the beautiful scenery degree of passage path obtains optimal path, and when driving, according to this
The method for obtaining optimal path, constantly optimize the driving path of scenic spot bicycle according to current location, to obtain optimal path, really
Scenic spot solo running is protected on optimal path, visitor is while riding, moreover it is possible to preferably go sightseeing.
A kind of path optimizing system of scenic spot bicycle is also provided in the present invention.For the path optimizing system of scenic spot bicycle,
The present invention provides two preferred embodiments.
One embodiment, using following module：
As shown in fig. 6, Fig. 6 is a kind of block diagram of bicycle path optimizing system in scenic spot in the present invention.
Scenic spot bicycle optimization system includes：Client 100, server end 200, the client 100 and the server
The communication connection of end 200.
The client 100 includes main control module 101, position acquisition module 102, terminal selecting module 103, path acquisition
Module 104, the first memory module 105, display module 106, payment module 107, communication module 109, the position acquisition module
102nd, terminal selecting module 103, path acquisition module 104, the first memory module 105, display module 106, payment module 107,
Communication module 109 is electrically connected with the main control module 101 respectively, and the power module 108 is used to carry for the client 100
Power supply energy.
The server end 200 includes navigation module 201, path planning module 202, computing module 203, order module
204th, the second memory module 205, the server end 200 is used for planning and navigation to path, and passes through the communication module
109 are sent to the client 100.
Position acquisition module 102 is used to obtaining the position that scenic spot bicycle is presently in and the position of terminal.Position acquisition
Module 102, which can include d GPS locating module or other, can obtain the module of position.
Terminal selecting module 103 is used for visitor when in use, and selection on a client 100 will ride past final position.Need
It is noted that after reaching home, if also to continue to ride, should be selected again by terminal selecting module 103 next
Final position.
Path acquisition module 104 is used for the optimal path for obtaining planning.Path acquisition module is from the path of server end 200
The optimal route that planning module 202 is planned, and visitor is shown to by display module 106.
First memory module 105 is used to store the information such as language, map, history traveling record.
Display module 106 is used for show paths map, and navigation information.
Payment module 107 be used for settle accounts rent scenic spot bicycle expense, payment module 107 can at the end of riding basis
Distance of riding charge, the duration rent that can also be ridden on the estimation when renting scenic spot bicycle is used, when visitor returns the car, if
More than estimated duration of riding, then the rent for additionally increasing above the duration of scheduled time is used.
Power module 108 is used to provide electric energy.Power module 108 can be dry cell, can also be battery, Huo Zheqi
He rechargeable battery or mobile power supply.
Communication module 109 communicates for the server end 200 of client more than 100, interaction data.The communication of communication module 109
Mode is wireless communication mode, can be the wireless communication modes such as mobile communication, bluetooth communication.
Navigation module 201 is used to generate navigation information, provides navigation.The mode of navigation can be display module display navigation
Map, and the position that visitor is presently in is shown, highlight the optimal route from origin to terminal.
Path planning module 202 is used to plan path, and cooks up optimal path.Path planning module 202
The terminal selected according to origin position and visitor by terminal selecting module 103, is planned route, and obtain optimal route.
Sorted firstly the need of all paths obtained from origin to terminal, and by the length or beautiful scenery degree in each path,
Obtain optimal path.Optimal path is the most short path of path length or the most beautiful path of landscape.
Computing module 203, which is used to calculate, rents the expense of scenic spot bicycle, the distance ridden, the beautiful scenery in each path
Degree score, the length in each path.
Order module 204 is used to be ranked up the length in each path, the beautiful scenery degree score in each path, passes through row
Sequence obtains optimal path.
Second memory module 205 is for storing scenic spot map, history is ridden data, disbursement and sattlement information etc..
In the present embodiment, the course of work of scenic spot bicycle path optimizing system is：When visitor begins to use scenic spot bicycle, lead to
Cross position acquisition module 102 and obtain positional information, terminal is selected by terminal selecting module 103.Using current location as origin, with
Destination is terminal, and passage path planning module 202 obtains all paths from origin to terminal, and according to computing module 203
The length in each path calculated, the beautiful scenery degree score in each path, the length by order module 204 to each path
Degree, the beautiful scenery degree score in each path are ranked up, and optimal path is obtained by sorting.Path acquisition module 104 obtains
To after optimal path, constantly using current location as origin, destination is terminal, cooks up optimal path, to ensure bicycle row
Sail on optimal path.Navigation module 201 provides navigation, and navigation information is included on display screen 106.Terminate riding
When, computing module 203 calculates the expense this time ridden.Either, before beginning of riding, by estimating the time that will ride,
Precalculate estimated charges.After the expense of riding is calculated, payment module 107 pays expense.Main control module 101 is used to control visitor
The work of the modules of family end 100.Power module 108 is used to provide working power for client 100.
Second embodiment, adds historical data statistical module 206 on the basis of one embodiment.
Historical data statistical module 206 is united for ridden to history data, Historical Cost data, history using data
Meter, facilitates scenic spot management root according to these data, there is provided more quality service.
As shown in fig. 7, Fig. 7 is another block diagram of bicycle path optimizing system in scenic spot in the present invention.
Scenic spot bicycle optimization system includes：Client 100, server end 200, the client 100 and the server
The communication connection of end 200.
The client 100 includes main control module 101, position acquisition module 102, terminal selecting module 103, path acquisition
Module 104, the first memory module 105, display module 106, payment module 107, communication module 109, the position acquisition module
102nd, terminal selecting module 103, path acquisition module 104, the first memory module 105, display module 106, payment module 107,
Communication module 109 is electrically connected with the main control module 101 respectively, and the power module 108 is used to carry for the client 100
Power supply energy.
The server end 200 includes navigation module 201, path planning module 202, computing module 203, order module
204th, the second memory module 205, historical data statistical module 206, the server end 200 are used for the planning to path and led
Boat, and the client 100 is sent to by the communication module 109.
Historical data statistical module 206 is united for ridden to history data, Historical Cost data, history using data
Meter, facilitates scenic spot management root according to these data, there is provided more quality service.
Fig. 8 is the composition frame chart of payment module in the present invention.As shown in figure 8, payment module 107 includes mobile payment module
1071st, payment module 1072, auto deduction module 1073 are supplemented with money.When paying the expense for renting scenic spot bicycle, shifting can be passed through
The dynamic mode paid pays expense, such as the mobile payment mode such as Alipay, wechat, Net silver pays scenic spot bicycle rent and used.
Payment module 1072 is supplemented with money to be used to pay the rent of scenic spot bicycle use by way of rechargeable card.Auto deduction module
1073 are used for the expense that the bales catch from visitor's account removes this rental scenic spot bicycle.
Fig. 9 is the composition frame chart of computing module in the present invention.As shown in figure 9, computing module 203 includes distance computing module
2031st, expense computing module 2032, beautiful scenery degree computing module 2033.Distance computing module 2031 is used to calculate each path
Length, the data such as the distance ridden.Expense computing module 2032 is used to calculate the expense that visitor rents scenic spot bicycle, hire order
Car can be with distance of riding come computational costs, can also be with the time of riding come computational costs.Beautiful scenery degree computing module
The 2033 landscape fraction for calculating each path, landscape fraction highest are the most beautiful path of landscape.
In summary, the method for optimizing route and system of the scenic spot bicycle in the present invention.On the one hand, visitor is facilitated to go sightseeing,
Avoid wasting time because route is unfamiliar with；On the other hand, management of the scenic spot to visitor and the investigation to tour are facilitated
And statistics, to facilitate scenic spot to provide more quality service as visitor.
Although describing the present invention with reference to exemplary embodiment, it is to be understood that, term used is explanation and example
Property and nonrestrictive term.Because the present invention can be embodied without departing from the spiritual or substantive of invention in a variety of forms,
It should therefore be appreciated that above-mentioned embodiment is not limited to any foregoing details, and should be in the spirit that appended claims are limited
With widely explained in scope, therefore the whole changes fallen into claim or its equivalent scope and remodeling all should be the power of enclosing
Profit requires to be covered.
Claims (10)
- A kind of 1. method for optimizing route of scenic spot bicycle, it is characterised in that including：Obtain the current position of scenic spot bicycle；Obtain the destination locations that will be sailed for；Using current location as origin, destination locations are terminal, obtain all paths from origin to terminal；Determine optimal path.
- 2. the method for optimizing route of scenic spot bicycle according to claim 1, it is characterised in that the determination optimal path Method includes：Calculate each path length；The most short path of path length is defined as optimal path.
- 3. the method for optimizing route of scenic spot bicycle according to claim 2, it is characterised in that ensure that scenic spot solo running exists Method on optimal path includes：The most short optimal path of acquisition approach length；Route is prompted in fork on the road；Judge whether to travel by optimal path；If it is not, optimal path is planned again, if so, continuing to travel.
- 4. the method for optimizing route of scenic spot bicycle according to claim 1, it is characterised in that the determination optimal path Method includes：It is paths ordering according to the beautiful scenery degree in each path；The highest that will sort is as optimal path.
- 5. the method for optimizing route of scenic spot bicycle according to claim 4, it is characterised in that ensure that scenic spot solo running exists Method on optimal path includes：Obtain landscape sequence highest optimal path；Route is prompted in fork on the road；Judge whether to travel by optimal path；If it is not, optimal path is planned again, if so, continuing to travel.
- A kind of 6. path optimizing system of scenic spot bicycle, it is characterised in that including：Client, server end, the client and The server end communication connection；The client includes main control module, position acquisition module, terminal selecting module, path acquisition module, the first storage mould Block, display module, payment module, communication module, the position acquisition module, terminal selecting module, path acquisition module, first Memory module, display module, payment module, communication module are electrically connected with the main control module respectively, and the power module is used In providing electric energy for the client；The server end includes navigation module, path planning module, computing module, order module, the second memory module, described Server end is used for planning and navigation to path, and is sent to the client by the communication module.
- 7. the path optimizing system of scenic spot bicycle according to claim 6, it is characterised in that the server end includes well Historical data statistical module, for being counted to history layout data, historical navigation data, history using data.
- 8. the route optimization system of the scenic spot bicycle according to claim 6 or 7, it is characterised in that the payment module bag Include：Mobile payment module for mobile payment, for supplement payment with money supplement payment module, the bales catch for auto deduction with money Money module.
- 9. the route optimization system of the scenic spot bicycle according to claim 6 or 7, it is characterised in that the computing module bag Include for calculate distance distance computing module, the expense computing module for computational costs, for count calculate beautiful scenery The beautiful scenery degree computing module of degree.
- 10. the route optimization system of the scenic spot bicycle according to power requires 6, it is characterised in that the communication of the communication module Mode is wireless communication mode.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710808773.6A CN107862401A (en) | 2017-09-09 | 2017-09-09 | A kind of method for optimizing route and system of scenic spot bicycle |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710808773.6A CN107862401A (en) | 2017-09-09 | 2017-09-09 | A kind of method for optimizing route and system of scenic spot bicycle |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107862401A true CN107862401A (en) | 2018-03-30 |
Family
ID=61699250
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710808773.6A Pending CN107862401A (en) | 2017-09-09 | 2017-09-09 | A kind of method for optimizing route and system of scenic spot bicycle |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107862401A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108961582A (en) * | 2018-06-14 | 2018-12-07 | 珠海天人科技有限公司 | A kind of green tour remotely rides operation system and its method for running |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105046627A (en) * | 2015-07-21 | 2015-11-11 | 青岛市光电工程技术研究院 | Beidou navigation positioning technology based intelligent management system for bicycles in scenic spot |
| US9569745B1 (en) * | 2015-07-27 | 2017-02-14 | Amazon Technologies, Inc. | Dynamic vehicle routing for regional clusters |
| CN106534384A (en) * | 2017-01-03 | 2017-03-22 | 上海量明科技发展有限公司 | Method, device and system for optimizing path of shared bicycle |
-
2017
- 2017-09-09 CN CN201710808773.6A patent/CN107862401A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105046627A (en) * | 2015-07-21 | 2015-11-11 | 青岛市光电工程技术研究院 | Beidou navigation positioning technology based intelligent management system for bicycles in scenic spot |
| US9569745B1 (en) * | 2015-07-27 | 2017-02-14 | Amazon Technologies, Inc. | Dynamic vehicle routing for regional clusters |
| CN106534384A (en) * | 2017-01-03 | 2017-03-22 | 上海量明科技发展有限公司 | Method, device and system for optimizing path of shared bicycle |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108961582A (en) * | 2018-06-14 | 2018-12-07 | 珠海天人科技有限公司 | A kind of green tour remotely rides operation system and its method for running |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10969234B2 (en) | Multimodal vehicle routing system and method with vehicle parking | |
| CN104864883B (en) | Electric automobile paths planning method based on cloud platform | |
| CN104182492B (en) | Information provider unit | |
| CN102110362B (en) | Method and system for processing travel route planning | |
| CN104024800B (en) | Can coverage area computing device, method | |
| Wang | An optimal location choice model for recreation-oriented scooter recharge stations | |
| CN103674046B (en) | Vehicle travel is planned | |
| JP5120204B2 (en) | Travel guidance device, travel guidance method, and computer program | |
| CN107782327A (en) | The vehicle routing problem of energetic optimum | |
| CN109255068A (en) | A kind of charging pile management method, device, server and system | |
| CN104748753B (en) | A kind of online air navigation aid and online navigation system | |
| CN107036617A (en) | The traffic path method and system for planning that a kind of taxi is combined with subway | |
| US20140188382A1 (en) | Vehicle route planning method and apparatus | |
| CN106504577A (en) | A kind of park and shift traffic path method and device for planning | |
| CN106548242A (en) | Vehicle order distribution method and device | |
| CN107491826A (en) | A kind of express delivery based on traffic shared platform incidentally system and method | |
| CN1673686A (en) | Navigation systems | |
| US11358478B2 (en) | Light electric vehicle with dynamic gear ratio selection feature | |
| CN102374868A (en) | Route search device, route search method, and corresponding computer program | |
| CN103376116B (en) | Scenic route planning in automobile navigation | |
| CN105026893B (en) | time efficient traffic routing system | |
| CN111879329B (en) | Customized public transport passable shortest path calculation method based on A-x algorithm | |
| CN106441325A (en) | Intermodal navigation system and method | |
| CN107024219A (en) | A kind of park and shift paths planning method and device | |
| CN109615901A (en) | A kind of parking management system and method based on big data |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20180330 |