Supercharge Your Innovation With Domain-Expert AI Agents!

Scenic spot route recommending method based on spectral clustering algorithm

A spectral clustering algorithm and route recommendation technology, which is applied in the field of scenic spot route recommendation based on spectral clustering algorithm, which can solve the problem of not being able to meet the needs of tourists well.

Inactive Publication Date: 2016-03-30
NANJING UNIV +2
View PDF2 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] None of the above methods can well meet the needs of tourists in the actual situation, that is, to recommend a shortest travel route to tourists in a short period of time.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Scenic spot route recommending method based on spectral clustering algorithm
  • Scenic spot route recommending method based on spectral clustering algorithm
  • Scenic spot route recommending method based on spectral clustering algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0085] In this embodiment, data of scenic spots of a certain lake scenic spot in city A is used for experiments.

[0086] For the original data obtained, the invalid data is filtered out first, that is, only the location information of the scenic spots and the path information between the scenic spots are retained; and the data is processed to calculate the distance between the directly connected scenic spots (unit (m)).

[0087] Secondly, get the scenic spots that the user chooses to play, the user's starting point and the ending point of leaving the scenic spot. The starting point is set to point S, and the end point is set to point E. An undirected weighted graph is generated according to the data information of the selected scenic spot. The weight between two scenic spots is the distance between the scenic spots. If the two scenic spots are not directly connected, the weight is set to infinity.

[0088] Thirdly, in order to better divide small scenic spots, first delete the remo...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a scenic spot route recommending method based on a spectral clustering algorithm. The method comprises the following steps of step1, determining scenic spots which a tourist wants to visit, collecting data information of the scenic spots and abstracting into an undirected graph; step2, using a Floyd algorithm to calculate a shortest distance of any two scenic spots in the graph and deleting useless paths in a scenic spot path graph; step3, applying the spectral clustering algorithm in the scenic spot path graph to cut a large scenic region into a plurality of small scenic regions; step4, using a simulated annealing algorithm to calculate a route program plan among the small scenic regions; step5, selecting the scenic spot in the small scenic region which is closest to the tourist as a starting point of the tourist, calculating a scenic spot visiting route in the small scenic region, and then visiting the next small scenic region according to the route program plan among the small scenic regions, calculating the scenic spot visiting route in each small scenic region respectively and finally acquiring visiting routes of all the scenic spots.

Description

Technical field [0001] The invention relates to the field of tourism information services, in particular to a method for recommending scenic spots route based on a spectral clustering algorithm. Background technique [0002] The optimization of tourist routes has always been a social focus of people's attention. Especially in recent years, with the development of cities and the improvement of people's living material standards, traveling during festivals has become an indispensable part of holidays. Therefore, more and more people pay more and more attention to how to optimize tourism routes reasonably. [0003] Tourism route planning is a typical traveling salesman problem (TSP). The traveling salesman problem refers to the traveling salesman visiting each city in a certain order, so that each city can be visited and only once, and finally back to the starting point, and The cost is minimal. Traveling salesman problem is a typical polynomial complexity non-deterministic problem ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06Q10/04
CPCG06Q10/047
Inventor 窦万春沈永康吴诗颖周作建
Owner NANJING UNIV
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com