CN108491964A - A method of visiting route according to GPS location Automatic Optimal - Google Patents
A method of visiting route according to GPS location Automatic Optimal Download PDFInfo
- Publication number
- CN108491964A CN108491964A CN201810203252.2A CN201810203252A CN108491964A CN 108491964 A CN108491964 A CN 108491964A CN 201810203252 A CN201810203252 A CN 201810203252A CN 108491964 A CN108491964 A CN 108491964A
- Authority
- CN
- China
- Prior art keywords
- route
- coordinate
- optimal
- gps location
- visit
- 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
- 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
- G06Q30/00—Commerce
- G06Q30/01—Customer relationship services
- G06Q30/015—Providing customer assistance, e.g. assisting a customer within a business location or via helpdesk
- G06Q30/016—After-sales
Abstract
A kind of method for visiting route according to GPS location Automatic Optimal, includes the following steps in the present invention：Information collection, data conversion, storage, route is split and route optimization.It using optimal route provided by the invention, can directly reduce in the way time, improve the time in the shop of employee, effective percentage improves about 15%, reduces manpower use cost indirectly.Daily visit rate is improved, increases visit shop number, increases sales order.The personal management of enterprise is horizontal, and blind shop rate is reduced by 10%, and the mode that the shops of covering is visited all in accordance with route is completed, and the complexity of conventional management is reduced, and reduces management cost.
Description
Technical field
The present invention relates to a kind of methods for visiting route according to GPS location Automatic Optimal, belong to mobile office application field.
Background technology
With the arriving of Internet era, management has slowly all moved towards information-based, intelligent, sells industry soon and developed in recent years
It is also very rapid, but due to the particularity of its industry, slowly could not really goes on the ranks of information management, business personnel's
Working time is mostly field personnel visit shops, and working time, range, efficiency are difficult to monitor, and it is not clear that shops is visited in field personnel
Route optimization guidance, visit efficiency it is low, work it is no it is planned very arbitrarily, blind shop, dead shop be nobody shows any interest in and suffered from and do not fit
The tool support of conjunction, company can not track the visit situation of assessment business field personnel.
Under the form of this sternness, in pin industry development soon, industry is generally accepted and executed visits door according to route
The mode in shop, but without rational route planning, in the process of implementation, route sequence is chaotic, visits, the odd-numbered day excessively high in the way time
It is relatively low to visit shops's number.For the above visit drawback, visit effect must be improved by a kind of method of Automatic Optimal route
Rate was reduced in the way time, realized that corporate resource maximizes.
Invention content
The present invention is in view of the deficienciess of the prior art, provide a kind of side for visiting route according to GPS location Automatic Optimal
Method utilizes GPS positioning record, router algorithm and database technology.All GPS locations in the route visited, profit are needed by one
One is calculated in the most short route most saved with the time in path, solves field personnel route by way of comparison with weighting algorithm
Optimal route.
The technical solution that the present invention solves above-mentioned technical problem is as follows：One kind visiting route according to GPS location Automatic Optimal
Method, include the following steps：
S1 information collections：Segregated account is logged in from mobile terminal, acquires the specific coordinate information and dependency basis to call on a customer
Plinth data uploads to route optimization system, establishes independent customer basis archives one by one, they uniformly belong to this independence
Account；
S2 data conversions：After route optimization system receives the information that these call on a customer, the coordinate solution come up will be acquired
It analyses on map, the conversion between system latitude and longitude coordinates is then carried out, in systems corresponding coordinate points mark after conversion
Note on map, behind can to the client belonging to account carry out route optimization；
S3 is stored：It is converted into coordinate in map side, is stored into database；
S4 routes are split：The block being responsible for into administrative staff according to storage map reference divides, and obtains the block automatically and is covered
The GPS coordinate point of lid；Then according to management latitude, limiting factor (s) is added, splits out visit route automatically；
S5 route optimizations：
(1) according to specific requirements layout at single course, calling on a customer for currently needing to distribute is dispersed on map, is chosen
Needing to be assigned to client's coordinate in route can be assigned；
(2) scheme optimized to the visit of single course sequence is：Coordinate on map is converted to xy axis by system,
It determines all routes, then therefrom selects minimal path as optimal route.
The present invention is further arranged to, after completing route optimization, you can optimal route is downloaded from mobile terminal, according to optimal
Route is visited.
The present invention is further arranged to, and the transfer algorithm between the system latitude and longitude coordinates is as follows：Decimal
Degrees=Degrees+minutes/60+seconds/3600.
The present invention is further arranged to, and the limiting factor (s) includes personnel, role, shops's significance level or visit period.
The present invention is further arranged to, and the scheme optimized to the visit sequence of single course is specially：
A, projection zone is determined：The whole world is divided into multiple projection zones by warp；
B, it converts：Coordinate (longitude and latitude) on sphere is scaled to the circular cylindrical coordinate of projection using trigonometric function；
C, all routes are determined：According to all the points for the successful route that finally converts, after determining a starting point, carry out
The algorithm for traversing bubbling, obtains all link line footpaths；
D, it compares preferentially：Intersect the shortest path of route for comparing and obtaining, carry out the storage of database, determine one it is optimal
Path.
The present invention is further arranged to, and is determined in projection zone, in engineer's scale 1：2.5 ten thousand -1：6 ° of points of bands are used on 500000 figures,
Comparative example ruler is 1：10000 and be more than 1：10000 figure uses 3 ° of points of bands.
Preferably, it determines in projection zone using 6 ° of points of band methods：From Greenwich zero degree warp, every 6 ° are divided into a projection
Band, the whole world are divided into 60 projection zones, and 0 ° -6 ° from east longitude of the Eastern Hemisphere is first band, and central meridian is 3 °, and so on, projection
Reel number is 1-30；It projects the calculation formula of code name n and central meridian longitude L0：L0=(6n-3) °；The Western Hemisphere projection zone from
180 ° are back-calculated to 0 °, number 31-60, and the calculation formula of projection code name n and central meridian longitude L0 is L0=360- (6n-
3)°。
Using optimal route provided by the invention, it can directly reduce in the way time, improve the time in the shop of employee, effectively
Rate improves about 15%, reduces manpower use cost indirectly.Daily visit rate is improved, increases visit shop number, increases sale and order
It is single.The personal management of enterprise is horizontal, blind shop rate is reduced by 10%, the mode that the shops of covering is visited all in accordance with route is complete
At reducing the complexity of conventional management, reduce management cost.
Description of the drawings
It to describe the technical solutions in the embodiments of the present invention more clearly, below will be to needed in the embodiment
Attached drawing is briefly described, it should be apparent that, drawings in the following description are only some embodiments of the invention, for this field
For those of ordinary skill, without creative efforts, other drawings may also be obtained based on these drawings.
Fig. 1 is a kind of potential route being not optimised；
Fig. 2 is a kind of potential route being not optimised；
Fig. 3 is optimization route；
Fig. 4 is route optimization system data transmission figure；
Fig. 5 is a kind of potential route example being not optimised；
Fig. 6 is client's sequence in route in Fig. 5；
Fig. 7 is the optimization route of Fig. 5；
Fig. 8 is client's sequence in route in Fig. 7.
Specific implementation mode
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation describes, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
The present invention utilizes mobile terminal system and background management system, is developed based on C# language, using scanning algorithm,
Scanning algorithm is a kind of algorithm of " route re-optimization after being first grouped ", some is given in the site of certain area by so-called grouping
People, then winding displacement within the scope of this again, optimization.Route optimization is to choose a point as polar starting origin, and one
The connecting line of any one site and origin in connected graph is defined as zero degree, establishes polar coordinate system.Then to all visits
Position where point carries out polar coordinate transform, then builds group since minimum angles site, and counterclockwise, site is added one by one
Enter into group, path optimization finally is carried out to the single circuit in each group.It both ensure that the accuracy of route optimization in this way, closed
Rationality in turn ensures the coverage rate of site.
Specifically, the method for the present invention for visiting route according to GPS location Automatic Optimal, includes the following steps：
S1 information collections：Segregated account is logged in from mobile terminal, acquires the specific coordinate information and dependency basis to call on a customer
Plinth data uploads to route optimization system, establishes independent customer basis archives one by one, they uniformly belong to this independence
Account, the present invention in data transmission relations it is as shown in Figure 4；
S2 data conversions：After route optimization system receives the information that these call on a customer, the coordinate solution come up will be acquired
It analyses on map, then carries out the conversion between system latitude and longitude coordinates, transfer algorithm is：Decimal Degrees=
Degrees+minutes/60+seconds/3600.Corresponding coordinate points are labeled on map in systems after conversion, after
Face can carry out route optimization to the client belonging to account；
S3 is stored：It is converted into coordinate in map side, is stored into database；
S4 routes are split：The block being responsible for into administrative staff according to storage map reference divides, and obtains the block automatically and is covered
The GPS coordinate point of lid；Then according to management latitude, be added personnel, role, shops's significance level or visit period etc. limit because
Element splits out visit route automatically；
S5 route optimizations：
(1) according to specific requirements layout at single course, the rule of conventional layout route currently needs generally with region division
Calling on a customer for being distributed is dispersed on map, can choose the client's coordinate for needing to be assigned in route that can divide with loop graph function
With completion；
(2) after circuit is assigned, user only needs to choose one of client's coordinate points to be starting point, clicks our systems
On Automatic Optimal button, system is just automatic to execute assignment algorithm, calculates the visit sequence of most reasonable；
(3) scheme optimized to the visit of single course sequence is：Coordinate on map is converted to xy axis by system,
Determine all routes, if you need to visit eight clients of A, B, C, D, E, F, G, H, possible route is very more, in Fig. 1 and Fig. 2
Route be two of which, then therefrom select minimal path as optimal route, specifically：
A, projection zone is determined：The whole world is divided into multiple projection zones by warp, in engineer's scale 1：2.5 ten thousand -1：On 500000 figures
Using 6 ° of points of bands, comparative example ruler is 1：10000 and be more than 1：10000 figure uses 3 ° of points of bands.For using 6 ° of points of band methods, from Green
Prestige is controlled zero degree warp and is risen, and every 6 ° are divided into a projection zone, and the whole world is divided into 60 projection zones, the Eastern Hemisphere from 0 ° -6 ° of east longitude be the
One band, central meridian are 3 °, and so on, projection reel number is 1-30；It is public that it projects the calculating of code name n and central meridian longitude L0
Formula is：L0=(6n-3) °；The Western Hemisphere projection zone is back-calculated from 180 ° to 0 °, number 31-60, projects code name n and central meridian warp
The calculation formula for spending L0 is L0=360- (6n-3) °.
B, it converts：Coordinate (longitude and latitude) on sphere is scaled to the circular cylindrical coordinate of projection using trigonometric function；
C, all routes are determined：According to all the points for the successful route that finally converts, after determining a starting point, carry out
The algorithm for traversing bubbling, obtains all link line footpaths；
D, it compares preferentially：Intersect the shortest path of route for comparing and obtaining, carry out the storage of database, determine one it is optimal
Path, i.e., route shown in Fig. 3.
After S6 completes route optimization, you can download optimal route from mobile terminal, visited according to optimal route.
Illustrate advantages of the present invention in order to clearer, the optimization route obtained with regular course and according to the present invention carries out
Comparison, with reference to figure 5-8.Fig. 5 represents a kind of conventional route for not using the method for the present invention, and Fig. 6 is corresponding to call on a customer
Sequencing, can as seen from the figure, and route is complicated, and total route is longer, will necessarily delay for a long time, efficiency is very low.Fig. 8
For the corresponding sequencings to call on a customer of Fig. 7, the route as seen from Figure 7 that can be apparent from is simply clear, and distance is most short, because
This can be with the saving plenty of time of maximum possible and energy.
The foregoing is merely presently preferred embodiments of the present invention, is not intended to limit the invention, it is all the present invention spirit and
Within principle, any modification, equivalent replacement, improvement and so on should all be included in the protection scope of the present invention.
Claims (7)
1. a kind of method for visiting route according to GPS location Automatic Optimal, which is characterized in that include the following steps：
S1 information collections：Segregated account is logged in from mobile terminal, acquires the specific coordinate information to call on a customer and relevant rudimentary money
Material uploads to route optimization system, establishes independent customer basis archives one by one, they uniformly belong to this independent account
Family；
S2 data conversions：After route optimization system receives the information that these call on a customer, the coordinate resolution that acquisition comes up is arrived
On map, the conversion between system latitude and longitude coordinates is then carried out, corresponding coordinate points are labeled in systems after conversion
On map；
S3 is stored：It is converted into coordinate in map side, is stored into database；
S4 routes are split：The block being responsible for into administrative staff according to storage map reference divides, and obtains what the block was covered automatically
GPS coordinate point；Then according to management latitude, limiting factor (s) is added, splits out visit route automatically；
S5 route optimizations：
(1) according to specific requirements layout at single course, calling on a customer for currently needing to distribute is dispersed on map, chooses needs
The client's coordinate being assigned in route can be assigned；
(2) scheme optimized to the visit of single course sequence is：Coordinate on map is converted to xy axis by system, is determined
Go out all routes, then therefrom selects minimal path as optimal route.
2. the method according to claim 1 for visiting route according to GPS location Automatic Optimal, which is characterized in that complete road
After line optimization, you can download optimal route from mobile terminal, visited according to optimal route.
3. the method according to claim 1 for visiting route according to GPS location Automatic Optimal, which is characterized in that the system
Transfer algorithm between latitude and longitude coordinates of uniting is as follows：Decimal Degrees=Degrees+minutes/60+seconds/
3600。
4. the method according to claim 1 for visiting route according to GPS location Automatic Optimal, which is characterized in that the limit
It includes personnel, role, shops's significance level or visit period to determine factor.
5. the method according to claim 1 for visiting route according to GPS location Automatic Optimal, which is characterized in that single
The scheme that optimizes of visit sequence of route is specially：
A, projection zone is determined：The whole world is divided into multiple projection zones by warp；
B, it converts：Using trigonometric function by the coordinate transformation on sphere be projection circular cylindrical coordinate；
C, all routes are determined：It is traversed after determining a starting point according to all the points for the successful route that finally converts
The algorithm of bubbling obtains all link line footpaths；
D, it compares preferentially：Intersect the shortest path for comparing obtained route, carries out the storage of database, determine an optimal road
Diameter.
6. the method according to claim 5 for visiting route according to GPS location Automatic Optimal, which is characterized in that determine and throw
In shadow bands, in engineer's scale 1：2.5 ten thousand -1：It is 1 that 6 ° of points of bands, comparative example ruler are used on 500000 figures：10000 and be more than 1：10000 figure is adopted
With 3 ° of points of bands.
7. the method according to claim 5 for visiting route according to GPS location Automatic Optimal, which is characterized in that determine and throw
Using 6 ° of points of band methods in shadow bands：0 ° -6 ° from east longitude of the Eastern Hemisphere is first band, and central meridian is 3 °, and so on, projection reel number is
1-30；It projects the calculation formula of code name n and central meridian longitude L0：L0=(6n-3) °；The Western Hemisphere projection zone is returned from 180 °
It calculates to 0 °, number 31-60, the calculation formula of projection code name n and central meridian longitude L0 is L0=360- (6n-3) °.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810203252.2A CN108491964A (en) | 2018-03-13 | 2018-03-13 | A method of visiting route according to GPS location Automatic Optimal |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810203252.2A CN108491964A (en) | 2018-03-13 | 2018-03-13 | A method of visiting route according to GPS location Automatic Optimal |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108491964A true CN108491964A (en) | 2018-09-04 |
Family
ID=63338776
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810203252.2A Pending CN108491964A (en) | 2018-03-13 | 2018-03-13 | A method of visiting route according to GPS location Automatic Optimal |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108491964A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110363323A (en) * | 2018-11-20 | 2019-10-22 | 南京掌控网络科技有限公司 | A kind of Intelligent planning method, system and the equipment of periodicity customer visit route |
| CN112348601A (en) * | 2020-12-04 | 2021-02-09 | 上海晶确科技有限公司 | Service development route planning method |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101349567A (en) * | 2008-07-29 | 2009-01-21 | 方圆信通科技（北京）有限公司 | Method for providing local mobile geographical information service based on GPS and mobile terminal |
| CN103069416A (en) * | 2010-08-31 | 2013-04-24 | 株式会社东芝 | Electronic map data processing system |
| CN104601626A (en) * | 2013-10-31 | 2015-05-06 | 大连智友软件科技有限公司 | Customer visit method based on mobile terminal |
| CN104636872A (en) * | 2015-02-11 | 2015-05-20 | 厦门雅迅网络股份有限公司 | Method and device for recording action and visit duration of field operation worker |
| CN105184422A (en) * | 2015-09-28 | 2015-12-23 | 华南理工大学 | Intelligent tour route planning auxiliary method based on internet word frequency |
| CN105528649A (en) * | 2015-11-30 | 2016-04-27 | 山东烟草研究院有限公司 | Route optimization recommendation method based on clustering and saving algorithms |
| US20170024666A1 (en) * | 2012-07-12 | 2017-01-26 | Stubhub, Inc. | User preferred venue seating |
| CN106709678A (en) * | 2016-11-16 | 2017-05-24 | 上海卓易云汇智能技术有限公司 | Object transportation method and system |
-
2018
- 2018-03-13 CN CN201810203252.2A patent/CN108491964A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101349567A (en) * | 2008-07-29 | 2009-01-21 | 方圆信通科技（北京）有限公司 | Method for providing local mobile geographical information service based on GPS and mobile terminal |
| CN103069416A (en) * | 2010-08-31 | 2013-04-24 | 株式会社东芝 | Electronic map data processing system |
| US20170024666A1 (en) * | 2012-07-12 | 2017-01-26 | Stubhub, Inc. | User preferred venue seating |
| CN104601626A (en) * | 2013-10-31 | 2015-05-06 | 大连智友软件科技有限公司 | Customer visit method based on mobile terminal |
| CN104636872A (en) * | 2015-02-11 | 2015-05-20 | 厦门雅迅网络股份有限公司 | Method and device for recording action and visit duration of field operation worker |
| CN105184422A (en) * | 2015-09-28 | 2015-12-23 | 华南理工大学 | Intelligent tour route planning auxiliary method based on internet word frequency |
| CN105528649A (en) * | 2015-11-30 | 2016-04-27 | 山东烟草研究院有限公司 | Route optimization recommendation method based on clustering and saving algorithms |
| CN106709678A (en) * | 2016-11-16 | 2017-05-24 | 上海卓易云汇智能技术有限公司 | Object transportation method and system |
Non-Patent Citations (1)
| Title |
|---|
| 姜丽慧: ""快消品企业在农村地区的移动商务应用研究"", 《中国优秀硕士学位论文全文数据库 经济与管理科学辑》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110363323A (en) * | 2018-11-20 | 2019-10-22 | 南京掌控网络科技有限公司 | A kind of Intelligent planning method, system and the equipment of periodicity customer visit route |
| CN110363323B (en) * | 2018-11-20 | 2023-04-07 | 南京掌控网络科技有限公司 | Intelligent planning method, system and equipment for periodic customer visit route |
| CN112348601A (en) * | 2020-12-04 | 2021-02-09 | 上海晶确科技有限公司 | Service development route planning method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11922366B2 (en) | System and method for dynamic pairing function optimization | |
| Cheng et al. | A GIS approach to shopping mall location selection | |
| Horner et al. | Optimizing hurricane disaster relief goods distribution: model development and application with respect to planning strategies | |
| Jung et al. | Integration of GIS, GPS, and optimization technologies for the effective control of parcel delivery service | |
| CN107464018A (en) | A kind of Distribution path optimization method and device, computer equipment, storage medium | |
| CN104751312B (en) | A kind of logistics information of freight source active obtaining system and method based on LBS | |
| CN108896051B (en) | Shopping navigation method and device, electronic equipment and storage medium | |
| CN109151890A (en) | A kind of mobile terminal locating method and device | |
| CN103148857B (en) | Information providing method and system thereof | |
| CN105208652B (en) | A kind of indoor locating system based on wireless technology | |
| CN101900565A (en) | Path determining method and device | |
| CN103822638B (en) | The treating method and apparatus of customer position information | |
| US20200394581A1 (en) | Non-linear systems and methods for destination selection | |
| CN104636457B (en) | A kind of method and device of location finding cognition | |
| CN109829120A (en) | A kind of Tourism Information Applying System | |
| CN108491964A (en) | A method of visiting route according to GPS location Automatic Optimal | |
| CN105869512A (en) | Multi-information mixed measurement mapping method and device | |
| CN106888433B (en) | Identical service request position privacy protection method based on Thiessen polygon | |
| US20170358015A1 (en) | User Location History Implies Diminished Review | |
| JP3860867B2 (en) | Schedule creation device based on geographic information | |
| Meire et al. | A bimodal accessibility analysis of Australia through application programming interfaces | |
| CN114692968A (en) | Number taking processing method and device and electronic equipment | |
| CN113505945A (en) | BD card punching and shop visiting method for maintaining customer relationship and supervising BD personnel | |
| CN107038239A (en) | A kind of mapable rendering method of agricultural product industry information | |
| Horowitz | Lowry-type land use models |
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: 20180904 |