CN117433557A - Customer visit route planning and navigation method - Google Patents
Customer visit route planning and navigation method Download PDFInfo
- Publication number
- CN117433557A CN117433557A CN202311764888.1A CN202311764888A CN117433557A CN 117433557 A CN117433557 A CN 117433557A CN 202311764888 A CN202311764888 A CN 202311764888A CN 117433557 A CN117433557 A CN 117433557A
- Authority
- CN
- China
- Prior art keywords
- client
- visited
- map application
- path
- application program
- 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 33
- 238000012216 screening Methods 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 8
- 230000006870 function Effects 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000006872 improvement Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000004590 computer program Methods 0.000 description 2
- 238000005265 energy consumption Methods 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000009467 reduction Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 235000013361 beverage Nutrition 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 235000011869 dried fruits Nutrition 0.000 description 1
- 235000013305 food Nutrition 0.000 description 1
- 235000013611 frozen food Nutrition 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3446—Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags, using precalculated routes
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3407—Route searching; Route guidance specially adapted for specific applications
Abstract
The invention discloses a method for planning and navigating a customer visit route, which relates to the technical field of path planning navigation, and comprises the following steps: acquiring the name of a client in a client subset to be visited and longitude and latitude address information corresponding to the name of the client; marking all client nodes in the client subset to be visited as unvisited; setting the current position positioned in the map application program as an initial node, and adding longitude and latitude position information of the initial node into a to-be-visited client path list; taking the current position as a starting point, calculating the distance between the current position and a node in an unvisited state, and determining the node closest to the current position; adding the client node closest to the current position into a list of to-be-visited client paths; and sending the to-be-visited client path to the map application program. Automatic planning and navigation of the visiting customer path are realized.
Description
Technical Field
The invention relates to the technical field of path planning navigation, in particular to a customer visit route planning and navigation method.
Background
Business personnel have long set customer visit routes empirically. Under the condition that a plurality of clients are responsible for service personnel, the problems of complicated and time-consuming missing of the to-be-visited clients or visiting of the clients and long driving mileage exist. With the development of the mobile internet, the client relationship management software is widely applied to mobile devices, so that the fine management of the business is possible. How to realize the automatic planning of the visiting customer path in the customer management software is a problem to be solved.
Disclosure of Invention
The invention provides a method for planning and navigating a visiting route of a client, which realizes the automatic planning and navigation of a visiting client path.
According to an aspect of the present disclosure, there is provided a method for planning and navigating a visited route of a customer, the method comprising:
s1, acquiring the name of a client in a client subset to be visited and longitude and latitude address information corresponding to the name of the client;
s2, marking all client nodes in the client subset to be visited as an unvisited state;
s3, setting the current position positioned in the map application program as an initial node, and adding longitude and latitude position information of the initial node into a to-be-visited client path list;
s4, calculating the distance between the current position and the node in the non-access state by taking the current position as a starting point, and determining the node closest to the current position;
s5, adding the client node closest to the current position into a list of the to-be-visited client paths;
s6, marking the client node newly added into the to-be-visited client path list as a visited state;
s7, taking the client nodes newly added into the to-be-visited client path list as starting points, and repeating the steps S4-S6 until all the client nodes are marked as visited;
s8, connecting the last accessed client node with the initial position, and determining a client path to be accessed;
s9, sending the to-be-visited customer path to the map application program; the to-be-visited client path comprises position information and sequence information of client nodes;
and S10, the map application program carries out navigation of the route according to the to-be-visited client path.
In one possible implementation manner, before acquiring the client name in the client subset to be visited and the latitude and longitude address information corresponding to the client name, the method further includes:
determining a client to be visited according to the client category;
acquiring client information of a client to be visited, wherein the client information comprises client name and address information;
converting the address information into address information represented by longitude and latitude;
invoking a map application program, and displaying the position of the client to be visited in a user interface of the map application program;
and acquiring a subset of the clients to be visited, which is selected by a user through a map application user interface.
In one possible implementation manner, the determining the to-be-visited client according to the client category includes:
and selecting the client category according to the regional category of the client and the industry category of the client, and screening the client to be visited.
In one possible implementation manner, the obtaining the subset of clients to be visited selected by the user through the map application user interface includes:
and selecting client nodes of the map application program interface through a preset function-selecting button, and generating a client subset to be visited according to the selected client nodes of the map application program interface.
According to an aspect of the present disclosure, there is provided an electronic apparatus, wherein the electronic apparatus includes:
a processor and a memory storing computer executable instructions that, when executed, cause the processor to perform the one of the customer visit route planning and navigation methods.
According to an aspect of the present disclosure, there is provided a computer readable storage medium storing one or more instructions that, when executed by a processor, implement the method of customer visit route planning and navigation.
Compared with the prior art, the invention has the beneficial effects that:
according to the method for planning and navigating the visiting route of the client, a plurality of clients are selected in a map application program interface, the clients to be visited are determined, the sequence of the clients to be visited is determined through a path algorithm, and the determined sequence and the determined position mode of the clients to be visited are used for a program in a map, so that planning and navigating are performed. Therefore, the service staff can automatically form the visit paths for a plurality of clients to be visited only by selecting the client range to be visited from the client software, and the paths are time-saving, mileage-saving, work efficiency improvement and automobile energy consumption reduction. And planning a route of the client to be visited in the application program, wherein the planning of the visited route has the minimum cost.
Drawings
Fig. 1 shows a flow diagram of a method for customer visit route planning and navigation in accordance with an embodiment of the present disclosure.
Detailed Description
Various exemplary embodiments, features and aspects of the disclosure will be described in detail below with reference to the drawings. In the drawings, like reference numbers indicate identical or functionally similar elements. Although various aspects of the embodiments are illustrated in the accompanying drawings, the drawings are not necessarily drawn to scale unless specifically indicated.
The word "exemplary" is used herein to mean "serving as an example, embodiment, or illustration. Any embodiment described herein as "exemplary" is not necessarily to be construed as preferred or advantageous over other embodiments.
In addition, numerous specific details are set forth in the following detailed description in order to provide a better understanding of the present disclosure. It will be understood by those skilled in the art that the present disclosure may be practiced without some of these specific details. In some instances, methods, means, elements, and circuits well known to those skilled in the art have not been described in detail in order not to obscure the present disclosure.
Referring to fig. 1, according to an aspect of the present disclosure, there is provided a method for planning and navigating a visited route of a customer, the method comprising:
determining a client to be visited according to the client category;
for example, in one possible implementation, the determining the to-be-visited client according to the client class includes: and selecting the client category according to the regional category of the client and the industry category of the client, and screening the client to be visited.
For example, the user interface of the client management application includes a box for the client major class, a box for the client sub-class, and a box for the tile major class. For example, the customer's major categories include foods, daily necessities, toys, clothing, and the like. The customer subclass includes: beverages, dried fruits, frozen foods, and the like. The general category of the areas can also be selected, for example, urban area, yellow island area, urban area, and the like.
After determining the selection boxes of the customer major class, the customer minor class and the region major class selected by the user, the map application displays the region of the selected region, and simultaneously, the map application displays map positions of a plurality of customers in the form of dots.
Acquiring client information of a client to be visited, wherein the client information comprises client name and address information;
converting the address information into address information represented by longitude and latitude;
invoking a map application program, and displaying the position of the client to be visited in a user interface of the map application program;
and acquiring a subset of the clients to be visited, which is selected by a user through a map application user interface. For example, the shape of the selected region is initially selected by a small hand button of the map application user interface, and after the mouse clicks on the small hand button, the selection of a circle, polygon, or rectangle is initiated. When the selected map is round, clicking a left button in the map interface to drag, and loosening a left button of a mouse after drawing is completed; when the polygon is selected, clicking the left key to select the starting point, continuing clicking the left key to select the next point, and after drawing is completed, clicking the left mouse key; and when the rectangle is selected, clicking a left mouse button in the map interface to drag, and releasing the left mouse button after drawing is completed.
When all clients are displayed on the map and a route is set, regional clients can be defined on the map in three modes of polygons, quadrilaterals and circles, so that a user can conveniently and intuitively set a visiting route on the map.
In one possible implementation manner, the obtaining the subset of clients to be visited selected by the user through the map application user interface includes:
and selecting client nodes of the map application program interface through a preset function-selecting button, and generating a client subset to be visited according to the selected client nodes of the map application program interface. For example, a plurality of dots included within a selection range of a circle of the map application interface are displayed for the locations of the clients in the subset of clients to be visited in the map.
Fig. 1 shows a flow chart of a method for planning and navigating a visited route of a customer according to an embodiment of the disclosure, as shown in fig. 1, the method includes:
s1, acquiring the name of a client in a client subset to be visited and longitude and latitude address information corresponding to the name of the client;
s2, marking all client nodes in the client subset to be visited as an unvisited state;
s3, setting the current position positioned in the map application program as an initial node, and adding longitude and latitude position information of the initial node into a to-be-visited client path list;
s4, calculating the distance between the current position and the node in the non-access state by taking the current position as a starting point, and determining the node closest to the current position;
s5, adding the client node closest to the current position into a list of the to-be-visited client paths;
s6, marking the client node newly added into the to-be-visited client path list as a visited state;
s7, taking the client nodes newly added into the to-be-visited client path list as starting points, and repeating the steps S4-S6 until all the client nodes are marked as visited;
s8, connecting the last accessed client node with the initial position, and determining a client path to be accessed;
s9, sending the to-be-visited customer path to the map application program; the to-be-visited client path comprises position information and sequence information of client nodes;
and S10, the map application program carries out navigation of the route according to the to-be-visited client path.
For example, the current location of the salesman is taken as the starting point, the first customer location closest to him is found, the next customer closest to this location is found taking this customer location as the starting point, and so on. And finally, transmitting the client sequence and the number to a hundred-degree map to carry out the whole navigation planning of the overall route until all clients in the route are planned.
The map application program can navigate according to the serial numbers of the path sequences of the clients to be visited, and the interface of the map application program can display a plurality of dots with marks, wherein the numbers in the dots represent the path sequences of the clients to be visited. Therefore, the service staff can automatically form the visit paths for a plurality of clients to be visited only by selecting the client range to be visited from the client software, and the paths are time-saving, mileage-saving, work efficiency improvement and automobile energy consumption reduction.
According to an aspect of the present disclosure, there is provided an electronic apparatus, wherein the electronic apparatus includes:
a processor and a memory storing computer executable instructions that, when executed, cause the processor to perform the one of the customer visit route planning and navigation methods.
According to an aspect of the present disclosure, there is provided a computer readable storage medium storing one or more instructions that, when executed by a processor, implement the method of customer visit route planning and navigation.
It should be noted that, for simplicity of description, the foregoing method embodiments are all described as a series of acts, but it should be understood by those skilled in the art that the present disclosure is not limited by the order of acts described, as some steps may be performed in other orders or concurrently in accordance with the present disclosure. Further, those skilled in the art will also appreciate that the embodiments described in the specification are all alternative embodiments, and that the acts and modules referred to are not necessarily required by the present disclosure.
In the foregoing embodiments, the descriptions of the embodiments are emphasized, and for parts of one embodiment that are not described in detail, reference may be made to related descriptions of other embodiments.
In the several embodiments provided in the present disclosure, it should be understood that the disclosed apparatus may be implemented in other manners. For example, the apparatus embodiments described above are merely illustrative, such as the division of the units, merely a logical function division, and there may be additional manners of dividing the actual implementation, such as multiple units or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, or may be in electrical or other forms.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in each embodiment of the present disclosure may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units described above may be implemented either in hardware or in software program modules.
The integrated units, if implemented in the form of software program modules, may be stored in a computer-readable memory for sale or use as a stand-alone product. Based on such understanding, the technical solution of the present disclosure may be embodied in essence or a part contributing to the prior art or all or part of the technical solution in the form of a software product stored in a memory, comprising several instructions for causing a computer device (which may be a personal computer, a server or a network device, etc.) to perform all or part of the steps of the method described in the various embodiments of the present disclosure. And the aforementioned memory includes: a U-disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a removable hard disk, a magnetic disk, or an optical disk, or other various media capable of storing program codes.
Those of ordinary skill in the art will appreciate that all or a portion of the steps in the various methods of the above embodiments may be implemented by a program that instructs associated hardware, and the program may be stored in a computer readable memory, which may include: flash disk, read-Only Memory (ROM), random access Memory (Random Access Memory, RAM), magnetic disk or optical disk.
The foregoing has described in detail embodiments of the present disclosure, with specific examples being employed herein to illustrate the principles and implementations of the present disclosure, the above examples being provided solely to assist in understanding the methods of the present disclosure and their core ideas; meanwhile, as one of ordinary skill in the art will have variations in the detailed description and the application scope in light of the ideas of the present disclosure, the present disclosure should not be construed as being limited to the above description.
Various aspects of the present disclosure are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the disclosure. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer-readable program instructions.
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The foregoing description of the embodiments of the present disclosure has been presented for purposes of illustration and description, and is not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the various embodiments described. The terminology used herein was chosen in order to best explain the principles of the embodiments, the practical application, or the technical improvements in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.
Claims (6)
1. A method for planning and navigating a customer visit route, the method comprising:
s1, acquiring the name of a client in a client subset to be visited and longitude and latitude address information corresponding to the name of the client;
s2, marking all client nodes in the client subset to be visited as an unvisited state;
s3, setting the current position positioned in the map application program as an initial node, and adding longitude and latitude position information of the initial node into a to-be-visited client path list;
s4, calculating the distance between the current position and the node in the non-access state by taking the current position as a starting point, and determining the node closest to the current position;
s5, adding the client node closest to the current position into a list of the to-be-visited client paths;
s6, marking the client node newly added into the to-be-visited client path list as a visited state;
s7, taking the client nodes newly added into the to-be-visited client path list as starting points, and repeating the steps S4-S6 until all the client nodes are marked as visited;
s8, connecting the last accessed client node with the initial position, and determining a client path to be accessed;
s9, sending the to-be-visited customer path to the map application program; the to-be-visited client path comprises position information and sequence information of client nodes;
and S10, the map application program carries out navigation of the route according to the to-be-visited client path.
2. The method for planning and navigating a customer visit path as claimed in claim 1, wherein,
before acquiring the client name and the latitude and longitude address information corresponding to the client name in the client subset to be visited, the method further comprises the following steps:
determining a client to be visited according to the client category;
acquiring client information of a client to be visited, wherein the client information comprises client name and address information;
converting the address information into address information represented by longitude and latitude;
invoking a map application program, and displaying the position of the client to be visited in a user interface of the map application program;
and acquiring a subset of the clients to be visited, which is selected by a user through a map application user interface.
3. A method for planning and navigating a call route for a customer according to claim 2, wherein said determining the customer to be visited according to the customer category comprises:
and selecting the client category according to the regional category of the client and the industry category of the client, and screening the client to be visited.
4. The method for planning and navigating a visited route for a customer according to claim 2, wherein the step of obtaining a subset of the customers to be visited selected by the user through the map application user interface comprises:
and selecting client nodes of the map application program interface through a preset function-selecting button, and generating a client subset to be visited according to the selected client nodes of the map application program interface.
5. An electronic device, wherein the electronic device comprises:
a processor and a memory storing computer executable instructions which, when executed, cause the processor to perform the method of any of claims 1-4.
6. A computer readable storage medium storing one or more instructions which, when executed by a processor, implement the method of any one of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311764888.1A CN117433557A (en) | 2023-12-21 | 2023-12-21 | Customer visit route planning and navigation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311764888.1A CN117433557A (en) | 2023-12-21 | 2023-12-21 | Customer visit route planning and navigation method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117433557A true CN117433557A (en) | 2024-01-23 |
Family
ID=89558628
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311764888.1A Pending CN117433557A (en) | 2023-12-21 | 2023-12-21 | Customer visit route planning and navigation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117433557A (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20120086025A (en) * | 2011-01-25 | 2012-08-02 | 에스케이플래닛 주식회사 | Movement course service system, movement course apparatus and method providing movement course thereof |
| CN103413209A (en) * | 2013-07-17 | 2013-11-27 | 西南交通大学 | Method for selecting multi-user and multi-warehouse logistics distribution path |
| CN104520881A (en) * | 2012-06-22 | 2015-04-15 | 谷歌公司 | Ranking nearby destinations based on visit likelihoods and predicting future visits to places from location history |
| CN107796413A (en) * | 2017-09-30 | 2018-03-13 | 郑州云海信息技术有限公司 | A kind of multi-destination route recommendation method and system |
| CN110363323A (en) * | 2018-11-20 | 2019-10-22 | 南京掌控网络科技有限公司 | A kind of Intelligent planning method, system and the equipment of periodicity customer visit route |
| CN110837917A (en) * | 2019-10-01 | 2020-02-25 | 榕知科技(武汉)有限公司 | Customer visit management system, method, terminal equipment and storage medium |
| CN111678529A (en) * | 2020-05-14 | 2020-09-18 | 腾讯科技（深圳）有限公司 | Navigation method, path generation method, device, equipment and medium |
| CN112330467A (en) * | 2020-11-02 | 2021-02-05 | 泰康保险集团股份有限公司 | Auxiliary information generating system |
| CN112362071A (en) * | 2020-11-10 | 2021-02-12 | 中国平安人寿保险股份有限公司 | Multi-destination route planning method, device and storage medium |
| CN114090898A (en) * | 2021-11-29 | 2022-02-25 | 深圳壹账通智能科技有限公司 | Information recommendation method and device, terminal equipment and medium |
-
2023
- 2023-12-21 CN CN202311764888.1A patent/CN117433557A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20120086025A (en) * | 2011-01-25 | 2012-08-02 | 에스케이플래닛 주식회사 | Movement course service system, movement course apparatus and method providing movement course thereof |
| CN104520881A (en) * | 2012-06-22 | 2015-04-15 | 谷歌公司 | Ranking nearby destinations based on visit likelihoods and predicting future visits to places from location history |
| CN103413209A (en) * | 2013-07-17 | 2013-11-27 | 西南交通大学 | Method for selecting multi-user and multi-warehouse logistics distribution path |
| CN107796413A (en) * | 2017-09-30 | 2018-03-13 | 郑州云海信息技术有限公司 | A kind of multi-destination route recommendation method and system |
| CN110363323A (en) * | 2018-11-20 | 2019-10-22 | 南京掌控网络科技有限公司 | A kind of Intelligent planning method, system and the equipment of periodicity customer visit route |
| CN110837917A (en) * | 2019-10-01 | 2020-02-25 | 榕知科技(武汉)有限公司 | Customer visit management system, method, terminal equipment and storage medium |
| CN111678529A (en) * | 2020-05-14 | 2020-09-18 | 腾讯科技（深圳）有限公司 | Navigation method, path generation method, device, equipment and medium |
| CN112330467A (en) * | 2020-11-02 | 2021-02-05 | 泰康保险集团股份有限公司 | Auxiliary information generating system |
| CN112362071A (en) * | 2020-11-10 | 2021-02-12 | 中国平安人寿保险股份有限公司 | Multi-destination route planning method, device and storage medium |
| CN114090898A (en) * | 2021-11-29 | 2022-02-25 | 深圳壹账通智能科技有限公司 | Information recommendation method and device, terminal equipment and medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9212918B1 (en) | Systems and methods for generating and displaying multiple layers on a digital map | |
| US7595725B1 (en) | System and method for identifying geographical areas that significantly overlap a map view | |
| US10572932B2 (en) | System for providing optimal shopping routes in retail store and method of using same | |
| US10066960B2 (en) | Systems and methods for using route matrices for identifying intersection POIs | |
| US7983949B1 (en) | System and method for selecting targeted information for serving with a map view | |
| US10445691B2 (en) | System for improving order batching using location information of items in retail store and method of using same | |
| CN102426022B (en) | For showing the method and system of point of interest | |
| KR101292872B1 (en) | Schematic destination maps | |
| CN107577750B (en) | Method and system for drawing navigation data vector intersection | |
| JP2017516070A (en) | Navigation guidance between automatically determined starting point and selected destination | |
| CN104221008A (en) | Pre-fetching map tile data along a route | |
| CN110887499B (en) | Method and terminal for processing road data and interest point data in map | |
| US7676376B2 (en) | Rate and distribution system | |
| CN103927374A (en) | Web GIS map layer establishing method based on SharpMap | |
| CN113096246B (en) | Three-dimensional map data updating method | |
| CN112129310A (en) | Map display method and device | |
| WO2020068904A1 (en) | Selecting points of interest for display on a personalized digital map | |
| US9140573B2 (en) | Path finding in a map editor | |
| CN117433557A (en) | Customer visit route planning and navigation method | |
| CN107423361A (en) | A kind of searching method closest to service point | |
| CN109029476A (en) | A kind of method and apparatus for determining range coverage | |
| US9129318B2 (en) | System and method for allocating suppliers using geographical information system and supplier capability | |
| CN114004632A (en) | Order thermodynamic diagram construction method and equipment | |
| JP2015125359A (en) | Map data distribution system | |
| CN112182438A (en) | Method and system for marking parking place primitives |
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 |